The importance of supertagging for wide-coverage CCG parsing

COLING 2004 - Proceedings of the 20th International Conference on Computational Linguistics

Volumn , Issue , 2004, Pages

  Clark, Stephen ^a   Curran, James R ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b UNIVERSITY OF SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DISCRIMINATIVE TRAINING; LOGLINEAR MODEL; MODEL ESTIMATION; ORDERS OF MAGNITUDE;

COMPUTATIONAL LINGUISTICS;

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

References (18)

1. Srinivas Bangalore and Aravind Joshi. 1999. Supertagging: An approach to almost parsing. Computational Linguistics, 25(2):237-265.
2. John Chen and K. Vijay-Shanker. 2000. Automated extraction of TAGS from the Penn Treebank. In Proceedings of IWPT 2000, Trento, Italy.
3. John Chen, Srinivas Bangalore, and K. Vijay-Shanker. 1999. New models for improving supertag disambiguation. In Proceedings of the 9th Meeting of EACL, Bergen, Norway.
4. John Chen, Srinivas Bangalore, Michael Collins, and Owen Rambow. 2002. Reranking an N-gram supertagger. In Proceedings of the TAG+ Workshop, pages 259-268, Venice, Italy.
5. Stephen Clark and James R. Curran. 2003. Log-linear models for wide-coverage CCG parsing. In Proceedings of the EMNLP Conference, pages 97-104, Sapporo, Japan.
6. Stephen Clark and James R. Curran. 2004. Parsing the WSJ using CCG and log-linear models. In Proceedings of the 42nd Meeting of the ACL, Barcelona, Spain.
7. Stephen Clark, Julia Hockenmaier, and Mark Steedman. 2002. Building deep dependency structures with a wide-coverage CCG parser. In Proceedings of the 40th Meeting of the ACL, pages 327-334, Philadelphia, PA.
8. Stephen Clark. 2002. A supertagger for Combinatory Categorial Grammar. In Proceedings of the TAG+ Workshop, pages 19-24, Venice, Italy.
9. Michael Collins. 1999. Head-Driven Statistical Models for Natural Language Parsing. Ph.D. thesis, University of Pennsylvania.
10. James R. Curran and Stephen Clark. 2003. Investigating GIS and smoothing for maximum entropy taggers. In Proceedings of the 10th Meeting of the EACL, pages 91-98, Budapest, Hungary.
11. Jason Eisner. 1996. Efficient normal-form parsing for Combinatory Categorial Grammar. In Proceedings of the 34th Meeting of the ACL, pages 79-86, Santa Cruz, CA.
12. Julia Hockenmaier and Mark Steedman. 2002. Acquiring compact lexicalized grammars from a cleaner tree-bank. In Proceedings of the Third LREC Conference, pages 1974-1981, Las Palmas, Spain.
13. Julia Hockenmaier. 2003. Data and Models for Statistical Parsing with Combinatory Categorial Grammar. Ph.D. thesis, University of Edinburgh.
14. Ronald M. Kaplan, Stefan Riezler, Tracy H. King, John T. Maxwell III, Alexander Vasserman, and Richard Crouch. 2004. Speed and accuracy in shallow and deep stochastic parsing. In Proceedings of the HLT/NAACL Conference, Boston, MA.
15. Jorge Nocedal and Stephen J. Wright. 1999. Numerical Optimization. Springer, New York, USA.
16. Miles Osborne. 2000. Estimation of stochastic attribute-value grammars using an informative sample. In Proceedings of the 18th International Conference on Computational Linguistics, pages 586-592, Saarbrücken, Germany.
17. Anoop Sarkar, Fei Xia, and Aravind Joshi. 2000. Some experiments on indicators of parsing complexity for lexicalized grammars. In Proceedings of the COLING Workshop on Efficiency in Large-Scale Parsing Systems, pages 37-42, Luxembourg.
18. Mark Steedman. 2000. The Syntactic Process. The MIT Press, Cambridge, MA.