Definitions from Wikipedia (Levenshtein automaton)

▸ noun:  In computer science, a Levenshtein automaton for a string w and a number n is a finite-state automaton that can recognize the set of all strings whose Levenshtein distance from w is at most n.


▸ Words similar to levenshtein automaton
▸ Usage examples for levenshtein automaton

▸ Idioms related to levenshtein automaton
▸ Wikipedia articles (New!)
▸ Words that often appear near levenshtein automaton
▸ Rhymes of levenshtein automaton

▸ Invented words related to levenshtein automaton