编辑距离

edit_distance

Implementation of string distance algorithms.

Description

Edit distances algorithms for fuzzy matching. Specifically, this library provides:

• Levenshtein distance
• Restricted Damerau-Levenshtein distance
• Longest Common Subsequence
• Jaro–Winkler distance
• Jaccard N-gram distance

Examples

Levenshtein d = new Levenshtein();
print(d.distance('witch', 'kitsch')); // 2