Returns an integer representing Levenshtein distance between source and target.

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

The algorithm used is based on the Wagner-Fisher iterative implementation.

Examples

iex> Levenshtein.distance("same", "same")
0
iex> Levenshtein.distance("kitten", "sitting")
3