DMCA
Hash Table Sizes for Storing N-Grams for Text Processing
| Citations: | 3 - 0 self |
BibTeX
@MISC{Gu_hashtable,
author = {Zhong Gu and Daniel Berleant},
title = {Hash Table Sizes for Storing N-Grams for Text Processing},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
N-grams have been widely investigated for a number of text processing tasks. However n-gram based systems often labor under the large memory requirements of nave storage of the large vectors that describe the many n-grams that could potentially appear in documents. This problem becomes more severe as the number of documents (and hence the number of vectors to store and process) rises. A natural approach to reducing vector size is to hash the large number of possible n-grams into a smaller vector. We address this problem by identifying good and bad hash table sizes over a wide range of sizes. We show that English, French, and German n-grams behave similarly when hashed, and that this is unlike the behavior of randomly generated n-grams. Therefore the difference in behavior is due to properties of the languages themselves. We then investigate different table sizes and identify which sizes are particularly good when hashing ngrams during processing of these languages.
