String Distance
Levenshtein and Sørensen-Dice for fuzzy match.
Levenshtein distance
3
edits to transform A into B
Levenshtein similarity
57.1%
Sørensen-Dice
0.364
What's what
- Levenshtein: count of insert / delete / substitute operations
- Similarity: 1 minus Levenshtein over max length (0 to 1)
- Sørensen-Dice: bigram overlap (0 to 1)
For fuzzy matching, deduplication, or autocomplete suggestion ranking. Levenshtein is intuitive but slow for long strings. Dice is faster on bigrams and works well for typo detection.
About
Compare two strings. The tool reports Levenshtein edit distance, similarity ratio (0 to 1), and Sørensen-Dice bigram coefficient. Useful for fuzzy match, deduplication, or autocomplete ranking.
How to use
- Type two strings.
FAQ
Which metric should I use?+
Levenshtein for typo correction (one substitution = one edit). Dice for typos and reordering (works on bigrams). For most cases, both give similar rankings.