References

ACL1992

1992. Proceedings of the 30th Annual Meeting of the Association for Computational Linguistics, University of Delaware, Newark, Delaware.

Aho and Ullman1972

Alfred V. Aho and Jeffrey D. Ullman. 1972. The Theory of Parsing, Translation, and Compiling. Volume1: Parsing. Prentice-Hall, Englewood Cliffs, N.J.

Bahl et al.1983

Lalit R. Bahl, Frederick Jelinek, and Robert L. Mercer. 1983. A maximum likelihood approach to continuous speech recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 5(2):179-190.

Baker1979

James K. Baker. 1979. Trainable grammars for speech recognition. In Jared J. Wolf and Dennis H. Klatt, editors, Speech Communication Papers for the 97th Meeting of the Acoustical Society of America, pages 547-550, MIT, Cambridge, Mass.

Baum et al.1970

Leonard E. Baum, Ted Petrie, George Soules, and Norman Weiss. 1970. A maximization technique occuring in the statistical analysis of probabilistic functions in Markov chains. The Annals of Mathematical Statistics, 41(1):164-171.

Booth and Thompson1973

Taylor L. Booth and Richard A. Thompson. 1973. Applying probability measures to abstract languages. IEEE Transactions on Computers, C-22(5):442-450.

Briscoe and Carroll1993

Ted Briscoe and John Carroll. 1993. Generalized probabilistic LR parsing of natural language (corpora) with unification-based grammars. Computational Linguistics, 19(1):25-59.

Casacuberta and Vidal1988

F. Casacuberta and E. Vidal. 1988. A parsing algorithm for weighted grammars and substring recognition. In Gabriel Ferraté, Theo Pavlidis, Alberto Sanfeliu, and Horst Bunke, editors, Syntactic and Structural Pattern Recognition, volume F45 of NATO ASI Series, pages 51-67. Springer Verlag, Berlin.

Corazza et al.1991

Anna Corazza, Renato De Mori, Roberto Gretter, and Giorgio Satta. 1991. Computation of probabilities for an island-driven parser. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(9):936-950.

Dempster et al.1977

A. P. Dempster, N. M. Laird, and D. B. Rubin. 1977. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, Series B, 34:1-38.

Earley1970

Jay Earley. 1970. An efficient context-free parsing algorithm. Communications of the ACM, 6(8):451-455.

Fujisaki et al.1991

T. Fujisaki, F. Jelinek, J. Cocke, E. Black, and T. Nishino. 1991. A probabilistic parsing method for sentence disambiguation. In Masaru Tomita, editor, Current Issues in Parsing Technology, chapter 10, pages 139-152. Kluwer Academic Publishers, Boston.

Graham et al.1980

Susan L. Graham, Michael A. Harrison, and Walter L. Ruzzo. 1980. An improved context-free recognizer. ACM Transactions on Programming Languages and Systems, 2(3):415-462.

Jelinek and Lafferty1991

Frederick Jelinek and John D. Lafferty. 1991. Computation of the probability of initial substring generation by stochastic context-free grammars. Computational Linguistics, 17(3):315-323.

Jelinek et al.1992

Frederick Jelinek, John D. Lafferty, and Robert L. Mercer. 1992. Basic methods of probabilistic context free grammars. In Laface and De Mori [Laface and De Mori1992], pages 345-360. Proceedings of the NATO Advanced Study Institute, Cetraro, Italy, July 1990.

Jelinek1985

Frederick Jelinek. 1985. Markov source modeling of text generation. In J. K. Skwirzynski, editor, The Impact of Processing Techniques on Communications, volume E91 of NATO ASI Series, pages 569-598. Nijhoff, Dordrecht. Proceedings of the NATO Advanced Study Institute, Bonas, France, July 1983.

Jones and Eisner1992

Mark A. Jones and Jason M. Eisner. 1992. A probabilistic parser and its applications. In AAAI Workshop on Statistically-Based NLP Techniques, pages 20-27, San Jose, CA.

Jurafsky et al. 1994

Daniel Jurafsky, Chuck Wooters, Gary Tajchman, Jonathan Segal, Andreas Stolcke, Eric Fosler, and Nelson Morgan. 1994. The Berkeley Restaurant Project. In Proceedings International Conference on Spoken Language Processing, volume 4, pages 2139-2142, Yokohama.

