Fast string correction with Levenshtein automata

International Journal on Document Analysis and Recognition

Volumn 5, Issue 1, 2003, Pages 67-85

  Schulz, Klaus U ^a   Mihov, Stoyan ^b  

^a UNIVERSITY OF MUNICH   (Germany)

^b BULGARIAN ACADEMY OF SCIENCES   (Bulgaria)

Author keywords

Electronic dictionaries; Levenshtein distance; Optical character recognition; Spelling correction

Indexed keywords

AND SPLITS; ELECTRONIC DICTIONARIES; EVALUATION RESULTS; FAST METHODS; LEVENSHTEIN DISTANCE; SPELLING CORRECTION; UNRESTRICTED TEXTS;

OPTICAL CHARACTER RECOGNITION;

FINITE AUTOMATA;

EID: 84893371228     PISSN: 14332833     EISSN: 14332825     Source Type: Journal    
DOI: 10.1007/s10032-002-0082-8     Document Type: Article

References (36)

1. [AFW83] Angell RC, Freund GE, Willett P (1983) Automatic spelling correction using a trigram similarity measure. Inf Process Manage 19:255-261
2. [Bla60] Blair CR (1960) A program for correcting spelling errors. Inf Control 3:60-67
3. [Bun93] Bunke H (1993) A fast algorithm for finding the nearest neighbor of a word in a dictionary. In: Proceedings of 2nd International Conference on Document Analysis and Recognition ICDAR '93, pp 632-637. IEEE Computer Society Press
4. [CSY99] Calude CS, Salomaa K, Yu S (1999) Metric lexical analysis. In: 4th International Workshop on Implementing Automata, WIA'99. Lecture Notes in Computer Science, vol 2214. Springer, Berlin Heidelberg New York
5. [dBdBT95] de Bertrand de Beuvron F, Trigano P (1995) Hierarchically coded lexicon with variants. Int J Pattern Recogn Artif Intell 9(1):145-165
6. +97] Dengel A, Hoch R, Hönes F, Jäger T, Malburg M, Weigel A (1997) Techniques for improving OCR results. In: Bunke H, Wang PSP (eds) Handbook of Character Recognition and Document Image Analysis. World Scientific, Singapore
7. [DMWW00] Daciuk J, Mihov S, Watson B, Watson R (2000) Incremental construction of minimal acyclic finite state automata. Comput Linguist 26(1):3-16
8. [GP90] Galil Z, Park K (1990) An improved algorithm for approximate string matching. SIAM J Comput 19(6):989-999
9. [Hon95] Hong T (1995) Degraded text recognition using visual and linguistic context. PhD thesis. CEDAR, State University of New York at Buffalo
10. [HU79] Hopcroft JE, Ullman JD (1979) Introduction to automata theory, languages, and computation. Addison-Wesley, Reading, Mass.
11. [Hul92] Hull JJ (1992) A hidden Markov model for language syntax in text recognition. In: Proceedings of the 11th IAPR International Conference on Pattern Recognition, The Hague, The Netherlands. IEEE Computer Society Press, pp 416-423
12. [KEW91] Keenan FG, Evett LJ, Withrow RJ (1991) A large vocabulary stochastic analyser for handwriting recognition. In: Proceedings of the First International Conference on Document Analysis and Recognition (ICDAR '91), pp 794-802. IEEE Computer Society Press
13. [Koz97] Kozen DC (1997) Automata and computability. Springer, New York Berlin Heidelberg
14. [KST92] Kim JY, Shawe-Taylor J (1992) An approximate string-matching algorithm. Theor Comput Sci 92:107-117
15. [KST94] Kim JY, Shawe-Taylor J (1994) Fast string matching using an n-gram algorithm. Softw Pract Exper 94(1):79-88
16. [Kuk92] Kukich K (1992) Techniques for automatically correcting words in texts. ACM Comput Surv 24(4):377-439
17. [Lev66] Levenshtein V (1996) Binary codes capable of correcting deletions, insertions, and reversals. Sov Phys Dokl 10(8):707-710
18. [Mih98] Mihov S (1998) Direct building of minimal automaton for given list. In: Annuaire de l'Université de Sofia "St. Kl. Ohridski", vol 91(1)
19. [Ofl96] Oflazer K (1996) Error-tolerant finite-state recognition with applications to morphological analysis and spelling correction. Comput Linguist 22(1):73-89
20. [OL97] Oommen BJ, Loke RKS (1997) Pattern recognition of strings with substitutions, insertions, deletions, and generalized transpositions. Pattern Recogn 30(5):789-800
21. [OM88] Owolabi O, McGregor DR (1988) Fast approximate string matching. Softw Pract Exper 18(4):387-393
22. [RE71] Riseman EM, Ehrich RW (1971) Contextual word recognition using binary digrams. IEEE Trans Comput C-20(4):397-403
23. [Rev92] Revuz D (1992) Minimisation of acyclic deterministic automata in linear time. Theor Comput Sci 92(1):181-189
24. [SHC83] Srihari SN, Hull JJ, Choudhari R (1983) Integrating diverse knowledge sources in text recognition. ACM Trans Office Inf Syst 1(1):68-87
25. [Sin90] Sinha RMK (1990) On partitioning a dictionary for visual text recognition. Pattern Recogn 23(5):497-500
26. [SKS96] Seni G, Kripasundar V, Srihari RK (1996) Generalizing edit distance to incorporate domain information: handwritten text recognition as a case study. Pattern Recogn 29(3):405-414
27. [SM01] Schulz KU, Mihov S (2001) Fast string correction with Levenshtein-automata. CIS-Report 01-127, CIS, Universität München
28. [Sri85] Srihari SN (1985) Computer text recognition and error correction. Tutorial. IEEE Computer Society Press, Silver Spring, Md.
29. [TIAY90] Takahashi H, Itoh N, Amano T, Yamashita A (1990) A spelling correction method and its application to an OCR system. Pattern Recogn 23(3/4):363-377
30. [Ukk85] Ukkonen E (1985) Algorithms for approximate string matching. Inf Control 64:100-118
31. [Ukk92] Ukkonen E (1992) Approximate stringmatching with q-grams and maximal matches. Theor Comput Sci 92:191-211
32. [Ull77] Ullmann JR (1977) A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors. Comput J 20(2):141-147
33. [WBR95] Weigel F, Baumann S, Rohrschneider J (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), pp 857-860. IEEE Computer Society Press
34. [WF74] Wagner RA, Fisher M (1974) The string-tostring correction problem. J ACM 21(1):168-173
35. [WM92] Wu S, Manber U (1992) Fast text searching allowing errors. Commun ACM 35(10):83-91
36. [ZD95] Zobel J, Dart P (1995) Finding approximate matches in large lexicons. Softw Pract Exper 25(3):331-345