Rahul Sharma (Editor)

SuperMemo

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit
Developer(s)
  
SuperMemo World

Website
  
supermemo.com

License
  
Proprietary

Stable release
  
version 2016 (v. 17.00) / June 2016; 9 months ago (2016-06)

Operating system
  
Windows, Windows Mobile, Palm OS, Web, more

Type
  
Accelerated learning and memory software

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. 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.

Contents

According to the developers of SuperMemo and some other proponents of spaced repetition learning, the process can optimize long-term knowledge acquisition.

The method is available as a computer program for Windows, Windows CE, Windows Mobile, (Pocket PC), iPhone, iPad, iPod Touch, (iTunes), Palm OS (PalmPilot), etc. It can also be used in a web browser or even without a computer.

The desktop version of SuperMemo (since v. 2002) supports incremental reading.

Software implementation

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 recall - did they answer the question easily, with hesitation, not at all, and so on - 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.

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

Algorithms

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). Subsequent versions of the software have further optimized the algorithm.

As of June 2016, the latest version of the SuperMemo algorithm is SM-17, released in 2016.

Criticism of SM3+

The SM-2 algorithm uses the performance on a card to schedule only that card, while SM-3 and newer algorithms use card performance to schedule that card and similar cards. The additional optimizations sometimes yield perverse results – answering "hard" on a card may yield an interval longer than answering "easy" on a card – and are criticized as reducing the robustness of the algorithm, making it more sensitive to variations – non-uniform difficulty of cards (a problem in versions 4 to 6, according to Woźniak), inconsistencies in studying, and so forth.

Woźniak disagreed with the criticism, but noted that in practice the other factors affecting study make it not very important.

Non-SuperMemo implementations

Some of the algorithms have been reimplemented 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.

References

SuperMemo Wikipedia