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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1983-2016
01219832016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
List decoding of insertions and deletions in the Levenshtein metric is considered. The Levenshtein distance between two sequences… (More)
  • figure 1
Is this relevant?
2015
2015
The Levenshtein Nondeterministic Finite state Automaton (NFA) recognizes input strings within a set edit distance of a configured… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2014
2014
Current Translation Memory (TM) systems work at the surface level and lack semantic knowledge while matching. This paper presents… (More)
  • table 1
  • table 2
  • table 6
  • table 7
  • table 3
Is this relevant?
2013
2013
In this article, we propose a novel scheme for online handwritten character recognition based on Levenshtein distance metric… (More)
  • figure 3
  • figure 1
  • table I
  • figure 2
  • figure 4
Is this relevant?
2011
2011
The Levenshtein distance is a simple distance metric derived from the number of edit operations needed to transform one string… (More)
  • figure 1
Is this relevant?
2009
2009
The maximal cardinality of a code W on the unit sphere in n dimensions with (x, y) ≤ s whenever x, y ∈ W, x 6= y, is denoted by A… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
2008
2008
Sequential pattern mining is an important problem in continuous, fast, dynamic and unlimited stream mining. Recently approximate… (More)
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2002
Highly Cited
2002
The Levenshtein distance between two words is the minimal number of insertions, deletions or substitutions that are needed to… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1997
1997
 
Is this relevant?
1992
1992
This paper describes the integration of a spelling corrector into the structured editor Grif. This corrector is based on the… (More)
Is this relevant?