Interpreting tractable versus intractable reciprocal sentences
| Autor: | Bott, O., Schlotterbeck, F., Szymanik, J., Bos, J., Pulman, S. |
|---|---|
| Přispěvatelé: | ILLC (FGw), Logic and Computation (ILLC, FNWI/FGw) |
| Jazyk: | angličtina |
| Rok vydání: | 2011 |
| Zdroj: | Proceedings of the Ninth International Conference on Computational Semantics: IWCS 2011 : January 12-14, 2011, Oxford, UK, 75-84 STARTPAGE=75;ENDPAGE=84;TITLE=Proceedings of the Ninth International Conference on Computational Semantics |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|