{"created":"2025-01-18T23:20:19.090483+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00057029","sets":["1164:5159:5180:5185"]},"path":["5185"],"owner":"1","recid":"57029","title":["信頼度基準デコーディングを用いた高効率な単語グラフ生成法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2005-02-05"},"_buckets":{"deposit":"c8dc6b84-82e2-4d54-8535-d70673759ed9"},"_deposit":{"id":"57029","pid":{"type":"depid","value":"57029","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":"An Efficient Word Graph Generation using Confidence Scored Decoding","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2005-02-05","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"奈良先端科学技術大学大学院情報科学研究科"},{"subitem_text_value":"京都大学学術メディアセンター"},{"subitem_text_value":"奈良先端科学技術大学大学院情報科学研究科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science, Nara Institute of Science and Technology","subitem_text_language":"en"},{"subitem_text_value":"Academic Center for Computing and Media Studies, Kyoto University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science, Nara Institute of Science and Technology","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/57029/files/IPSJ-SLP04055013.pdf","label":"IPSJ-SLP04055013"},"date":[{"dateType":"Available","dateValue":"2007-02-05"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SLP04055013.pdf","filesize":[{"value":"957.2 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":"22"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"730ae4ef-3bd2-4fa6-a5b7-1f478cbd577a","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2005 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"李, 晃伸"},{"creatorName":"河原, 達也"},{"creatorName":"鹿野, 清宏"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"AKINOBU, LEE","creatorNameLang":"en"},{"creatorName":"TATSUYA, KAWAHARA","creatorNameLang":"en"},{"creatorName":"KIYOHIRO, SHIKANO","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10442647","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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"音声認識結果の単語集合をグラフ形式で表現する方法が広く用いられている．本報告では，２パストリートレリスデコーダーにおいてオンラインで得られる単語信頼度を用いて単語グラフを効率よく生成する手法を提案する．後段パスのスタックデコーディング中に，(1)同一箇所に現れる同一単語候補をマージすることで検索中に動的に単語グラフを生成し，(2)これまでに得られた仮説パスと重複する部分文仮説の探索を中断する．さらに，(3)探索中に得られる単語信頼度に基づく枝刈りにより，信頼度の低い単語の展開を抑制する．これらの手法により，不要な探索を抑えて効率よく単語グラフを生成する．認識実験の結果，グラフの動的生成によりN-best候補に比べてより少ない計算量で多くの単語仮説を残すことができ，最小のGERを改善できることが示された．信頼度による枝刈りは一定の効果が確認できたが，探索中の信頼度を用いることによる信頼度値の不安定さの影響が大きいことが分かった．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"An efficient search algorithm to generate word graph on tree-trellis decoder using search-time confidence score is investigated. In the 2nd pass of tree-trellis search, the stack decoding is modified to fixate word candidates on-the fly in order to generate word graph dynamically by merging paths by sharing same words at the same frame. The hypotihent will be terminated if the last word has already been in the current partial word graph and expanded so far. Furthermore, a word puruning by confidence score is applied at word expansion to suppress unpromissing words to appear. Experimental results show that the proposed method can generate a word graph faster than using N-best sentence list, and also can generate more word graphs to improve minimal GER. Pruning by confidence score showed a certain effect to reduce the number of word expansion, but has little effect on the total search time due to the unstableness of the searchtime confidence scoring especially for a short words.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"76","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告音声言語情報処理（SLP）"}],"bibliographicPageStart":"71","bibliographicIssueDates":{"bibliographicIssueDate":"2005-02-05","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"12(2004-SLP-055)","bibliographicVolumeNumber":"2005"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"links":{},"id":57029,"updated":"2025-01-21T15:29:48.835672+00:00"}