Department of Psychology.
J Exp Psychol Gen. 2020 Feb;149(2):230-248. doi: 10.1037/xge0000648. Epub 2019 Jul 15.
Do complex event representations fragment over time, or are they instead forgotten in an all-or-none manner? For example, if we met a friend in a café and they gave us a present, do we forget the constituent elements of this event (location, person, and object) independently, or would the whole event be forgotten? Research suggests that item-based memories are forgotten in a fragmented manner. However, we do not know how more complex episodic, event-based memories are forgotten. We assessed both retrieval accuracy and dependency-the statistical association between the retrieval successes of different elements from the same event-for complex events. Across 4 experiments, we show that retrieval dependency is found both immediately after learning and following a 12-hr and 1-week delay. Further, the amount of retrieval dependency after a delay is greater than that predicted by a model of independent forgetting. This dependency was only seen for coherent "closed-loops," where all pairwise associations between locations, people, and objects were encoded. When "open-loops" were learned, where only 2 out of the 3 possible associations were encoded, no dependency was seen immediately after learning or after a delay. Finally, we also provide evidence for higher retention rates for closed-loops than for open-loops. Therefore, closed-loops do not fragment as a function of forgetting and are retained for longer than are open-loops. Our findings suggest that coherent episodic events are not only retrieved, but also forgotten, in an all-or-none manner. (PsycINFO Database Record (c) 2020 APA, all rights reserved).
复杂事件的表示是否会随时间碎片化,还是会以全有或全无的方式被遗忘?例如,如果我们在咖啡馆遇到朋友并收到礼物,我们是否会独立地忘记事件的组成部分(地点、人物和物品),还是会忘记整个事件?研究表明,基于项目的记忆会以碎片化的方式被遗忘。然而,我们不知道更复杂的情节、基于事件的记忆是如何被遗忘的。我们评估了复杂事件的检索准确性和依赖性(即从同一事件中检索不同元素的统计关联)。在 4 个实验中,我们表明,无论是在学习后立即还是在 12 小时和 1 周延迟后,都可以找到检索依赖性。此外,延迟后检索依赖性的量大于独立遗忘模型预测的值。这种依赖性仅在连贯的“闭环”中可见,其中所有位置、人物和物品之间的所有成对关联都被编码。当学习“开环”时,即只编码 3 个可能关联中的 2 个,那么无论是在学习后还是延迟后,都不会出现依赖性。最后,我们还提供了闭环比开环具有更高保留率的证据。因此,闭环不会随遗忘而碎片化,其保留时间比开环长。我们的发现表明,连贯的情节事件不仅以全有或全无的方式被检索,而且也会被遗忘。