String Similarity: Levenshtein Distance

This example computes the minimum number of insertions, deletions, and substitutions required to transform one string into another. The dynamic programming table is filled step by step.

Sample Strings

Dynamic Programming Table

Step Explanation