Marcin Zajenkowski

Learn More
We examine the verification of simple quantifiers in natural language from a computational model perspective. We refer to previous neuropsychological investigations of the same problem and suggest extending their experimental setting. Moreover, we give some direct empirical evidence linking computational complexity predictions with cognitive reality. In the(More)
The paper explores the cognitive mechanisms involved in the verification of sentences with proportional quantifiers (e.g., "More than half of the dots are blue"). The first study shows that the verification of proportional sentences is more demanding than the verification of sentences such as: "There are seven blue and eight yellow dots". The second study(More)
We discuss a computational model of quantifier verification. It predicts that there is no effect of monotonicity on the verification of numerical quantifiers but only the interaction of monotonicty and sentential truth-values. Moreover, it predicts no monotonicity or interaction with truth-values effects for proportional quantifiers. We present an(More)
Article history: Received 22 March 2013 Received in revised form 30 May 2013 Accepted 25 June 2013 Available online xxxx The paper explores the relationship between intelligence and the semantic processing of natural language quantifiers. The first study revealed that intelligence is positively associated with the subjects' performance when solving a(More)
The paper presents a study examining the role of working memory in quantifier verification. We created situations similar to the span task to compare numerical quantifiers of low and high rank, parity quantifiers and proportional quantifiers. The results enrich and support the data obtained previously in [1–3] and predictions drawn from a computational(More)
Strategies used by people to verify quantified sentences, like ‘Most cars are white’, have been a popular research topic on the intersection of linguistics, computer science, philosophy, and psychology. A prominent computational model of the task, semantic automata, has been introduced by van Benthem in 1983. In this paper we present a probabilistic(More)
We compare time needed for understanding di erent types of quanti ers. In the rst study, we show that the distinction between quanti ers recognized by nite-automata and push-down automata is psychologically relevant. In the second study, we compare comprehension of push-down quanti ers in universes with randomly placed objects and those where objects were(More)
OBJECTIVE The author examines the relationship between energetic arousal (EA) and the processing of sentences containing natural-language quantifiers. BACKGROUND Previous studies and theories have shown that energy may differentially affect various cognitive functions. Recent investigations devoted to quantifiers strongly support the theory that various(More)
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(More)
A hypothesis that anger is related to high energetic arousal (EA), but only at a low level of agreeableness was tested. In the first two studies, the association between trait anger, agreeableness, and EA was explored. In the next two studies, the interactions of agreeableness with constructs conceptually and empirically close to EA, in predicting anger(More)