Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...
-
Updated
Jun 1, 2022 - Java
Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...
SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
📐 Compute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.
Python port of SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
A .NET port of java-string-similarity
🔤 Rust implementations of string similarity metrics
pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.
📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...
Java port of SymSpell: 1 million times faster through Symmetric Delete spelling correction algorithm
SymSpellCompound: compound aware automatic spelling correction
🦀📏 Rust library to compare strings (or any sequences). 25+ algorithms, pure Rust, common interface, Unicode support.
Get text similarity level with Damerau-Levenshtein distance
Fast approximate strings search & spelling correction
A collection of string comparisons algorithms
PySpark phonetic and string matching algorithms
Library of tools for fuzzy matching.
Fast edit distance Python extension written in Cython/C++. Supports Levenshtein distance and Damerau Optimal String Alignment (OSA) distance.
LinSpell spelling correction algorithm implementation using Swift and Objective-C
This project Orchid-Fst implements a fast text string dictionary search data structure: Finite state transducer (short for FST) in c++ language.This FST C++ open source project has much significant advantages.
Efficient String Comparison Functions and Fuzzy String Matching
Add a description, image, and links to the damerau-levenshtein topic page so that developers can more easily learn about it.
To associate your repository with the damerau-levenshtein topic, visit your repo's landing page and select "manage topics."