Random forests and the data sparseness problem in language modeling
Authors:
- 20 February 2006
- journal article
- Published by Elsevier in Computer Speech & Language
- Vol. 21 (1) , 105-152
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Using the Web to Obtain Frequencies for Unseen BigramsComputational Linguistics, 2003
- Structured language modelingComputer Speech & Language, 2000
- A survey of smoothing techniques for ME modelsIEEE Transactions on Speech and Audio Processing, 2000
- The random subspace method for constructing decision forestsIEEE Transactions on Pattern Analysis and Machine Intelligence, 1998
- Shape Quantization and Recognition with Randomized TreesNeural Computation, 1997
- On structuring probabilistic dependences in stochastic language modellingComputer Speech & Language, 1994
- Optimal partitioning for classification and regression treesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1991
- A tree-based statistical language model for natural language speech recognitionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- Inferring decision trees using the minimum description lenght principleInformation and Computation, 1989
- Stochastic Complexity and ModelingThe Annals of Statistics, 1986