In-memory hash tables for accumulating text vocabularies

摘要

We have investigated candidate data structures for managing large lexicons of English words. In our experiments with BSTs, splay trees, a heuristic splay tree, and two variants of hashing, we have found that hashing using an efficient bit-wise has scheme is three to four times faster than other schemes.