| Literature DB >> 31774810 |
Pedro Tiago Martins1,2, Cedric Boeckx1,2,3.
Abstract
Recently, prominent theoretical linguists have argued for an explicit scenario for the evolution of the human language capacity on the basis of its computational properties. Concretely, the simplicity of a minimalist formulation of the operation Merge, which allows humans to recursively compute hierarchical relations in language, has been used to promote a sudden-emergence, single-mutation scenario. In support of this view, Merge is said to be either fully present or fully absent: one cannot have half-Merge. On this basis, it is inferred that the emergence of our fully fledged language capacity had to be sudden. Thus, proponents of this view draw a parallelism between the formal complexity of the operation at the computational level and the number of evolutionary steps it must imply. Here, we examine this argument in detail and show that the jump from the atomicity of Merge to a single-mutation scenario is not valid and therefore cannot be used as justification for a theory of language evolution along those lines.Entities:
Mesh:
Year: 2019 PMID: 31774810 PMCID: PMC6880980 DOI: 10.1371/journal.pbio.3000389
Source DB: PubMed Journal: PLoS Biol ISSN: 1544-9173 Impact factor: 8.029
Fig 1Nested dependencies (left) versus crossed dependencies (right).
In the English example to the left, “the cat the dog chased escaped,” the dependencies do not cross. In the Swiss-German example (from [24]), to the right, “mer Hans es huus hälfed aastriiche” (we helped Hans paint the house), the dependencies cross.
The hierarchy of formal languages and corresponding automata.
| Class | Grammar | Automaton |
|---|---|---|
| Type-3 | Regular | Finite-state |
| Type-2 | Context-free | Pushdown |
| Type-1 | Context-sensitive | Linear bounded |
| Type-0 | Unrestricted | Turing machine |
Fig 2Berwick and Chomsky's theory of language evolution in the context of Marr's levels.