Sciweavers

Share
ACL
2008

Randomized Language Models via Perfect Hash Functions

10 years 4 months ago
Randomized Language Models via Perfect Hash Functions
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 other parameters. The scheme can represent any standard n-gram model and is easily combined with existing model reduction techniques such as entropy-pruning. We demonstrate the space-savings of the scheme via machine translation experiments within a distributed language modeling framework.
David Talbot, Thorsten Brants
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2008
Where ACL
Authors David Talbot, Thorsten Brants
Comments (0)
books