{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00057596","sets":["1164:5159:5216:5219"]},"path":["5219"],"owner":"1","recid":"57596","title":["大語彙連続音声認識エンジンJuliusにおける　A * 探索法の改善"],"pubdate":{"attribute_name":"公開日","attribute_value":"1999-07-23"},"_buckets":{"deposit":"c82a1d72-6272-43e4-96c8-478435f9eb2f"},"_deposit":{"id":"57596","pid":{"type":"depid","value":"57596","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"大語彙連続音声認識エンジンJuliusにおける　A * 探索法の改善","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"大語彙連続音声認識エンジンJuliusにおける　A * 探索法の改善"},{"subitem_title":"Improvements of A * - based search algorithm in LVCSR engine Julius","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1999-07-23","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":"Graduate School of Informatics, Kyoto University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Informatics, Kyoto 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/57596/files/IPSJ-SLP99027005.pdf"},"date":[{"dateType":"Available","dateValue":"2001-07-23"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SLP99027005.pdf","filesize":[{"value":"644.1 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":"96d90a0e-6850-452e-8fb1-a6d1c59273b1","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1999 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"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"}],"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":"大語彙連続音声認識エンジンJuliusにおける解探索アルゴリズムの種々の改善手法を提案し，その評価を行う．ヒューリスティックの非適格性から生じる探索誤りや探索失敗を解消するために，第2パスで探索が幅優先に陥るのを防ぐenveloped best-first探索を提案するとともに，第1パスで単語間triphoneを近似計算することで探索の高精度化を図る．高速化の面からは，第2パスの音響尤度計算におけるスコアでのビーム設定と，第1パスでの1-gram確率に基づくfactoringを導入する．JNASの20 000語タスクでの評価実験の結果探索誤りの多くが解消され，またその精度を落とさずに計算量を削減することができた．最終的に，実時間の12.9倍で94.9%，monophoneではほぼ実時間で84.2%の単語認識精度を得ることができた．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The recent improvements in our LVCSR engine \"Julius\" are shown. To ease search errors and search failure caused by dis-optimality of heuristics, an enveloped best-first search algorithm and an approximation of the inter-word context dependency on the 1st pass are proposed. More, score-based envelope beam for aoustic scanning on the 2nd pass and 1-gram factoring are introduced to decrease computational costs. Experiments on 20,000-word JNAS task show that most of the search errors are dissolved and the costs can be efficiently cut with little accuracy loss. The system achieved word accuracy of 94.9% in a real-time factor of 12.9, and using monophone model, 84.2% in nearly real-time.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"40","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告音声言語情報処理（SLP）"}],"bibliographicPageStart":"33","bibliographicIssueDates":{"bibliographicIssueDate":"1999-07-23","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"64(1999-SLP-027)","bibliographicVolumeNumber":"1999"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"updated":"2025-01-22T04:25:27.564243+00:00","created":"2025-01-18T23:20:45.905774+00:00","id":57596}