Theories

Four-set student lexical memory model with staged progression from introduction to long-term retention

Theory · All theories
Evidence · 2 claims (1 for, 1 against) · 1 study (1 causal), q3 · 0 of 1 report an effect size · 2 claims rest on one study

Description

The adaptive tutoring algorithm formalizes each student's lexical memory as four non-intersecting sets: "N – units assigned to the student and pending introduction; P – units in the process of active acquisition; S – units in the student's short-term memory; L – learned units (in the long-term memory)." Units move forward from N to P to S to L, with the only backward movement from S to P on recall failure. A unit enters short-term memory after at least four successful recalls in activities of increasing difficulty, and is deemed fully learned after remaining in short-term memory for at least seven days and still being recalled. The model is rooted in the Linguistic Automaton framework and the cybernetic approach to instruction as regulation.

Design Implications

Context

Requirements

Constraints

Target Learners

Target Learning Objectives

Claims

Examples

Key Sources

Page metadata
Field Value
type theory
title Four-set student lexical memory model with staged progression from introduction to long-term retention
description The adaptive tutoring algorithm formalizes each student's lexical memory as four non-intersecting sets: "N – units assigned to the student and pending introduction; P – units in the process of active acquisition; S –...
status review
generated by process:wiki-ingest on 2026-09-27
trust unverified — no one has confirmed this page's content
sources 1 — evgeny-chukharev-hudilainen-and-tatiana-a-klepikova-2016

Frontmatter is the page's machine-readable record — see the Schema & Guide.