Automata and Complexity in Multiple-Quantifier Sentence Verification

Abstract

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.all or all.some, influences the cognitive difficulty of the task. We discuss how computational modeling can account for the varying cognitive load in quantifier verification.


Back to Table of Contents