A lighting fast bitwise prefix tree implementation. You can find information about this kind of structures under names trie, DAWG or minimal acyclic deterministic finite automata.
This library can be usefull for
In compare to list based dictionaries the prefix tree structure is both faster and less memory consuming with the same funcionality.
Performance (tested on http://sjp.pl/slownik/growy/sjp-20111017.tar.gz):
You can download this library from http://sourceforge.net/projects/prefixtree/
If you have any problem with this software go on support page http://sourceforge.net/p/prefixtree/discussion
If these links don't work you should look at http://sites.google.com/site/thumren/home/prefixtree