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.
2016
2016
Privacy-Preserving Genetic Relatedness Test
An increasing number of individuals are turning to Direct-To-Consumer genetic testing to learn about their predisposition to… 
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… 
2011
2011
Multilingual Document Clustering Using Wikipedia as External Knowledge
This paper presents Multilingual Document Clustering (MDC) on comparable corpora. Wikipedia has evolved to be a major structured… 
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… 
2008
2008
Analogical Translation of Medical Words in Different Languages
Term translation has become a recurring need in many domains. This creates an interest for robust methods which can translate… 
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… 
2006
2006
A unifying framework for relational distance-based learning founded on relational algebra
We propose a novel unifying framework for relational distance based learning where learning examples are stored in a relational… 
2001
2001
An Error-Correction Graph Grammar to Recognize Texture Symbols
This paper presents an algorithm for recognizing symbols with textured elements in a graphical document. A region adjacency graph… 
2000
2000
Two Types of Translation Memory
Defined most generally, a translation memory is a computerised archive of existing translations, structured in such a way as to…