Global thresholding and multiple-pass parsing

Proceedings of the 2nd Conference on Empirical Methods in Natural Language Processing, EMNLP 1997

Volumn , Issue , 1997, Pages 11-25

  Goodman, Joshua ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GLOBAL THRESHOLDING; MULTIPLE PASS; NOVEL TECHNIQUES; ORDERS OF MAGNITUDE; PERFORMANCE:LEVEL; SEARCH ALGORITHMS; THRESHOLDING TECHNIQUES;

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

References (13)

1. Carabailo, Sharon and Eugene Charniak. 1996. Figures of merit for best-first probabilistic chart parsing. In Proceedings of the Conference on Era-. pirical Methods in Natural Language Processing, pages 127-132, Philadelphia, May.
2. Caraballo, Sharon and Eugene Charniak. 1997. New figures of merit for best first probabilistic chart parsing. In submission. Available from http://www. cs. brown, edu/people/sc/ NewFiguresofMerit. ps. Z .
3. Charniak, Eugene. 1996. Tree-bank grammars. Technical Report CS-96-02, Department of Computer Science, Brown University. Available from ftp://ftp. cs. brown, edu/pub/t echreport s/ 96/cs96-O2.ps. Z .
4. Collins, Michael. 1996. A new statistical parser based on bigram lexical dependencies. In Proceedings of the 3~th Annual Meeting of the ACL, pages 184-191, Santa Cruz, CA, June.
5. Lafferty, John, Daniel Sleator, and Davy Temperley. 1992. Grammatical trigrams: A probabilistic model of link grammar. In Proceedings of the 1992 AAAI Fall Symposium on Probabilistic Approaches to Natural Language, October.
6. Rayner, Manny and David Carter. 1996. Fast parsing using pruning and grammar specialization. In Proceedings of the 3~th Annual Meeting of the ACL, pages 223-230, Santa Cruz, CA, June.
7. Resnik, P. 1992. Probabilistic tree-adjoining grammar as a framework for statistical natural language processing. In Proceedingsofthe l~th International Conference on Computational Linguistics, Nantes, France, August.
8. Schabes, Y. and R. Waters. 1994. Tree insertion grammar: A cubic-time parsable formalism that lexicalizes context-freegrammar without changing the tree produced. Technical Report TR-94-13, Mitsubishi Electric Research Laboratories.
9. Schabes, Yves. 1992. Stochastic lexicalized tree-adjoining grammars. In Proceedings of the l~th International Conference on Computational Linguistics, pages 426-432, Nantes, France, August.
10. Schwartz, Richard, Steve Austin, Francis Kubala, John Makhoul, Long Nguyen, Paul Placeway, and George Zavaliagkos. 1992. New uses for the n-best sentence hypothesis within the byblos speech recognition system. In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, volume I, pages 1-4, San Francisco, California.
11. Stolcke, Andreas. 1993. An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Technical Report TR-93-065, International Computer Science Institute, Berkeley, CA.
12. Wu, Dekai. 1996. A polynomial-time algorithm for statistical machine translation. In Proceedings of the 3~th Annual Meeting of the ACL, pages 152-158, Santa Cruz, CA, June.
13. Zavaliagkos, G., T. Anastasakos, G. Chou, C. Lapre, F. Kubala, J. Makhoul, L. Nguyen, R. Schwartz, and Y. Zhao. 1994. Improved search, acoustic and language, modeling in the BBN Byblos large vocabulary CSR system. In Proceedings of the ARPA Workshop on Spoken Language Technology, pages 81-88, Phdnsboro, New Jersey.