dLSimilarity function

double dLSimilarity(
  1. List<int> a,
  2. List<int> b, {
  3. int sigma = 256,
})

Similarity using Damerau-Levenshtein Distance

Implementation

double dLSimilarity(List<int> a, List<int> b, {int sigma = 256}) {
  int distance = dLDistance(a, b, sigma: sigma);
  int maxLength = a.length > b.length ? a.length : b.length;
  double similarity = 1 - (distance / maxLength);
  return similarity;
}