Squibs and Discussions: Estimation of Probabilistic Context-Free Grammars

Computational Linguistics

Volumn 24, Issue 2, 1998, Pages 299-305

  Chi, Zhiyi ^a   Geman, Stuart ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; PROBABILITY DISTRIBUTIONS;

PARSE TREES; PROBABILISTIC CONTEXT FREE GRAMMARS;

CONTEXT FREE GRAMMARS;

EID: 0039623923     PISSN: 08912017     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (10)

1. Baker, J. K. 1979. Trainable grammars for speech recognition. In Speech Communications Papers of the 97th Meeting of the Acoustical Society of America, pages 547-550, Cambridge, MA.
2. Baum, L. E. 1972. An inequality and associated maximization techniques in statistical estimation of probabilistic functions of Markov processes. Inequalities, 3:1-8.
3. Booth, T. L. and R. A. Thompson. 1973. Applying probability measures to abstract languages. IEEE Trans. on Computers, C-22:442-450.
4. Dempster, A., N. Laird, and D. Rubin. 1977. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, Series B, 39:1-38.
5. Grenander, U. 1976. Lectures in Pattern Theory Volume 1, Pattern Synthesis. Springer-Verlag, New York.
6. Harris, T. E. 1963. The Theory of Branching Processes. Springer-Verlag, Berlin.
7. Hopcroft, J. E. and J. D. Ullman. 1979. Introduction to Automata Theory, Languages, and Computation. Addison Wesley.
8. Sánchez, J. A. and J. M. Benedí. 1997. Consistency of stochastic context-free grammars from probabilistic estimation based on growth transformations. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19:1052-1055.
9. Stolcke, A. 1995. An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Computational Linguistics, 21:165-201.
10. Wetherell, C. S. 1980. Probabilistic languages: A review and some open questions. Computing Surveys, 12:361-379.