Efficient normal-form parsing for combinatory categorial grammar

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn 1996-June, Issue , 1996, Pages 79-86

  Eisner, Jason ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; SEMANTICS; SYNTACTICS;

CATEGORIAL GRAMMAR; COMBINATORY CATEGORIAL GRAMMAR; NORMAL FORM; SEMANTIC AMBIGUITIES; SEMANTIC EQUIVALENCES; SIMPLE++; SPURIOUS AMBIGUITIES;

EQUIVALENCE CLASSES;

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

References (22)

1. Gosse Bouma. 1989. Efficient processing of flexible categorial grammar. In Proceedings of the Fourth Conference of the European Chapter of the Association for Computational Linguistics, 19-26, University of Manchester, April.
2. David Dowty. 1988. Type raising, functional composition, and non-constituent conjunction. In R. Oehrle, E. Bach and D. Wheeler, editors, Categorial Grammars and Natural Language Structures. Reidel.
3. Mark Hepple. 1987. Methods for parsing combinatory categorial grammar and the spurious ambiguity problem. Unpublished M.Sc. thesis, Centre for Cognitive Science, University of Edinburgh.
4. Mark Hepple. 1990. The Grammar and Processing of Order and Dependency: A Categorial Approach. Ph.D. thesis, University of Edinburgh.
5. Mark Hepple and Glyn Morrill. 1989. Parsing and derivational equivalence. In Proceedings of the Fourth Conference of the European Chapter of the Association for Computational Linguistics, 10-18, University of Manchester, April.
6. Herman Hendriks. 1993. Studied Flexibility: Categories and Types in Syntax and Semantics. Ph.D. thesis, Institute for Logic, Language, and Computation, University of Amsterdam.
7. Aravind Joshi, K. Vijay-Shanker, and David Weir. 1991. The convergence of mildly context-sensitive grammar formalisms. In Foundational Issues in Natural Language Processing, MIT Press.
8. Lauri Karttunen. 1986. Radical lexicalism. Report No. CSLI-86-68, CSLI, Stanford University.
9. E. KSnig. 1989. Parsing as natural deduction. In Proceedings of the 27lh Annual Meeting of the Association for Computational Linguistics, Vancouver.
10. J. Lambek. 1958. The mathematics of sentence structure. American Mathematical Monthly 65:154-169.
11. Michael Moortgat. 1990. Unambiguous proof representations for the Lambek Calculus. In Proceedings of the Seventh Amsterdam Colloquium.
12. Michael Niv. 1994. A psycholinguistically motivated parser for CCG. In Proceedings of the 32nd Annual Meeting of the Association for Computational Linguistics, Las Cruces, NM, June.
13. Remo Paresehi and Mark Steedman. A lazy way to chart parse with eombinatory grammars. In Proceedings of the P5th Annual Meeting of the Association for Computational Linguistics, Stanford University, July.
14. Scott Prevost and Mark Steedman. 1994. Specifying intonation from context for speech synthesis. Speech Communication, 15:139-153.
15. Mark Steedman. 1990. Gapping as constituent coordination. Linguistics and Philosophy, 13:207-264.
16. Mark Steedman. 1991. Structure and intonation. Language, 67:260-296.
17. Mark Steedman. 1987. Combinatory grammars and parasitic gaps. Natural Language and Linguistic Theory, 5:403-439.
18. Anna Szabolcsi. 1989. Bound variables in syntax: Are there any? In R. Bartsch, J. van Benthem, and P. van Emde Boas (eds.), Semantics and Contextual Expression, 295-318. Forts, Dordrecht.
19. K. Vijay-Shanker and David Weir. 1990. Polynomial time parsing of combinatory ¢ategorial grammars. In Proceedings of the P8th Annual Meeting of the Association for Computational Linguistics. K. Vijay-Shanker and David Weir. 1993. Parsing some constrained grammar formalisms. Computational Linguistics, 19(4):591-636.
20. K. Vijay-Shanker and David Weir. 1994. The equivalence of four extensions of context-free grammars. Mathematical Systems Theory, 27:511-546.
21. Kent Wittenburg. 1986. Natural Language Parsing with Combinatory Calegorial Grammar in a Graph-Unification-Based Formalism. Ph.D. thesis, University of Texas.
22. Kent Wittenburg. 1987. Predictive combinators: A method for efficient parsing of Combinatory Categorial Grammars. In Proceedings of the 25th Annual Meeting of the Association for Computational Linguistics, Stanford University, July.