Why this tool is useful
Use Levenshtein distance to quantify spelling differences, compare short identifiers or set a transparent fuzzy-match threshold.
Text & List Tools · runs locally
Levenshtein Distance Calculator
Count the minimum single-grapheme insertions, deletions and substitutions needed to change one Unicode text into another.
Ready. Your working data stays in this browser.
How it works
The browser splits both values into grapheme clusters and fills two rolling dynamic-programming rows, so memory grows with the shorter text rather than the full matrix.
Practical example
Changing kitten to sitting needs two substitutions and one insertion, producing a distance of 3.
Validation
The calculation is deterministic and explains validation errors instead of silently changing invalid input.
Privacy boundary
Input and output remain in this tab. Copy and download happen through browser APIs without a server upload.
Result passport
Every run reports its tool mode, timestamp and input/output size so transformed data can be audited.