Trie

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

java-8

View on GitHub

47 Stars

12 Forks

3 Watchers

Java Language

95.5 SrcLog Score

Cost to Build

$2.99M

Market Value

$3.96M

How is this calculated?

Growth over time

11 data points · 2021-08-01 → 2026-09-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.

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

Similar to Trie

java8-tutorial java-bible apollo atomix java8-the-missing-tutorial AwesomeJavaFX gnirehtet WebIDE Equivalent-Exchange-3 copycat spring-react-example jasypt-spring-boot tikione-steam-cleaner derive4j nakadi QuickTheories cdap mockneat docker-alpine-java Algorithms-and-Data-Structures-in-Java StorageSystem sAINT visualee web-bee clojure.java-time usl4j mybatis-dynamic-sql shop design-patterns GDX-RPG