Incremental processing and acceptability

Computational Linguistics

Volumn 26, Issue 3, 2000, Pages 318-338

  Morrill, Glyn ^a  

^a Modul C 5 Campus Nord ^*  (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

INCREMENTAL PROCESSING; LAMBEK CATEGORIAL GRAMMARS; NOUN PHRASE; PROOF NET; VALENCIES;

EID: 0041029029     PISSN: 08912017     EISSN: None     Source Type: Journal    
DOI: 10.1162/089120100561728     Document Type: Article

References (27)

1. Ades, Anthony E. and Mark J. Steedman. 1982. On the Order of Words. Linguistics and Philosophy, 4:517-558.
2. Bever, Thomas. 1970. The cognitive basis for linguistic structures. In J. R. Hayes, editor, Cognition and the Growth of Language, Wiley, New York.
3. Buszkowski, Wojciech. 1986. Completeness results for Lambek syntactic calculus. Zeitschrift für mathematische Logik und Grundlage der Mathematik, 32:13-28.
4. Carpenter, Bob. 1998. Type-Logical Semantics. MIT Press, Cambridge, MA.
5. Chomsky, Noam. 1965. Aspects of the Theory of Syntax. MIT Press, Cambridge, MA.
6. Danos, Vincent and Laurent Regnier. 1989. The Structure of Multiplicatives. Archive for Mathematical Logic, 28:181-203.
7. Došen, Kosta. 1992. A brief survey of frames for the Lambek calculus. Zeitschrift für mathematische Logik und Grundlage der Mathematik, 38:179-187.
8. Gibson, E. and J. Thomas. 1996. The processing complexity of English center-embedded and self-embedded structures. Proceedings of NELS, University of Massachusetts, Amherst.
9. Girard, Jean-Yves. 1987. Linear Logic. Theoretical Computer Science, 50:1-102.
10. de Groote, Philippe and Christian Retoré. 1996. On the Semantic Readings of Proof-Nets. In Geert-Jan Kruijff, Glyn Morrill and Richard. T. Oehrle, editors, Proceedings of Formal Grammar 1996, Prague, pages 57-70.
11. Hendriks, Herman. 1993. Studied Flexibility: Categories and Types in Syntax and Semantics. D.Phil. dissertation, Universiteit van Amsterdam, Amsterdam.
12. Hepple, Mark. 1990. Normal form theorem proving for the Lambek calculus. In H. Karlgren, editor, Proceedings of the 13th International Conference on Computational Linguistics (COLING 1990), pages 173-178, Stockholm.
13. Hepple, Mark and Glyn Morrill. 1989. Parsing and Derivational Equivalence. Proceedings of the Fourth Conference of the European Chapter of the Association for Computational Linguistics, pages 10-18, Manchester.
14. Johnson, Mark. 1998. Proof nets and the complexity of processing center embedded constructions, Journal of Logic, Language and Information, 7(4):433-447.
15. Kimball, John. 1973. Seven principles of surface structure parsing in natural language. Cognition, 2:15-47.
16. König, Esther. 1989. Parsing as natural deduction. Proceedings of the 27th Annual Meeting, pages 272-279, Vancouver. Association for Computational Linguistics.
17. Lamarche, François and Christian Retoré. 1996. Proof nets for the Lambek calculus - an overview. In V. Michele Abrusci and Claudia Casadio, editors, Proofs and Linguistic Categories: Applications of Logic to the Analysis and Implementation of Natural Language. CLUEB, Bologna, pages 241-262.
18. Lambek, Joachim. 1958. The mathematics of sentence structure. American Mathematical Monthly, 65:154-170.
19. Lecomte, Alain and Christian Retoré. 1995. An alternative categorial grammar. Glyn Morrill and Richard. T. Oehrle, editors, Proceedings of Formal Grammar 1995, Barcelona, pages 181-196.
20. Moortgat, Michael. 1988. Categorial Investigations: Logical and Linguistic Aspects of the Lambek Calculus. Foris, Dordrecht.
21. Moortgat, Michael. 1997. Categorial Type Logics. In Johan van Benthem and Alice ter Meulen, editors, Handbook of Logic and Language. Elsevier, Amsterdam, pages 93-177.
22. Morrill, Glyn. 1994. Type Logical Grammar: Categorial Logic of Signs. Kluwer Academic Publishers, Dordrecht.
23. Morrill, Glyn. 1999. Geometry of Lexico-Syntactic Interaction. Proceedings of the Ninth Conference of the European Chapter of the Association for Computational Linguistics, Bergen, pages 61-70.
24. Pentus, Mati. 1994. Language completeness of the Lambek calculus. Proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science, Paris, pages 487-496.
25. Roorda, Dirk. 1991. Resource Logics: Proof-Theoretical Investigations. D.Phil, dissertation, Universiteit van Amsterdam, Amsterdam.
26. Steedman, Mark J. 1997. Surface Structure and Interpretation. MIT Press, Cambridge, MA.
27. Zielonka, Wojciech. 1981. Axiomatizability of Ajdukiewicz-Lambek calculus by means of cancellation scheme. Zeitschrift für mathematische Logik und Grundlage der Mathematik, 27:215-224.