Randomized Language Models via Perfect Hash Functions

By David Talbot, Thorsten Brants. 2008

57 citations recorded by the source corpus.

Subfields: Large Language Models

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Large Language Models

1. Edouard Grave
2. Armand Joulin
3. Herv'e J'egou
4. David Chiang
5. Tomas Mikolov
6. Piotr Bojanowski
7. Li Deng
8. Phil Blunsom

Citations in the corpus

• FastText.zip: Compressing text classification models (2016, methodology): “Various strategies have been developed, for example using tree structures or hash functions, and are discussed in (Talbot & Brants, 2008).”
• Probabilistic Counting with Randomized Storage (2009, unknown): “, [Talbot and Osborne, 2007a; Talbot and Branst, 2008]).”
• Sketch Algorithms for Estimating Point Queries in NLP (2012, background): “language models (Talbot and Brants, 2008; Levenberg and Osborne, 2009), and distributional similarity (Ravichandran et al.”
• Learning to Translate with Source and Target Syntax (2010, methodology): “These were smoothed using modified Kneser-Ney (Chen and Goodman, 1998) and stored using randomized data structures similar to those of Talbot and Brants (2008).”