Kotlin String Similarity

Kotlin String Similarity is a Kotlin Multiplatform library for measuring and comparing the similarity of strings.

Kotlin String Similarity implements various string similarity and distance measures. It contains over a dozen algorithms, including, but not limited to, Levenshtein distance (and siblings), Jaro-Winkler, Longest Common Subsequence, Cosine similarity, and many others. Check the summary table below for the complete list.

This is project was initially a port of tdebatty's java-string-similarity to Kotlin Multiplatform, however is now expanding upon it.

Including

You can include kt-string-similarity in your project by adding the following:

<dependencies>
    <dependency>
        <groupId>ca.solo-studios</groupId>
        <artifactId>kt-string-similarity</artifactId>
        <version>0.1.0</version>
    </dependency>
</dependencies>

dependencies {
    implementation 'ca.solo-studios:kt-string-similarity:0.1.0'
}

dependencies {
    implementation("ca.solo-studios:kt-string-similarity:0.1.0")
}

[libraries]
kt-string-similarity = { group = "ca.solo-studios", name = "kt-string-similarity", version = "0.1.0" }

Overview

The main characteristics of each implemented algorithm are presented below. The "cost" columns gives an estimation of the computational/memory costs to compute the similarity between two strings of length \(m\) and \(n\) respectively.

Notes

References