Skip to search formSkip to main contentSkip to account menu

Edit distance

Known as: Levenshtein string distance, Optimal string alignment, Levenshtein algorithm 
In computer science, edit distance is a way of quantifying how dissimilar two strings (e.g., words) are to one another by counting the minimum number… 
Wikipedia (opens in a new tab)

Related topics

Related topics

36 relations
Approximate string matchingBioinformaticsBitap algorithmByte

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Implementation of Fuzzy Keyword Search over Encrypted Data in Cloud Computing
Highly Cited
2013
Highly Cited
2013
TIDIER: an identifier splitting approach using speech recognition techniques
The software engineering literature reports empirical evidence on the relation between various characteristics of a software… 
2009
2009
Automatic standardisation of texts containing spelling variation: How much training data do you need?
Large quantities of spelling variation in corpora, such as that found in Early Modern English, can cause significant problems for… 
Highly Cited
2008
Highly Cited
2008
Extracting lists of data records from semi-structured web pages
2007
2007
A Metric for Paraphrase Detection
Monolingual text-to-text generation is an emerging research area in natural language processing. One reason for the interest in… 
2007
2007
Finding Content in File-Sharing Networks When You Can't Even Spell
The query success rate in current filesharing systems is low, for example, only 7-10% in Gnutella. An often-overlooked cause for… 
2004
2004
3-Dimensional curve similarity using string matching
2000
2000
What’s been forgotten in translation memory
Although undeniably useful for the translation of certain types of repetitive document, current translation memory technology is… 
1997
1997
Classes of cost functions for string edit distance
Finding a sequence of edit operations that transforms one string of symbols into another with the minimum cost is a well-known… 
1988
1988
A fast parallel algorithm to determine edit distance
We consider the problem of determining in parallel the cost of converting a source string to a destination string by a sequence… 
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)