Efficiency, robustness and accuracy in picky chart parsing

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn 1992-June, Issue , 1992, Pages 40-47

  Magerman, David M ^a   Weir, Carl ^b  

^a STANFORD UNIVERSITY   (United States)

^b Paramax Systems ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORMAL LANGUAGES;

BOTTOM UP; GRAMMAR RULES; PARSING ALGORITHM; PROBABILISTIC MODELS; PROBABILISTIC PREDICTION; PROBABILISTICS; SUB-OPTIMAL SEARCH METHODS;

EFFICIENCY;

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

References (17)

1. Black, E., Jelinek, F., Lafferty, J., Magerman, D. M., Mercer, R. and Roukos, S. 1992. Towards History-based Grammars: Using Richer Models of Context in Probabilistic Parsing. In Proceedings of the February 1992 DARPA Speech and Natural Language Workshop. Arden House, NY.
2. Brown, P., Jelinek, F., and Mercer, R. 1991. Basic Method of Probabilistic Context-free Grammars. IBM Internal Report. Yorktown Heights, NY.
3. Bobrow, R. J. 1991. Statistical Agenda Parsing. In Proceedings of the February 1991 DARPA Speech and Natural Language Workshop. Asilomar, California.
4. Chitrao, M. and Grishman, R. 1990. Statistical Parsing of Messages. In Proceedings of the June 1990 DARPA Speech and Natural Language Workshop. Hidden Valley, Pennsylvania.
5. Church, K. 1988. A Stochastic Parts Program and Noun Phrase Parser for Unrestricted Text. In Proceedings of the Second Conference on Applied Natural Language Processing. Austin, Texas.
6. Earley, J. 1970. An Efficient Context-Free Parsing Algorithm. Communications of the A CM Vol. 13, No. 2, pp. 94-102.
7. Gale, W. A. and Church, K. 1990. Poor Estimates of Context are Worse than None. In Proceedings of the June 1990 DARPA Speech and Natural Language Workshop. Hidden Valley, Pennsylvania.
8. Jelinek, F. 1985. Self-orgmlizingLanguage Modeling for Speech Recognition. IBM Report.
9. Kasami, T. 1965. An Efficient Recognition and Syntax Algorithm for Context-Free Languages. Scientific Report AFCRL-65-758, Air Force Cambridge Research Laboratory. Bedford, Massachusetts.
10. Kay, M. 1980. Algorithm Schemata and Data Structures in Syntactic Processing. CSL-80-1, October 1980.
11. Kimball, J. 1973. Principles of Surface Structure Parsing in Natural Language. Cognition, 2.15-47.
12. Magerman, D. M. and Marcus, M. P. 1991. Pearl: A Probabilistic Chart Parser. In Proceedings of the European ACL Conference, Mavcli 1991. Berlin, Germany.
13. Magerman, D. M. and Weir, C. 1992. Probabilisti¢: Prediction and Picky Chart Parsing. In Proceedings of the February 1992 DARPA Speech and Natural Language Workshop. Arden House, NY.
14. Moore, R. and Dowding, J. 1991. Efficient Bottom-Up Parsing. In Proceedings of the February 1991 DARPA Speech and Natural Language Workshop. Asilomar, California.
15. Sharman, R. A., Jelinek, F., and Mercer, R. 1990. Generating a Grammar for Statistical Training. In Proceedings of the June 1990 DARPA Speech and Natural Language Workshop. Hidden Valley, Pennsylvania.
16. Seneff, Stephanie 1989. TINA. In Proceedings of the August 1989 International Workshop in Parsing Technologies. Pittsburgh, Pennsylvania.
17. Younger, D. H. 1967. Recognition and Parsing of Context-Free Languages in Time n3. Information and ControlVol. 10, No. 2, pp. 189-208.