- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Automatic Translation feature is available on CiNii Labs
- Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
Full Text Approximate String Search using Suffix Arrays
-
- YAMASITA Tatuo
- Graduate School of Information Science, Nara Institute of Science and Technology
-
- MATSUMOTO Yuji
- Graduate School of Information Science, Nara Institute of Science and Technology
Bibliographic Information
- Other Title
-
- Suffix Array を用いたフルテキスト類似用例検索
Search this article
Description
The error-tolerant recognition algorithm using TRIE and the dynamic programming algorithm are known as methods of the approximate matching. Computational complexity of the dynamic programming algorithm is in proportion to the text size, while that of the algorithm using TRIE is independent of the text size. However, TRIE has a problem that it requires a huge amount of data space, and the error-tolerant recognition algorithm has a problem that it does not take account of full text search. In this paper, we give a solution to these problems of the error-tolerant recognition algorithm using TRIE. First, we extend the error-tolerant recognition algorithm and apply it to the full text search. Secondly, to solve the data space problem, we employ a data structure called Suffix Arrays to achieve a large scale full text approximate string seach system.
Journal
-
- IPSJ SIG Notes
-
IPSJ SIG Notes 47 23-30, 1997-09-11
Information Processing Society of Japan (IPSJ)
- Tweet
Details 詳細情報について
-
- CRID
- 1570291227269182592
-
- NII Article ID
- 110002934050
-
- NII Book ID
- AN10114171
-
- Text Lang
- ja
-
- Data Source
-
- CiNii Articles
