a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
-
Updated
Jun 22, 2024 - TypeScript
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
📐 Hidden alignment conditional random field for classifying string pairs.
A Java library for computation on permutations and sequences
This repository is a related to all about Natural Langauge Processing - an A-Z guide to the world of Data Science. This supplement contains the implementation of algorithms, statistical methods and techniques (in Python)
Fast fuzzy regex matcher: specify max edit distance to find approximate matches
Calculating Edit Distance with PySpark
Fuzzy string matching, grouping, and evaluation.
Fast edit distance Python extension written in Cython/C++. Supports Levenshtein distance and Damerau Optimal String Alignment (OSA) distance.
Tree edit distances using the Zhang-Shasha algorithm
Edit distance algorithms inc. Jaro, Damerau-Levenshtein, and Optimal Alignment
Edit distance algorithms inc. Jaro, Damerau-Levenshtein, and Optimal Alignment
🔤 Rust implementations of string similarity metrics
SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
Python port of SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
Config files for my GitHub profile.
HUMID: reference free FastQ deduplication
📝 A pure Gleam package to compute the edit distance of two strings
To evaluate machine translation, they use several methods, some of which we fully implemented
Add a description, image, and links to the edit-distance topic page so that developers can more easily learn about it.
To associate your repository with the edit-distance topic, visit your repo's landing page and select "manage topics."