In the following tests, the memory usage was measured for 3 million unique Unicode Russian words; "simple lookup time " was measured on a lookup for a specific one word.
|Description||memory usage (MegaBytes)||Unicode||Lookup time (nanosecond)||Reverse-lookup|
|PAT-Trie||a pointer-based implementation of PAT-trie (aka Patricia-Trie and Radix-Trie) and may use a lot of memory because of that.||242||No||333||No|
|HAT-Trie||Trie-HashMap hybrid. It is claimed to be the state-of-art Trie-like structure with the fastest lookups.||125||Yes||195||No|
|DA-Trie||Double-Array Trie C implementation||101||Yes||281||No|
|Marisa-Trie||memory-efficient recursive LOUDS-trie-based data structure implemented as C++ library||11||Yes||2010||Yes|
|DAWG||Directed Acyclic Word Graphs||2.8||Yes||249||No|