Comprehension of Simple Quantifiers. Empirical Evaluation of a Computational Model
Jakub Szymanik, Marcin Zajenkowski

Abstract:
We compare time needed for understanding different types of
quantifiers. In the first study, we show that the distinction between
quantifiers recognized by finite-automata and push-down automata is
psychologically relevant. In the second study, we compare
comprehension of push-down quantifiers in universes with randomly
placed objects and those where objects were ordered in some specific
way simplifying (with respect to memory resources) computational
task. The reaction time in the second case is significantly shorter
than in the first case.