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.
2015
2015
Structural offline handwriting character recognition using levenshtein distance
Research in offline handwriting recognition for unconstrained text remains a difficult challenge. Some problems such as noise in… 
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… 
2014
2014
Secure Hamming distance based record linkage with malicious adversaries
2012
2012
AUTOMSv2 results for OAEI 2012
This paper presents AUTOMSv2 effort towards building a tool for the automated alignment of domain ontologies. The developed tool… 
2011
2011
PREDICTING INTRASTATE CONFLICT ONSET : AN EVENT DATA APPROACH USING EUCLIDEAN AND LEVENSHTEIN DISTANCE MEASURES
The goal of much of the large-N quantitative literature focusing on conflict onset has been to find generalizable empirical… 
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… 
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… 
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
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)