论文信息 - Dutch Grammar and Processing: A Case Study in TLG

Dutch Grammar and Processing: A Case Study in TLG

The aim of this paper is to see type logical grammar (TLG) at work on an interesting linguistic case: the incremental processing of Dutch subordinate clause word order, namely the so-called cross-serial dependencies. With the help of proof net machinery adapted for the continuous and discontinuous Lambek calculus we are able to account for the increasing unacceptability of cross-serial dependencies with increasingly multiple embeddings.

Glyn Morrill | Oriol Valentín | Mario Fadda

[1] Mark Steedman,et al. Dependency and Coordination in the Grammar of Dutch and English , 1985 .

[2] Dirk Roorda,et al. Resource Logics : Proof-Theoretical Investigations , 1991 .

[3] Mario Piazza,et al. Linguistic Applications of First Order Intuitionistic Linear Logic , 2001, J. Log. Lang. Inf..

[4] Glyn Morrill,et al. Proof Nets for Basic Discontinuous Lambek Calculus , 2008, J. Log. Comput..

[5] J. Lambek. The Mathematics of Sentence Structure , 1958 .

[6] Mark Hepple,et al. The grammar and processing of order and dependency : a categorial approach , 1990 .

[7] Mark Johnson. Proof Nets and the Complexity of Processing Center Embedded Constructions , 1998, J. Log. Lang. Inf..

[8] Mati Pentus. Language completeness of the Lambek calculus , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[9] Glyn Morrill,et al. Incremental processing and acceptability , 2000, CL.

[10] Mike Calcagno. A Sign-Based Extension to the Lambek Calculus for Discontinuous Constituency , 1995, Log. J. IGPL.