View Source ExFuzzywuzzy.Similarity.Levenshtein (ex_fuzzywuzzy v0.3.0)

Implements the similarity calculus basing on the Levenshtein distance

Summary

Functions

The Levenshtein distance is calculated as the minimum number of edits in order to transition from one string to the other Implementation follows Hjelmqvist algorithm

Functions

@spec calculate(String.t(), String.t()) :: float()

The Levenshtein distance is calculated as the minimum number of edits in order to transition from one string to the other Implementation follows Hjelmqvist algorithm