Abstract

A Markovian model of repeated recall is presented that is based on four memory processes: (a) a presentation increment that strengthens the memory trace of a word when the word is shown to a subject, (b) a recall increment that strengthens the trace when the subject successfully recalls the word, (c) a cueing decrement that weakens the trace as contextual cues for retrieving a word change over successive trials of attempted recall, and (d) a sampling rule that translates the strength of a memory trace into a probability of recall. Mathematically, the model predicts the relative frequencies of the recall patterns that are defined by sequences of recalls and forgets for individual words over trials. According to the model, the recallability of a word depends on its state, which is a function of (a) whether the word has been recalled for the first time, and if so, then (b) how many consecutive forgets of the word immediately precede the current trial, (c) how many successful recalls of the word have accumulated, and (d) how many previous trials of attempted recall have elapsed. Paradigms that were well described by the model were (a) no reminding, in which words were presented once and then recalled repeatedly without additional presentations; (b) restricted reminding, in which words were presented before each trial of attempted recall up to their first successful recall but not thereafter; and (c) complete reminding, in which all words were presented befor each attempted recall, whether previously recalled or not. Differences in recall among these conditions were explained in terms of differences in values of the model's parameters.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.