Stochastic Context-Free Grammars, properties of stochastic languages

[Baker, 1979]

J.K. Baker. Trainable grammars for speech recognition. In D. Klatt and J. Wolf, editors, Speech Communication Papers for the 97th Meeting of the Acoustical Society of America, pages 547-550, 1979.

[Banerjee and Rosenfeld, 1992]

S. Banerjee and A. Rosenfeld. MAP estimation of context-free grammars. Pattern Recognition Letters, 13:95-101, 1992.

[Black et al., 1993]

E. Black, F. Jelinek, J. Lafferty, D.M. Magreman, R. Mercer, and S. Roukos. Towards history-based grammars: Using richer models for probabilistic parsing. In 31st Annual Meeting of the Association for Computational Linguistics, pages 31-37, Columbus, 1993.

[Booth and Thompson, 1973]

T.L. Booth and R.A. Thompson. Applying probabilistic measures to abstract languages. IEEE Transactions on Computers, 22(5):442-450, 1973.

[Brown et al., 1992]

P. Brown, S. Della Pietra, V. Della Pietra, J. Lai, and R. Mercer. An estimate of an upper bound for the entropy of english. Computational Linguistics, 18:31-40, 1992.

[Casacuberta, 1990]

F. Casacuberta. Some relations among stochastic finite state networks used in automatic speech recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 12(7):691-685, 1990.

[Chaudhuri and Rao, 1986]

R. Chaudhuri and A.N.V. Rao. Approximating grammar probabilities: Solution of a conjecture. Journal of the Association for Computing Machinery, 33(4):702-705, 1986.

[Chaudhuri et al., 1983]

R. Chaudhuri, S. Pham, and O.N. Garcia. Solution of an open problem on probabilistic grammars. IEEE Transactions on Computers, 32(8):758-750, 1983.

[Corazza et al., 1991]

A. Corazza, R. DeMori, R. Gretter, and G. Satta. Computation of probabilities for an island-driven parser. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(9):936-950, 1991.

[Fu, 1974]

K.S. Fu. Syntactic Methods in Pattern Recognition, volume 112 of Mathematics in Science and Engineering. Academic Press, New-York, 1974.

[Gonzalez and Thomason, 1978]

R.C. Gonzalez and M. G. Thomason. Syntacic Pattern Recognition, An Introduction. Addition-Wesley, Reading, Massachusetts, 1978.

[Huang and Fu, 1971]

H. Huang and K.S. Fu. On stochastic context-free languages. Information Sciences, 3:201-224, 1971.

[Hutchins, 1972]

S.E. Hutchins. Moments of strings and derivation lengths of stochastic context-free grammars. Information Sciences, 4:179-191, 1972.

[Jelinek et al., 1992]

F. Jelinek, J.D. Lafferty, and R.L. Mercer. Basic methods of probabilistic context free grammars. In P. Laface and R. De Mori, editors, Speech Recognition and Understanding. Recent Advances, Trends and Applications, pages 345-360. NATO ASI, Springer Verlag, 1992.

[Kochman and Kupin, 1992]

F. Kochman and J.J. Kupin. Removing left recursion in stochastic grammars. Working Paper 1103, IDA-Center for Communications Research, December 1992.

[Kupiec, 1991]

J. Kupiec. A trellis-based algorithm for estimating the parameters of a hidden stochastic context-free grammar. In DARPA workshop on Speech and Natural Language, pages 241-246, 1991.

[Kupiec, 1992]

J. Kupiec. Hidden Markov estimation for unrestricted stochastic context-free grammars. In International Conference on Acoustic, Speech and Signal Processing, pages 177-180, 1992.

[Lari and Young, 1990]

K. Lari and S.J. Young. The estimation of stochastic context-free grammars using the Inside-Outside algorithm. Computer Speech and Language, 4:35-56, 1990.

[Mark et al., 1992]

K. Mark, M. Miller, U. Grenander, and S. Abney. Parameter estimation for constrained context-free language models. In DARPA workshop on Speech and Natural Language, pages 146-149, 1992.

[Merialdo, 1995]

B. Merialdo. Algorithmes pour grammaires probabilistes. In Traitement Automatique de la Langue Naturelle, pages 124-133, Marseille, 1995.

[Pereira and Schabes, 1992]

F. Pereira and Y. Schabes. Inside-outside reestimation from partially bracketed corpora. In 30th Annual Meeting of the ACL, pages 128-135, 1992.

[Stolcke and Segal, 1994]

A. Stolcke and J. Segal. Precise N-gram probabilities from stochastic context-free grammars. Technical Report TR-94-007, ICSI, January 1994.

[Thomason, 1990]

M.G. Thomason. Generating functions for stochastic context-free grammars. International Journal of Pattern Recognition and Artificial Intelligence, 4(4):553-572, 1990.

[Wetherell, 1980]

C. Wetherell. Probabilistic languages: A review and some open questions. Computing Surveys, 12(4):361-379, 1980.

[Young and Shih, 1994]

S.J. Young and H.-H. Shih. Computer assisted grammar construction. In Grammatical Inference and Applications, ICGI'94, number 862 in Lecture Notes in Artificial Intelligence, pages 282-290. Springer Verlag, 1994.