Some interdefinability results for syntactic constraint classes

DOI10.1007/978-3-642-14322-9_7MaRDI QIDQ3584998zbMATH OpenOpenAlexFDO

Authors Thomas Graf

Publication date 31 August 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14322-9_7

zbMATH Keywords

economy conditionsmodel-theoretic syntaxmulti-dimensional treesoptimality systemssyntactic constraintstransderivationality

Mathematics Subject Classification ID

Natural language processing (68T50)

Recommendations

• Logical Aspects of Computational Linguistics
• Syntactic structures as multi-dimensional trees
• Reference-set constraints as linear tree transductions via controlled optimality systems
• Constraints on derivations
• The Theory of Grammar Constraints

Cited in

(7)

• Constraints on derivations
• Syntactic structures as multi-dimensional trees
• Inter-definability of Horn contraction and Horn revision
• Decidability and syntactic control of interference
• Reference-set constraints as linear tree transductions via controlled optimality systems
• Merge. Binarity in (multidominant) syntax
• Logical Aspects of Computational Linguistics

This page was built for publication: Some interdefinability results for syntactic constraint classes

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