Go port of the python jellyfish module for approximate and phonetic matching of strings.
-
Updated
Dec 24, 2018 - Go
Go port of the python jellyfish module for approximate and phonetic matching of strings.
The main purpose of this project was to develop a matching algorithm in python to fuzzy classify people from a customer list as positive or negative based on a messy positive and negative database with a confidence score.
fast fuzzy string matching for Python
Kotlin multiplatform library offering various algorithms to measure string similarity and distance
Just some implementations of word distance functions.
Detect lexical blending using similarity by approximate string matching and word vectors
⚖️ Fetches all song titles in your playlist and compares them to find duplicates. Supports multithreading!
Algorithm to rank text similarity between set of strings and given inputs
Search database using jaro-winkler string similarity against a query
An R script that uses AI for data analysis on Deezer playlists, like looking for fuzzy duplicates, rank of genre and artists.
String metrics function in golang (levenshtein, damerau-levenshtein, jaro, jaro-winkler and additionally bk-tree) for autocorrect
Aceh language dictionary API created using Golang
Framework for finding similar rows in a JDBC source
Telegram bot, which takes IT slangs and outputs Formal mappings along with definitions
String metrics libary for Go lang. (e.g. Dice/Sorensen, Hamming, Jaro, Jaro-Winkler, Levenshtein)
A fast implementation of Jaro-Winkler distance comparing two &str values.
Jaro Winkler Distance is a algorithm that can be used to compare two strings of sentences and get the score in percent how much is similar.
Edit distance algorithms inc. Jaro, Damerau-Levenshtein, and Optimal Alignment
Add a description, image, and links to the jaro-winkler topic page so that developers can more easily learn about it.
To associate your repository with the jaro-winkler topic, visit your repo's landing page and select "manage topics."