Rapid fuzzy string matching in Python using various string metrics
-
Updated
May 18, 2024 - C++
Rapid fuzzy string matching in Python using various string metrics
Search pre-defined keywords into the scanned PDF files using Levenshtein algorithm.
Finds similar word(s) in a list of words.
The fastest .Net Levenshtein around
Golang metrics for calculating string similarity and other string utility functions
Class library with some text matching & processing methods
Easy to use and powerful fuzzy string matching, port of fuzzywuzzy.
Simple package to implement levenshtein distance algorithm in typescript
📐 Compute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.
Fuzzy search strings in strings in dotnet
Fast edit distance Python extension written in Cython/C++. Supports Levenshtein distance and Damerau Optimal String Alignment (OSA) distance.
Edit distance algorithms inc. Jaro, Damerau-Levenshtein, and Optimal Alignment
Edit distance algorithms inc. Jaro, Damerau-Levenshtein, and Optimal Alignment
Rapid fuzzy string matching in C++ using the Levenshtein Distance
The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
A CLI spelling corrector for when you're unsure
🔤 Rust implementations of string similarity metrics
SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
Add a description, image, and links to the levenshtein topic page so that developers can more easily learn about it.
To associate your repository with the levenshtein topic, visit your repo's landing page and select "manage topics."