Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Levenshtein_automaton> ?p ?o }
Showing triples 1 to 39 of
39
with 100 triples 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 wikiPageLength "4215".
- Levenshtein_automaton wikiPageOutDegree "16".
- Levenshtein_automaton wikiPageRevisionID "706448574".
- Levenshtein_automaton wikiPageWikiLink Agrep.
- Levenshtein_automaton wikiPageWikiLink Backtracking.
- Levenshtein_automaton wikiPageWikiLink Cartesian_product.
- Levenshtein_automaton wikiPageWikiLink Category:Finite_automata.
- Levenshtein_automaton wikiPageWikiLink Category:String_matching_algorithms.
- Levenshtein_automaton wikiPageWikiLink Computer_science.
- Levenshtein_automaton wikiPageWikiLink Dynamic_programming.
- Levenshtein_automaton wikiPageWikiLink Finite-state_machine.
- Levenshtein_automaton wikiPageWikiLink Finite_state_transducer.
- Levenshtein_automaton wikiPageWikiLink Formal_language.
- Levenshtein_automaton wikiPageWikiLink Levenshtein_distance.
- Levenshtein_automaton wikiPageWikiLink Levenshtein–Damerau_distance.
- Levenshtein_automaton wikiPageWikiLink Regular_language.
- Levenshtein_automaton wikiPageWikiLink String_(computer_science).
- Levenshtein_automaton wikiPageWikiLink TRE_(computing).
- Levenshtein_automaton wikiPageWikiLink Trie.
- Levenshtein_automaton wikiPageWikiLinkText "Levenshtein automata".
- Levenshtein_automaton wikiPageWikiLinkText "Levenshtein automaton".
- Levenshtein_automaton wikiPageWikiLinkText "automaton".
- Levenshtein_automaton wikiPageUsesTemplate Template:Cn.
- Levenshtein_automaton wikiPageUsesTemplate Template:Reflist.
- Levenshtein_automaton wikiPageUsesTemplate Template:Strings.
- Levenshtein_automaton subject Category:Finite_automata.
- Levenshtein_automaton subject Category:String_matching_algorithms.
- Levenshtein_automaton hypernym Automaton.
- Levenshtein_automaton type Algorithm.
- 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 Q6535190.
- Levenshtein_automaton sameAs Levenshteinoutomaat.
- Levenshtein_automaton sameAs m.096xc5.
- Levenshtein_automaton sameAs Q6535190.
- Levenshtein_automaton wasDerivedFrom Levenshtein_automaton?oldid=706448574.
- Levenshtein_automaton isPrimaryTopicOf Levenshtein_automaton.