Finally, we store trie-node children as sorted vectors instead of hash maps to reduce memory footprint.
we are able to load a trie encoding 400M input dependency parses, 170M distinct nodes and 48M distinct sentence structures in under 10GB of RAM.