Authors: Philip Rehberger
License: MIT
Summary: Match strings approximately using multiple algorithms: Levenshtein edit distance, Damerau-Levenshtein with transpositions, Jaro-Winkler similarity, Dice coefficient, Hamming distance, and Longest Common Subsequence. Includes token-based matching,...
Loading
