Grammatical Trigrams: A Probabilistic Model of Link Grammar

AAAI Fall Symposium - Technical Report

Volumn FS-92-04, Issue , 1992, Pages 89-97

  Laffertyt, John ^a   Sleator, Daniel ^b   Temperley, Davy ^c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; CONTEXT FREE LANGUAGES; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

CONTEXT-FREE; LANGUAGE MODEL; LINK GRAMMAR; MAXIMUM-LIKELIHOOD ESTIMATE; MODEL-BASED OPC; NATURAL LANGUAGES; PROBABILISTIC MODELS; RELATIVE ENTROPY; STOCHASTICS; TRI GRAMS;

MAXIMUM LIKELIHOOD ESTIMATION;

EID: 84904340852     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. L. K. Bahl, F. Jehnek, and It. L. Mercer. A Maximumlikehhood approach to continuous speech recognition. IEEE Trans. on Pattern Analysis and Machine Intelligence, Vol. PAMI-5, No. 2, pp. 179-190, 1983.
2. L. E. Baum.An inequality and associated maximization technique in statistical estimation of probabilistic functions of a Markovprocess. Inequalities, 627(3):1-8, 1972.
3. E. Black, J. Lafferty, and S. Itoukos. Development, evaluation, and results for a broad-coverage probabihstic grammarof Enghsh-language computer manuals. To appear in Proceedings of the ACL, 1992.
4. E. Black, F. Jelinek, J. Lafferty, D. Magerman,It. Mercer, and S. Itoukos. Towardshistory-based grammars: Using richer models for probabihstic parsing. In Proceedings of the DARPASpeech and Natural Language Workshop, Arden House, February 1992.
5. E. Black, F. Jelinek, J. Lafferty, It. Mercer, and S. Itoukos. Decision tree models applied to the labelling of text with parts-of-speech. In Proceedings of the DARPASpeech and Natural Language Workshop, Arden House, February 1992.
6. P. Brown,S. Della Pietra, V. Della Pietra, J. Lai, and It. Mercer. Anestimate of an upper boundfor the entropy of English. ComputationalLinguistics, 18(2):31-40, 1992.
7. H. Gaifman. Dependency systems and phrase-structure systems. Information and Control 8, 1965, Pages 304-337.
8. F. Jelinek, J. D. Lafferty, and It. L. Mercer. Basic methodsof probabilistic context-free grammars.In Speech Recognition and Understanding: Recent Advances, Trends, and Applications, P. Laface and It. De Mori, editors. Springer Verlag, Series F: Computerand Systems Sciences, vol. 75, 1992.
9. F. Jelinek and J. D. Lafferty. Computationof the probabihty of initial substring generation by stochastic context-free grammars. Computational Linguistics, 17(3):315-323, 1991.
10. I. A. Mel~uk. Dependency Syntax: Theory and Practice, State University of New York Press 1988.
11. It. T. Oehrle, E. Bach, and D. Wheeler, Editors. Categorial Grammars and Natural Language Structures. D. Iteidel Publishing Company,1988.
12. Y. Schabes. Stochastic lexicalized tree-adjoining grammars. In Proceedings of COLING-92, Nantes, France, July 1992.
13. D. Sleator and D. Temperley. Parsing English with a Link Grammar.Technical report CMU-CS-91-196, Department of ComputerScience, Carnegie Mellon University, 1991.
14. C. E. Shannon. Prediction and entropy of printed Enghsh. Bell Syst. Tech. J., Vol. 30, pp. 50-64, 1951.