Calculate edit distance between two strings and estimate their similarity percentage.
Distance
-
Similarity
-
Lengths
-
Enter the example value or paste your own input, choose the mode when one is available, and read the first result card for the direct answer. The output area gives a copyable block for code reviews, documentation, API tests, classwork or troubleshooting notes.
What the result means
Levenshtein distance counts the minimum insertions, deletions and substitutions needed to turn one string into another.
What is not included
The dynamic-programming matrix is capped for browser responsiveness on very long strings.
Privacy note
The calculation runs in your browser. Avoid pasting production secrets, credentials, private keys, customer data or regulated personal data unless your own policy allows browser-based tools.