about
Billion Word Benchmark for Statistical Language Modeling from Google (arxiv.org)
1 point by Reallynow on Mar 12, 2014 | hide | past | pdf | discuss on HN

In plain words: A public collection of nearly one billion words, with fixed training and test splits, lets language models be tested and compared. A neural network reading words in order did best, and combining techniques cut perplexity—next-word surprise—by 35% versus the usual five-word lookup model.

Abstract · One Billion Word Benchmark for Measuring Progress in Statistical Language Modeling

We propose a new benchmark corpus to be used for measuring progress in statistical language modeling. With almost one billion words of training data, we hope this benchmark will be useful to quickly evaluate novel language modeling techniques, and to compare their contribution when combined with other advanced techniques. We show performance of several well-known types of language models, with the best results achieved with a recurrent neural network based language model. The baseline unpruned Kneser-Ney 5-gram model achieves perplexity 67.6; a combination of techniques leads to 35% reduction in perplexity, or 10% reduction in cross-entropy (bits), over that baseline. The benchmark is available as a code.google.com project; besides the scripts needed to rebuild the training/held-out data, it also makes available log-probability values for each word in each of ten held-out data sets, for each of the baseline n-gram models.

Ciprian Chelba, Tomas Mikolov, Mike Schuster, Qi Ge, Thorsten Brants, Phillipp Koehn, Tony Robinson
arXiv:1312.3005 · cs.CL · submitted Dec 11, 2013 · updated Mar 4, 2014
abstract · pdf · html · Accompanied by a code.google.com project allowing anyone to generate the benchmark data, and use it to compare their language model against the ones described in the paper

add comment on HN