{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00231455","sets":["1164:2735:11166:11409"]},"path":["11409"],"owner":"44499","recid":"231455","title":["文字の置換履歴に対する組合せ最適化を通じた文字解読"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-12-04"},"_buckets":{"deposit":"7911ed22-96ef-4449-aabb-b7f935e6d4c2"},"_deposit":{"id":"231455","pid":{"type":"depid","value":"231455","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"文字の置換履歴に対する組合せ最適化を通じた文字解読","author_link":["624831","624832","624833","624830"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"文字の置換履歴に対する組合せ最適化を通じた文字解読"},{"subitem_title":"Decipherment via Combinatorial Optimization and Character Substitution Log","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2023-12-04","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"奈良女子大学"},{"subitem_text_value":"奈良女子大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Nara Women's University","subitem_text_language":"en"},{"subitem_text_value":"Nara Women's University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/231455/files/IPSJ-MPS23146001.pdf","label":"IPSJ-MPS23146001.pdf"},"date":[{"dateType":"Available","dateValue":"2025-12-04"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS23146001.pdf","filesize":[{"value":"1.1 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"17"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"e3e133fc-c8e7-4c81-865c-f884957db2e1","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"楉, 春華"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"吉田, 哲也"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Haruka, Sumoto","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Tetsuya, Yoshida","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10505667","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-8833","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"文字解読とは，未知の言語における単語と既知の言語における単語の対応を推定する問題である．文字列の編集距離に基づく目的関数の交互最適化を行う既存研究は，汎用性は高いものの最適化における初期値依存性が非常に強いという課題があった．本稿では文字の置換履歴に対する組合せ最適化を通じた文字解読を提案する．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Decipherment is a problem of inferring the correspondence of words between a known language and unknown language. Previous work based on edit distance formalized the problems of decipherment and cognate pair identification in terms of alternating optimization. This paper proposes a decipherment method based on combinatorial optimization and character substitution log.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告数理モデル化と問題解決（MPS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2023-12-04","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2023-MPS-146"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":231455,"updated":"2025-01-19T10:45:25.517252+00:00","links":{},"created":"2025-01-19T01:31:46.207134+00:00"}