levenshteinDistance function

Future<int> levenshteinDistance(
  1. String str1,
  2. String str2
)

Computes the minimum number of single-character edits (insertions, deletions or substitutions) required to change the str1 into the str2

Implementation

Future<int> levenshteinDistance(String str1, String str2) async {
  return str1.levenshteinDistance(str2);
}