Hostname: page-component-7b7567c8c-jswmv Total loading time: 0 Render date: 2026-11-15T20:07:47.909Z Has data issue: false hasContentIssue false

A Formal Universal of Natural Language Grammar

Published online by Cambridge University Press:  01 January 2026

Mark Steedman*
Affiliation:
University of Edinburgh

Abstract

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.

Information

Type
Research Article
Copyright
Copyright © 2020 Linguistic Society of America

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable