Fast string correction with Levenshtein automata

@article{Schulz2002FastSC,
  title={Fast string correction with Levenshtein automata},
  author={K. Schulz and S. Mihov},
  journal={International Journal on Document Analysis and Recognition},
  year={2002},
  volume={5},
  pages={67-85}
}
  • K. Schulz, S. Mihov
  • Published 2002
  • Computer Science
  • International Journal on Document Analysis and Recognition
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 recognize 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 to… Expand
Nondeterministic Finite Automata in Hardware-the Case of the Levenshtein Automaton
A Memory-Efficient GPU Method for Hamming and Levenshtein Distance Similarity
Fast Approximate Search in Large Dictionaries
Average-Case Analysis of Approximate Trie Search (Extended Abstract)
Breadth-first search strategies for trie-based syntactic pattern recognition
Approximate word matching with synchronized rational relations
Descriptional Complexity of Error Detection
Fast Selection of Small and Precise Candidate Sets from Dictionaries for Text Correction Tasks
Fast Selection of Small and Precise Candidate Sets from Dictionaries for Text Correction Tasks
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 39 REFERENCES
Approximate String Matching with q-grams and Maximal Matches
  • E. Ukkonen
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1992
Contextual Word Recognition Using Binary Digrams
A hidden Markov model for language syntax in text recognition
  • J. Hull
  • Computer Science
  • Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol.II. Conference B: Pattern Recognition Methodology and Systems
  • 1992
Algorithms for Approximate String Matching
  • E. Ukkonen
  • Computer Science, Mathematics
  • Inf. Control.
  • 1985
Fast text searching: allowing errors
Hierarchically Coded Lexicon with Variants
...
1
2
3
4
...