damerauLevenshteinDistance(sa, sb, w = c(1, 1, 1, 1))
length(sa)
Levenshtein VI (1966). Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady 10: 707-10 Damerau Levenshtein Distance calculates the difference between two strings used for typographical errors (typo's)