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