News for hackers. Stuff that matters.
Re:The Trie: A Neglected Data Structure by fogleman on Friday September 13, 2013 @10:39AM (#6380754)
Should mention that tries can be heavily compressed into DAWGs (Directed Acyclic Word Graphs) by eliminating common subtrees. I've used this in word games on iOS where I want a small memory footprint.

P.S. I love tries!

Re:The Trie: A Neglected Data Structure by nathell on Friday September 13, 2013 @11:23AM (#6381057)
"How to Squeeze a Lexicon" by Ciura and Deorowicz [1] is a good and practical introduction to DAWGs.

[1]: http://sun.aei.polsl.pl/~mciura/publikacje/lexicon.pdf