Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter
}
TY - CHAP
T1 - Computational models of working memory for language
AU - Hitch, Graham
AU - Hurlstone, Mark
AU - Hartley, Tom
PY - 2022/7/31
Y1 - 2022/7/31
N2 - We start with a brief review of evidence that verbal working memory (WM) involves a limited capacity phonological loop capable of retaining verbal sequences for a few seconds in immediate serial recall, vocabulary acquisition, speech production and language comprehension. The challenge of explaining how such a system handles information about serial order is discussed in the context of computational models of the immediate recall of unstructured sequences of words, letters, or digits, an extensively studied laboratory task for which there are many benchmark findings. Evaluating computational models against these benchmarks suggests a serial ordering mechanism in which items are simultaneously active before being selected for sequential output by a process of competitive queuing (CQ). Further evidence shows how this process may operate in the context of sequences that conform to various kinds of linguistic constraint. We conclude by suggesting that CQ is a promising theoretical mechanism for connecting and potentially unifying theories of WM and language processing more generally despite major differences in their scope and level of abstraction.
AB - We start with a brief review of evidence that verbal working memory (WM) involves a limited capacity phonological loop capable of retaining verbal sequences for a few seconds in immediate serial recall, vocabulary acquisition, speech production and language comprehension. The challenge of explaining how such a system handles information about serial order is discussed in the context of computational models of the immediate recall of unstructured sequences of words, letters, or digits, an extensively studied laboratory task for which there are many benchmark findings. Evaluating computational models against these benchmarks suggests a serial ordering mechanism in which items are simultaneously active before being selected for sequential output by a process of competitive queuing (CQ). Further evidence shows how this process may operate in the context of sequences that conform to various kinds of linguistic constraint. We conclude by suggesting that CQ is a promising theoretical mechanism for connecting and potentially unifying theories of WM and language processing more generally despite major differences in their scope and level of abstraction.
M3 - Chapter
T3 - Cambridge Handbooks in Language and Linguistics
SP - 143
EP - 174
BT - The Cambridge Handbook of Working Memory and Language
A2 - Schwieter, John W.
A2 - Wen, Edward Z. S.
PB - Cambridge University Press
CY - Cambridge
ER -