3 ms·
The Levenshtein distance, which finds the fewest edits to transform one string to another is also a classical example.
by marton78 7y ago
The Levenshtein distance, which finds the fewest edits to transform one string to another is also a classical example.