DocTreeDocTree

A learning path ready to make your own.

Spaced repetition explained

Spaced repetition — concise guide Spaced repetition (SR) is a learning method that schedules reviews at increasing intervals to time retrieval before forgetting, maximizing long-term retention while minimizing study time. Core idea Spread reviews over time (distributed practice) instead of massed rehearsal (cramming). Use retrieval practice to strengthen memory traces and reconsolidate information. Brief history 1885 — Ebbinghaus: forgetting curve and spacing effect. 1960s — Pimsleur: graded-interval language schedules. 1970s — Leitner: box-based flashcard system. 1980s–1990s — Woźniak: SuperMemo (SM-2) introduced algorithmic scheduling and ease factors. 2000s– — Anki and other apps popularized SR; recent work uses ML/predictive models. Why SR works (theoretical foundations) Spacing effect: distributed practice improves retention. Retrieval/testing effect: active recall strengthens memory more than passive review. Encoding/context variability: varied contexts provide more retrieval cues. Desirable difficulties: effortful retrieval leads to better long-term learning. Interference reduction & reconsolidation: spacing reduces interference and stabilizes memories. Key concepts and metrics Interval: time between reviews. Ease factor (EF): per-item multiplier controlling interval growth (SM-2 default ≈ 2.5; min ≈ 1.3). Repetitions (n): count of consecutive successful recalls. Quality score: subjective rating after review (0–5 in SM-2) used to update EF and schedule. Retention target / forgetting index: chosen recall probability at next review (commonly 80–90%). New cards/day & review load: practical controls for daily study time. Algorithms & scheduling strategies Leitner system: non-parametric boxes; correct answers move a card to a less-frequent box, incorrect ones return to box 1. Simple and physical-friendly. SM-2 (SuperMemo): classic algorithm using n, I (interval), EF, and quality q. Basic rules: If q < 3: reset repetitions (n=0) and schedule soon (I=1). Else increment n and set I = 1 (n=1), 6 (n=2), or previous_I × EF (n>2). Update EF by a small formula (floored at ≈1.3); default EF ≈ 2.5. Modern/adaptive models: BKT, PFA, Elo-like models, IRT, and ML predictors estimate recall probability from item/user features and compute review timing to hit retention targets. Building effective SR cards Principles: active recall, atomicity (one fact per card), minimal information, clear context, and use cloze deletions or image occlusions when helpful. Card types: basic Q/A, reversed pairs, cloze deletion, image occlusion, and code-snippet/cloze for programming. Examples: Vocabulary (front: "to eat (Spanish)" — back: "comer"); Cloze: "Yo {{c1::como}} manzanas."; Image occlusion: label parts of anatomy. Card-writing habits: avoid ambiguous questions, split multi-step answers, add mnemonics/imagery for difficult items. Workflows by domain Language: prioritize production (cloze, sentence recall), 10–30 new cards/day, short initial steps (minutes → 1 day). Medicine: image occlusion, cloze for pathways, tag by system, focus on high-yield facts and case-based cards. Programming: small problems, code-completion cloze cards plus deliberate practice projects. Exam prep: start early, consistent spacing, exam-style questions plus core-concept cards; avoid last-minute cramming as main strategy. Measuring success & tuning Track daily review time, retention percentage, maturity distribution, and backlog (overdue cards). Tuning heuristics: new cards/day 10–30 for beginners (up to 50–200 for heavy users); target retention 80–90%; initial learning steps like 10 minutes then 1 day. If reviews exceed capacity, reduce new cards or suspend low-priority tags. Limitations & criticisms Best for discrete factual knowledge; less effective alone for deep conceptual/problem-solving skills. Context dependence: same-study-context reviews can limit transfer. Interference from many similar items; risk of focusing on memorization instead of mastery. Requires consistent maintenance and upfront card creation time. Current research & trends Strong empirical support for spacing and testing effects (meta-analyses exist). Optimization models (Pavlik & Anderson) and ML personalization are active areas. Research on sleep, consolidation, and timing; growing interest in context-aware and physiological (neuroadaptive) scheduling. Future directions Real-time personalized schedulers using ML; curriculum-integrated SR; procedural/skill-oriented SR combined with simulation; AR/VR and context-aware cues; team/collaborative decks; neuroadaptive timing experiments. Practical checklist & starter settings Card rules: one fact per card, active recall, cloze when appropriate, use visuals/mnemonics for hard items. Daily routine: allocate 25–60 minutes; do overdue reviews first, then new cards. Starter algorithm settings (Anki/SM-like): new cards/day 20; initial steps 10 minutes → 1 day; starting ease 2.5; minimum ease 1.3; graduating intervals: 1 day then 6 days; target retention 85–90%. Maintain: prune low-value cards, tag and suspend temporary or low-yield sets. Common troubleshooting Backlog from too many new cards: cut new cards by ~50% until manageable. Cards repeatedly “hard/wrong”: rewrite, split, or add mnemonic/context. Confusion from similar items: add distinct context or imagery; avoid near-duplicate cards. Avoid relying solely on SR for skills—combine with practice, feedback, and projects. Conclusion Spaced repetition is an evidence-based, efficient method for retaining large amounts of discrete information. Its effectiveness increases when combined with high-quality card design, active practice, contextual variation, and sensible scheduling. Start small with well-crafted decks, monitor load and retention, and iterate. If you like, I can provide an Anki deck template (CSV/Anki), code to simulate SM-2 vs. optimized scheduling, or review sample cards and suggest rewrites.
Open full tree
Spaced repetition explainedFoundations of Spaced RepetitionTechniques and StrategiesPractical ApplicationsAdvanced Topics

