✏️ Levenshtein Distance Calculator

Calculate the minimum number of single-character edits needed to transform one string into another.

Edit Distance Calculator
Enter two strings to calculate the minimum edit distance between them.
Length: 6 characters
Length: 7 characters
0
Minimum edits required

Edit Operations:

No operations needed (strings are identical)
About Levenshtein Distance

Also known as edit distance, it measures the minimum number of single-character edits (insertions, deletions, or substitutions) required to change one word into another.

Allowed Operations:

  • • Insertion: Add a character
  • • Deletion: Remove a character
  • • Substitution: Replace a character
Dynamic Programming Matrix
The algorithm builds a matrix where each cell represents the minimum edits needed.
Use Cases
  • • Spell checkers and autocorrect
  • • DNA sequence analysis
  • • Plagiarism detection
  • • Fuzzy string matching
  • • Version control systems
  • • Natural language processing
  • • Data deduplication