Uses of Interface org.apache.commons.text.similarity.ObjectSimilarityScore (Apache Commons Text 1.13.0 API)
Description: use: package: org.apache.commons.text.similarity, interface: ObjectSimilarityScore

# Uses of Interface
org.apache.commons.text.similarity.ObjectSimilarityScore

Packages that use ObjectSimilarityScore
Package
Description
org.apache.commons.text.similarity
Provides algorithms for string similarity.

- ## Uses of ObjectSimilarityScore in org.apache.commons.text.similarity

  Subinterfaces of ObjectSimilarityScore in org.apache.commons.text.similarity
  Modifier and Type
  Interface
  Description
  `interface`
  `EditDistance<R>`
  Interface for Edit Distances.
  `interface`
  `SimilarityScore<R>`
  Scores `CharSequence` similarity, like a `String`.
  Classes in org.apache.commons.text.similarity that implement ObjectSimilarityScore
  Modifier and Type
  Class
  Description
  `class`
  `CosineDistance`
  Measures the cosine distance between two character sequences.
  `class`
  `HammingDistance`
  The hamming distance between two strings of equal length is the number of positions at which the corresponding symbols are different.
  `class`
  `IntersectionSimilarity<T>`
  Measures the intersection of two sets created from a pair of character sequences.
  `class`
  `JaccardDistance`
  Measures the Jaccard distance of two sets of character sequence.
  `class`
  `JaccardSimilarity`
  Measures the Jaccard similarity (aka Jaccard index) of two sets of character sequence.
  `class`
  `JaroWinklerDistance`
  Measures the Jaro-Winkler distance of two character sequences.
  `class`
  `JaroWinklerSimilarity`
  A similarity algorithm indicating the percentage of matched characters between two character sequences.
  `class`
  `LevenshteinDetailedDistance`
  An algorithm for measuring the difference between two character sequences.
  `class`
  `LevenshteinDistance`
  An algorithm for measuring the difference between two character sequences.
  `class`
  `LongestCommonSubsequence`
  A similarity algorithm indicating the length of the longest common subsequence between two strings.
  `class`
  `LongestCommonSubsequenceDistance`
  An edit distance algorithm based on the length of the longest common subsequence between two strings.