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… 
2018
2018
Combination of levenshtein distance and rabin-karp to improve the accuracy of document equivalence level
Rabin Karp algorithm is a search algorithm that searches for a substring pattern in a text using hashing. It is beneficial for… 
2017
2017
Research on string similarity algorithm based on Levenshtein Distance
The application of string similarity is very extensive, and the algorithm based on Levenshtein Distance is particularly classic… 
Highly Cited
2017
Highly Cited
2017
Align and Copy: UZH at SIGMORPHON 2017 Shared Task for Morphological Reinflection
This paper presents the submissions by the University of Zurich to the SIGMORPHON 2017 shared task on morphological reinflection… 
Highly Cited
2014
Highly Cited
2014
CSCC: Simple, Efficient, Context Sensitive Code Completion
Code Completion helps developers learn APIs and frees them from remembering every detail. In this paper, we describe a novel… 
Highly Cited
2011
Highly Cited
2011
Levenshtein Distance Technique in Dictionary Lookup Methods: An Improved Approach
Dictionary lookup methods are popular in dealing with ambiguous letters which were not recognized by Optical Character Readers… 
2008
2008
Representing Tone in Levenshtein Distance
Levenshtein distance, also known as string edit distance, has been shown to correlate strongly with both perceived distance and… 
Highly Cited
2007
Highly Cited
2007
Indo-European languages tree by Levenshtein distance
The evolution of languages closely resembles the evolution of haploid organisms. This similarity has been recently exploited… 
Highly Cited
2006
Highly Cited
2006
Multiple Dimension Levenshtein Edit Distance Calculations for Evaluating Automatic Speech Recognition Systems During Simultaneous Speech
Since 1987, the National Institute of Standards and Technology has been providing evaluation infrastructure for the Automatic… 
Highly Cited
2003
Highly Cited
2003
Web mining with relational clustering
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)