Main content

Contributors:
  1. Kristjan Kalm

Date created: | Last Updated:

: DOI | ARK

Creating DOI. Please wait...

Create DOI

Category: Project

Description: Memory for verbal material improves when words form familiar chunks. But how does the improvement due to chunking come about? Two possible explanations are that the input might be actively recoded into chunks, each of which takes up less memory capacity than items not forming part of a chunk (a form of data compression), or that chunking is based on redintegration. If chunking is achieved by redintegration, representations of chunks exist only in long-term memory and help to reconstructing degraded traces in short-term memory. In six experiments using two-alternative forced choice recognition and immediate serial recall, we find that when chunks are small (two words) they display a pattern suggestive of redintegration, while larger chunks (three words), show a pattern consistent with data compression. This is concurs with previous data showing that there is a cost involved in recoding material into chunks in short-term memory. With smaller chunks this cost seems to outweigh the benefits of recoding words into chunks. The main features of the serial recall data can be captured by a simple extension to the Primacy model of Page and Norris (1998).

License: CC-By Attribution 4.0 International

Has supplemental materials for Chunking and redintegration in verbal short-term memory on PsyArXiv

Files

Loading files...

Citation

Recent Activity

Loading logs...

OSF does not support the use of Internet Explorer. For optimal performance, please switch to another browser.
Accept
This website relies on cookies to help provide a better user experience. By clicking Accept or continuing to use the site, you agree. For more information, see our Privacy Policy and information on cookie use.
Accept
×

Start managing your projects on the OSF today.

Free and easy to use, the Open Science Framework supports the entire research lifecycle: planning, execution, reporting, archiving, and discovery.