In this paper, I develop a hybrid theory which takes into account both linear order and syntax. Anvari & Blumberg ( 2021) make a similar point concerning the Maximize Presuppositions constraint in English partitive constructions, arguing that the observed competition demonstrates yet another case in which proceeding expressions contribute to the local context of preceding expressions. Thus both theories incorrectly predict that modifiers update the context before the head noun. ![]() However, in such constructions the modifiers precede and also asymmetrically c-command the head noun. He shows that certain English, Mandarin, and French nominals require their head noun to update the context before the modifiers. More recently, Schlenker ( 2020) has presented yet another data that raise a problem for both his own incremental algorithm and the c-command-based alternative. Romoli & Mandelkern ( 2017) formalize the hierarchy-based algorithm. He proposes that the order of context update mirrors structural hierarchy, that is, expressions that are higher in the structure updates the context prior to those that are lower. Ingason ( 2016) presents data from Japanese which hint that local contexts cannot be calculated in a strictly incremental fashion. However, there are a number of challenges to the proposed algorithm. Schlenker shows that his incremental algorithm reproduces many of the predictions of the dynamic approaches.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |