Dutch Grammar and Processing: A Case Study in TLG

DOI10.1007/978-3-642-00665-4_22MaRDI QIDQ3623844zbMATH OpenOpenAlexFDO

Authors Glyn Morrill, Oriol Valentín, Mario Fadda

Publication date 24 April 2009

Published in Logic, Language, and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00665-4_22

zbMATH Keywords

discontinuous Lambek calculusDutch cross-serial dependenciesproof net complexity metricType Logical Grammar

Mathematics Subject Classification ID

Logic of natural languages (03B65) Natural language processing (68T50) Linguistics (91F20)

Recommendations

• Types as graphs: Continuations in type logical grammar
• Proof nets and the complexity of processing center embedded constructions
• Descriptions of cross-serial dependencies
• Publication:4939014
• scientific article; zbMATH DE number 1689580

Cites work

• A Sign-Based Extension to the Lambek Calculus for Discontinuous Constituency
• Linguistic application of first order intuitionistic linear logic
• Proof nets and the complexity of processing center embedded constructions
• Proof Nets for Basic Discontinuous Lambek Calculus

Cited in

(8)

• Parsing/theorem-proving for logical grammar \textit{CatLog3}
• The displacement calculus
• Models for the Displacement Calculus
• scientific article; zbMATH DE number 1749209 (Why is no real title available?)
• scientific article; zbMATH DE number 1749211 (Why is no real title available?)
• A categorial type logic
• The hidden structural rules of the discontinuous Lambek calculus
• An incremental grammar approach to multiple nominative constructions in Japanese

This page was built for publication: Dutch Grammar and Processing: A Case Study in TLG

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3623844)