Example input/output
Input: kitten / sitting
Output: Distance: 3
How it works
This tool implements the classic Levenshtein dynamic programming algorithm. It builds a matrix of edit costs and returns the minimum edit distance between the two strings. The result shows the number of operations needed to transform one string into the other. Processing runs in your browser.
Common use cases
- Measure string similarity for spell-checking or fuzzy matching logic
- Calculate the edit distance between two strings for diff analysis
- Validate approximate string matching algorithms in code