56 Open Source Levenshtein Distance Software Projects
Free and open source levenshtein distance code projects including engines, APIs, generators, and tools.
Recursion And Dynamic Programming20 ⭐
Julia and Python recursion algorithm, fractal geometry and dynamic programming applications including Edit Distance, Knapsack (Multiple Choice), Stock Trading, Pythagorean Tree, Koch Snowflake, Jerusalem Cross, Sierpiński Carpet, Hilbert Curve, Pascal Triangle, Prime Factorization, Palindrome, Coin Change, Hanoi Tower, Cantor Set, Fibonacci
Python port of SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
Ml Ai Python Codes13 ⭐
Python various Important codes, Machine learning, NLP using Spacy and NLTK with Neural Network in ML
Ngx Smart Routing Demo24 ⭐
Implementation of correct path suggestion using Levenshtein distance algorith
Wolfgarbe Symspell2007 ⭐
SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
Java String Similarity2419 ⭐
Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...
Open Rsd12 ⭐
Proyecto educativo, que muestra cómo un sistema se conecta con la Red de Salud Digital, parte de la Estrategia de Salud Digital de la República Argentina.
Customized Symspell49 ⭐
Java port of SymSpell: 1 million times faster through Symmetric Delete spelling correction algorithm
Spellchecker Wasm36 ⭐
SpellcheckerWasm is an extrememly fast spellchecker for WebAssembly based on SymSpell
Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support
Genivia Fuzzymatcher15 ⭐
Fast fuzzy regex matcher: specify max edit distance to find approximate matches
Lua Bk Tree12 ⭐
A pure Lua implementation of bk-trees, created because it was needed for fuzzy term matching.
Go Edlib303 ⭐
📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...
Maxbachmann Levenshtein17 ⭐
The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
Bbalet Stopwords103 ⭐
Removes most frequent words (stop words) from a text content. Based on a Curated list of language statistics.
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
Agext Levenshtein60 ⭐
Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.
Umbertogriffo Trie29 ⭐
A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.
A fuzzy matching string distance library for Scala and Java that includes Levenshtein distance, Jaro distance, Jaro-Winkler distance, Dice coefficient, N-Gram similarity, Cosine similarity, Jaccard similarity, Longest common subsequence, Hamming distance, and more..
Compute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.
Python Word Error Rate14 ⭐
Calculates the word error rate of two strings, and the result is written into beautify HTML.
Rust implementation of sequence alignment / Levenshtein distance by A* acceleration of the DP algorithm