string-similarity/com.aallam.similarity/RatcliffObershelp

RatcliffObershelp

class RatcliffObershelp

The Ratcliff/Obershelp algorithm computes the similarity of two strings the doubled number of matching characters divided by the total number of characters in the two strings. Matching characters are those in the longest common subsequence plus, recursively, matching characters in the unmatched region on either side of the longest common subsequence.

Constructors

Link copied to clipboard
constructor()

Functions

Link copied to clipboard
fun distance(first: String, second: String): Double

Return 1 - similarity.

Link copied to clipboard
fun similarity(first: String, second: String): Double

Compute the Ratcliff-Obershelp similarity between strings.