Accurate context-free parsing with combinatory categorial grammar

ACL 2010 - 48th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference

Volumn , Issue , 2010, Pages 335-344

  Fowler, Timothy A D ^a   Penn, Gerald ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORY CATEGORIAL GRAMMAR; CONTEXT-FREE; NEW RESULTS; STATE OF THE ART;

COMPUTATIONAL LINGUISTICS;

FORMAL LANGUAGES;

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

References (11)

1. J. Baldridge. 2002. Lexically Specified Derivational Control in Combinatory Categorial Grammar. Ph.D. thesis, University of Edinburgh.
2. J. Bos, S. Clark, M. Steedman, J. R Curran, and J. Hockenmaier. 2004. Wide-coverage semantic representations from a CCG parser. In Proceedings of COLING, volume 4, page 1240-1246.
3. S. Clark and J. R. Curran. 2007. Wide-Coverage efficient statistical parsing with CCG and Log-Linear models. Computational Linguistics, 33(4):493-552.
4. S. Clark, J. Hockenmaier, and M. Steedman. 2002. Building deep dependency structures with a widecoverage CCG parser. In Proceedings of the 40th Meeting of the ACL, page 327-334.
5. J. Hockenmaier and M. Steedman. 2007. CCGbank: a corpus of CCG derivations and dependency structures extracted from the penn treebank. Computational Linguistics, 33(3):355-396.
6. F. Hoyt and J. Baldridge. 2008. A logical basis for the d combinator and normal form in CCG. In Proceedings of ACL-08: HLT, page 326-334, Columbus, Ohio. Association for Computational Linguistics.
7. J. Lambek. 1958. The mathematics of sentence structure. American Mathematical Monthly, 65(3):154-170.
8. S. Petrov and D. Klein. 2007. Improved inference for unlexicalized parsing. In Proceedings of NAACL HLT 2007, page 404-411.
9. M. Steedman. 2000. The syntactic process. MIT Press.
10. K. Vijay-Shanker and D. Weir. 1994. The equivalence of four extensions of context-free grammars. Mathematical Systems Theory, 27(6):511-546.
11. W. Zielonka. 1981. Axiomatizability of Ajdukiewicz- Lambek calculus by means of cancellation schemes. Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik, 27:215-224.