Paper

C-Command Dependencies as TSL String Constraints

Authors: Thomas Graf (Stony Brook University) , Nazila Shafiei (Stony Brook University)

Abstract

We provide a general framework for analyzing c-command based dependencies in syntax, e.g. binding and NPI licensing, from a subregular perspective. C-command relations are represented as strings computed from Minimalist derivation trees, and syntactic dependencies are shown to be input-output tier-based strictly local over such strings. The complexity of many syntactic phenomena thus is comparable to dependencies in phonology and morphology.

Keywords: generative syntax, subregular complexity, Minimalist grammars, command relations, binding, NPIs

How to Cite: Graf, T. & Shafiei, N. (2019) “C-Command Dependencies as TSL String Constraints”, Society for Computation in Linguistics. 2(1). doi: https://doi.org/10.7275/4rrx-x488