An implementation of the Dice/Sorensen metric.
An implementation of the Jaro metric.
An implementation of the Jaro metric. One differing detail in this implementation is that if a character is matched in string2, it cannot be matched upon again. This results in a more penalized distance in these scenarios.
An implementation of the Jaro-Winkler metric.
An implementation of the Jaro-Winkler metric. One differing detail in this implementation is that if a character is matched in string2, it cannot be matched upon again. This results in a more penalized distance in these scenarios (e.g. comparing henka and henkan distance is 0.9666 versus the typical 0.9722).
An implementation of the Dice/Sorensen metric. This implementation differs in that n-gram size is required. Traditionally, the algorithm uses bigrams.