Fast string correction with Levenshtein automata.
Klaus U. SchulzStoyan MihovPublished in: Int. J. Document Anal. Recognit. (2002)
Keyphrases
- edit distance
- regular expressions
- hamming distance
- string matching
- levenshtein distance
- cellular automata
- finite automaton
- graph matching
- distance measure
- string similarity
- deterministic automata
- similarity measure
- pattern matching
- finite state
- approximate string matching
- finite state machines
- tree automata
- finite automata
- error detection
- suffix tree
- distance function
- lattice gas
- string edit distance
- databases
- context free grammars
- distortion correction
- data structure
- search engine
- neural network