| EthanRutherford/fast-fuzzy |
276 |
|
3 |
47 |
over 3 years ago |
48 |
November 05, 2022 |
2 |
isc |
JavaScript |
| Fast fuzzy search utility |
| umbertogriffo/Trie |
31 |
|
0 |
0 |
over 4 years ago |
0 |
|
1 |
|
Java |
| A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity. |
| jnorthrup/patl |
20 |
|
0 |
0 |
almost 4 years ago |
0 |
|
0 |
|
C++ |
| Roman Klyujkov's Practical Algorithm Template library |
| troshko111/fast-fuzzy-matching |
18 |
|
0 |
0 |
almost 9 years ago |
0 |
|
0 |
mit |
C# |
| BK-tree with Damerau-Levenshtein distance and Trie with Levenshtein distance |
| dvirsky/levenshtein |
16 |
|
0 |
0 |
about 6 years ago |
0 |
|
0 |
bsd-2-clause |
Go |
| sparse levenshtein automaton in go |
| vcbin/SparseDamerauLevenshteinAutomaton |
11 |
|
0 |
0 |
almost 10 years ago |
0 |
|
0 |
mit |
Python |
| Python implementaion of optimal string alignment algorithm of SparseDamerauLevenshteinAutomaton for string fuzzy match. |
| jamra/LevenshteinTrie |
10 |
|
0 |
0 |
about 11 years ago |
0 |
|
0 |
apache-2.0 |
Go |
| A Trie data structure that allows for fuzzy string matching |
| Vivino/go-autocomplete-trie |
10 |
|
0 |
0 |
over 3 years ago |
0 |
|
2 |
mit |
Go |
| go-autocomplete-trie is a data structure for text auto completion that allows for fuzzy matching and configurable levenshtein distance limits |
| talhasaruhan/fuzzy-search |
9 |
|
0 |
0 |
almost 4 years ago |
0 |
|
0 |
mit |
C++ |
| Data structures for fuzzy string search |
| brendanlong/ocaml-trie |
8 |
|
0 |
0 |
over 8 years ago |
0 |
|
0 |
other |
OCaml |
| Trie code forked from https://www.lri.fr/~filliatr/software.en.html |
