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.
Go port of the python jellyfish module for approximate and phonetic matching of strings.
ABAP Did You Mean is a package for finding similar words or suggestions from a dictionary, inspired by "Did you mean?" functionality. It leverages distance and similarity algorithms for accurate suggestions.
End-to-end B2B payments reconciliation bot built with n8n. Automates matching of bank transactions against ERP payables using fuzzy name matching (Jaro-Winkler) and amount-tolerance rules. Classifies transactions as matched, pending, discrepant, or unmatched. Logs summaries to Google Sheets. Optional AI classification via Claude.
A high-performance TypeScript library for string similarity, distance algorithms, and text normalization utilities
Calculate Jaro-Winkler string similarity from the terminal.
An R script that uses AI for data analysis on Deezer playlists, like looking for fuzzy duplicates, rank of genre and artists.
Levenshtein edit distance with memoized DP and closest-match search.
fast fuzzy string matching for Python
Aceh language dictionary API created using Golang
Data Linkage project. Questo progetto combina tecniche di data linkage e web scraping per identificare differenze di prezzo tra soggiorni nei i siti web booking e agoda.
Metricas de similaridade (Levenshtein, Jaro-Winkler, Dice)
Detect lexical blending using similarity by approximate string matching and word vectors
Comprehensive string similarity metrics for Go: edit distance, token-based, phonetic — 15 algorithms, zero dependencies
Blazing-fast string similarity library written in Rust with Python bindings. Covers edit distance, fuzzy matching, set-based, alignment, and vector algorithms
Algorithm to rank text similarity between set of strings and given inputs
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.
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."