🧩 Enhance data accuracy with MakFuzz, a fuzzy matching engine that streamlines data cleaning and deduplication with powerful spelling and phonetic strategies.

Rust-powered fuzzy search and string distance for JavaScript/TypeScript. 10-50x faster than fuse.js/leven.

A fast implementation of Jaro-Winkler distance comparing two &str values.

Hybrid string similarity

High-performance, open-source sanctions screening/watchlist engine for AML/KYC compliance. Features fuzzy (Jaro-Winkler), phonetic (Double Metaphone), and token-based name matching against OFAC, UN, EU & UK watchlists. Embeddable Java library with Vert.x and Spring Boot server modules, batch screening API, and audit trail support.

Calculate Jaro-Winkler string similarity from the terminal.

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

String metrics function in golang (levenshtein, damerau-levenshtein, jaro, jaro-winkler and additionally bk-tree) for autocorrect

🪼 a python library for doing approximate and phonetic matching of strings.

Python string distance/similarity CLI. Levenshtein, Hamming, Jaro-Winkler, cosine, LCS, fuzzy match, phonetic matching (Soundex, Metaphone). Zero dependencies.

Go metrics for calculating string similarity and other string utility functions

Python implementation of several sequence alignment algorithms such as Waterman-Smith-Beyer, Gotoh, and Needleman-Wunsch intended to calculate distance, show alignment, and display the underlying matrices.

Edit distance algorithms inc. Jaro, Damerau-Levenshtein, and Optimal Alignment

Edit distance algorithms inc. Jaro, Damerau-Levenshtein, and Optimal Alignment

A pico sized (> 1kb) typo-tolerant word matching library

Ruby & C implementation of Jaro-Winkler distance algorithm which supports UTF-8 string.

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.

High-performance and memory efficient native C++ text similarity algorithms for Node.js

📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...