Abstract We provide a general formal 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.
Files [pdf]
@InProceedings{GrafShafiei19SCiL,
author = {Graf, Thomas and Shafiei, Nazila},
author+an = {2=sbu},
title = {C-Command Dependencies as {TSL} String Constraints},
year = {2019},
booktitle = {Proceedings of the {Society} for {Computation} in
{Linguistics} ({SCiL}) 2019},
editor = {Jarosz, Gaja and Nelson, Max and O'Connor, Brendan and
Pater, Joe},
pages = {205--215},
doi = {10.7275/4rrx-x488},
openaccess = {gold},
}