The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning. Learn more →
Top 14 edit-distance Open-Source Projects
-
SymSpell
SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
-
edlib
Lightweight, super fast C/C++ (& Python) library for sequence alignment using edit (Levenshtein) distance.
-
go-edlib
📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...
-
js-levenshtein
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
-
Quickenshtein
Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support
-
WorkOS
The modern identity platform for B2B SaaS. The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.
-
trie
A Trie implementation in Go meant for auto-completion use cases. Supports Levenshtein distance search. (by shivamMg)
-
distlib
Distance related functions (Damerau-Levenshtein, Jaro-Winkler , longest common substring & subsequence) implemented as SQLite run-time loadable extension. Any UTF-8 strings are supported.
-
edit-distance-linear
Levenshtein edit distance in linear memory (also turns out to be faster than C++)
-
SaaSHub
SaaSHub - Software Alternatives and Reviews. SaaSHub helps you find the best software and product alternatives
Project mention: Should you combine edit distance "spell check" algorithms with phonetic matching algorithms for robust keyword finding? | /r/AskComputerScience | 2023-11-07The SimSpell algorithm uses deletions to determine edit distance of the input query word compared to a dictionary of correctly spelled words. The Double Metaphone algorithm (or other phonetic algorithms) convert the words to phonetic versions (phonetic "hashes" basically), and you then search based on the input phonetic hash matching the dictionary of phonetic hashes.
Project mention: textdistance.rs: Rust library to compare strings (or any sequences). 25+ algorithms, pure Rust, common interface, Unicode support. Based on popular and battle-tested textdistance Python library. | /r/rust | 2023-05-19The wide selection of algorithms is great, but some preliminary testing shows that this library's implementations are quite slower than the already existing implementations, e.g strsim.
Project mention: Dice-coefficient: Doubled speed by not using an array | news.ycombinator.com | 2023-07-14
edit-distance related posts
- Should you combine edit distance "spell check" algorithms with phonetic matching algorithms for robust keyword finding?
- Help with deep learning project "autocorrection"
- Spellcheck and Levenshtein distance
- Auto correct/Auto complete feature
- SymSpell: 1M times faster spelling correction
- What's an efficient way to find multiple subsequences in several FASTQs?
-
A note from our sponsor - WorkOS
workos.com | 26 Apr 2024
Index
What are some of the best open-source edit-distance projects? This list will help you:
Project | Stars | |
---|---|---|
1 | SymSpell | 3,034 |
2 | PolyFuzz | 716 |
3 | edlib | 484 |
4 | go-edlib | 444 |
5 | js-levenshtein | 428 |
6 | strsim-rs | 375 |
7 | Quickenshtein | 273 |
8 | trie | 107 |
9 | dice-coefficient | 48 |
10 | distlib | 20 |
11 | edits.cr | 16 |
12 | JavaPermutationTools | 7 |
13 | edit-distance-linear | 3 |
14 | Edits | 2 |
Sponsored