levenstein library Null safety

Support for computing levenshtein distance between two strings

More dartdocs go here.

Extensions

StringMatcher

Functions

levenshteinDistance(String str1, String str2) Future<int>
Computes the minimum number of single-character edits (insertions, deletions or substitutions) required to change the str1 into the str2