Dutch Grammar and Processing: A Case Study in TLG

DOI10.1007/978-3-642-00665-4_22zbMath1236.03026OpenAlexW2179047274MaRDI QIDQ3623844

Oriol Valentín, Glyn Morrill, 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)

Related Items (5)

Parsing/theorem-proving for logical grammar \textit{CatLog3} ⋮ The displacement calculus ⋮ A Categorial Type Logic ⋮ The Hidden Structural Rules of the Discontinuous Lambek Calculus ⋮ Models for the Displacement Calculus

Cites Work

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

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