๐ค Levenshtein Distance Calculator
3Edit distance
57%Similarity
Transformation breakdown
kโsitteโing
MatchSubstituteInsertDelete
Calculates the minimum number of single-character insertions, deletions, and substitutions needed to turn one string into another (the edit distance, or Levenshtein distance), and visualizes which characters changed with color-coded chips. Useful for spell-checking, string similarity scoring, or learning fuzzy-search algorithms.
How to use
- Enter the two strings you want to compare.
- The edit distance and similarity percentage are calculated automatically.
- The breakdown of the transformation (matches, substitutions, insertions, deletions) is shown as color-coded chips.
FAQ
What is edit distance (Levenshtein distance)?
It's the minimum number of single-character insert, delete, and substitute operations needed to turn one string into another.
How is the similarity percentage calculated?
It's 1 minus (edit distance รท length of the longer string), shown as a percentage. A higher value means the two strings are more similar.
Is the comparison case-sensitive?
Yes, the current version compares strings case-sensitively.