View Source Leven (leven v1.0.1)

Compute the Levenshtein distance between two strings.

The Levenshtein distance, also known as edit distance, measures the difference between two strings in terms of the minimum number of single-character edits (insertions, deletions, or substitutions) required to change one string into the other.

Link to this section Summary

Functions

Returns the Levenshtein distance between two strings.

Link to this section Functions

Link to this function

distance(source, target)

View Source
@spec distance(String.t(), String.t()) :: integer()

Returns the Levenshtein distance between two strings.