Skip to search formSkip to main contentSkip to account menu

Levenshtein automaton

Known as: Levenshtein automata, Levenshtein transducer 
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… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
In this paper we propose a method for reducing the number of formal concepts in formal concept analysis of data with fuzzy… 
2015
2015
In this chapter, we study the application of existing entity resolution (ER) techniques on a real-world multi-source genealogical… 
2014
2014
Current Translation Memory (TM) systems work at the surface level and lack semantic knowledge while matching. This paper presents… 
2013
2013
Natural language processing for historical text imposes a variety of challenges, such as to deal with a high degree of spelling… 
2009
2009
At least two: the reputation of their brand and a reputation for being tough on imitators of this brand. Sustaining a brand… 
2008
2008
Many natural language applications, like machine translation and information extraction, are required to operate on text with… 
2004
2004
In some real world applications, the sample could be described as a string of symbols rather than a vector of real numbers. It is… 
Highly Cited
2002
Highly Cited
2002
  • K. Schulz, S. Mihov
  • International Journal on Document Analysis and…
  • 2002
  • Corpus ID: 207046453
Abstract. The Levenshtein distance between two words is the minimal number of insertions, deletions or substitutions that are… 
Highly Cited
1997
Highly Cited
1997
We describe ongoing work in the experimental evaluation of a range of methods for measuring the phonetic distance between the… 
1983
1983
Let T(U) be the set of words in the dictionary H which contains U as a substring. The problem considered here is the estimation…