SuperMemo

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

SuperMemo
SuperMemo Desktop
Developer(s)SuperMemo World, Piotr Woźniak
Stable release
Version 18.05 / October 29, 2020; 6 months ago (2020-10-29)
Written inDelphi
Operating systemWindows, Windows Mobile, Palm OS
Size48.1 MB
TypeAccelerated learning and memory software
LicenseProprietary
Websitewww.supermemo.com

SuperMemo (from "Super Memory") is a learning method and software package developed by SuperMemo World and SuperMemo R&D with Piotr Woźniak in Poland from 1985 to the present.[1] It is based on research into long-term memory, and is a practical application of the spaced repetition learning method that has been proposed for efficient instruction by a number of psychologists as early as in the 1930s.[2]

The method is available as a computer program for Windows, Windows CE, Windows Mobile, (Pocket PC), Palm OS (PalmPilot), etc. Course software by the same company (SuperMemo World) can also be used in a web browser or even without a computer.[3]

The desktop version of SuperMemo (since v. 2002) supports incremental reading, as well as traditional creation of question and answer flashcards.[4]

Software implementation[edit]

The SuperMemo program stores a database of questions and answers constructed by the user. When reviewing information saved in the database, the program uses the SuperMemo algorithm to decide what questions to show the user. The user then answers the question and rates their relative ease of recall - with grades of 1 to 5 (1 is the hardest, 5 is the easiest) - and their rating is used to calculate how soon they should be shown the question again. While the exact algorithm varies with the version of SuperMemo, in general, items that are harder to remember show up more frequently.[5]

Besides simple text questions and answers, the latest version of SuperMemo supports images, video, and HTML questions and answers.[6]

Since 2002, SuperMemo has had a unique set of features that distinguish it from other spaced repetition programs, called incremental reading (IR). Whereas earlier versions were built around users entering information they wanted to use, using IR, users can import text that they want to learn from. The user reads the text inside of SuperMemo, and tools are provided to bookmark one's location in the text and automatically schedule it to be revisited later, extract valuable information, and turn extracts into questions for the user to learn. By automating the entire process of reading and extracting knowledge to be remembered all in the same program, time is saved from having to manually prepare information, and insights into the nature of learning can be used to make the entire process more natural for the user. Furthermore, since the process of extracting knowledge can often lead to the extraction of more information than can actually be feasibly remembered, a priority system is implemented that allows the user to ensure that the most important information is remembered when they can't review all information in the system.[7]

Algorithms[edit]

The specific algorithms SuperMemo uses have been published, and re-implemented in other programs.

Different algorithms have been used; SM–0 refers to the original (non-computer-based) algorithm, while SM-2 refers to the original computer-based algorithm released in the 1987 (used in SuperMemo versions 1.0 through 3.0, referred to as SM-2 because SuperMemo version 2 was the most popular of these).[8][9] Subsequent versions of the software have further optimized the algorithm.

Piotr Woźniak, the developer of SuperMemo algorithms, released the description for SM-5 in a paper titled Optimization of repetition spacing in the practice of learning. Little detail is specified in the algorithms released later than that.

In 1995, SM-8, which capitalized on data collected by users of SuperMemo 6 and SuperMemo 7 and added a number of improvements that strengthened the theoretical validity of the function of optimum intervals and made it possible to accelerate its adaptation, was introduced in SuperMemo 8.[10]

In 2002, SM-11, the first SuperMemo algorithm that was resistant to interference from the delay or advancement of repetitions was introduced in SuperMemo 11 (aka SuperMemo 2002). In 2005, SM-11 was tweaked to introduce boundaries on A and B parameters computed from the Grade vs. Forgetting Index data.[10]

In 2011, SM-15, which notably eliminated two weaknesses of SM-11 that would show up in heavily overloaded collections with very large item delays, was introduced in Supermemo 15.[10]

In 2016, SM-17, the first version of the algorithm to incorporate the two component model of memory, was introduced in SuperMemo 17.[11]

The latest version of the SuperMemo algorithm is SM-18, released in 2019.[12]

Description of SM-2 algorithm[edit]

