Evidence against the context-freeness of natural language

  title={Evidence against the context-freeness of natural language},
  author={Stuart M. Shieber},
  journal={Linguistics and Philosophy},
  • S. Shieber
  • Published 1 August 1985
  • Computer Science
  • Linguistics and Philosophy
In searching for universal constraints on the class of natural languages, linguists have investigated a number of formal properties, including that of context-freeness. Soon after Chomsky’s categorization of languages into his well-known hierarchy (Chomsky, 1963), the common conception of the context-free class of languages as a tool for describing natural languages was that it was too restrictive a class — interpreted strongly (as a way of characterizing structure sets) and even weakly (as a… Expand
Learning of Context-Free Languages: A Survey of the Literature
This work surveys methods for learning context-free languages (CFL's) in the theoretical computer science literature, considering those that take text as input, those thatTake structural information as input), those that rely on CFL formalisms that are not based on context- free grammars, those which learn subclasses of CFL's, and stochastic methods. Expand
Computationally Relevant Properties of Natural Languages and Their Grammars
What is currently known about natural language morphology and syntax from the perspective of formal language theory is surveyed and recent developments such as feature-theory, the use of extension and unification, default mechanisms, and metagram-matical techniques are outlined. Expand
Computationally relevant properties of natural languages and their grammars
What is currently known about natural language morphology and syntax from the perspective of formal language theory is surveyed and recent developments such as feature-theory, the use of extension and unification, default mechanisms, and metagrammatical techniques are outlined. Expand
Contextual Grammars versus Natural Languages
We continue here the investigations concerning the relevance of certain classes of contextual grammars (internal contextual grammars with maximal use of selectors) as generative models of naturalExpand
Formal language theory: refining the Chomsky hierarchy
  • G. Jäger, J. Rogers
  • Computer Science, Medicine
  • Philosophical Transactions of the Royal Society B: Biological Sciences
  • 2012
The arguments why neither regular nor context-free grammar is sufficiently expressive to capture all phenomena in the natural language syntax are recapitulated. Expand
Mildly Context-Sensitive Grammars
One of the most investigated families of languages is the family of context-free languages, which turn out to be very useful in many applications of formal languages and they have good mathematical properties. Expand
Global index languages
Describing power is shown both in terms of the set of string languages included in GILs, as well as the structural descriptions generated by the corresponding grammars, which preserves the desirable properties of context-free languages. Expand
The equivalence of four extensions of context-free grammars
The result presented in this paper is that all four of the formalisms under consideration generate exactly the same class of string languages. Expand
Grammar Formalisms for Natural Languages
For a long time there has been a debate about whether CFGs are sufficiently powerful to describe natural languages, but these approaches were able to treat a large range of linguistic phenomena. Expand
A formal universal of natural language grammar
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 limitedExpand


Natural languages and context-free languages
The question of when the human languages purely as sets of strings of words (henceforth stringsets) fall within the class called context-free languages (CFL’s) is taken up, and it is shown that it is still open. Expand
Cross-Serial Dependencies in Dutch
Chomsky’s argument that natural languages are not finite state languages puts a lower bound on the weak generative capacity of grammars for natural languages (Chomsky (1956), but these arguments are not the only formal considerations by which this can be done. Expand
English and the Class of Context-Free Languages
Langendoen and Postal (1984) show that for any L, WF(L) is a proper class, hence not a set, much less a recursively enumerable set, and there is thus no question of WF (L) being CF. Expand
English is Not a Context-Free Language
The question whether English is a context-free language has for some time been regarded as an open one. In this article, I argue that the answer is negative. I exhibit a regular set L (a set that canExpand
Phrase Structure Grammar
Transformational grammars for natural languages, as currently envisaged, deploy a large number of devices: complex symbols, base rules, rule schemata, lexical insertion rules, lexical redundancyExpand
On Two Recent Attempts to Show that English Is Not a CFL
It has become somewhat more important to linguists to determine at least whether English the most studied language in the era of generative grammar and the primary focus for natural language processing efforts is context-free (CF) or not. Expand
The Complexity of the Vocabulary of Bambara
The weak generative capacity of the vocabulary of Bambara is studied, and it is shown that the vocabulary is not context free. Expand
Crossed Serial Dependencies: A low-power parseable extension to GPSG
An extension to the GPSG grammatical formalism is proposed, allowing non-terminals to consist of finite sequences of category labels, and allowing schematic variables to range over such sequences, and shown to be parseable by a simple extension to an existing parsing method for GPSG. Expand
The nature of syntactic representation
A Semantic Theory of "NP-movement" Dependencies and a Phrase Structure Account of Scandinavian Extraction Phenomena. Expand
Introduction to Automata Theory, Languages and Computation
This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments. Expand