Global optimization and complexity trade-offs
-
Kaius Sinnemäki
Abstract
It is sometimes assumed in research on language complexity that if languages tended towards some optimal level of global complexity, so that all languages would be roughly equally complex, then local complexity trade-offs should be a general principle in language. Drawing evidence from computer simulations I show that in equally complex systems the proportion of trade-offs (significant negative correlations) is higher than in random systems but far from being a general principle in language. In addition, it may be impossible to determine whether a certain correlation-set comes from random systems or equally complex systems. Based on these results a correlational approach on a handful of typological variables cannot be used to validate, or even falsify, the assumption that all languages are equally complex and, therefore, complexity trade-offs should be kept separate from that assumption. The typological distribution of complexity, drawn from the World Atlas of Language Structures, is further shown to differ from both random systems and equally complex systems.
©2014 by Walter de Gruyter Berlin/Boston
Articles in the same Issue
- Special volume on linguistic complexity: Editor's preface
- Overt and hidden complexity – Two types of complexity and their implications
- Complexity trade-offs do not prove the equal complexity hypothesis
- Complexity in the history of language study
- Complexity in language and in law
- Global optimization and complexity trade-offs
- Network science as a method of measuring language complexity
Articles in the same Issue
- Special volume on linguistic complexity: Editor's preface
- Overt and hidden complexity – Two types of complexity and their implications
- Complexity trade-offs do not prove the equal complexity hypothesis
- Complexity in the history of language study
- Complexity in language and in law
- Global optimization and complexity trade-offs
- Network science as a method of measuring language complexity
