Project Name | Stars | Downloads | Repos Using This | Packages Using This | Most Recent Commit | Total Releases | Latest Release | Open Issues | License | Language |
---|---|---|---|---|---|---|---|---|---|---|
Fast Fuzzy | 276 | 3 | 47 | a year ago | 48 | November 05, 2022 | 2 | isc | JavaScript | |
Fast fuzzy search utility | ||||||||||
Trie | 31 | 2 years ago | 1 | Java | ||||||
A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity. | ||||||||||
Patl | 20 | 2 years ago | C++ | |||||||
Roman Klyujkov's Practical Algorithm Template library | ||||||||||
Fast Fuzzy Matching | 18 | 7 years ago | mit | C# | ||||||
BK-tree with Damerau-Levenshtein distance and Trie with Levenshtein distance | ||||||||||
Levenshtein | 16 | 4 years ago | bsd-2-clause | Go | ||||||
sparse levenshtein automaton in go | ||||||||||
Sparsedameraulevenshteinautomaton | 11 | 8 years ago | mit | Python | ||||||
Python implementaion of optimal string alignment algorithm of SparseDamerauLevenshteinAutomaton for string fuzzy match. | ||||||||||
Go Autocomplete Trie | 10 | a year ago | 2 | mit | Go | |||||
go-autocomplete-trie is a data structure for text auto completion that allows for fuzzy matching and configurable levenshtein distance limits | ||||||||||
Levenshteintrie | 10 | 9 years ago | apache-2.0 | Go | ||||||
A Trie data structure that allows for fuzzy string matching | ||||||||||
Fuzzy Search | 9 | 2 years ago | mit | C++ | ||||||
Data structures for fuzzy string search | ||||||||||
Ocaml Trie | 8 | 6 years ago | other | OCaml | ||||||
Trie code forked from https://www.lri.fr/~filliatr/software.en.html |