Find a needle (a document or record) in a haystack using string similarity and (optionally) regular expression rules. Uses Dice's Coefficient (aka Pair Similiarity) and Levenshtein Distance internally.
Repository Index
47,133 repositories indexed
1–3 of 3 · Most stars
Calculates edit distance using Damerau-Levenshtein algorithm
Fast string edit distance computation, using the Damerau-Levenshtein algorithm.