Paper

Case assignment in TSL syntax: a case study

Authors
  • Mai Ha Vu (University of Delaware)
  • Nazila Shafiei (Stony Brook University)
  • Thomas Graf (Stony Brook University)

Abstract

Recent work suggests that the subregular complexity of syntax might be comparable to that of phonology and morphology. More specifically, whereas phonological and morphological dependencies are tier-based strictly local over strings, syntactic dependencies are tier-based strictly local over derivation trees. However, a broader range of empirical phenomena must be considered in order to solidify this claim. This paper investigates various phenomena related to morphological case, and we argue that they, too, are tier-based strictly local. Not only do our findings provide empirical support for a kind of computational parallelism across language modules, they also offer a new, computationally unified perspective of structural and lexical case. We hope that this paper will enable other researchers to fruitfully study syntactic phenomena from a subregular perspective.

Keywords: syntax, case assignment, dependent case theory, subregular hierarchy, TSL syntax, c-command

How to Cite:

Vu, M., Shafiei, N. & Graf, T., (2019) “Case assignment in TSL syntax: a case study”, Society for Computation in Linguistics 2(1), 267-276. doi: https://doi.org/10.7275/sywz-xw23

Downloads:
Download PDF

38 Views

9 Downloads

Published on
01 Jan 2019