2006
DOI: 10.1016/j.jtbi.2006.06.026
|View full text |Cite
|
Sign up to set email alerts
|

Surprises in approximating Levenshtein distances

Abstract: The Levenshtein distance is an important tool for the comparison of symbolic sequences, with many appearances in genome research, linguistics and other areas. For efficient applications, an approximation by a distance of smaller computational complexity is highly desirable. However, our comparison of the Levenshtein with a generic dictionary-based distance indicates their statistical independence. This suggests that a simplification along this line might not be possible without restricting the class of sequenc… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2009
2009
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…We have considered several distances of similarities: distance from Levenshtein, Jaro, distance, distance from Jaccard and distance from JaroWincler. In our approach, we have performed a comparison between the results of these distances (Baake et al, 2006;Raymond, 2005). We have opted for the JaroWincler distance, which provides the best results.…”
Section: Lexical Similaritymentioning
confidence: 99%
“…We have considered several distances of similarities: distance from Levenshtein, Jaro, distance, distance from Jaccard and distance from JaroWincler. In our approach, we have performed a comparison between the results of these distances (Baake et al, 2006;Raymond, 2005). We have opted for the JaroWincler distance, which provides the best results.…”
Section: Lexical Similaritymentioning
confidence: 99%