Name
Abstract | ||
|---|---|---|
We present a novel family of language model (LM) estimation techniques named Sparse Non-negative Matrix (SNM) estimation. A first set of experiments empirically evaluating it on the One Billion Word Benchmark shows that SNM $n$-gram LMs perform almost as well as the well-established Kneser-Ney (KN) models. When using skip-gram features the models are able to match the state-of-the-art recurrent neural network (RNN) LMs; combining the two modeling techniques yields the best known result on the benchmark. The computational advantages of SNM over both maximum entropy and RNN LM estimation are probably its main strength, promising an approach that has the same flexibility in combining arbitrary features effectively and yet should scale to very large amounts of data as gracefully as $n$-gram LMs do. |
Year | Venue | Field |
|---|---|---|
2014 | CoRR | Pattern recognition,Matrix (mathematics),Computer science,Probability estimation,Recurrent neural network,Artificial intelligence,Gram,Principle of maximum entropy,Machine learning,Language model |
DocType | Volume | Citations |
Journal | abs/1412.1454 | 4 |
PageRank | References | Authors |
0.47 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Noam Shazeer | 1 | 1089 | 43.70 |
| Joris Pelemans | 2 | 4 | 0.81 |
| Ciprian Chelba | 3 | 4 | 0.47 |