Dynamic programming for parsing and estimation of stochastic unification-based grammars

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn 2002-July, Issue , 2002, Pages 279-286

  Geman, Stuart ^a   Johnson, Mark ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORMAL LANGUAGES; GRAPHIC METHODS; STOCHASTIC SYSTEMS;

ALGORITHMS COMPLEXITY; DYNAMIC PROGRAMMING ALGORITHM; EXPONENTIAL DISTRIBUTIONS; EXPONENTIALS; GRAPH-BASED; GRAPHICAL MODEL; MOST LIKELY; STOCHASTICS; TRAINING CORPUS; UNIFICATION-BASED GRAMMARS;

DYNAMIC PROGRAMMING;

EID: 9444286729     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. Steven Abney. 1997. Stochastic Attribute-Value Grammars. Computational Linguistics, 23(4):597-617.
2. Robert Cowell. 1999. Introduction to inference for Bayesian networks. In Michael Jordan, editor, Learning in Graphical Models, pages 9-26. The MIT Press, Cambridge, Massachusetts.
3. Kenneth D. Forbus and Johan de Kleer. 1993. Building problem solvers. The MIT Press, Cambridge, Massachusetts. Stuart Geman and Kevin Kochanek. 2000. Dynamic programming and the representation of soft-decodable codes. Technical report, Division of Applied Mathematics, Brown University.
4. Mark Johnson, Stuart Geman, Stephen Canon, Zhiyi Chi, and Stefan Riezler. 1999. Estimators for stochastic "unificationbased" grammars. In The Proceedings of the 37th Annual Conference of the Association for Computational Linguistics, pages 535-541, San Francisco.
5. Morgan Kaufmann. John Lafferty, Andrew McCallum, and Fernando Pereira. 2001. Conditional Random Fields: Probabilistic models for segmenting and labeling sequence data. In Machine Learning: Proceedings of the Eighteenth International Conference (ICML 2001), Stanford, California.
6. John T. Maxwell III and Ronald M. Kaplan. 1995. A method for disjunctive constraint satisfaction. In Mary Dalrymple, Ronald M. Kaplan, John T. Maxwell III, and Annie Zaenen, editors, Formal Issues in Lexical-Functional Grammar, number 47 in CSLI Lecture Notes Series, chapter 14, pages 381-481. CSLI Publications.
7. Yusuke Miyao and Jun'ichi Tsujii. 2002. Maximum entropy estimation for feature forests. In Proceedings of Human Language Technology Conference 2002, March.
8. Judea Pearl. 1988. Probabalistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo, California.
9. Padhraic Smyth, David Heckerman, and Michael Jordan. 1997. Probabilistic Independence Networks for Hidden Markov Models. Neural Computation, 9(2):227-269.