Grammatical bigrams

Advances in Neural Information Processing Systems

Volumn , Issue , 2002, Pages

  Paskin, Mark A ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING ALGORITHMS;

BIGRAMS; CONVENTIONAL MODELS; EM TRAINING; LARGE AMOUNTS; LARGE DATASETS; PROBABILISTIC MODELING; SYNTACTIC STRUCTURE;

SYNTACTICS;

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

References (13)

1. 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.
2. John Lafferty, Daniel Sleator, and Davy Temperley. Grammatical trigrams: A probabilistic model of link grammar. In Proceedings of the AAAI Conference on Probabilistic Approaches to Natural Language, October 1992.
3. Yves Schabes. Stochastic lexicalized tree-adjoining grammars. In Proceedings of the Fourteenth International Conference on Computational Linguistics, pages 426-432, Nantes, Prance, 1992.
4. Mark A. Paskin. Cubic-time parsing and learning algorithms for grammatical bigram models. Technical Report CSD-01-1148, University of California, Berkeley, 2001.
5. Jason Eisner. Bilexical grammars and their cubic-time parsing algorithms. In Harry Bunt and Anton Nijholt, editors, Advances in Probabilistic and Other Parsing Technologies, chapter 1. Kluwer Academic Publishers, October 2000.
6. Michael Collins. Head-driven Statistical Models for Natural Language Parsing. PhD thesis, University of Pennsylvania, Philadelphia, Pennsylvania, 1999.
7. Richard A. Hudson. English Word Grammar. B. Blackwell, Oxford, UK, 1990.
8. Jason M. Eisner. An empirical comparison of probability models for dependency grammars. Technical Report ICRS-96-11, CIS Department, University of Pennsylvania, 220 S. 33rd St. Philadelphia, PA 19104-6389, 1996.
9. Deniz Yuret. Discovery of Linguistic Relations Using Lexical Attraction. PhD thesis, Massachusetts Institute of Technology, May 1998.
10. M. Marcus, B. Santorini, and M. Marcinkiewicz. Building a large annotated corpus of english: The penn treebank. Computational Linguistics, 19:313-330, 1993.
11. Jeffrey C. Reynar and Adwait Ratnaparkhi. A maximum entropy approach to identifying sentence boundaries. In Proceedings of the Fifth Conference on Applied Natural Language Processing, Washington, D.C., March 31 - April 3 1997.
12. S. Delia Pietra, V. Delia Pietra, J. Gillett, J. Lafferty, H. Printz, and L. Ures. Inference and estimation of a long-range trigram model. In Proceedings of the Second International Colloquium on Grammatical Inference and Applications, number 862 in Lecture Notes in Artificial Intelligence, pages 78-92. Springer-Verlag, 1994.
13. Ronald Rosenfeld. Adaptive Statistical Language Modeling: A Maximum Entropy Approach. PhD thesis, Carnegie Mellon University, 1994.