[HTML][HTML] Computational complexity explains neural differences in quantifier verification
Different classes of quantifiers provably require different verification algorithms with different
complexity profiles. The algorithm for proportional quantifiers, like 'most', is more complex …
complexity profiles. The algorithm for proportional quantifiers, like 'most', is more complex …
The interplay of computational complexity and memory load during quantifier verification
Formal analysis of the minimal computational complexity of verification algorithms for natural
language quantifiers implies that different classes of quantifiers demand the engagement of …
language quantifiers implies that different classes of quantifiers demand the engagement of …
Degree of incrementality is modulated by experimental context–ERP evidence from German quantifier restriction
F Schlotterbeck, P Augurzky, R Ulrich - Language, Cognition and …, 2023 - Taylor & Francis
The current ERP study investigates the role of non-linguistic context in incremental semantic
comprehension. Using picture-sentence verification, we examined the neurophysiological …
comprehension. Using picture-sentence verification, we examined the neurophysiological …
Quantifiers and Complexity: The distinct neural signatures of verification algorithms for natural language quantifiers.
HS Bremnes - 2023 - ntnuopen.ntnu.no
This thesis concerns the impact of computational complexity on the verification of natural
language quantifiers. In particular, it deals with the neural consequences of so-called …
language quantifiers. In particular, it deals with the neural consequences of so-called …