University of Cambridge > Talks.cam > Natural Language Processing Reading Group > Randomized Language Models via Perfect Hash Functions

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Randomized Language Models via Perfect Hash Functions

Download to your calendar using vCal

If you have a question about this talk, please contact Diarmuid Ó Séaghdha .

At this session of the NLIP Reading Group we’ll be discussing the following paper:

David Talbot and Thorsten Brants. 2008. Randomized Language Models via Perfect Hash Functions. In Proceedings of ACL -08.

Abstract: 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.

This talk is part of the Natural Language Processing Reading Group series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Espresso Library, 210 East Road, Cambridge CB1 1BG Lecture Room 4, Baker Building, Department of Engineering Trumpington Street Cambridge, United Kingdom Mobile Robots Seminar

Other talks

Title to be confirmed Polar Oceans Seminar Talk Afternoon Break Spectral rigidity of random covers of compact hyperbolic surfaces Afternoon Break Caribbean Trip and Cacti
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity