Bayesian Grammar Induction for Language Modeling
| dc.creator | Chen, Stanley F. | |
| dc.date | 1995-05-01 | |
| dc.date.accessioned | 2026-07-07T09:09:47Z | |
| dc.date.available | 2026-07-07T09:09:47Z | |
| dc.description | We describe a corpus-based induction algorithm for probabilistic context-free grammars. The algorithm employs a greedy heuristic search within a Bayesian framework, and a post-pass using the Inside-Outside algorithm. We compare the performance of our algorithm to n-gram models and the Inside-Outside algorithm in three language modeling tasks. In two of the tasks, the training data is generated by a probabilistic context-free grammar and in both tasks our algorithm outperforms the other techniques. The third task involves naturally-occurring data, and in this task our algorithm does not perform as well as n-gram models but vastly outperforms the Inside-Outside algorithm. | |
| dc.description | 8 pages, LaTeX, uses aclap.sty | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9504034 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9504034 | |
| dc.identifier | Proc. 33rd Annual Meeting of the ACL, p. 228-235, Cambridge, MA 1995 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151161 | |
| dc.subject | Computation and Language | |
| dc.title | Bayesian Grammar Induction for Language Modeling | |
| dc.type | text |