In J. Bos & S. Pulman (eds.), Proceedings of the International Conference on Computational Semantics 9 (2011)
AbstractIn three experiments, we investigated the computational complexity of German reciprocal sentences with different quantiﬁcational antecedents. Building upon the tractable cognition thesis (van Rooij, 2008) and its application to the veriﬁcation of quantiﬁers (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 quantiﬁer 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 veriﬁcation 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 quantiﬁer antecedents.
Similar books and articles
Interpreting tractable versus intractable reciprocal sentences.Oliver Bott, Fabian Schlotterbeck & Jakub Szymanik - forthcoming - In Proceedings of the International Conference on Computational Semantics.
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.
Distributivity strengthens reciprocity, collectivity weakens it.Hana Filip & Gregory N. Carlson - 2001 - Linguistics and Philosophy 24 (4):417-466.
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
Plural Predication and the Strongest Meaning Hypothesis.Yoad Winter - 2001 - Journal of Semantics 18 (4):333-365.
A Note on some Neuroimaging Study of Natural Language Quantifiers Comprehension.Jakub Szymanik - 2007 - Neuropsychologia 45 (9):2158-2160.
Why reciprocal altruism is not a kind of group selection.Grant Ramsey & Robert Brandon - 2011 - Biology and Philosophy 26 (3):385-400.
Contribution of Working Memory in the Parity and Proportional Judgments.Jakub Szymanik & Marcin Zajenkowski - 2011 - Belgian Journal of Linguistics 25:189-206.
Branching Quantification v. Two-way Quantification.Nina Gierasimczuk & Jakub Szymanik - 2009 - Journal of Semantics 26 (4):329-366.
The Epistemic Inadequacy of Ersatzer Possible World Semantics.Michael J. Shaffer & Jeremy Morris - 2010 - Logique Et Analyse 53:61-76.
Weak vs. strong Readings of donkey sentences and monotonicity inference in a dynamic setting.Makoto Kanazawa - 1994 - Linguistics and Philosophy 17 (2):109 - 158.
Added to PP
Historical graph of downloads