Tractable versus Intractable Reciprocal Sentences

In J. Bos & S. Pulman (eds.), Proceedings of the International Conference on Computational Semantics 9 (2011)
  Copy   BIBTEX

Abstract

In three experiments, we investigated the computational complexity of German reciprocal sentences with different quantificational antecedents. Building upon the tractable cognition thesis (van Rooij, 2008) and its application to the verification of quantifiers (Szymanik, 2010) we predicted complexity differences among these sentences. Reciprocals with all-antecedents are expected to preferably receive a strong interpretation (Dalrymple et al., 1998), but reciprocals with proportional or numerical quantifier antecedents should be interpreted weakly. Experiment 1, where participants completed pictures according to their preferred interpretation, provides evidence for these predictions. Experiment 2 was a picture verification task. The results show that the strong interpretation was in fact possible for tractable all but one-reciprocals, but not for exactly n. The last experiment manipulated monotonicity of the quantifier antecedents.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 98,109

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Relational domains and the interpretation of reciprocals.Sivan Sabato & Yoad Winter - 2012 - Linguistics and Philosophy 35 (3):191-241.
Reciprocals are Definites.Sigrid Beck - 2001 - Natural Language Semantics 9 (1):69-138.

Analytics

Added to PP
2010-11-30

Downloads
84 (#210,902)

6 months
5 (#938,808)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jakub Szymanik
University of Amsterdam

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references