Keyword dictionary compression using efficient trie implementation

Summary form only given. The author proposes a method to construct a compact and efficient tree structure which can be applied to both large- and small- scale keyword dictionaries. He uses four types of tree node representations eclectically depending on the number of children of the node, to minimize unused spaces and to provide fast access: array representation, bitmap director representation, list representation, and string representation