A new one pass algorithm for estimating stochastic context-free grammars

Information Processing Letters

Volumn 72, Issue 1-2, 1999, Pages 37-45

  Ra, Dong Yul ^a   Stockman, George C ^b  

^a Yonsei University Wonju   (South Korea)

^b Michigan State University   (United States)

Author keywords

Algorithm; Estimation; Parsing; Rule probability; Stochastic context free grammars

Indexed keywords

EID: 0347660816     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(99)00119-2     Document Type: Article

References (9)

1. A. V. Aho, J.D. Ullman, The Theory of Parsing, Translation, and Compiling, Vol. 1. Parsing, Prentice-Hall, Englood Cliffs, NJ, 1972.
2. J.K. Baker, Trainable grammars for speech recognition, in: J.J. Wolf, D.H. Klatt (Eds.), Speech Communication Papers for the 97th meeting of the Acoustical Society of America, 1979, pp. 547-550.
3. T.L. Booth, R.A. Thompson, Applying probability measures to abstract languages, IEEE Trans. Comput. C-22 (5) (1973) 442-450.
4. J. Earley, An efficient context-free parsing algorithm, Comm. ACM 6 (8) (1970) 94-102.
5. T. Fusisaki, F. Jelinek, J. Cocke, E. Black, T. Nishino, A probabilistic parsing method for sentence disambiguation, in: M. Tomita (Ed.), Current Issues in Parsing Technology, Kluwer Academic Publishers, 1991, pp. 139-152.
6. F. Jelinek, J.D. Lafferty, R.L. Mercer, Basic methods of probabilistic context-free grammars, in: P. Laface, R. De Mori (Eds.), Speech Recognition and Understanding: Recent Advances, Trends and Applications, NATO ASI Series F, Vol. 75, Springer, Berlin, 1992, pp. 345-360.
7. K. Lari, S.J. Young, The estimation of stochastic context-free grammars using inside-outside algorithm, Comput. Speech Language 5 (1990) 35-56.
8. A. Stolcke, An efficient probabilistic context-free parsing algorithm that computes prefix probabilities, Comput. Linguistics 21 (2) (1995) 165-202.
9. M. Tomita, Efficient Parsing for Natural Language, Kluwer Academic Publishers, Dordrecht, 1986.