Levenshtein Distance Online Calculator

Online tool for calculating Levenshtein distance.

About Levenshtein Distance

Levenshtein Distance is the minimum number of edits required to make two texts, given an edit can only be applied to a single character.

Levenshtein Distance has some upper and lower bounds

  • If two texts has different length, it is at least the difference of length of the texts
  • The value is less than or equal the length of longer text
  • The value is zero if and only if the text are equal
  • Hamming distance is an upper bound if the strings have equal length

Example 1

Text 1:

abc
Text 1:
abd
Output:
1

Example 2

Text 1:

abc
Text 1:
a1234
Output:
4