Journal of Communication Disorder 44:2011 (2011)
| Authors |
|
| Abstract |
We compared the processing of natural language quantifiers in a group of patients with
schizophrenia and a healthy control group. In both groups, the difficulty of the quantifiers was
consistent with computational predictions, and patients with schizophrenia took more time to solve the problems. However, they were significantly less accurate only with proportional quantifiers, like more than half. This can be explained by noting that, according to the complexity perspective, only proportional quantifiers require working memory engagement.
|
| Keywords | working memory quantifiers computational complexity schizophrenia language impairments |
| Categories | (categorize this paper) |
| Options |
Mark as duplicate
Export citation
|
Download options
PhilArchive copy
Upload a copy of this paper Check publisher's policy Papers currently archived: 68,975
External links
(no proxy) Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
- Sign in / register and customize your OpenURL resolver..
- Configure custom resolver
References found in this work BETA
No references found.
Citations of this work BETA
Interpreting plural predication: homogeneity and non-maximality.Manuel Križ & Benjamin Spector - 2021 - Linguistics and Philosophy 44 (5):1131-1178.
Semantics of the Barwise Sentence: Insights From Expressiveness, Complexity and Inference.Dariusz Kalociński & Michał Tomasz Godziszewski - 2018 - Linguistics and Philosophy 41 (4):423-455.
An Analytic Tableaux Model for Deductive Mastermind Empirically Tested with a Massively Used Online Learning System.Nina Gierasimczuk, Han L. J. van der Maas & Maartje E. J. Raijmakers - 2013 - Journal of Logic, Language and Information 22 (3):297-314.
Processing of Numerical and Proportional Quantifiers.Sailee Shikhare, Stefan Heim, Elise Klein, Stefan Huber & Klaus Willmes - 2015 - Cognitive Science 39 (7):1504-1536.
Easy Solutions for a Hard Problem? The Computational Complexity of Reciprocals with Quantificational Antecedents.Fabian Schlotterbeck & Oliver Bott - 2013 - Journal of Logic, Language and Information 22 (4):363-390.
View all 8 citations / Add more citations
Similar books and articles
Quantifiers and Working Memory.Jakub Szymanik & Marcin Zajenkowski - 2010 - In Maria Aloni & Katrin Schulz (eds.), Amsterdam Colloquium 2009, LNAI 6042. Springer.
Understanding Quantifiers in Language.Jakub Szymanik & Marcin Zajenkowski - 2009 - In N. A. Taatgen & H. van Rijn (eds.), Proceedings of the 31st Annual Conference of the Cognitive Science Society.
Improving Methodology of Quantifier Comprehension Experiments.Jakub Szymanik & Marcin Zajenkowski - 2009 - Neuropsychologia 47 (12):2682--2683.
Computational Complexity of Some Ramsey Quantifiers in Finite Models.Marcin Mostowski & Jakub Szymanik - 2007 - Bulletin of Symbolic Logic 13:281--282.
Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language.Jakub Szymanik - 2010 - Linguistics and Philosophy 33 (3):215-250.
Almost All Complex Quantifiers Are Simple.Jakub Szymanik - 2010 - In C. Ebert, G. Jäger, M. Kracht & J. Michaelis (eds.), Mathematics of Language 10/11, Lecture Notes in Computer Science 6149. Springer.
A Note on Some Neuroimaging Study of Natural Language Quantifiers Comprehension.Jakub Szymanik - 2007 - Neuropsychologia 45 (9):2158-2160.
The Computational Complexity of Quantified Reciprocals.Jakub Szymanik - 2009 - In Peter Bosch, David Gabelaia & Jérôme Lang (eds.), Lecture Notes on Artificial Intelligence 5422, Logic, Language, and Computation 7th International Tbilisi Symposium on Logic, Language, and Computation. Springer.
Characterizing Definability of Second-Order Generalized Quantifiers.Juha Kontinen & Jakub Szymanik - 2011 - In L. Beklemishev & R. de Queiroz (eds.), Proceedings of the 18th Workshop on Logic, Language, Information and Computation, Lecture Notes in Artificial Intelligence 6642. Springer.
Quantifiers in TIME and SPACE. Computational Complexity of Generalized Quantifiers in Natural Language.Jakub Szymanik - 2009 - Dissertation, University of Amsterdam
Computational Semantics for Monadic Quantifiers.Marcin Mostowski - 1998 - Journal of Applied Non--Classical Logics 8 (1-2):107--121.
Computational Complexity of the Semantics of Some Natural Language Constructions.Marcin Mostowski & Dominika Wojtyniak - 2004 - Annals of Pure and Applied Logic 127 (1-3):219--227.
A Generalized Quantifier Concept in Computational Complexity Theory.Heribert Vollmer - 1999 - In Generalized Quantifiers and Computation (Aix-En-Provence, 1997). Springer. pp. 99--123.
Contribution of Working Memory in the Parity and Proportional Judgments.Jakub Szymanik & Marcin Zajenkowski - 2011 - Belgian Journal of Linguistics 25:189-206.
Analytics
Added to PP index
2011-11-08
Total views
61 ( #185,096 of 2,498,160 )
Recent downloads (6 months)
3 ( #212,239 of 2,498,160 )
2011-11-08
Total views
61 ( #185,096 of 2,498,160 )
Recent downloads (6 months)
3 ( #212,239 of 2,498,160 )
How can I increase my downloads?
Downloads
