## Fast String Correction with Levenshtein-Automata (2002)

Venue: | INTERNATIONAL JOURNAL OF DOCUMENT ANALYSIS AND RECOGNITION |

Citations: | 27 - 4 self |

### BibTeX

@ARTICLE{Schulz02faststring,

author = {Klaus Schulz and Stoyan Mihov},

title = {Fast String Correction with Levenshtein-Automata},

journal = {INTERNATIONAL JOURNAL OF DOCUMENT ANALYSIS AND RECOGNITION},

year = {2002},

volume = {5},

pages = {67--85}

}

### Years of Citing Articles

### OpenURL

### Abstract

The Levenshtein-distance between two words is the minimal number of insertions, deletions or substitutions that are needed to transform one word into the other. Levenshtein-automata of degree n for a word W are defined as finite state automata that regognize the set of all words V where the Levenshtein-distance between V and W does not exceed n. We show how to compute, for any fixed bound n and any input word W , a deterministic Levenshtein-automaton of degree n for W in time linear in the length of W . Given an electronic dictionary that is implemented in the form of a trie or a finite state automaton, the Levenshtein-automaton for W can be used to control search in the lexicon in such a way that exactly the lexical words V are generated where the Levenshtein-distance between V and W does not exceed the given bound. This leads to a very fast method for correcting corrupted input words of unrestricted text using large electronic dictionaries. We then introduce a second method that avoids the explicit computation of Levenshtein-automata and leads to even improved eciency. We also describe how to extend both methods to variants of the Levenshtein-distance where further primitive edit operations (transpositions, merges and splits) may be used.

### Citations

3825 | Introduction to Automata Theory, Languages, and Computation - Hopcroft, UlIman - 1979 |

1197 | Binary codes capable of correcting deletions, insertions and reversals - Levenshtein - 1966 |

653 |
The String-to-String Correction Problem
- Wagner, Fischer
- 1974
(Show Context)
Citation Context ...istances [AFW83, Ukk92, KST92, KST94]. In this paper, we take the Levenshtein-distance as a basis. The standard algorithm for computing the Levenshtein-distance between two words by Wagner and Fisher =-=[WF74]-=- uses a dynamic programming scheme that leads to quadratic time complexity. Even with more sophisticated algorithms (cf. [Ukk85]) it is not realistic to compute the Levenshtein-distance between the in... |

351 | Techniques for automatically correcting words in text - Kukich - 1992 |

182 |
Algorithms for approximate string matching
- Ukkonen
- 1985
(Show Context)
Citation Context ...omputing the Levenshtein-distance between two words by Wagner and Fisher [WF74] uses a dynamic programming scheme that leads to quadratic time complexity. Even with more sophisticated algorithms (cf. =-=[Ukk85]-=-) it is not realistic to compute the Levenshtein-distance between the input word W and each of the words in the dictionary, already for dictionaries of a modest size. The problem becomes even more ser... |

152 | Approximate string-matching with q-grams and maximal matches* 1 - Ukkonen - 1992 |

137 | A fast bit-vector algorithm for approximate string matching based on dynamic programming - Myers - 1998 |

126 | Automata and Computability - Kozen - 1997 |

55 | Automatic spelling correction using a trigram similarity measure - Willett, Angell - 1983 |

51 |
Minimisation of acyclic deterministic automata in linear time
- Revuz
- 1992
(Show Context)
Citation Context ...) in time and space O(jW j). Corollary 5.1.3 For any input W , the minimal deterministic Levenshtein-automaton of degree 1 for W can be computed in time and space O(jW j). Proof. A result by D. Revuz =-=[Rev92]-=- shows that acyclic deterministicsnite state automata can be minimalized in linear time. Since LEV 1 (W ) is deterministic and acyclic the result follows. Example 5.1.4 Figure 5.1 describes the automa... |

23 | Computer Text Recognition and Error Correction - Srihari - 1984 |

23 | Degraded Text Recognition Using Visual and Linguistic Context - Hong - 1995 |

21 | Incorporation of a markov model of language syntax in a text recognition algorithm - Hull |

19 | Integrating Diverse Knowledge Sources in Text Recognition - Srihari, Hull, et al. - 1983 |

15 | A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in words - Ullmann - 1977 |

13 | Fast approximate string matching - Owolabi, McGregor - 1988 |

12 | Loke, “Pattern recognition of strings with substitutions, insertions, deletions and generalized transpositions - Oommen, S - 1995 |

10 | An approximate string-matching algorithm - Kim, Shawe-Taylor - 1992 |

10 | Fast string matching using an n-gram algorithm - Kim, Shawe-Taylor - 1994 |

10 | A program for correcting spelling errors - Blair - 1960 |

9 | Generalizing edit distance to incorporate domain information: Handwritten text recognition as a case study - Seni, Kripasundar, et al. - 1996 |

9 | A Spelling Correction Method and Its Application to an OCR System - Takahashi, Itoh, et al. - 1990 |

8 | Direct building of minimal automaton for given list. Annuaire de l’Université de Sofia - Mihov - 1997 |

8 | Contextual Word Recognition using binary diagrams - Riseman, Ehrich - 1971 |

8 | Partitioning a Dictionary for Visual Text Recognition - Sinha - 1990 |

8 | Finding approximate matches in large lexicons. Software Pract Exp - Zobel, PW - 1995 |

6 | Lexical Postprocessing by Heuristic Search and Automatic Determination of the Edit Costs - Weigel, Baumann, et al. - 1995 |

6 | Incremental construction of minimal acyclic state automata - Daciuk, Mihov, et al. - 2000 |

6 | Selektionsklassen und Hyponymie im Lexikon - Langer - 1996 |

6 | Lexikon und automatische Lemmatisierung - Maier-Meyer - 1995 |

5 | Electronic lexica and corpora research at CIS - Guenthner - 1996 |

3 | A large vocabulary stochastic analyser for handwriting recognition - Keenan, Evett, et al. - 1991 |

1 | Error-tolerant recognition with applications to morphological analysis and spelling correction - Kemal - 1996 |

1 |
A fast algorithm for the nearest neighbor of a word in a dictionary
- Bunke
- 1993
(Show Context)
Citation Context ...number of common n-grams with W exceed a certain threshold are selected in thesrst step [OM88, KST92, ZD95]. More recently, techniques from automata theory have been used to tackle the problem. Bunke =-=[Bun93]-=- has shown that for any given word W the columns of the table computed in the Fisher-Wagner algorithm can be compiled into a deterministicsnite state automaton. For any word V the automaton may be use... |

1 | de Beuvron and Philippe Trigano. Hierarchically coded lexicon with variants - Bertrand - 1995 |

1 | Einfache deutsche Verben. Eine syntaktische und semantische Beschreibung der verbalen Simplizia fur das elektronische Lexikonsystem CISLEX - Schnorbusch - 1998 |