Modelling transposition latencies: Constraints for theories of serial order memory
Modelling transposition latencies: Constraints for theories of serial order memory
复制标题
DOI：
10.1016/j.jml.2004.03.007
复制
发表时间：
2004-07-01
影响因子：
4.3
通讯作者：
Lewandowsky, S
中科院分区：
文献类型：
--
作者：
Farrell, S;Lewandowsky, S
短期记忆的几个相互竞争的理论可以在定量水平上解释连续回忆的表现。然而，迄今为止，大多数理论还没有被应用到伴随的反应延迟模式，从而忽视了丰富的和高度诊断方面的性能。本文探索并测试了表示序列顺序的四种替代机制的错误延迟预测。来自三个实验的数据表明，延迟是换位位移的负函数，例如，过早报告的列表项（在其正确的序列位置之前）比报告太晚的列表项回忆得更慢。我们通过模拟表明，这些数据排除了四个代表性的机制。数据支持的概念，序列顺序表示的首位梯度，伴随着抑制召回的项目。(C)2004年爱思唯尔公司All rights reserved.
Several competing theories of short-term memory can explain serial recall performance at a quantitative level. However, most theories to date have not been applied to the accompanying pattern of response latencies, thus ignoring a rich and highly diagnostic aspect of performance. This article explores and tests the error latency predictions of four alternative mechanisms for the representation of serial order. Data from three experiments show that latency is a negative function of transposition displacement, such that list items that are reported too soon (ahead of their correct serial position) are recalled more slowly than items that are reported too late. We show by simulation that these data rule out three of the four representational mechanisms. The data support the notion that serial order is represented by a primacy gradient that is accompanied by suppression of recalled items. (C) 2004 Elsevier Inc. All rights reserved.