Library is used to perform fuzzy matching (matching simillar strings). It uses Levenshtein Distance algorithms to perform this operation.
In information theory, linguistics and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences....
this package is based on Levenshtein Distance Algorithm:
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.