Trie
Trie copied to clipboard
Published
20 hours ago •
umbertogriffo
umbertogriffo
A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.
Results
2
Trie issues
Sort by
recently updated
recently updated
newest added
Hi, Thanks for this repo, it's quite useful. Fixed some unnecessary slowdown due to boxing/unboxing and duplicated adding of results. Passes unit tests. Several times faster on my ad hoc...
enhancement
Metadata
42
Stars
11
Forks
Watchers
Owner
Metadata
A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.