Levenshtein distance

Known as: Levenstein distance 
In information theory and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
  • 2015
Index TermsSequence comparison, Levenshtein distance, normalized edit distance. Although a number of normalized edit distances… (More)
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?
2010
2010
Iris recognition from surveillance-type imagery is an active research topic in biometrics. However, iris identification in… (More)
  • figure 1
  • table 1
  • figure 4
  • figure 6
Is this relevant?
2007
2007
The evolution of languages closely resembles the evolution of haploid organisms. This similarity has been recently exploited [1… (More)
  • figure 1
  • figure 2
Is this relevant?
2005
2005
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions… (More)
  • figure 1
Is this relevant?
2004
2004
Graph structures play a critical role in computer vision, but they are inconvenient to use in pattern recognition tasks because… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
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… (More)
  • table I
Is this relevant?
2002
2002
We have recently shown that q-gram filters based on gapped q-grams instead of the usual contiguous q-grams can provide orders of… (More)
  • figure 1
  • figure 2
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 2
  • figure 3
  • figure 7
Is this relevant?
Highly Cited
1976
Highly Cited
1976
In this paper we propose a new method for correcting garbled words based on Levenshtein distance and weighted Levenshtein… (More)
  • table III
  • figure 4
  • figure 6
  • figure 7
  • figure 8
Is this relevant?