Edit Distance (Levenshtein Distance) Visualization
Find the minimum number of operations to transform one string into another
Source String
I
N
T
E
N
T
I
O
N
Target String
E
X
E
C
U
T
I
O
N
Edit Distance Algorithm Properties
Time Complexity
O(m × n)
Space Complexity
O(m × n)
Operations
Insert, Delete, Substitute
Use Cases
Spell Check, DNA Analysis
Operation Legend
= Match
↔ Substitute
✕ Delete
+ Insert