Click here to Skip to main content Click here to Skip to main
content  Implementing a memory efficient search tree for a
wordlist  , 19 Aug 2005 Rate this: Please Sign up or sign in to
vote. This article describes a method of storing a wordlist into
a compressed form while providing a relatively quick word lookup
functionality.   This article describes a method of storing a
wordlist (all the words listed in a dictionary, but without
their definitions) into a compressed form while providing a
relatively quick word lookup functionality.  Motivation and
background  At some point in time, I was implementing a word
game on an embedded platform that required players to create
valid words out of letters for whom they would get points. The
way the game was going required couple of word lookups every
second. It was necessary to have some kind of dictionary for
validating the words, and we had both size and speed
limitations.  The wordlist we started with (and we changed a
little later) was about 1 MB in size. While on