kkg

kkg / LevenshteinDistance / 0.1.1

README.md

This algorithm calclates Levenshtein distance between two strings.

Levenshtein distance is the minimum number of single-character edits (insertions, deletions or substitutions) required to change one word into the other.

Input

Two strings

Output

Levenshtein distance of two words as an integral number.

Contents