Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
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
IS A
automa a stati finiti
DIFFERENT FROM
EN
Damerau–Levenshtein distance
distanza di Levenshtein
NAMED AFTER
Vladimir Levenshtein

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License