246:(IR or "increading"). 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.
1074:
29:
235:
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 -
257:
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 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).
275:
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
271:
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.
236:
with grades of 0 to 5 (0 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.
560:
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.
279:
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.
529:
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.
308:, which loosely indicates how "easy" the card is (more precisely, it determines how quickly the inter-repetition interval grows). The initial value of
301:, 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.
1005:
319:, which is the length of time (in days) SuperMemo will wait after the previous review before asking the user to review the card again.
282:
In 2016, SM-17, the first version of the algorithm to incorporate the two component model of memory, was introduced in SuperMemo 17.
239:
Besides simple text questions and answers, the latest version of SuperMemo supports images, video, and HTML questions and answers.
327:
days ago. For each review, the user tries to recall the information and (after being shown the correct answer) specifies a grade
323:
Every time the user starts a review session, SuperMemo provides the user with the cards whose last review occurred at least
801:
1258:
242:
Since 2000, SuperMemo has had a unique set of features that distinguish it from other spaced repetition programs, called
331:(from 0 to 5) indicating a self-evaluation the quality of their response, with each grade having the following meaning:
185:
learning method that has been proposed for efficient instruction by a number of psychologists as early as in the 1930s.
119:
998:
606:
82:
1201:
825:
797:
261:
170:
42:
293:
The first computer-based SuperMemo algorithm (SM-2) tracks three properties for each card being studied:
53:
28:
991:
554:
772:
254:
The specific algorithms SuperMemo uses have been published, and re-implemented in other programs.
830:"Application of a computer to improve the results obtained in working with the SuperMemo method"
829:
354:
The following algorithm is then applied to update the three variables associated with the card:
641:
264:, the developer of SuperMemo algorithms, released the description for SM-5 in a paper titled
1150:
546:
134:
8:
1063:
243:
224:
930:
1217:
1186:
722:
880:
1196:
1125:
1073:
1028:
1014:
664:
616:
341:
2: Incorrect response, but upon seeing the correct answer it seemed easy to remember.
189:
182:
94:
258:
Subsequent versions of the software have claimed to further optimize the algorithm.
1043:
656:
611:
178:
129:
89:
698:
1232:
1227:
1222:
1110:
1090:
855:
542:
977:
1082:
1058:
1038:
1033:
970:
197:
98:
682:
1252:
1191:
1130:
668:
620:
538:
607:"Want to Remember Everything You'll Ever Learn? Surrender to This Algorithm"
338:
1: Incorrect response, but upon seeing the correct answer it felt familiar.
285:
The latest version of the SuperMemo algorithm is SM-18, released in 2019.
1237:
1105:
905:
217:
577:
268:
Little detail is specified in the algorithms released later than that.
193:
36:
223:
The desktop version of SuperMemo (since SuperMemo 10 (2000)) supports
1155:
1100:
1048:
963:
660:
227:, as well as traditional creation of question and answer flashcards.
209:
201:
109:
983:
931:"Super-Memo 2 Plugin for Super-Memo for Windows: Delphi Source Code"
747:
1140:
1120:
1115:
550:
166:
162:
1160:
1145:
1135:
205:
102:
537:
Some of the algorithms have been re-implemented in other, often
335:
0: "Total blackout", complete failure to recall the information.
169:
package developed by SuperMemo World and SuperMemo R&D with
145:
1095:
1053:
344:
3: Correct response, but required significant effort to recall.
266:
Optimization of repetition spacing in the practice of learning.
174:
1170:
773:"SuperMemo Guru: Minimum Definition of Incremental Reading"
177:
from 1985 to the present. It is based on research into
850:
848:
846:
802:"Account of research leading to the SuperMemo method"
966:â An introduction to spaced-repetition and SuperMemo
843:
820:
818:
188:The method is available as a computer program for
1250:
532:
288:
16:Spaced repetition memorization/learning software
815:
600:
598:
980:â A guide to using SuperMemo to study Japanese
999:
824:
796:
212:), etc. Course software by the same company (
595:
59:Version 19.03 / December 20, 2023
347:4: Correct response, after some hesitation.
1006:
992:
230:
681:Biedalak K., Murakowski J., WoĆșniak P.:
350:5: Correct response with perfect recall.
181:, and is a practical application of the
124:Accelerated learning and memory software
639:
1251:
973:â How SuperMemo can help learn English
856:"SuperMemo Algorithm - SuperMemo Help"
693:
691:
1013:
987:
640:Spitzer, Herbert F. (December 1939).
964:Use spaced-repetition software (SRS)
604:
688:
13:
683:Using SuperMemo without a computer
14:
1270:
951:
649:Journal of Educational Psychology
1072:
27:
923:
898:
873:
790:
765:
740:
715:
675:
633:
570:
315:The inter-repetition interval
1:
605:Wolf, Gary (April 21, 2008),
564:
533:Non-SuperMemo implementations
289:Description of SM-2 algorithm
249:
971:Learn English with SuperMemo
748:"SuperMemo Guru: Increading"
220:or even without a computer.
7:
723:"SuperMemo Screenshot Tour"
161:(from "Super Memory") is a
10:
1275:
1259:Spaced repetition software
978:Memory Software: SuperMemo
555:list of flashcard software
485:+ (0.1 − (5 −
1210:
1179:
1081:
1070:
1021:
685:â Paper and pencil method
140:
128:
118:
108:
88:
78:
74:
52:
48:
35:
26:
216:) can also be used in a
553:'s Org-drill. See full
489:) Ă (0.08 + (5 −
231:Software implementation
642:"Studies in Retention"
297:The repetition number
61:; 9 months ago
962:Tomasz P. Szynalski:
699:"SuperMemo 10 (2000)"
465:(incorrect response)
304:The easiness factor
1064:Incremental reading
244:incremental reading
225:incremental reading
23:
1218:Hermann Ebbinghaus
1187:Hermann Ebbinghaus
935:SuperMemo Articles
860:help.supermemo.org
727:help.supermemo.org
582:supermemopedia.com
406:(correct response)
386:updated values of
371:repetition number
21:
1246:
1245:
1197:Sebastian Leitner
1126:eSpindle Learning
1029:Spaced repetition
1015:Spaced repetition
969:Pawel Kowalczyk:
906:"Algorithm SM-18"
881:"Algorithm SM-17"
541:programs such as
183:spaced repetition
156:
155:
41:SuperMemo World,
1266:
1076:
1044:Forgetting curve
1008:
1001:
994:
985:
984:
946:
945:
943:
941:
927:
921:
920:
918:
916:
902:
896:
895:
893:
891:
877:
871:
870:
868:
866:
852:
841:
840:
838:
836:
822:
813:
812:
810:
808:
794:
788:
787:
785:
783:
769:
763:
762:
760:
758:
744:
738:
737:
735:
733:
719:
713:
712:
711:
709:
703:super-memory.com
695:
686:
679:
673:
672:
661:10.1037/h0063404
646:
637:
631:
630:
629:
627:
602:
593:
592:
590:
588:
574:
375:easiness factor
179:long-term memory
152:
149:
147:
90:Operating system
69:
67:
62:
31:
24:
20:
1274:
1273:
1269:
1268:
1267:
1265:
1264:
1263:
1249:
1248:
1247:
1242:
1233:Cecil Alec Mace
1228:Robert A. Bjork
1223:Thomas Landauer
1206:
1175:
1077:
1068:
1017:
1012:
976:Patrick Kenny:
954:
949:
939:
937:
929:
928:
924:
914:
912:
904:
903:
899:
889:
887:
879:
878:
874:
864:
862:
854:
853:
844:
834:
832:
823:
816:
806:
804:
795:
791:
781:
779:
771:
770:
766:
756:
754:
746:
745:
741:
731:
729:
721:
720:
716:
707:
705:
697:
696:
689:
680:
676:
644:
638:
634:
625:
623:
603:
596:
586:
584:
576:
575:
571:
567:
535:
527:
493:) Ă 0.02))
291:
252:
233:
214:SuperMemo World
144:
70:
65:
63:
60:
17:
12:
11:
5:
1272:
1262:
1261:
1244:
1243:
1241:
1240:
1235:
1230:
1225:
1220:
1214:
1212:
1208:
1207:
1205:
1204:
1199:
1194:
1189:
1183:
1181:
1177:
1176:
1174:
1173:
1168:
1163:
1158:
1153:
1148:
1143:
1138:
1133:
1128:
1123:
1118:
1113:
1108:
1103:
1098:
1093:
1087:
1085:
1083:Study software
1079:
1078:
1071:
1069:
1067:
1066:
1061:
1059:Leitner system
1056:
1051:
1046:
1041:
1039:Testing effect
1036:
1034:Spacing effect
1031:
1025:
1023:
1019:
1018:
1011:
1010:
1003:
996:
988:
982:
981:
974:
967:
959:
958:
953:
952:External links
950:
948:
947:
922:
910:supermemo.guru
897:
885:supermemo.guru
872:
842:
814:
789:
777:supermemo.guru
764:
752:supermemo.guru
739:
714:
687:
674:
655:(9): 641â656.
632:
612:Wired Magazine
594:
568:
566:
563:
551:Emacs Org-mode
534:
531:
356:
352:
351:
348:
345:
342:
339:
336:
321:
320:
313:
302:
290:
287:
251:
248:
232:
229:
198:Windows Mobile
154:
153:
142:
138:
137:
132:
126:
125:
122:
116:
115:
112:
106:
105:
99:Windows Mobile
92:
86:
85:
80:
76:
75:
72:
71:
58:
56:
54:Stable release
50:
49:
46:
45:
39:
33:
32:
15:
9:
6:
4:
3:
2:
1271:
1260:
1257:
1256:
1254:
1239:
1236:
1234:
1231:
1229:
1226:
1224:
1221:
1219:
1216:
1215:
1213:
1209:
1203:
1202:Piotr WoĆșniak
1200:
1198:
1195:
1193:
1192:Paul Pimsleur
1190:
1188:
1185:
1184:
1182:
1180:Practitioners
1178:
1172:
1169:
1167:
1164:
1162:
1159:
1157:
1154:
1152:
1149:
1147:
1144:
1142:
1139:
1137:
1134:
1132:
1131:Hello English
1129:
1127:
1124:
1122:
1119:
1117:
1114:
1112:
1109:
1107:
1104:
1102:
1099:
1097:
1094:
1092:
1089:
1088:
1086:
1084:
1080:
1075:
1065:
1062:
1060:
1057:
1055:
1052:
1050:
1047:
1045:
1042:
1040:
1037:
1035:
1032:
1030:
1027:
1026:
1024:
1020:
1016:
1009:
1004:
1002:
997:
995:
990:
989:
986:
979:
975:
972:
968:
965:
961:
960:
956:
955:
936:
932:
926:
911:
907:
901:
886:
882:
876:
861:
857:
851:
849:
847:
831:
827:
826:P. A. WoĆșniak
821:
819:
803:
799:
798:P. A. WoĆșniak
793:
778:
774:
768:
757:September 15,
753:
749:
743:
728:
724:
718:
704:
700:
694:
692:
684:
678:
670:
666:
662:
658:
654:
650:
643:
636:
622:
618:
614:
613:
608:
601:
599:
583:
579:
573:
569:
562:
558:
556:
552:
548:
544:
540:
530:
525:
521:
517:
513:
510:
506:
503:
499:
496:
492:
488:
484:
480:
477:
473:
469:
466:
463:
460:
456:
452:
448:
444:
441:
437:
434:
430:
427:
423:
420:
416:
413:
410:
407:
403:
400:
397:
393:
389:
385:
382:
378:
374:
370:
366:
363:
359:
355:
349:
346:
343:
340:
337:
334:
333:
332:
330:
326:
318:
314:
311:
307:
303:
300:
296:
295:
294:
286:
283:
280:
277:
273:
269:
267:
263:
262:Piotr WoĆșniak
259:
255:
247:
245:
240:
237:
228:
226:
221:
219:
215:
211:
207:
203:
199:
195:
191:
186:
184:
180:
176:
172:
171:Piotr WoĆșniak
168:
164:
160:
151:
148:.super-memory
143:
139:
136:
133:
131:
127:
123:
121:
117:
113:
111:
107:
104:
100:
96:
93:
91:
87:
84:
81:
77:
73:
57:
55:
51:
47:
44:
43:Piotr WoĆșniak
40:
38:
34:
30:
25:
19:
1165:
938:. Retrieved
934:
925:
913:. Retrieved
909:
900:
888:. Retrieved
884:
875:
863:. Retrieved
859:
835:November 18,
833:. Retrieved
807:November 18,
805:. Retrieved
792:
780:. Retrieved
776:
767:
755:. Retrieved
751:
742:
732:November 15,
730:. Retrieved
726:
717:
708:December 29,
706:, retrieved
702:
677:
652:
648:
635:
624:, retrieved
610:
587:December 25,
585:. Retrieved
581:
572:
559:
536:
528:
523:
519:
515:
511:
508:
504:
501:
497:
494:
490:
486:
482:
478:
475:
471:
470:â 0
467:
464:
461:
458:
454:
450:
446:
442:
439:
438:â 6
435:
432:
428:
425:
424:â 1
421:
418:
414:
411:
408:
405:
401:
398:
395:
391:
387:
383:
380:
376:
372:
368:
364:
361:
357:
353:
328:
324:
322:
316:
309:
305:
298:
292:
284:
281:
278:
274:
270:
265:
260:
256:
253:
241:
238:
234:
222:
213:
187:
158:
157:
37:Developer(s)
18:
1238:Hal Pashler
1211:Researchers
1106:Course Hero
782:December 3,
626:January 30,
578:"Main Page"
367:user grade
218:web browser
165:method and
135:Proprietary
940:August 23,
565:References
507:â 1.3
457:increment
453:)
250:Algorithms
194:Windows CE
79:Written in
66:2023-12-20
1166:SuperMemo
1156:OpenCards
1151:Mnemosyne
1101:Cobocards
1049:Flashcard
669:0022-0663
621:1059-1028
547:Mnemosyne
500:< 1.3
379:interval
358:algorithm
210:PalmPilot
202:Pocket PC
159:SuperMemo
22:SuperMemo
1253:Category
1141:Lingopie
1121:Duolingo
1116:Cram.com
1022:Concepts
957:Articles
828:(1990).
800:(1990).
474:â 1
445:â round(
167:software
163:learning
1161:Quizlet
1146:Memrise
1136:Kahoot!
426:else if
384:output:
312:is 2.5.
206:Palm OS
190:Windows
141:Website
130:License
114:12.5 MB
103:Palm OS
95:Windows
64: (
1096:Cerego
1054:Memory
915:May 9,
890:May 1,
865:May 1,
667:
619:
549:, and
512:return
509:end if
476:end if
455:end if
394:, and
365:input:
276:data.
175:Poland
83:Delphi
1171:Synap
645:(PDF)
360:SM-2
1111:Cram
1091:Anki
942:2021
917:2020
892:2019
867:2019
837:2020
809:2020
784:2019
759:2021
734:2023
710:2023
665:ISSN
628:2019
617:ISSN
589:2023
543:Anki
539:free
502:then
462:else
440:else
433:then
431:= 1
419:then
417:= 0
409:then
404:â„ 3
150:.com
120:Type
110:Size
657:doi
204:),
200:, (
173:in
146:www
1255::
933:.
908:.
883:.
858:.
845:^
817:^
775:.
750:.
725:.
701:,
690:^
663:.
653:30
651:.
647:.
615:,
609:,
597:^
580:.
557:.
545:,
526:)
522:,
520:EF
518:,
505:EF
498:EF
495:if
483:EF
481:â
479:EF
451:EF
449:Ă
412:if
399:if
392:EF
390:,
377:EF
362:is
310:EF
306:EF
196:,
192:,
101:,
97:,
1007:e
1000:t
993:v
944:.
919:.
894:.
869:.
839:.
811:.
786:.
761:.
736:.
671:.
659::
591:.
524:I
516:n
514:(
491:q
487:q
472:I
468:n
459:n
447:I
443:I
436:I
429:n
422:I
415:n
402:q
396:I
388:n
381:I
373:n
369:q
329:q
325:I
317:I
299:n
208:(
68:)
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
