2 packages returned for Tags:"LevenshteinDistance"

Package type
Sort by
Options
this package is based on Levenshtein Distance Algorithm: eg. first string ="abc rs t" secind string ="acb ts t" levenshtein distance =3 similarity ratio = 0.625 it is useful to understand how much both input strings are similar.