Interpreting tractable versus intractable reciprocal sentences
In Proceedings of the International Conference on Computational Semantics (forthcoming)
| 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. | |||||||||
| Keywords | reciprocal expressions computational complexity Strong Meaning Hypothesis P-Cognition Hypothesis | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,653 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesOliver Bott, Fabian Schlotterbeck & Jakub Szymanik (2011). Tractable Versus Intractable Reciprocal Sentences. In J. Bos & S. Pulman (eds.), Proceedings of the International Conference on Computational Semantics 9.
Jakub Szymanik (2009). The Computational Complexity of Quantified Reciprocals. 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.
Jakub Szymanik (2010). Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language. Linguistics and Philosophy 33 (3):215-250.
Sivan Sabato & Yoad Winter (2012). Relational Domains and the Interpretation of Reciprocals. Linguistics and Philosophy 35 (3):191-241.
Jakub Szymanik (2009). Quantifiers in TIME and SPACE. Computational Complexity of Generalized Quantifiers in Natural Language. Dissertation, University of Amsterdam
Hana Filip & Gregory N. Carlson (2001). Distributivity Strengthens Reciprocity, Collectivity Weakens It. Linguistics and Philosophy 24 (4):417-466.
Jakub Szymanik & Marcin Zajenkowski (2009). Improving Methodology of Quantifier Comprehension Experiments. Neuropsychologia 47 (12):2682--2683.
Jakub Szymanik & Marcin Zajenkowski (2009). Comprehension of Simple Quantifiers. Empirical Evaluation of a Computational Model. Cognitive Science: A Multidisciplinary Journal 34 (3):521-532.
Marcin Mostowski & Jakub Szymanik (2007). Computational Complexity of Some Ramsey Quantifiers in Finite Models. The Bulletin of Symbolic Logic 13:281--282.
Yoad Winter (2001). Plural Predication and the Strongest Meaning Hypothesis. Journal of Semantics 18 (4):333-365.
Valentina Sala, Laura Macchi, Marco D'Addario & Maria Bagassi (2011). Children's Acceptance of Underinformative Sentences: The Case of Some as a Determiner. Thinking and Reasoning 15 (2):211-235.
Valentina Sala, Laura Macchi, Marco D'Addario & Maria Bagassi (2011). Children's Acceptance of Underinformative Sentences: The Case of Some as a Determiner. Thinking and Reasoning 15 (2):211-235.
Jakub Szymanik & Marcin Zajenkowski (2009). Understanding Quantifiers in Language. In N. A. Taatgen & H. van Rijn (eds.), Proceedings of the 31st Annual Conference of the Cognitive Science Society.
Theodor Leiber (1999). Deterministic Chaos and Computational Complexity: The Case of Methodological Complexity Reductions. Journal for General Philosophy of Science 30 (1):87-101.
Analytics
Monthly downloads |
Added to index2010-11-26Total downloads36 ( #32,922 of 548,977 )Recent downloads (6 months)1 ( #63,511 of 548,977 )How can I increase my downloads? |
My notes
Discussion
