- Notifications
You must be signed in to change notification settings - Fork2
Kotlin multiplatform library offering various algorithms to measure string similarity and distance
License
NotificationsYou must be signed in to change notification settings
aallam/string-similarity-kotlin
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
This is a library that implements various measures of string similarity and distance.
Add the Maven Central repository if it is not already there:
repositories { mavenCentral()}Add a dependency to the dependencies block:
dependencies { implementation"com.aallam.similarity:string-similarity-kotlin:$version"}The following is the list of implemented algorithms:
- Levenshtein
- Normalized Levenshtein
- Weighted Levenshtein
- Damerau-Levenshtein
- Optimal String Alignment
- Jaro-Winkler
- Longest Common Subsequence
- Metric Longest Common Subsequence
- N-Gram
- Q-Gram
- Cosine similarity
- Jaccard index
- Sorensen-Dice coefficient
- Ratcliff-Obershelp
The library is a Kotlin port ofjava-string-similarity.
The library is an open-sourced software licensed under theMIT license.
About
Kotlin multiplatform library offering various algorithms to measure string similarity and distance
Topics
Resources
License
Uh oh!
There was an error while loading.Please reload this page.
Stars
Watchers
Forks
Uh oh!
There was an error while loading.Please reload this page.