{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00220255","sets":["1164:4842:10828:11017"]},"path":["11017"],"owner":"44499","recid":"220255","title":["A Proposal of Alternative Answer Search Method for Phrase Fill-in-blank Problems in C programming"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-09-24"},"_buckets":{"deposit":"c2c29f5d-11c6-4df8-9d36-1344ab2f3460"},"_deposit":{"id":"220255","pid":{"type":"depid","value":"220255","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"A Proposal of Alternative Answer Search Method for Phrase Fill-in-blank Problems in C programming","author_link":["575677","575674","575673","575678","575676","575680","575679","575675"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A Proposal of Alternative Answer Search Method for Phrase Fill-in-blank Problems in C programming"},{"subitem_title":"A Proposal of Alternative Answer Search Method for Phrase Fill-in-blank Problems in C programming","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2022-09-24","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Okayama University Department of Electrical and Communication Engineering"},{"subitem_text_value":"Okayama University Department of Electrical and Communication Engineering"},{"subitem_text_value":"Okayama University Department of Electrical and Communication Engineering"},{"subitem_text_value":"Nihon University Department of Computer Science"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Okayama University Department of Electrical and Communication Engineering","subitem_text_language":"en"},{"subitem_text_value":"Okayama University Department of Electrical and Communication Engineering","subitem_text_language":"en"},{"subitem_text_value":"Okayama University Department of Electrical and Communication Engineering","subitem_text_language":"en"},{"subitem_text_value":"Nihon University Department of Computer Science","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/220255/files/IPSJ-CE22166003.pdf","label":"IPSJ-CE22166003.pdf"},"date":[{"dateType":"Available","dateValue":"2024-09-24"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-CE22166003.pdf","filesize":[{"value":"813.3 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"19"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"a4cf79ec-2d51-4882-a919-9b4c285daa52","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Xiqin, Lu"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Nobuo, Funabiki"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Zhikang, Li"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kiyoshi, Ueda"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Xiqin, Lu","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Nobuo, Funabiki","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Zhikang, Li","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kiyoshi, Ueda","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10096193","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8930","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"Currently, we are studying the phrase fill-in-blank problem (PFP) in C programming learning assistant system (CPLAS) for code reading & writing self-studies of novice students. In a PFP instance, key phrases (sets of multiple elements) are blanked in a given source code to be filled in by students. Any answer from a student is automatically marked through string matching at the system. However, some blanks can have grammatically correct alternative answers besides the original phrases in the source code. Previously, they were manually found, which caused additional loads and mistakes. In this paper, we propose an alternative answer search method to find alternative answers for blanks in a PFP instance, if exist. Seven phrase patterns for possible alternative answers in C programming are listed up. Using regular expressions, their matching phrases are found among the blanks. For evaluations, we apply the proposal to 37 source codes in previous PFP instances, and confirm the conformity of the alternative answers in them.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Currently, we are studying the phrase fill-in-blank problem (PFP) in C programming learning assistant system (CPLAS) for code reading & writing self-studies of novice students. In a PFP instance, key phrases (sets of multiple elements) are blanked in a given source code to be filled in by students. Any answer from a student is automatically marked through string matching at the system. However, some blanks can have grammatically correct alternative answers besides the original phrases in the source code. Previously, they were manually found, which caused additional loads and mistakes. In this paper, we propose an alternative answer search method to find alternative answers for blanks in a PFP instance, if exist. Seven phrase patterns for possible alternative answers in C programming are listed up. Using regular expressions, their matching phrases are found among the blanks. For evaluations, we apply the proposal to 37 source codes in previous PFP instances, and confirm the conformity of the alternative answers in them.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告コンピュータと教育（CE）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2022-09-24","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"2022-CE-166"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:20:18.051439+00:00","updated":"2025-01-19T14:37:48.525880+00:00","id":220255}