The first computer-based SuperMemo algorithm (SM-2)[9] tracks three properties for each card being studied:

  • The repetition number n, which is the number of times the card has been successfully recalled (meaning it was given a grade ≥ 3) in a row since the last time it was not.
  • The easiness factor EF, which loosely indicates how "easy" the card is (more precisely, it determines how quickly the inter-repetition interval grows). The initial value of EF is 2.5.
  • The inter-repetition interval I, which is the length of time (in days) SuperMemo will wait after the previous review before asking the user to review the card again.

Every time the user starts a review session, SuperMemo provides the user with the cards whose last review occurred at least I days ago. For each review, the user tries to recall the information and (after being shown the correct answer) specifies a grade q (from 0 to 5) indicating a self-evaluation the quality of their response, with each grade having the following meaning:

  • 0: "Total blackout", complete failure to recall the information.
  • 1: Incorrect response, but upon seeing the correct answer it felt familiar.
  • 2: Incorrect response, but upon seeing the correct answer it seemed easy to remember.
  • 3: Correct response, but required significant difficulty to recall.
  • 4: Correct response, after some hesitation.
  • 5: Correct response with perfect recall.

The following algorithm is then applied to update the three variables associated with the card:

algorithm SM-2 is
    input:  user grade q
            repetition number n
            easiness factor EF
            interval I
    output: updated values of n, EF, and I

    if q ≥ 3 (correct response) then
        if n = 0 then
            I ← 1
        else if n = 1 then
            I ← 6
        else
            I ← ⌈I × EFend if
        EFEF + (0.1 − (5 − q) × (0.08 + (5 − q) × 0.02))
        if EF < 1.3 then
            EF ← 1.3
        end if
        increment n
    else (incorrect response)
        n ← 0
        I ← 1
    end if

    return (n, EF, I)

After all scheduled reviews are complete, SuperMemo asks the user to re-review any cards they marked with a grade less than 4 repeatedly until they give a grade ≥ 4.

Non-SuperMemo implementations[edit]

Some of the algorithms have been re-implemented in other, often free programs such as Anki, Mnemosyne, and Emacs Org-mode's Org-drill. See full list of flashcard software.

The SM-2 algorithm has proven most popular in other applications, and is used (in modified form) in Anki and Mnemosyne, among others. Org-drill implements SM-5 by default, and optionally other algorithms such as SM-2 and a simplified SM-8.

References[edit]

  1. ^ Wolf, Gary (2008), "Want to Remember Everything You'll Ever Learn? Surrender to This Algorithm", Wired Magazine
  2. ^ Spitzer, Herbert F. (December 1939). "Studies in Retention" (PDF). Journal of Educational Psychology. 30 (9): 641–656. doi:10.1037/h0063404. ISSN 0022-0663.
  3. ^ Biedalak K., Murakowski J., Woźniak P.: Using SuperMemo without a computer – Paper and pencil method
  4. ^ Purdy, Kevin (2010), "Use Incremental Reading to Memorize Large Batches of Data", Lifehacker
  5. ^ Wolf, Gary (April 21, 2008). "Want to Remember Everything You'll Ever Learn? Surrender to This Algorithm". Wired. ISSN 1059-1028. Retrieved January 30, 2019.
  6. ^ "SuperMemo: What's new in SuperMemo 17?". super-memory.com. Retrieved January 30, 2019.
  7. ^ "SuperMemo Guru: Minimum Definition of Incremental Reading". supermemo.guru. Retrieved December 3, 2019.
  8. ^ P. A. Woźniak (1990). "Account of research leading to the SuperMemo method". Retrieved November 18, 2020.
  9. ^ a b P. A. Woźniak (1990). https://www.supermemo.com/en/archives1990-2015/english/ol/sm2. Retrieved November 18, 2020. Missing or empty |title= (help)
  10. ^ a b c "SuperMemo Algorithm - SuperMemo Help". help.supermemo.org. Retrieved May 1, 2019.
  11. ^ "Algorithm SM-17". supermemo.guru. Retrieved May 1, 2019.
  12. ^ "Algorithm SM-18". supermemo.guru. Retrieved May 9, 2020.

External links[edit]

Articles