Rote Learning and Memorisation

Memorisation is last-resort work on leftover facts with no hook. Those leftovers are names, constants, unordered lists, anything without a causal, functional, or conceptual connection. They are reached for after the conceptual structure is built, never as the way the topic is learned. Rote works. It is the wrong first tool.

Two tools do this work. A flashcard holds one leftover fact as a prompt and an answer. A drawn scene of invented objects, the method of loci, holds a leftover list, from a few items to thirty or more.

Core takeaways

• Memorisation is for the facts left over after the conceptual structure is built: names, constants, unordered lists, anything with no causal hook.
• Used too soon, isolated facts take the place of a structure, forget faster, and pile up past what the topic needs.
• A usable flashcard holds one prompt and one fact. Several facts on one card cannot be marked right or wrong, so the card cannot be scheduled.
• A deck counted in hundreds or thousands is the sign of a system compensating for shallow encoding, not of diligence.
• A list with no hook is held as one drawn scene of invented objects, each element caused by the one before it, and a finished scene can be entered at any point.
• Higher-Order Learning, Importance-Based Chunking, and Layers of Learning shrink the leftover pile before either tool is used, and Spaced Interleaved Retrieval sets the intervals between reviews.

What it costs early

Used too soon, isolated facts take the place of a structure. They forget faster. The pile grows past what the topic needs, and then the facts do not stay held. Reaching for these tools on most of the material means the structure upstream was skipped.

Two tools for the leftover

Two tools remain for the leftover the structure cannot hold. Flashcards hold that leftover as prompt-and-answer cards, one fact at a time, outer layer only. The method of loci holds a leftover list as a drawn scene, from a few items to thirty or more. They are two separate tools. They do not form a program.

The two differ in cost. Cards are cheap to make and are reviewed indefinitely. A scene is expensive once and then holds.

Both sit on top of the encoding and retrieval already running. They do not replace them.

What makes a usable card

A prompt-and-answer card trains recall only when it tests one leftover fact at a time. Used past leftover facts, the card becomes the week’s work. The leftover pile is names, constants, arbitrary lists, anything with no causal hook. A larger deck is not a sign of more diligence, and cards are not a first encoding system.

A usable card holds a single prompt: a question, a blank to fill, or image occlusion, where part of a picture is covered and the missing piece is asked for. Several facts on one prompt cannot be marked. Five blanks and one miss leave no legal score: the card is neither right nor wrong, so it cannot be scheduled. That scoring bind is why one thing per card is a rule rather than a slogan.

What belongs on a card is leftover. Relationships should already be encoded. Cards work on whatever they test, including concepts; the restriction is cost and sequencing, not a law of memory. A conceptual deck feels productive while it takes up the week.

When the deck shows the encoding was shallow

Hundreds or thousands of cards is the signature of a system compensating for shallow encoding, not of diligence. The bloated deck demands constant repeating time and creates overwhelm, crowding out the relational work that would have shrunk it.

A summary card states the information; it has no retrieval effect. A flashcard forces the answer before the check. Only the second trains memory. Restudy on a card is still restudy.

Cards work on whatever they test, so a conceptual deck keeps paying while it takes the week away from encoding. The price is repeating time. The quit signal is a deck that is the week’s main session, or a pile counted in hundreds. Success is a leftover pile small enough to review in spare minutes, with no dedicated block.

A small deck of leftover facts is the sign the rest of the system worked. The cards hold what has no hook. They are not a second encoding system.

Building the scene

The method of loci is a way of holding a list of unconnected facts as one drawn scene of strange objects, invented for those items rather than walked through a remembered building. A remembered fixture will not become the item; a door handle forced to stand for train is the image that fails. A shared building mixes lists, so recall hits an object without knowing which list the object belongs to. Each list gets its own invented picture instead, so objects fit the items and lists do not collide.

Leftover items do encode under a reread. The picture still carries more for a list with no hook. A wooden train is gone by the next day. A train with a forest growing inside it is not. If every object is equally bizarre, none stands out, and the effect is gone. The scene is not tied to a place, so no one location collects several lists. Each element is caused by the one before it, so each element’s neighbours bring back an item.

