Levenshtein Distance Calculator

Edit distance and similarity update as you type in either string — nothing leaves your browser.

How it works

The Levenshtein (edit) distance is the minimum number of single-character insertions, deletions and substitutions needed to turn String A into String B, computed with the classic dynamic-programming table. Similarity is derived from that distance relative to the longer of the two strings, as a percentage — two identical strings (including two empty strings) are 100% similar.