AbstractIn 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.
Similar books and articles
Tractable versus Intractable Reciprocal Sentences.Oliver Bott, Fabian Schlotterbeck & Jakub Szymanik - 2011 - In J. Bos & S. Pulman (eds.), Proceedings of the International Conference on Computational Semantics 9.
The Computational Complexity of Quantified Reciprocals.Jakub Szymanik - 2009 - In Peter Bosch, David Gabelaia & Jérôme Lang (eds.), Lecture Notes on Artificial Intelligence 5422, Logic, Language, and Computation 7th International Tbilisi Symposium on Logic, Language, and Computation. Springer.
Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language.Jakub Szymanik - 2010 - Linguistics and Philosophy 33 (3):215-250.
Relational domains and the interpretation of reciprocals.Sivan Sabato & Yoad Winter - 2012 - Linguistics and Philosophy 35 (3):191-241.
Quantifiers in TIME and SPACE. Computational Complexity of Generalized Quantifiers in Natural Language.Jakub Szymanik - 2009 - Dissertation, University of Amsterdam
Distributivity strengthens reciprocity, collectivity weakens it.Hana Filip & Gregory N. Carlson - 2001 - Linguistics and Philosophy 24 (4):417-466.
Improving Methodology of Quantifier Comprehension Experiments.Jakub Szymanik & Marcin Zajenkowski - 2009 - Neuropsychologia 47 (12):2682--2683.
Computational complexity of some Ramsey quantifiers in finite models.Marcin Mostowski & Jakub Szymanik - 2007 - Bulletin of Symbolic Logic 13:281--282.
Plural Predication and the Strongest Meaning Hypothesis.Yoad Winter - 2001 - Journal of Semantics 18 (4):333-365.
Children's acceptance of underinformative sentences: The case of some as a determiner.Valentina Sala, Laura Macchi, Marco D'Addario & Maria Bagassi - 2009 - Thinking and Reasoning 15 (2):211-235.
Understanding Quantifiers in Language.Jakub Szymanik & Marcin Zajenkowski - 2009 - In N. A. Taatgen & H. van Rijn (eds.), Proceedings of the 31st Annual Conference of the Cognitive Science Society.
Deterministic chaos and computational complexity: The case of methodological complexity reductions. [REVIEW]Theodor Leiber - 1999 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 30 (1):87-101.
Added to PP
Historical graph of downloads
Citations of this work
Easy Solutions for a Hard Problem? The Computational Complexity of Reciprocals with Quantificational Antecedents.Fabian Schlotterbeck & Oliver Bott - 2013 - Journal of Logic, Language and Information 22 (4):363-390.
References found in this work
No references found.