A finished scene can start from any point and still hold.

A scene that only runs forwards has an order but no connections between its elements. The encoding happens while the scene is worked out on paper. The original items sit beside the scene as a key.

What a scene is for and what it costs

A scene is for leftover single-use facts such as a date or an enzyme name. The operating band is a few items to thirty or more. Three items can be one figure.

What is stored this way comes back on demand without transferring or combining.

A leftover list takes minutes. A long one takes most of an hour, with later items costing more. A built scene needs a handful of later looks, the next day, a week later, a month later, and then the scene holds.

What shrinks the pile

Items with causal, functional, or conceptual relationships belong in a relational structure, and where one is viable it is built instead. Leftover facts stay leftover because understood material is remembered as it makes sense, so work upstream shrinks the pile.

Higher Order Learning is the conceptual core that must exist first, and it shrinks what is left. Importance Based Chunking absorbs anything that can be grouped. Layers of Learning is where leftover arbitrary detail sits once the conceptual layers have taken what they can. When Layers of Learning and Higher-Order Learning do that work first, most of the material becomes relevant and deeply held without a card, and the leftover pile is what remains.

Bear Hunter System is the encoding practice the two tools sit on top of. Revision is the retrieval loop that continues. Reviews run through Spaced Interleaved Retrieval. Neither tool invents intervals.

The tools manufacture a hold for facts the structure cannot hold. A scene builds, on purpose, the interdependence that understood material already has. That is why the tools work, and why they are last.

How to practice this

1. Build the conceptual structure first. Put onto cards or a scene only the facts left with no hook. Notice that the leftover pile is names, constants, and unordered lists.
2. Write each card with one prompt: a question, one blank, or one covered part of a picture. Notice that a one-prompt card can be marked right or wrong and then scheduled.
3. On each card, force the answer before looking at the answer. Notice that reading a summary card gives no retrieval effect.
4. Count the deck. If it is in the hundreds, or it is the week’s main session, stop adding cards and return to the relational work.
5. For a list, draw one scene of invented objects, each element caused by the one before it. Then start from a point in the middle and notice whether the scene still holds.
6. Look at a built scene the next day, a week later, and a month later. Notice that after those looks the scene holds.

Related pages

• Bear Hunter System: the encoding practice the two tools sit on top of; they do not replace it.
• Revision: the retrieval loop that continues.
• Higher Order Learning: the conceptual core that must exist first; the relational work that must precede cards and that shrinks what is left.
• Layers of Learning: where leftover arbitrary detail sits; the work that makes most of the material relevant and deeply held without a card.
• Spaced Interleaved Retrieval: the review schedule; neither tool invents intervals.

Open questions

• Whether rote-first on a short deadline outperforms structure-first for leftover lists.
• Whether a few relational cards, used after encoding, earn their keep or still fail the opportunity-cost test.

Sources

• Dunlosky, J., et al. (2013). Improving students’ learning with effective learning techniques. Psychological Science in the Public Interest. Rote and imagery techniques rate moderate in utility and narrow in scope; practice testing rates high; rereading rates low. A summary card is rereading on a card. The last-resort rule is about place in the sequence, not a finding that rote cannot encode.
• Rowland, C. A. (2014). The effect of testing versus restudy on retention. Psychological Bulletin. Recall tests outperform restudy.
• Wozniak, P. Twenty rules of formulating knowledge. https://supermemo.guru/wiki/20_rules_of_knowledge_formulation : one thing per card, as practitioner rule, not a trial.
• Maguire, E. A., Valentine, E. R., Wilding, J. M., & Kapur, N. (2003). Routes to remembering: the brains behind superior memory. Nature Neuroscience. Trained memorisers recruit spatial and navigational systems; no structural brain difference.
• Dresler, M., et al. (2017). Mnemonic training reshapes brain networks to support superior memory. Neuron. Six weeks of loci training roughly doubled word-list recall.
• McDaniel, M. A., & Einstein, G. O. (1986). Bizarre imagery as an effective memory aid: the importance of distinctiveness. Journal of Experimental Psychology: Learning, Memory, and Cognition. Bizarre imagery helps by relative distinctiveness, the bound on the absurdity rule.