siongui / go-succinct-data-structure-trie

Succinct Data Structure of Trie, written in Go

Succinct Data Structure Trie

Implementation of Succinct Trie¹ in Go.

The trie structure is great for fast lookup of dictionary words, but if the vocabulary of the dictionary is big, it may takes a lot of space to store the constructed trie. For this reason, succinct data structure is applied to the trie strcuture and we can both have fast lookup and small space requirement.

Usage

• Basic example: basic usage
• Advanced example: pali dir

UNLICENSE

Released in public domain. See UNLICENSE.

References

---

1. Succinct Data Structures: Cramming 80,000 words into a Javascript file. (source code)↩