A formal universal of natural language grammar
A formal universal of natural language grammar
复制标题
自然语言语法的形式普遍性
DOI:
--
复制
发表时间:
2020
期刊:
影响因子:
--
通讯作者:
Mark Steedman
中科院分区:
文献类型:
--
作者:
Mark Steedman
This article proposes that the possible word orders for any natural language construction composed of n elements, each of which selects for the category headed by the next, are universally limited both across and within languages to a subclass of permutations on the ‘universal order of command’ 1, ... , n, as determined by their selectional restrictions. The permitted subclass is known as the ‘separable’ permutations, and grows in n as the large Schröder series {1, 2, 6, 22, 90, 394, 1806, ... }. This universal is identified as formal because it follows directly from the assumptions of combinatory categorial grammar (CCG)—in particular, from the fact that all CCG syntactic rules are subject to a combinatory projection principle that limits them to binary rules applying to contiguous nonempty categories. The article presents quantitative empirical evidence in support of this claim from the linguistically attested orders of the four elements Dem(onstrative), Num(erator), A(djective), N(oun), which have been examined in connection with various versions of Greenberg’s putative 20th universal concerning their order. A universal restriction to separable permutation is also supported by word-order variation in the Germanic verb cluster and in the Hungarian verb complex, among other constructions.*
影响因子:
0.5
作者:
Ulrike
通讯作者:
Ulrike