Global optimization and complexity trade-offs

• Authors: Kaius Sinnemäki
• Languages of publication: EN

Abstracts

EN

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.

Keywords

EN

language complexity; computer simulation; trade-offs; typology

• Publisher: De Gruyter
• Journal: Poznań Studies in Contemporary Linguistics
• Year: 2014
• Volume: 50
• Issue: 2
• Pages: 179-195

Dates

received

2014-01-13

revised

2014-04-30

accepted

2014-04-30

online

2014-07-16

Contributors

author

Kaius Sinnemäki

• University of Helsinki, Helsinki, Finland

Identifiers

DOI

10.1515/psicl-2014-0013