Recency order judgments in short term memory: Replication and extension of Hacker (1980)
preprint
OA: closed
Abstract
The classic finding from short-term relative JOR tasks is that correct response time (RT) depends on the lag to the more recent item but not to the less recent item (Hacker, 1980). For decades, researchers have argued that this finding is consistent with a self-terminating backward scanning model (Muter, 1979; Hacker, 1980; Hockley, 1984; McElree & Dosher, 1993). This finding has taken on new importance in light of recent proposal that many forms of memory depend on a compressed representation of the past (Howard, Shankar, Aue, & Criss, 2015). This paper replicates and extends the results of the classic papers. A Bayesian t-test showed substantial evidence for the null effect of lag to the less recent item on correct RT. In addition, this paper reports that correct RT is a sub-linear function of lag to the more recent probe and replicates the classic finding that error RT depends on lag to the less recent probe. These findings place new constraints on models of short-term memory scanning.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00