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.
2014
2014
AGraP: an algorithm for mining frequent patterns in a single graph using inexact matching
Frequent graph mining algorithms commonly use graph isomorphism to identify occurrences of a given pattern, but in the last years… 
2013
2013
αRoute: A name based routing scheme for Information Centric Networks
One of the crucial building blocks for Information Centric Networking (ICN) is a name based routing scheme that can route… 
2012
2012
A Poor Man’s Translation Memory Using Machine Translation Evaluation Metrics
We propose straightforward implementations of translation memory (TM) functionality for research purposes, using machine… 
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… 
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… 
2005
2005
Measuring reuse in hazard analysis
2002
2002
Shape recognition using attributed string matching with polygon vertices as the primitives
2000
2000
String techniques for detecting duplicates in document databases
Abstract. Detecting duplicates in document image databases is a problem of growing importance. The task is made difficult by the… 
2000
2000
Automatic keyword extraction with relational clustering and Levenshtein distances
Alternating cluster estimation (ACE) is a generalized clustering model. Relational ACE is a modification of ACE that can be used… 
1997
1997
Edit Distance Correlation Attack on the Alternating Step Generator
A novel edit distance between two binary input strings and one binary output string of appropriate lengths which incorporates 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)