Trie

Trie

umbertogriffo

A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.

48 Stars
12 Forks
3 Watchers
Java Language
95.9 SrcLog Score
Cost to Build
$3.02M
Market Value
$4.01M

Growth over time

13 data points  ·  2021-08-01 → 2026-11-01
Stars Forks Watchers
💬

How do you feel about this project?

Ask AI about Trie

Question copied to clipboard

What is the umbertogriffo/Trie GitHub project? Description: "A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.". Written in Java. Explain what it does, its main use cases, key features, and who would benefit from using it.

Question is copied to clipboard — paste it after the AI opens.

🏆 Show off this rank

umbertogriffo/Trie on SrcLog (holo style)

Add it to a GitHub README or profile — the card updates as the ranking changes:

How to clone Trie

Clone via HTTPS

git clone https://github.com/umbertogriffo/Trie.git

Clone via SSH

[email protected]:umbertogriffo/Trie.git

Download ZIP

Download master.zip

Found an issue?

Report bugs or request features on the Trie issue tracker:

Open GitHub Issues