{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00042944","sets":["1164:3782:3790:3794"]},"path":["3794"],"owner":"1","recid":"42944","title":["ダブル配列上の遷移数を抑制した基数探索法の提案"],"pubdate":{"attribute_name":"公開日","attribute_value":"2007-03-27"},"_buckets":{"deposit":"17f15c5d-1a61-49e1-ab51-a38fadaea027"},"_deposit":{"id":"42944","pid":{"type":"depid","value":"42944","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":"Proposal of Digital Search Method Reduced Search Length on the Double-Array","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2007-03-27","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":"Faculty of Education, Osaka Kyoiku University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Education, Osaka Kyoiku 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/42944/files/IPSJ-DD07060006.pdf"},"date":[{"dateType":"Available","dateValue":"2009-03-27"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DD07060006.pdf","filesize":[{"value":"1.3 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":"32"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"59b6b6be-0a11-4dbb-a4bf-9171c95a3f44","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2007 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":"Yasumasa, NAKAMURA","creatorNameLang":"en"},{"creatorName":"Hisatoshi, MOCHIZUKI","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10539261","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":"木構造で表現される基数探索法は、共通接頭辞探索が容易であるため、自然言語処理などを中心に広く用いられている。基数探索法の探索処理を効率化するため、木構造において遷移が一つしかない分岐を圧縮したパトリシアや、木構造を多分木としたマルチウェイ基数探索法が提案されている。また、マルチウェイ基数探索法のデータ構造として、高速性とコンパクト性をあわせもつダブル配列がある。本論文では、探索速度を効率化するため、ダブル配列上の遷移数を抑制した基数探索法を提案する。評価実験の結果、提案手法が有効であるとわかった。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Radix search method is used widely, such as dictionary information construction of the natural language processing system. Patricia and multiway radix search method is proposed in order to accelerate search processing. The double-array structure is an efficient data structure combining fast access with compactness. In this paper, we presents radix search method reduced the average of search length. The simulation results turned out that the presented method is effective.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"46","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告デジタルドキュメント（DD）"}],"bibliographicPageStart":"41","bibliographicIssueDates":{"bibliographicIssueDate":"2007-03-27","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"34(2007-DD-060)","bibliographicVolumeNumber":"2007"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":42944,"updated":"2025-01-22T11:12:37.582504+00:00","links":{},"created":"2025-01-18T23:09:27.881967+00:00"}