{"updated":"2025-01-22T23:13:04.128875+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00017627","sets":["934:1022:1054:1056"]},"path":["1056"],"owner":"1","recid":"17627","title":["近似文字列照合による全文検索のための接尾辞配列の高速走査法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2002-09-15"},"_buckets":{"deposit":"2caf9ded-ea59-43ca-b4a0-b6e7059c0814"},"_deposit":{"id":"17627","pid":{"type":"depid","value":"17627","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":"Fast Traversal of Suffix Arrays for Full - text Approximate String Matching","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"研究論文","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2002-09-15","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"通信総合研究所"},{"subitem_text_value":"通信総合研究所"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Communications Research Laboratory","subitem_text_language":"en"},{"subitem_text_value":"Communications Research Laboratory","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/17627/files/IPSJ-TOD4309002.pdf"},"date":[{"dateType":"Available","dateValue":"2004-09-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TOD4309002.pdf","filesize":[{"value":"250.6 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":"13"},{"tax":["include_tax"],"price":"0","billingrole":"39"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"dd9cd775-3092-4183-bbae-826d1e4061c5","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2002 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"内山, 将夫"},{"creatorName":"井佐原, 均"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Masao, Utiyama","creatorNameLang":"en"},{"creatorName":"Hitoshi, Isahara","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464847","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_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7799","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"近似文字列照合による全文検索では，入力パターンと一定以下の編集距離にある部分テキストすべてをテキストから検索する．近似文字列照合による全文検索は，テキストを接尾辞トライにより索引付けし，それを利用して検索することにより実現できる．しかし，接尾辞トライの占める空間領域は大きいため，接尾辞配列を索引として利用することもある．接尾辞配列を索引として利用する場合には，従来研究では，接尾辞トライ上での探索を接尾辞配列上での2分探索により模擬している．それに対して，本稿では，2分探索ではなく，補助的な配列を用いることにより，高速に，接尾辞トライ上での探索を模擬することができる手法を提案した．さらに，2分探索による方法を利用した場合と提案手法を利用した場合とにおける検索速度を実験的に測定し，提案手法の方が検索速度が速いことを示した．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Given a text and an input pattern, the goal of full-text approximate string matching is to search for all parts of the text that match the pattern. Full-text approximate string matching can be performed using a suffix trie as an index of the text. A suffix trie, however, is relatively large. So, a suffix array, which is a compact representation of a suffix trie, is often used to simulate searches on a suffix trie. A binary search algorithm is used to search the array. A method is described in this paper that uses an auxiliary array to simulate searches on a suffix trie. The method does not use a binary search algorithm so that it can perform a faster simulation. Experiments showed that the proposed method is faster than one using a binary search algorithm.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"14","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌データベース（TOD）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2002-09-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"SIG09(TOD15)","bibliographicVolumeNumber":"43"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T22:50:34.657228+00:00","id":17627,"links":{}}