1965
DOI: 10.3758/bf03343470
|View full text |Cite
|
Sign up to set email alerts
|

Prediction of paired-associate latencies after the last error by an all-or-none learning model

Abstract: AbstraetAn all-or-none learning model is presented which makes predictions for response latencies in pairedassociate learning. The predicted latencies decrease on trials following the last error of a criterion run and accurately describe the latency data of an experiment by Peterson (1965). Problem Peterson (1965) has stated that "For an incremental view of learning, the latency of response would be expected to decrease after the S stops making errors. However, decreasing latencies after errors cease are diffi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

1966
1966
2009
2009

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 4 publications
0
2
0
Order By: Relevance
“…The fine-grain structure of adults’ recall data—by which we mean the empirical distributions of various error and success statistics in standard recall paradigms—is known to conform closely to the predictions of such chains (for a review, see Brainerd, Howe, & Desrochers, 1982). Although Miller (1952) was the first to propose that finite Markov chains are applicable to memory paradigms, the earliest two-stage models of recall were Theios and Hakes’s (1962) model of paired-associates recall and Waugh and Smith’s (1962) model of free recall. Various investigators soon confirmed that two-stage absorbing Markov chains delivered excellent fits to paired-associates recall, cued-recall, free-recall, and serial-recall data (e.g., Bower & Theios, 1963; Estes & DaPolito, 1967; Greeno, 1968; Halff, 1977; Kintsch, 1963; Kintsch & Morris, 1965; Pagel, 1973).…”
Section: An Identifiable Model Of Direct Access Reconstruction and Fa...mentioning
confidence: 99%
“…The fine-grain structure of adults’ recall data—by which we mean the empirical distributions of various error and success statistics in standard recall paradigms—is known to conform closely to the predictions of such chains (for a review, see Brainerd, Howe, & Desrochers, 1982). Although Miller (1952) was the first to propose that finite Markov chains are applicable to memory paradigms, the earliest two-stage models of recall were Theios and Hakes’s (1962) model of paired-associates recall and Waugh and Smith’s (1962) model of free recall. Various investigators soon confirmed that two-stage absorbing Markov chains delivered excellent fits to paired-associates recall, cued-recall, free-recall, and serial-recall data (e.g., Bower & Theios, 1963; Estes & DaPolito, 1967; Greeno, 1968; Halff, 1977; Kintsch, 1963; Kintsch & Morris, 1965; Pagel, 1973).…”
Section: An Identifiable Model Of Direct Access Reconstruction and Fa...mentioning
confidence: 99%
“…A newly learned association tends to be remembered more quickly each time it is tested within the course of an experimental session (Eimas & Zeaman, 1963;Millward, 1964;Kintsch, 1965;Peterson, 1965;Suppes et ai, 1966). The purpose of the present study was to see whether such a reduction in latency of recall is maintained over intervals of 24 h. If so, then it may be that overlearned associations are in fact transferred (Theios, 1965;Suppes et ai, 1966) to a rapid-access "permanent" memory store from some more temporary and less accessible system. If not, then the effect may simply denote a relatively temporary response set induced within the course of an experimental session (cf.…”
mentioning
confidence: 87%