This library provides very fast implementations of Levenshtein, Jaro-Winkler, and Hamming distance algorithms for batch matching of two input lists with zero cache misses (L1, LLi, LLd, LL). It is ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback