Implementation of Succinct Trie [1] 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.
- Basic example: basic usage
- Advanced example: pali dir
Released in public domain. See UNLICENSE.
| [1] | Succinct Data Structures: Cramming 80,000 words into a Javascript file. (source code) |
| [2] | Google Search succinct data structure |
| [3] | Google Search succinct trie |
| [4] | Google Search golang const array |
| [5] | Google Search golang function as argument |
| [6] | Google Search golang charcodeat string - Go lang's equivalent of charCode() method of JavaScript - Stack Overflow |
| [7] | [Golang] Succinct Trie Implementation |
| [8] | [JavaScript] Bug in Succinct Trie Implementation of Bits.js |