Towards a Formal Description of NPI-licensing Patterns
Towards a Formal Description of NPI-licensing Patterns
复制标题
迈向 NPI 许可模式的正式描述
DOI：
--
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
Mai H. Vu
中科院分区：
文献类型：
--
作者：
Mai H. Vu
本文是对两种语言（英语和匈牙利语）简化版本的负极性项目（NPI）许可要求的正式研究。在模型理论语法的框架中，使用在树语言上定义的逻辑形式主义，我表明，这两种模式都不能用严格的局部（TSL）约束来描述，并建议它们需要更复杂的逻辑公式。特别是，可以使用基于统一关系的严格2局部约束对统治关系和局部1检验的约束来描述匈牙利模式。对于英语，无论有或没有级别，都没有足够的本地限制。作为分析的一部分，我给出了一种广义的树语言的定义，该定义使用基于层次的2个局部约束对主导关系，而它仍然指定为左派关系。
This paper is a formal study of a simplified version of Negative Polarity Item (NPI) licensing requirements in two languages, English and Hungarian. In the framework of Model-Theoretic Syntax, using logical formalisms defined over tree-languages, I show that neither pattern can be described with Tierbased Strictly Local (TSL) constraints only, and suggest that they need a more complex logical formula. In particular, Hungarian patterns can be described using a combination of Tier-based Strictly 2-Local constraints over dominance relations and Locally 1-Testable constraints over the left-of relations between nodes. For English, there are no sufficient local constraints, either with or without tiers. As part of the analysis, I give a definition of a generalized tree-language that uses Tier-based 2-Local constraints over dominance relations, while it remains underspecified for left-of relations.