Let the lesson walk with you.

Podcast

Spaced repetition explained podcast

0:00-3:34

Follow the trail that experts already trust.

Resources

Turn quick sparks into lasting recall.

Flashcards

Spaced repetition explained flashcards

16 cards

Question

Click to flip
Answer

Prove the idea before it slips away.

Quizzes

Spaced repetition explained quiz

13 questions

Which statement best defines spaced repetition (SR)?

Read deeper, connect wider, own the subject.

Deep Article

Spaced repetition explained — A complete guide

Spaced repetition is a powerful learning technique that schedules reviews of information at increasing intervals to exploit the brain’s natural forgetting process and maximize long-term retention while minimizing study time. This article provides a deep dive: history, cognitive foundations, algorithmic approaches, practical workflows, examples, common pitfalls, current research, and future directions.

Table of contents

  • What is spaced repetition?
  • Brief history and lineage
  • Theoretical foundations (why it works)
  • Key concepts and metrics
  • Algorithms and scheduling strategies
  • Leitner system
  • SM-2 (SuperMemo) and variants
  • Modern probabilistic/adaptive models
  • Pseudocode / Python example
  • How to build effective spaced-repetition cards
  • Card types and templates
  • Card-writing principles and examples
  • Workflows and settings (language, medicine, coding, exams)
  • Measuring success, tuning, and optimization
  • Limitations and criticisms
  • Current state of the field and research highlights
  • Future directions and innovations
  • Practical checklist and recommended starter settings
  • References and further reading

What is spaced repetition?

  • Definition: Spaced repetition (SR) is a study method that schedules reviews of memoranda at systematically increasing intervals. The goal is to prompt retrieval before forgetting completes, strengthening memory traces while using fewer reviews than massed practice.
  • Core idea: Instead of repeated, immediate rehearsal (cramming), spread reviews over time so memory consolidates and reconsolidates efficiently.

Brief history and lineage

  • Hermann Ebbinghaus (1885): Classic experimental work on memory and the forgetting curve—first systematic demonstration that memory decays over time and that distributed practice increases retention.
  • Pimsleur method (1960s): Applied graded-interval language learning schedule derived from practical observations.
  • Sebastian Leitner (1970s): Popularized a practical flashcard system using boxes to space reviews (the Leitner system).
  • Piotr Woźniak / SuperMemo (1980s–1990s): Introduced computer-implemented algorithms (SM family) that operationalized spacing intervals and “ease” factors; led to SM-2 algorithm and later refinements.
  • Modern tools: Anki (2006) and other apps (Memrise, Quizlet with SR features) democratized SR. Research and machine-learning models later sought to optimize scheduling.

Theoretical foundations (why spaced repetition works)

Multiple cognitive mechanisms explain SR’s effectiveness:

  • Spacing effect: Distributed practice yields better retention than massed practice (Ebbinghaus and many subsequent studies).
  • Retrieval practice / testing effect: Actively retrieving information strengthens memory more than passive review (Karpicke & Roediger).
  • Encoding variability / contextual variability: Revisiting material in different contexts or times provides more retrieval cues.
  • Desirable difficulties: Challenging retrieval enhances encoding and long-term retention (Bjork).
  • Reconsolidation: Reactivating memories followed by restabilization strengthens traces.
  • Interference reduction: Spacing reduces retroactive and proactive interference compared to dense learning.
  • Cognitive models: Forgetting often modeled by exponential or power functions; scheduling aims to time reviews when recall probability drops to a target.

