52 search results - page 2 / 11 » Efficient Minimal Perfect Hash Language Models |
EMNLP
2010
13 years 3 months ago
2010
We present three novel methods of compactly storing very large n-gram language models. These methods use substantially less space than all known approaches and allow n-gram probab...
ICGA
2008
13 years 5 months ago
2008
We present two new perfect hashing schemes that can be used for efficient bitboard move generation for sliding pieces in chess-like board games without the need to use rotated bit...
ACL
2008
13 years 6 months ago
2008
We propose a succinct randomized language model which employs a perfect hash function to encode fingerprints of n-grams and their associated probabilities, backoff weights, or oth...
EMNLP
2009
13 years 3 months ago
2009
Randomised techniques allow very big language models to be represented succinctly. However, being batch-based they are unsuitable for modelling an unbounded stream of language whi...
ANCS
2005
ACM
13 years 11 months ago
2005
ACM
Hash tables provide efficient table implementations, achieving O(1), query, insert and delete operations at low loads. However, at moderate or high loads collisions are quite freq...