https://github.com/umbertogriffo/trie
A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.
https://github.com/umbertogriffo/trie
data-structures java java-8 levenshtein-distance retrieval stream string-similarity trie
Last synced: 4 months ago
JSON representation
A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.
- Host: GitHub
- URL: https://github.com/umbertogriffo/trie
- Owner: umbertogriffo
- Created: 2017-02-17T17:19:28.000Z (over 8 years ago)
- Default Branch: master
- Last Pushed: 2022-04-19T07:25:43.000Z (over 3 years ago)
- Last Synced: 2025-05-16T22:15:19.791Z (5 months ago)
- Topics: data-structures, java, java-8, levenshtein-distance, retrieval, stream, string-similarity, trie
- Language: Java
- Homepage:
- Size: 34.6 MB
- Stars: 44
- Watchers: 3
- Forks: 12
- Open Issues: 2
-
Metadata Files:
- Readme: README.md