Levenshtein Distance & String Similarity - Levenshtein Distance, Jaro-Winkler & String Similarity Calculator
Calculate the minimum number of character edits (insertions, deletions, or substitutions) required to transform one string into another.
✓ 100% Free & Unlimited
✓ 100% Browser Local & Private
✓ No Registration Required
How to use Levenshtein Distance & String Similarity Online
- Step 1: Type your reference string into Code Target A.
- Step 2: Type your compared string into Code Target B.
- Step 3: Instantly view Levenshtein distance, Jaro-Winkler percent, and matching index counts.
Frequently Asked Questions
What is Levenshtein Distance?
It measures the difference between two sequences of characters by counting single-character edits.
What is Jaro-Winkler similarity?
It measures character matching patterns, giving higher scores to strings that share common prefixes.