{"updated":"2025-01-23T02:41:19.847724+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00010718","sets":["581:625:636"]},"path":["636"],"owner":"1","recid":"10718","title":["辞書に基づく単語の再帰的語義展開"],"pubdate":{"attribute_name":"公開日","attribute_value":"2005-02-15"},"_buckets":{"deposit":"8e799457-310b-48bb-be06-2d5bd4e6ec6a"},"_deposit":{"id":"10718","pid":{"type":"depid","value":"10718","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"辞書に基づく単語の再帰的語義展開","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"辞書に基づく単語の再帰的語義展開"},{"subitem_title":"Recursive Expansion of Word Definition Based on Dictionaries","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"論文","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2005-02-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"NTTコミュニケーション科学基礎研究所"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"NTT Communication Science Laboratories","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/10718/files/IPSJ-JNL4602028.pdf"},"date":[{"dateType":"Available","dateValue":"2007-02-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL4602028.pdf","filesize":[{"value":"176.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":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"fda3b502-abb0-4579-8878-2f625fd31506","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2005 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"鈴木, 敏"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Satoshi, Suzuki","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"辞書の持つ単語と定義文の関係を利用した，単語のベクトル化のための新しい手法を提案する．提案手法は定義文を再帰展開することにより単語ベクトルを生成する手法である．定義文を単語の集合と見なして再帰展開するときの問題は，この展開が無限に続くため，単語頻度などが計算できなくなることにある．しかし，展開時に一定の重みを仮定することで無限級数の形式に変換でき，計算可能となる．提案手法では，この展開を確率モデルとして扱い，計算の各過程における意味を明確にしている．これにより，応用の見通しが良くなるという長所を得ている．本論文では提案手法の詳細を示すとともに，本手法を単語類似度計算へ適用し，TF-IDFに基づく計算結果と比較・検証を行った．その結果は精度・再現率ともに提案手法が優位であるという明確な有効性を示すものであった．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We propose a new method for computing the probabilistic vector expression of words based on dictionaries, which exploits the relationship between headwords and their definitions. A word definition is a set of other words, each of which is expanded by its own definition. Generally, this expansion cannot be computed because it is repeatedly applied infinitely. Nevertheless, an assumption of adding a certain weight to each expansion formulates the infinite expansion to infinite series and makes it possible to be computed. The proposed method provides clear applicability and a well-founded procedure based on stochastic processes each of which is obvious. This paper describes details of the method and demonstrates its application to word similarity in comparison with TF-IDF. The simulations clearly show the advantage of our method in both recall and precision results.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"630","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"624","bibliographicIssueDates":{"bibliographicIssueDate":"2005-02-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicVolumeNumber":"46"}]},"relation_version_is_last":true,"item_2_alternative_title_2":{"attribute_name":"その他タイトル","attribute_value_mlt":[{"subitem_alternative_title":"自然言語"}]},"weko_creator_id":"1"},"created":"2025-01-18T22:45:33.009188+00:00","id":10718,"links":{}}