Paper

Adjunction in (T)SL Syntax

---

Abstract

Adjunction is intuitively a local operation, yet its subregular complexity is dependent on both the geometry of the syntactic representation as well as the specific model of adjunction assumed. Here, I propose a model of adjunction which is strictly local (SL) over Minimalist Grammar (MG) dependency trees, and which incorporates the core properties of optionality, iteration, invisibility to selection, and adjunct ordering restrictions. Non-locality is avoided in cases of recursive adjunction, and an interesting treatment of several other formal properties of adjunction is made possible.

Keywords: Minimalist Grammars, adjunction, dependency trees, unranked trees, SL tree languages, TSL tree languages

How to Cite:

Hanson, K., (2025) “Adjunction in (T)SL Syntax”, Society for Computation in Linguistics 8(1): 27. doi: https://doi.org/10.7275/scil.3190