com.rockymadden.stringmetric

similarity

package similarity

Visibility
  1. Public
  2. All

Type Members

  1. final case class DiceSorensenMetric(n: Int) extends StringMetric[Double] with Product with Serializable

    An implementation of the Dice/Sorensen metric.

    An implementation of the Dice/Sorensen metric. This implementation differs in that n-gram size is required. Traditionally, the algorithm uses bigrams.

  2. final case class JaccardMetric(n: Int) extends StringMetric[Double] with Product with Serializable

  3. final case class NGramMetric(n: Int) extends StringMetric[Double] with Product with Serializable

  4. final case class OverlapMetric(n: Int) extends StringMetric[Double] with Product with Serializable

  5. final case class WeightedLevenshteinMetric(delete: BigDecimal, insert: BigDecimal, substitute: BigDecimal) extends StringMetric[Double] with Product with Serializable

Value Members

  1. object HammingMetric extends StringMetric[Int] with Product with Serializable

  2. object JaroMetric extends StringMetric[Double] with Product with Serializable

    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.

  3. object JaroWinklerMetric extends StringMetric[Double] with Product with Serializable

    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).

  4. object LevenshteinMetric extends StringMetric[Int] with Product with Serializable

  5. object RatcliffObershelpMetric extends StringMetric[Double] with Product with Serializable

Ungrouped