Key concepts and metrics

  • Interval: Time between reviews of a given item.
  • Ease factor (EF): Item-specific multiplier that adjusts how quickly intervals grow.
  • Repetition count (n): How many consecutive successful recalls an item has had.
  • Quality score: Subjective rating after a review (0–5 in SM-2), used to update EF and intervals.
  • Retention target / forgetting index: The desired probability of recall at the next review (common targets: 80–90%).
  • New cards per day / review load: Practical control parameters for daily workload.
  • Maturity / stability: How robust an item’s memory trace is (often approximated by intervals and repetitions).
  • Spaced vs massed practice: Distributed exposures vs immediate repetition.

Algorithms and scheduling strategies

Leitner system (boxed flashcards)

  • Concept: Cards move through boxes. Correctly recalled cards move to the next (longer interval) box; incorrect ones return to box 1.
  • Practical: Simple, non-parametric, easy to implement with physical flashcards.
  • Example: Box 1 = daily, Box 2 = every 3 days, Box 3 = every 10 days, etc.

SM-2 (SuperMemo) — classic algorithm

  • Introduced by Piotr Woźniak (SM-2, used in early SuperMemo and widely adopted with slight variants).
  • Key variables: repetition count (n), interval (I), ease factor (EF), quality score (q ∈ 0..5).
  • Simplified logic:
  • If q < 3: reset n = 0, set next interval I = 1 (repeat soon).
  • Else:
  • If n = 1: I = 1 day
  • If n = 2: I = 6 days
  • Else: I = previous_I × EF
  • Increment n
  • Update EF: EF := max(1.3, EF + (0.1 - (5 - q)(0.08 + (5 - q)0.02)))
  • EF starts typically at 2.5.
  • This generates exponentially increasing intervals tempered by EF.

Pseudocode (SM-2) ``` function review_card(card, quality): if quality < 3: card.repetitions = 0 card.interval = 1 else: card.repetitions += 1 if card.repetitions == 1: card.interval = 1 elif card.repetitions == 2: card.interval = 6 else: card.interval = round(card.interval * card.ease)

update ease factor

card.ease = card.ease + (0.1 - (5 - quality) (0.08 + (5 - quality) 0.02)) if card.ease < 1.3: card.ease = 1.3 schedulenextreview(card, in_days=card.interval) ```

Python example (simplified) ```python class Card: def init(self): self.reps = 0 self.interval = 0 self.ease = 2.5

def sm2_review(card, quality): if quality < 3: card.reps = 0 card.interval = 1 else: card.reps += 1 if card.reps == 1: card.interval = 1 elif card.reps == 2: card.interval = 6 else: card.interval = round(card.interval card.ease) card.ease += 0.1 - (5 - quality) (0.08 + (5 - quality) * 0.02) if card.ease < 1.3: card.ease = 1.3 return card.interval ```

Modern/adaptive models

  • Bayesian Knowledge Tracing (BKT), Performance Factors Analysis (PFA), Elo-like models, and Item Response Theory (IRT) variants estimate latent knowledge and tailor intervals.
  • Pavlik & Anderson (2008) introduced models that optimize scheduling to maximize long-term retention given a study budget.
  • Recent systems use machine learning to predict recall probability from features (item difficulty, past history, time, context) and schedule reviews to hit retention targets.

Practical note: many apps combine heuristic rules with adaptive predictions (Anki’s default is SM-2 inspired but uses percent/multipliers; SuperMemo evolved to more complex models).

How to build effective spaced-repetition cards

Principles

  • Active recall: Design cards so the student must retrieve the answer (avoid recognition-only).
  • Atomicity: One fact per card. Don’t bundle unrelated facts.
  • Minimal information principle: Keep prompts concise; avoid excess information on the front.
  • Use cloze deletions for contextual sentences.
  • Mnemonics & imagery: For difficult-to-remember items, attach vivid cues.
  • Context-rich when needed: For understanding/procedural knowledge, include context to reduce interference.

Card types and templates

  • Basic (front/back): Simple Q/A.
  • Basic (and reversed): Two-way recall for pairs.
  • Cloze deletion: Fill-in-the-blank inside a sentence — excellent for language and fact contexts.
  • Image occlusion: Hide parts of diagrams (great for anatomy, circuits).
  • Code snippets: For programming, present a problem statement and expect code or output; use cloze to hide specific tokens.

Examples

  • Language vocab (basic):

Front: "to eat (Spanish)" Back: "comer"

  • Language cloze:

Text: "Yo ____ (to eat) manzanas." Cloze hidden: comer -> "Yo [comer] manzanas." (Answer: como)

  • Medicine (image occlusion):

Front: Heart diagram with left ventricle occluded Back: "Left ventricle — pumps oxygenated blood to systemic circulation"

Card-writing habits

  • Make cards about retrieval, not recognition....

Ready to see the full tree?

Clone the preview to open the complete learning structure, practice tools, and generated study materials.