Levenshtein Distance Calculator
Edit distance and similarity percentage between two strings.
Every calculation runs locally in your browser. Nothing you type here is sent to a server.
Edit distance
3
single-character edits
Similarity
57.1%
For informational and educational purposes only — not professional or technical advice, and not a substitute for consulting a qualified professional about your specific situation. TrueMeasureKit is not liable for decisions made based on these results. See our Terms of Service.
What "edit distance" actually counts
The Levenshtein distance is the minimum number of single-character insertions, deletions, or substitutions needed to turn one string into the other — "kitten" becomes "sitting" in exactly 3 edits (substitute k→s, substitute e→i, insert g). It's the algorithm behind spell-checker suggestions, fuzzy-search ranking, and duplicate-record detection, computed here with the standard dynamic-programming approach in O(n×m) time.
Frequently asked questions
What does Levenshtein distance measure?
The minimum number of single-character edits (insertions, deletions, or substitutions) needed to turn one string into another — a distance of 0 means identical strings, and the number grows with how different the strings are.