bn:02704728n
Noun Concept
IT
No term available
EN
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. Wikipedia
Relations
Sources