TY - GEN
T1 - Models of adjunction in minimalist grammars
AU - Graf, Thomas
PY - 2014
Y1 - 2014
N2 - Three closely related proposals for adding (cyclic) adjunction to Minimalist grammars are given model-theoretic definitions and investigated with respect to their linguistic and formal properties. While they differ with respect to their linguistic adequacy, they behave largely the same on a computational level. Weak generative capacity is not affected, and while subregular complexity varies betweeen the three proposals, it does not exceed the complexity imposed by Move. The closure of Minimalist derivation tree languages under intersection with regular tree languages, however, is lost.
AB - Three closely related proposals for adding (cyclic) adjunction to Minimalist grammars are given model-theoretic definitions and investigated with respect to their linguistic and formal properties. While they differ with respect to their linguistic adequacy, they behave largely the same on a computational level. Weak generative capacity is not affected, and while subregular complexity varies betweeen the three proposals, it does not exceed the complexity imposed by Move. The closure of Minimalist derivation tree languages under intersection with regular tree languages, however, is lost.
KW - adjunction
KW - closure properties
KW - derivation trees
KW - Minimalist grammars
KW - subregular tree languages
UR - https://www.scopus.com/pages/publications/84905455427
U2 - 10.1007/978-3-662-44121-3_4
DO - 10.1007/978-3-662-44121-3_4
M3 - Conference contribution
AN - SCOPUS:84905455427
SN - 9783662441206
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 52
EP - 68
BT - Formal Grammar - 19th International Conference, FG 2014, Proceedings
PB - Springer Verlag
T2 - 19th International Conference on Formal Grammar, FG 2014
Y2 - 16 August 2014 through 17 August 2014
ER -