Automata and Complexity in Multiple-Quantifier Sentence Verification

Open Access
Authors
Publication date 2013
Host editors
  • R.L. West
  • T.C. Stewart
Book title Proceedings of ICCM 2013
Book subtitle 12th International Conference on Cognitive Modeling
Event 12th International Conference on Cognitive Modeling
Pages (from-to) 239-244
Publisher Ottawa: Carleton University
Organisations
  • Faculty of Humanities (FGw)
  • Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
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 ◦ Every or Every ◦ Some, influences the cognitive difficulty of the task. We discuss how computational modeling can account for the varying cognitive load in quantifier verification.
Document type Conference contribution
Language English
Published at https://www.semanticscholar.org/paper/Automata-and-Complexity-in-Multiple-Quantifier-Szymanik-Szymanik/1979e7dc002c3a791f7b1bcfe03b0d5601aa5d93 http://jakubszymanik.com/papers/ICCM2013.pdf https://iccm-conference.neocities.org/2013/proceedings/
Downloads
aac22442034c8ebdf1932e308081d1e9418a (Accepted author manuscript)
Permalink to this page
Back