e/Levenshtein automaton

Information
has gloss	eng: In computer science, Levenshtein automata are a family of finite state automata that can recognize the set V of all words in a formal language for which the Levenshtein distance to an arbitrary word W does not exceed a particular constant. A Levenshtein automaton for W can be constructed in linear time proportional to the length of W, and can identify V in much less time than would be needed if the Levenshtein distance to W was calculated for each word in the language (a problem with quadratic time complexity). The construction operation for the Levenshtein automaton reflects the composition of a finite state transducer with the word. A probabilistic relative of the Levenshtein automaton is the Hidden Markov model.
lexicalization	eng: Levenshtein automaton
instance of	c/Algorithms on strings

Meaning
Afrikaans
has gloss	afr: In rekenaarwetenskap is Levenshteinoutomate n familie eindigetoestandoutomata wat die versameling V van alle woorde in n formele taal waarvoor die Levenshteinafstand tot n arbitrêre woord W nie n bepaalde konstante oorskry nie, kan herken. n Levenshteinoutomaat vir W kan in lineêre tyd eweredig aan die lengte van W gekonstrueer word, en kan V in baie minder tyd identifiseer as wat nodig sou wees as die Levenshteinafstand na W vir elke woord in die taal bereken sou word (n probleem met kwadratiese tydkompleksiteit).
lexicalization	afr: Levenshteinoutomaat