Jurafsky et al. 1995

Daniel Jurafsky, Chuck Wooters, Jonathan Segal, Andreas Stolcke, Eric Fosler, Gary Tajchman, and Nelson Morgan. 1995. Using a stochastic context-free grammar as a language model for speech recognition. In Proceedings IEEE Conference on Acoustics, Speech and Signal Processing, volume 1, pages 189-192, Detroit.

Kupiec1992

Julian Kupiec. 1992. Hidden Markov estimation for unrestricted stochastic context-free grammars. In Proceedings IEEE Conference on Acoustics, Speech and Signal Processing, volume 1, pages 177-180, San Francisco.

Laface and De Mori1992

Pietro Laface and Renato De Mori, editors. 1992. Speech Recognition and Understanding. Recent Advances, Trends, and Applications, volume F75 of NATO ASI Series. Springer Verlag, Berlin. Proceedings of the NATO Advanced Study Institute, Cetraro, Italy, July 1990.

Lari and Young1990

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

Lari and Young1991

K. Lari and S. J. Young. 1991. Applications of stochastic context-free grammars using the Inside-Outside algorithm. Computer Speech and Language, 5:237-257.

Magerman and Marcus1991

David M. Magerman and Mitchell P. Marcus. 1991. Pearl: A probabilistic chart parser. In Proceedings of the 2nd International Workshop on Parsing Technologies, pages 193-199, Cancun, Mexico.

Magerman and Weir1992

David M. Magerman and Carl Weir. 1992. Efficiency, robustness and accuracy in Picky chart parsing. In ACL [ACL1992], pages 40-47.

Nakagawa1987

Sei-ichi Nakagawa. 1987. Spoken sentence recognition by time-synchronous parsing algorithm of context-free grammar. In Proceedings IEEE Conference on Acoustics, Speech and Signal Processing, volume 2, pages 829-832, Dallas, Texas.

Ney1992

Hermann Ney. 1992. Stochastic grammars and pattern recognition. In Laface and De Mori [Laface and De Mori1992], pages 319-344. Proceedings of the NATO Advanced Study Institute, Cetraro, Italy, July 1990.

Päseler1988

Annedore Päseler. 1988. Modification of Earley's algorithm for speech recognition. In H. Niemann, M. Lang, and G. Sagerer, editors, Recent Advances in Speech Understanding and Dialog Systems, volume F46 of NATO ASI Series, pages 466-472. Springer Verlag, Berlin. Proceedings of the NATO Advanced Study Institute, Bad Windsheim, Germany, July 1987.

Pereira and Schabes1992

Fernando Pereira and Yves Schabes. 1992. Inside-outside reestimation from partially bracketed corpora. In ACL [ACL1992], pages 128-135.

Pereira and Shieber1987

Fernando C. N. Pereira and Stuart M. Shieber. 1987. Prolog and Natural-Language Analysis. Number 10 in CSLI Lecture Notes Series. Center for the Study of Language and Information, Stanford, CA.

Rabiner and Juang1986

L. R. Rabiner and B. H. Juang. 1986. An introduction to hidden Markov models. IEEE ASSP Magazine, 3(1):4-16.

Schabes1991

Yves Schabes. 1991. An inside-outside algorithm for estimating the parameters of a hidden stochastic context-free grammar based on Earley's algorithm. Unpublished mss. Presented at the Second Workshop on Mathematics of Language, Tarritown, N.Y., May 1991.

Stolcke and Segal1994

Andreas Stolcke and Jonathan Segal. 1994. Precise n-gram probabilities from stochastic context-free grammars. In Proceedings of the 32th Annual Meeting of the Association for Computational Linguistics, pages 74-79, New Mexico State University, Las Cruces, NM.

Stolcke1993

Andreas Stolcke. 1993. An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Technical Report TR-93-065, International Computer Science Institute, Berkeley, CA. Revised November 1994. To appear in Computational Linguistics.

Tomita1986

Masaru Tomita. 1986. Efficient Parsing for Natural Language. Kluwer Academic Publishers, Boston.

Wright1990

J. H. Wright. 1990. LR parsing of probabilistic grammars with input uncertainty for speech recognition. Computer Speech and Language, 4:297-323.