Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
Approximate string matchingApproximation algorithmAutomated Similarity Judgment ProgramBK-tree

Broader (1)

Dynamic programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Auto-correction of English to Bengali Transliteration System using Levenshtein Distance
The automated transliteration process is a function or software application that checks words against a computerized corpus to… 
2014
2014
Solution Algorithm of String Similarity Based on Improved Levenshtein Distance
When calculating the similarity of strings, the Levenshtein Distance(LD) algorithm only considers the operating times and ignores… 
Highly Cited
2012
Highly Cited
2012
Script Independent Word Spotting in Offline Handwritten Documents Based on Hidden Markov Models
Keyword spotting aims to retrieve all instances of a given keyword from a document in any language. In this paper, we propose a… 
Highly Cited
2008
Highly Cited
2008
Ontology-based context synchronization for ad hoc social collaborations
2006
2006
Understanding novice errors and error paths in Object-oriented programming through log analysis
What difficulties do beginners face when learning object-oriented programming? How are these reflected in the code they write? In… 
2006
2006
Log-based State Machine Construction for Analyzing Internal Logistics of Semiconductor Equipment
For evaluation of equipment productivity and diagnosis purposes state-transition models of equipments are necessary. In most… 
2004
2004
Levenshtein distance for graph spectral features
Graph structures play a critical role in computer vision, but they are inconvenient to use in pattern recognition tasks because… 
Highly Cited
2004
Highly Cited
2004
A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance
A statistical approach to cryptanalysis of a memoryless function of clock-controlled shift registers is introduced. In the case… 
2002
2002
Overall risk criterion estimation of hidden Markov model parameters
2002
2002
Fast cyclic edit distance computation with weighted edit costs in classification
  • G. PerisA. Marzal
  • Object recognition supported by user interaction…
  • 2002
  • Corpus ID: 15142284
Cyclic edit distances are a good measure of contour shapes dissimilarity. A branch and bound algorithm that speeds up the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)