Fast Fuzzy Matching

BK-tree with Damerau-Levenshtein distance and Trie with Levenshtein distance
Alternatives To Fast Fuzzy Matching
Project NameStarsDownloadsRepos Using ThisPackages Using ThisMost Recent CommitTotal ReleasesLatest ReleaseOpen IssuesLicenseLanguage
Fast Fuzzy2763472 years ago48November 05, 20222iscJavaScript
Fast fuzzy search utility
Trie31
2 years ago1Java
A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.
Patl20
2 years agoC++
Roman Klyujkov's Practical Algorithm Template library
Fast Fuzzy Matching18
7 years agomitC#
BK-tree with Damerau-Levenshtein distance and Trie with Levenshtein distance
Levenshtein16
4 years agobsd-2-clauseGo
sparse levenshtein automaton in go
Sparsedameraulevenshteinautomaton11
8 years agomitPython
Python implementaion of optimal string alignment algorithm of SparseDamerauLevenshteinAutomaton for string fuzzy match.
Go Autocomplete Trie10
a year ago2mitGo
go-autocomplete-trie is a data structure for text auto completion that allows for fuzzy matching and configurable levenshtein distance limits
Levenshteintrie10
9 years agoapache-2.0Go
A Trie data structure that allows for fuzzy string matching
Fuzzy Search9
2 years agomitC++
Data structures for fuzzy string search
Ocaml Trie8
6 years agootherOCaml
Trie code forked from https://www.lri.fr/~filliatr/software.en.html
Alternatives To Fast Fuzzy Matching
Select To Compare


Alternative Project Comparisons
Popular Levenshtein Projects
Popular Trie Projects
Popular Text Processing Categories

Get A Weekly Email With Trending Projects For These Categories
No Spam. Unsubscribe easily at any time.
C Sharp
Trie
Levenshtein