PP-2009-19: Improving methodology of quantifier comprehension experiments

PP-2009-19: Szymanik, Jakub and Zajenkowski, Marcin (2009) Improving methodology of quantifier comprehension experiments. [Report]

[img]
Preview
Text (Full Text)
PP-2009-19.text.pdf

Download (21kB) | Preview
[img] Text (Abstract)
PP-2009-19.abstract.txt

Download (978B)

Abstract

Our investigation enriches and explains some data obtained by McMillan and Troiani. We have shown that the computational model correctly predicts that quantifiers computable by finite-automata are easier to understand than quantifiers recognized by push-down automata. It improves results of McMillan, which compared only first-order quantifiers with higher-order quantifiers, putting in one group quantifiers recognized by finite-automata as well as those recognized by push-down automata. Moreover, we have assessed differences between logical, parity, and numerical quantifiers. Additionally, decreased reaction time in the case of proportional quantifiers over ordered universes supports findings of McMillan, who attributed the hardness of these quantifiers to the necessity of using working memory.

Item Type: Report
Report Nr: PP-2009-19
Series Name: Prepublication (PP) Series
Year: 2009
Uncontrolled Keywords: quantifiers; neuroimaging; computational semantics
Subjects: Computation
Date Deposited: 12 Oct 2016 14:37
Last Modified: 12 Oct 2016 14:37
URI: https://eprints.illc.uva.nl/id/eprint/349

Actions (login required)

View Item View Item