The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (1987 vol.9)
pp: 806-815
Eiichi Tanaka , Department of Information Science, Faculty of Engineering, Utsunomiya University, Utsunomiay 321, Japan.
Yurie Kojima , Department of Information Science, Faculty of Engineering, Utsunomiya University, Utsunomiay 321, Japan.
ABSTRACT
This paper describes a high speed string correction method using a hierarchical file. After reviewing a string correction method based on the Levenshtein distance, a hierarchical file construction method is introduced. A multistage string correction method using this file is proposed. The lower bound of computational complexity is estimated, and it is shown that a multistage method using a special type of a hierarchical file can reduce computational labor greatly. The larger the number of strings considered is, the more efficient the method becomes. The results of computer simulations on 5374 phoneme sequences using two and three stage correction methods are stated. The condition for a multistage string correction method to obtain higher correction rates than an ordinary dictionary method is included.
CITATION
Eiichi Tanaka, Yurie Kojima, "A High Speed String Correction Method Using a Hierarchical File", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.9, no. 6, pp. 806-815, June 1987, doi:10.1109/TPAMI.1987.4767987
21 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool