Fast approximate search in large dictionaries

Computational Linguistics

Volumn 30, Issue 4, 2004, Pages 451-477

  Mihov, Stoyan ^a   Schulz, Klaus U ^b  

^a BULGARIAN ACADEMY OF SCIENCES   (Bulgaria)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE TEXT SEARCHES; BASIC PROCEDURE; CORRECTION METHOD; EVALUATION RESULTS; FILTERING METHOD; NATURAL LANGUAGE PROCESSING; OPTIMAL FILTERING; SHORT CORRECTIONS;

NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 25844446812     PISSN: 08912017     EISSN: None     Source Type: Journal    
DOI: 10.1162/0891201042544938     Document Type: Review

References (46)

1. Angell, Richard C., George E. Freund, and Peter Willett. 1983. Automatic spelling correction using a trigram similarity measure. Information Processing and Management, 19:255-261.
2. Anigbogu, Julain C. and Abdel Belaid. 1995. Hidden Markov models in text recognition. International Journal of Pattern Recognition and Artificial Intelligence, 9(6):925-958.
3. Baeza-Yates, Ricardo A. and Gonzalo Navarro. 1998. Fast approximative string matching in a dictionary. In R. Werner, editor, Proceedings SPIRE'98, pages 14-22. IEEE Computer Science.
4. Baeza-Yates, Ricardo A. and Gonzalo Navarro. 1999. Faster approximate string matching. Algorithmic, 23(2):127-158.
5. Blair, Charles R. 1960. A program for correcting spelling errors. Information and Control, 3:60-67.
6. Bunke, Horst. 1993. A fast algorithm for finding the nearest neighbor of a word in a dictionary. In Proceedings of the Second International Conference on Document Analysis and Recognition (ICDAR'93), pages 632-637, Tsukuba, Japan.
7. Daciuk, Jan, Stoyan Mihov, Bruce W. Watson, and Richard E. Watson. 2000. Incremental construction of minimal acyclic finite state automata. Computational Linguistics, 26(1):3-16.
8. Davidson, Leon. 1962. Retrieval of misspelled names in an airline passenger record system. Communications of the ACM, 5(3):169-171.
9. de Bertrand de Beuvron, Francois and Philippe Trigano. 1995. Hierarchically coded lexicon with variants. International Journal of Pattern Recognition and Artificial Intelligence, 9(1):145-165.
10. Dengel, Andreas, Rainer Hoch, Frank Hönes, Thorsten Jäger, Michael Malburg, and Achim Weigel. 1997. Techniques for improving OCR results. In Horst Bunke and Patrick S. P. Wang, editors, Handbook of Character Recognition and Document Image Analysis, 227-258. World Scientific.
11. Hopcroft, John E. and Jeffrey D. Ullman. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA.
12. Kim, Jong Yong and John Shawe-Taylor. 1992. An approximate string-matching algorithm. Theoretical Computer Science, 92:107-117.
13. Kim, Jong Yong and John Shawe-Taylor. 1994. Fast string matching using an n-gram algorithm. Software - Practice and Experience, 94(1):79-88.
14. Kozen, Dexter C. 1997. Automata and Computability. Springer.
15. Kukich, Karen. 1992. Techniques for automatically correcting words in texts. ACM Computing Surveys, 24:377-439.
16. Levenshtein, Vladimir I. 1966. Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics-Doklady, 10:707-710.
17. Mihov, Stoyan and Denis Maurel. 2001. Direct construction of minimal acyclic subsequential transducers. In S. Yu and A. Pun, editors, Implementation and Application of Automata: Fifth International Conference (CIAA'2000) (Lecture Notes in Computer Science no. 2088), pages 217-229. Springer.
18. Mor, Moshe and Aviezri S. Fraenkel. 1981. A hash code method for detecting and correcting spelling errors. Technical Report CS81-03, Department of Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel.
19. Muth, Robert and Udi Manber. 1996. Approximate multiple string search. In Proceedings of the Seventh Annual Symposium on Combinatorical Pattern Matching (Lecture Notes in Computer Science, no. 1075) pages 75-86. Springer.
20. Myers, Eugene W. 1994. A sublinear algorithm for approximate keyword searching. Algorithmica, 12(4/5):345-374.
21. Navarro, Gonzalo. 2001. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31-88.
22. Navarro, Gonzalo and Ricardo A. Baeza-Yates. 1999. Very fast and simple approximate string matching. Information Processing Letters, 72:65-70.
23. Navarro, Gonzalo and Mathieu Raffinot. 2002. Flexible Pattern Matching in Strings. Cambridge University Press, Cambridge.
24. Odell, Margaret K. and Robert C. Russell. 1918. U.S. Patent Number 1, 261, 167. U.S. Patent Office, Washington, DC.
25. Odell, Margaret K. and Robert C. Russell. 1992. U.S. Patent Number 1,435,663. U.S. Patent Office, Washington, DC.
26. Oflazer, Kemal. 1996. Error-tolerant finite-state recognition with applications to morphological analysis and spelling correction. Computational Linguistics, 22(1):73-89.
27. Oommen, B. John and Richard K. S. Loke. 1997. Pattern recognition of strings with substitutions, insertions, deletions, and generalized transpositions. Pattern Recognition, 30(5):789-800.
28. Owolabi, Olumide and D. R. McGregor. 1988. Fast approximate string matching. Software - Practice and Experience, 18(4):387-393.
29. Riseman, Edward M. and Roger W. Ehrich. 1971. Contextual word recognition using binary digrams. IEEE Transactions on Computers, C-20(4):397-403.
30. Schulz, Klaus U. and Stoyan Mihov. 2001. Fast string correction with Levenshtein-automata. Technical Report 01-127, Centrum für Informations= und sprachverarbeitung, University of Munich.
31. Schulz, Klaus U. and Stoyan Mihov. 2002. Fast string correction with Levenshtein-automata. International Journal of Document Analysis and Recognition, 5(1):67-85.
32. Seni, Giovanni, V. Kripasundar, and Rohini K. Srihari. 1996. Generalizing edit distance to incorporate domain information: Handwritten text recognition as a case study. Pattern Recognition, 29(3):405-414.
33. Sinha, R. M. K. 1990. On partitioning a dictionary for visual text recognition. Pattern Recognition, 23(5):497-500.
34. Srihari, Sargur N. 1985. Computer Text Recognition and Error Correction. Tutorial. IEEE Computer Society Press, Silver Spring, MD.
35. Srihari, Sargur N., Jonathan J. Hull, and Ramesh Choudhari. 1983. Integrating diverse knowledge sources in text recognition. ACM Transactions on Office Information Systems, 1(1):68-87.
36. Stephen, Graham A. 1994. String Searching Algorithms. World Scientific, Singapore.
37. Takahashi, Hiroyasu, Nobuyasu Itoh, Tomio Amano, and Akio Yamashita. 1990. A spelling correction method and its application to an OCR system. Pattern Recognition, 23(3/4):363-377.
38. Ukkonen, Esko. 1985a. Algorithms for approximate string matching. Information and Control, 64:100-118.
39. Ukkonen, Esko. 1985b. Finding approximate patterns in strings. Journal of Algorithms, 6(1-3):132-137.
40. Ukkonen, Esko. 1992. Approximate string-matching with q-grams and maximal matches. Theoretical Computer Science, 92:191-211.
41. Ullman, Jeffrey R. 1977. A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors. Computer Journal, 20(2):141-147.
42. Wagner, Robert A. and Michael J. Fischer. 1974. The string-to-string correction problem. Journal of the ACM, 21(1):168-173.
43. Weigel, Achim, Stephan Baumann, and J. Rohrschneider. 1995. Lexical postprocessing by heuristic search and automatic determination of the edit costs. In Proceedings of the Third International Conference on Document Analysis and Recognition (ICDAR 95), pages 857-860.
44. Wells, C. J., L. J. Evett, Paul E. Whitby, and R.-J. Withrow. 1990. Fast dictionary look-up for contextual word recognition. Pattern Recognition, 23(5):501-508.
45. Wu, Sun and Udi Manber. 1992. Fast text searching allowing errors. Communications of the ACM, 35(10):83-91.
46. Zobel, Justin and Philip Dart. 1995. Finding approximate matches in large lexicons. Software - Practice and Experience, 25(3):331-345.