论文信息 - Fast approximate string matching with finite automata

Fast approximate string matching with finite automata

We present a fast algorithm for finding approximate matches of a string in a finite-state automaton, given some metric of similarity. The algorithm can be adapted to use a variety of metrics for determining the distance between two words.

Mans Hulden | Mans Hulden

[1] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[2] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[3] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[4] Jesfis Peral,et al. Heuristics -- intelligent search strategies for computer problem solving , 1984 .

[5] Kemal Oflazer,et al. Error-tolerant Finite-state Recognition with Applications to Morphological Analysis and Spelling Correction , 1995, CL.

[6] Klaus U. Schulz,et al. Fast string correction with Levenshtein automata , 2002, International Journal on Document Analysis and Recognition.

[7] Lauri Karttunen,et al. Finite State Morphology , 2003, CSLI Studies in Computational Linguistics.

[8] Mans Hulden,et al. Foma: a Finite-State Compiler and Library , 2009, EACL.