Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Levenshtein_automaton> ?p ?o. }
Showing items 1 to 13 of
13
with 100 items per page.
- Levenshtein_automaton abstract "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. That is, a string x is in the formal language recognized by the Levenshtein automaton if and only if x can be transformed into w by at most n single-character insertions, deletions, and substitutions.".
- Levenshtein_automaton wikiPageID "3345161".
- Levenshtein_automaton wikiPageRevisionID "575685988".
- Levenshtein_automaton hasPhotoCollection Levenshtein_automaton.
- Levenshtein_automaton subject Category:Automata_theory.
- Levenshtein_automaton subject Category:String_matching_algorithms.
- Levenshtein_automaton comment "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. That is, a string x is in the formal language recognized by the Levenshtein automaton if and only if x can be transformed into w by at most n single-character insertions, deletions, and substitutions.".
- Levenshtein_automaton label "Levenshtein automaton".
- Levenshtein_automaton sameAs m.096xc5.
- Levenshtein_automaton sameAs Q6535190.
- Levenshtein_automaton sameAs Q6535190.
- Levenshtein_automaton wasDerivedFrom Levenshtein_automaton?oldid=575685988.
- Levenshtein_automaton isPrimaryTopicOf Levenshtein_automaton.