Approximating grammar probabilities
- 10 August 1986
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 33 (4) , 702-705
- https://doi.org/10.1145/6490.214099
Abstract
It is proved that the production probabilities of a probabilistic context-free grammar may be obtained as the limit of the estimates inferred from an increasing sequence of randomly drawn samples from the language generated by the grammar.Keywords
This publication has 2 references indexed in Scilit:
- Solution of an Open Problem on Probabilistic GrammarsIEEE Transactions on Computers, 1983
- Probabilistic Languages: A Review and Some Open QuestionsACM Computing Surveys, 1980