1971
DOI: 10.21236/ad0731161
|View full text |Cite
|
Sign up to set email alerts
|

Organization in Free Recall Learning: Output Contiguity and Interresponse Times as a Function of Presentation Structure.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
2
0

Year Published

1974
1974
1980
1980

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 28 publications
0
2
0
Order By: Relevance
“…The Monk structure has a PRO of ln (4), while ours has a PRO of ln (2). Premature rewriting of BQM in the first step of the Monk algorithm precluded recognition of the chunks QMCJ and MCJ.…”
mentioning
confidence: 99%
“…The Monk structure has a PRO of ln (4), while ours has a PRO of ln (2). Premature rewriting of BQM in the first step of the Monk algorithm precluded recognition of the chunks QMCJ and MCJ.…”
mentioning
confidence: 99%
“…When elements to be learned are preorganized into chunks and elements of a chunk are retrieved together before being overtly recalled, subjects can be expected to recall elements in bursts, pausing between bursts. Because pauses have been shown to fall at the boundaries of experimenter-defined chunks, (Bower & Springston, 1970;McLean & Gregg, 1967;Gelfand, 1971), pauses can be used to discover unknown chunks.…”
mentioning
confidence: 99%