Automata and Complexity in Multiple-Quantifier Sentence Verification
Jakub Szymanik, Shane Steinert‐Threlkeld, Marcin Zajenkowski, Thomas Icard · UvA-DARE (University of Amsterdam) · 2013
We study possible algorithmic models for the picture verification task with double-quantified sentences of the form ‘Some X are connected with every Y’. We show that the ordering of quantifiers, either Some ◦ Every or Every ◦ Some, influences the cognitive difficulty of the task. We discuss how computational modeling can ac-count for the varying cognitive load in quantifier verifi-cation.