Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02704728n
Noun Concept
Categories: Finite automata, String matching algorithms
EN
Levenshtein automaton  Levenshtein automata  Levenshtein transducer
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
Definitions
Relations
Sources
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
mathematical model for string comparison Wikidata
IS A
finite-state machine
DIFFERENT FROM
Damerau–Levenshtein distance
Levenshtein distance
NAMED AFTER
Vladimir Levenshtein
Wikipedia
EN
Levenshtein automaton
Wikidata
EN
Levenshtein automaton
Wikipedia Redirections
EN
Levenshtein automata, Levenshtein transducer

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