Hostname: page-component-5db58dd55d-m58mf Total loading time: 0 Render date: 2026-05-26T08:06:51.827Z Has data issue: false hasContentIssue false

The best-supported language universals refer to scalar patterns deriving from processing cost

Published online by Cambridge University Press:  26 October 2009

Martin Haspelmath
Affiliation:
Max Planck Institute for Evolutionary Anthropology, 04103 Leipzig, Germany. haspelmath@eva.mpg.dehttp://www.eva.mpg.de/lingua/staff/haspelmath/home.php

Abstract

Conditional universals have always interested linguists more than unrestricted universals, which are often impossible to demonstrate empirically because categories cannot be defined in a cross-linguistically meaningful way. But deep dependencies have not been confirmed by more recent empirical research, and those universals with solid empirical support mostly relate to scalar patterns that can plausibly be related to processing cost.

Information

Type
Open Peer Commentary
Copyright
Copyright © Cambridge University Press 2009

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