Integration complexity and the order of cosisters

William Dyer


Abstract
The cost of integrating dependent constituents to their heads is thought to involve the distance between dependent and head and the complexity of the integration (Gibson, 1998). The former has been convincingly addressed by Dependency Distance Minimization (DDM) (cf. Liu et al., 2017). The current study addresses the latter by proposing a novel theory of integration complexity derived from the entropy of the probability distribution of a dependent’s heads. An analysis of Universal Dependency corpora provides empirical evidence regarding the preferred order of isomorphic cosisters—sister constituents of the same syntactic form on the same side of their head—such as the adjectives in pretty blue fish. Integration complexity, alongside DDM, allows for a general theory of constituent order based on integration cost.
Anthology ID:
W18-6007
Volume:
Proceedings of the Second Workshop on Universal Dependencies (UDW 2018)
Month:
November
Year:
2018
Address:
Brussels, Belgium
Editors:
Marie-Catherine de Marneffe, Teresa Lynn, Sebastian Schuster
Venue:
UDW
SIG:
Publisher:
Association for Computational Linguistics
Note:
Pages:
55–65
Language:
URL:
https://aclanthology.org/W18-6007
DOI:
10.18653/v1/W18-6007
Bibkey:
Cite (ACL):
William Dyer. 2018. Integration complexity and the order of cosisters. In Proceedings of the Second Workshop on Universal Dependencies (UDW 2018), pages 55–65, Brussels, Belgium. Association for Computational Linguistics.
Cite (Informal):
Integration complexity and the order of cosisters (Dyer, UDW 2018)
Copy Citation:
PDF:
https://aclanthology.org/W18-6007.pdf
Data
Universal Dependencies