Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
In this paper we propose a method for reducing the number of formal concepts in formal concept analysis of data with fuzzy… Expand
  • table 1
  • table 2
  • table 4
  • table 3
  • table 8
2015
2015
In this chapter, we study the application of existing entity resolution (ER) techniques on a real-world multi-source genealogical… Expand
  • table 2
  • table 1
  • table 3
  • table 4
  • table 5
2015
2015
The Levenshtein Nondeterministic Finite state Automaton (NFA) recognizes input strings within a set edit distance of a configured… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
2014
2014
Current Translation Memory (TM) systems work at the surface level and lack semantic knowledge while matching. This paper presents… Expand
  • table 1
  • table 2
  • table 6
  • table 7
  • table 3
2013
2013
Natural language processing for historical text imposes a variety of challenges, such as to deal with a high degree of spelling… Expand
  • table 1
  • figure 1
  • table 2
  • table 3
  • table 4
2009
2009
We investigate the structure of spherical τ-designs by applying polynomial techniques for investigation of some inner products of… Expand
2008
2008
Many natural language applications, like machine translation and information extraction, are required to operate on text with… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
1997
1997
In the previous chapters, we discussed problems involving an exact match of string patterns. We now turn to problems involving… Expand
  • figure 4.1
  • figure 4.3
  • figure 4.7