Levenshtein edit distance calculator for two strings

Enter any two strings and this calculator returns the minimum number of insertions, deletions, and substitutions required. It is useful when an exact equality check is too strict but you still need a clear, reproducible measure of difference. The comparison is deterministic, case-sensitive, and performed directly on Unicode code points without network access or probabilistic scoring.

What the distance tells you

A Levenshtein distance is a nonnegative integer. A result of zero means the two strings are identical, while a result of one means that one insertion, deletion, or substitution can make them equal. Larger results require more edits. For example, changing one letter is a substitution, adding a missing letter is an insertion, and removing an extra letter is a deletion. The algorithm considers all valid edit sequences and returns the smallest total rather than applying changes greedily from left to right. That distinction matters when repeated characters or shifted fragments create several possible alignments. The result is case-sensitive, so uppercase and lowercase forms count as different characters. It is also an absolute count, not a percentage. A distance of three may be substantial for a four-character code but minor for a long paragraph. When comparing strings of very different lengths, remember that the length difference alone establishes a minimum number of required insertions or deletions. Interpret the integer alongside the strings' lengths and your application's tolerance.

How the calculation works

The calculator uses dynamic programming to evaluate the cheapest way to transform every prefix of the first string into every prefix of the second. Each position considers three possibilities: insert the current character, delete a character, or substitute one character for another. Matching characters add no cost. The final cell contains the minimum edit count for the complete strings. This implementation stores only the previous and current rows of that calculation, which preserves the exact result while using memory proportional to the shorter input rather than allocating the full matrix. Characters are read as Unicode code points, so a supplementary character represented by a surrogate pair in JavaScript is treated as one comparison element. No normalization or case folding is performed. Consequently, visually similar text can differ when it uses distinct code points, combining marks, capitalization, or compatibility forms. Normalize or standardize text before sending it if your workflow intends those representations to be equivalent. Given the same two strings, the capability always returns the same integer.

Using the result in a workflow

Send the two values in the <code>first</code> and <code>second</code> fields. Both fields must be strings, although an empty string is valid and produces a distance equal to the other string's number of Unicode code points. The returned object contains the <code>distance</code> integer. A common workflow compares a submitted name with a known name and then applies a threshold chosen for the expected string length. Another checks whether a corrected identifier is within one edit of the original. Avoid treating one universal threshold as meaningful for every input: short product codes, personal names, and sentences have very different error profiles. If length-independent ranking is required, calculate a normalized score in your own application from the returned distance and an explicitly chosen denominator. Also decide whether punctuation, whitespace, accents, and letter case should matter before comparison; this capability preserves all of them exactly. The browser execution is suitable for interactive checks, while automated API requests use the same deterministic implementation at $0.002 per request. Invalid non-string values are rejected instead of being coerced silently.