1980
DOI: 10.3758/bf03329600
|View full text |Cite
|
Sign up to set email alerts
|

Analysis of search times in paired associates learning

Abstract: It was tentatively suggested that a long unsuccessful search on Trial n of a paired associate task might be associated with a higher probability of recall on Trial n + 1 than would a short search. The reasons for thinking this included the evidence that several test trials can be associated with good recall and that items found with difficulty in a retrieval task were later well recalled in a free recall task. The prediction was not confirmed, however, in either of two studies. Data are presented on the reduct… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1982
1982
1982
1982

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 5 publications
0
1
0
Order By: Relevance
“…Such a result, it could be argued, might also be obtained in a situation where no initial study was made of the lists; that is, it might simply be a reflection of the inverse correlation between rated associability and rank in free output. But it has been shown elsewhere (Murray, 1980) that when lists of mean ratings 3.52, 2.33, and 1.50, and of approximately equal word frequency, were learned to a high criterion, there was a significant Associability X Trials interaction, with the lists of low associability taking several more trials to learn than lists of high associability. Moreover, Shapiro (1969) has used the sensitive measure of retrieval latency to show a relationship between associability and retrieval efficiency.…”
Section: Discussionmentioning
confidence: 87%
“…Such a result, it could be argued, might also be obtained in a situation where no initial study was made of the lists; that is, it might simply be a reflection of the inverse correlation between rated associability and rank in free output. But it has been shown elsewhere (Murray, 1980) that when lists of mean ratings 3.52, 2.33, and 1.50, and of approximately equal word frequency, were learned to a high criterion, there was a significant Associability X Trials interaction, with the lists of low associability taking several more trials to learn than lists of high associability. Moreover, Shapiro (1969) has used the sensitive measure of retrieval latency to show a relationship between associability and retrieval efficiency.…”
Section: Discussionmentioning
confidence: 87%