sign in sign up
<<
Home , Anki (software), Flashcard, Hermann Ebbinghaus, Leitner system, Mnemosyne (software), Paul Pimsleur

Spaced repetition 1

Spaced repetition is a technique that incorporates increasing intervals of time between subsequent review of previously learned material; this exploits the psychological . Alternative names include spaced rehearsal, expanding rehearsal, graduated intervals, repetition spacing, repetition scheduling, spaced retrieval and expanded retrieval.[1]

Research and Applications

The notion that spaced repetition could be used for improving learning was first proposed in the book of Study by Prof. C. A. Mace in 1932. In 1939, Spitzer tested the effects of a type of spaced repetition on 6th Graders in Iowa to learn science facts.[2] Spitzer , a computer program implementing spaced tested over 3600 students in Iowa and showed that spaced repetition repetition. was effective. This early work went unnoticed and the field was relatively quiet until the late 1960s when cognitive psychologists, notably including Landuaer & Bjork[3] and Melton,[4] explored manipulation of repetition timing as a means to improve . Around the same time, Pimsleur courses pioneered the practical application of spaced repetition theory to language learning and in 1973, devised his "", an all-purpose spaced repetition learning system based on .

At the time, spaced repetition learning was principally being implemented via systems; these systems were somewhat unwieldy since any significant study base requires many thousands of flashcards. With the increase in accessibility of personal computing, spaced repetition began to be implemented with computer-assisted language learning -based solutions in the 1980s. The aim of these programs was to tailor the repetition spacing based on learner performance.[5] To enable the user to reach a target level of achievement (e.g. 90% of all material correctly recalled at any given time point), the software adjusts the repetition spacing interval. Material that is hard is shown more often and material that is easy is shown less often, with hard or easy being defined by the ease with which the user is able to produce a correct response. There are several families of algorithms for scheduling spaced repetition: • Neural networks based • Sebastian Leitner system learning machines: 5 stages and an arbitrary number of stages • SM-family of algorithms (SuperMemo): SM-0 (a paper implementation) to SM-11 (in SuperMemo 2006) Some have theorized that the precise length of intervals does not have a great impact on algorithm effectiveness,[6] [7] although it has been suggested by others that the interval (expanded vs. fixed interval, etc.) is quite important; the experimental data regarding this point are mixed.[8] Spaced repetition 2

Pimsleur's graduated-interval recall Graduated-interval recall is a type of spaced repetition published by in 1967.[9] It is used in the Pimsleur language learning system and it is particularly suited to programmed audio instruction due to the very short times (measured in seconds or minutes) between the first few repetitions, unlike other forms of spaced repetition which may not require such precise timings. The intervals published in his paper were: 5 seconds, 25 seconds, 2 minutes, 10 minutes, 1 hour, 5 hours, 1 day, 5 days, 25 days, 4 months, 2 years. By timing a Pimsleur language program with a stopwatch, it is possible to verify that the intervals are not followed exactly but have upper and lower bounds. A similar principle (graduated intervals with upper and lower bounds) is used in at least one open source software project (Gradint [10]) to schedule its audio-only lessons.

Prominent researchers • • Thomas K. Landauer and Robert A. Bjork • Cecil Alec Mace

Prominent practitioners • Paul Pimsleur • Sebastian Leitner • Piotr Woźniak

Software Most programs are modeled like learning with flashcards: items to memorize are entered into the program as question-answer pairs; when a pair is due to be reviewed, the question is displayed on screen, and the user is supposed to attempt to remember the answer; when the user has succeeded or failed, he manually reveals the answer, and then tells the program how easily he recalled the answer or failed to. The program schedules pairs based on spaced repetition algorithms. Without a program the user has to schedule flashcards; this takes time and restricts to simple algorithms like the Leitner system. Further refinements are found: • Question/answer can be a sound-file to train the recognition of spoken words. • Automatic generations of pairs; e.g. for vocabulary it's useful to generate a three question-pairs, written foreign word, its pronunciation and its meaning, but data has to be typed only once. • Show addition information retrieved automatically, like example-sentences containing a word. • Support advanced input formats such as LaTeX. • Using a web platform instead of an installable program. • Combine spaced repetition with online community functions, e.g. sharing courses. Some Implementations: • Anki • • Flashcard Exchange • Smart.fm • Skritter • SuperMemo • Winflash Spaced repetition 3

• eSpindle Learning aka LearnThat.org The above list is not comprehensive, nor does it intend to be. The list of flashcard software provides a broader overview.

Further reading • Caple, C. (1996). "The Effects of Spaced Practice and Spaced Review on Recall and Retention Using Computer Assisted Instruction". Dissertation for the degree of Doctor of , North Carolina State University.[11] • de Boer, V. (2003, August). "Optimal Learning and the Spacing Effect: Theory, Application and based on the Chain Model". Artificial Intelligence Master's Thesis for Computational Psychology, University of Amsterdam.[12] • Dempster, F. N. (1988). "The Spacing Effect: A Case Study in the Failure to Apply the Results of Psychological ". American Psychologist, 43(8), 627-634. • Greene R. L. (2008). Repetition and spacing effects. In Roediger H. L. III (Ed.), Learning and memory: A comprehensive reference. Vol. 2: of memory (pp. 65–78). Oxford: Elsevier. • Karpicke, J. D., & Roediger, H. L. (2007). "Expanding Retrieval Practice Promotes Short-Term Retention, but Equally Spaced Retrieval Enhances Long-Term Retention". Journal of : Learning, * Memory, and , 33(4), 704-719.[13] • Kerfoot, B. P.; Baker, H. E.; Koch, M. O.; Connelly, D.; Joseph, D. B.; Ritchey, M. L. (2007). "Randomized, Controlled Trial of Spaced Education to Urology Residents in the and Canada". The Journal of Urology 177 (4): 1481–1487. doi:10.1016/j.juro.2006.11.074. PMID 17382760. • Pavlik, P. I. (2005). The Microeconomics of Learning: Optimizing Paired-Associate Memory. PhD, Carnegie Mellon. • Pavlik, P. I.; Anderson, J. R. (2008). "Using a model to compute the optimal schedule of practice" [14]. Journal of Experimental Psychology 14 (2): 101–117. doi:10.1037/1076-898X.14.2.101. PMID 18590367.

References [1] "Human Memory: Theory and Practice", Alan D. Baddeley, 1997 [2] Spitzer, H. F. (1939). Studies in retention. Journal of Educational Psychology, 30, 641–657. [3] Landauer, T. K., & Bjork, R. A. (1978). Optimum rehearsal patterns and name learning. In M. Gruneberg, P. E. Morris, & R. N. Sykes (Eds.), Practical aspects of memory (pp. 625–632). London: Academic Press. [4] Melton, A. W. (1970). The situation with respect to the spacing of repetitions and memory. Journal of Verbal Learning and Verbal Behavior, 9, 596–606. [5] See #Software [6] Cull, W. L. (2000). Untangling the benefits of multiple study opportunities and repeated testing for cued recall. Applied Cognitive Psychology, 14, 215–235.

[7] Peter Bienstman on Mnemosyne mailing list, May 2008 (http:/ / sourceforge. net/ mailarchiveforum.

php?thread_name=e713b0cc0805221309i32e13a6fv299782c1e8cb4e35@mail. gmail. com& forum_name=mnemosyne-proj-devel)

[8] Chapter 6:Is Expanded Retrieval Practice a Superior Form of Spaced Retrieval? (http:/ / www. psych. wustl. edu/ coglab/ publications/

Balota+ et+ al+ roddy+ chapter. pdf), A Critical Review of the Extant Literature, DAVID A. BALOTA, JANET M DUCHEK, and JESSICA M. LOGAN

[9] Pimsleur, Paul (February 1967). "A Memory Schedule" (http:/ / jstor. org/ stable/ 321812). The Modern Language Journal (Blackwell Publishing) 51 (2): pp. 73–75. doi:10.2307/321812.

[10] http:/ / people. pwf. cam. ac. uk/ ssb22/ gradint/

[11] http:/ / www. eric. ed. gov/ ERICWebPortal/ custom/ portlets/ recordDetails/ detailmini. jsp?_nfpb=true& _&

ERICExtSearch_SearchValue_0=ED427772& ERICExtSearch_SearchType_0=no& accno=ED427772

[12] http:/ / www. neuromod. org/ mnemo/ victor/ thesis

[13] http:/ / psych. wustl. edu/ memory/ Roddy%20article%20PDF%27s/ Karpicke_Roediger_2007_JEPLMC. pdf

[14] http:/ / www. apa. org/ pubs/ journals/ features/ xap142101. pdf Article Sources and Contributors 4 Article Sources and Contributors

Spaced repetition Source: http://en.wikipedia.org/w/index.php?oldid=422042300 Contributors: AVRS, Alexius08, Analogy, Andycjp, Apkawel, Arcan, Aruffo, Aternouth, Beck4140, Berny68, Bhaak, Bizmanualz, Bobo192, Boredzo, Carlh, Colonel Warden, Conversion script, DCDuring, Der Falke, Destynova, DetlevSchm, DickBryant, Dwbcampbell, Elwikipedista, Enchanter, Furrykef, GLari, Gaius Cornelius, Gam3, Gioto, Graham.tibbitts, Gwendamian, Gwern, Harryboyles, Hut 8.5, JLaTondre, Jirimotejlek, Jonahglick, Kalimera, Kappa, Khalid hassani, Liface, Magnus Manske, Mat Wilson, MaxHund, Maxim, Meegs, Micru, Miernik, Mquinlan3, Nbarth, Nicolas1981, NinjaKid, Notyourbroom, Nposs, Occuli, Omniphile, Padmasana, Paul.stadler, Pavel Vozenilek, Piotr Wozniak, Pipep, Ptmkenny, Rjwilmsi, Rosiewrose, SGGH, Sandstein, Savoylettuce, Silas S. Brown, Sonjaaa, Stefletch, The RedBurn, TimothyBourke, Tobias Bergemann, Turbolence, Vharron, Vlg, W-sky, Wapcaplet, WereSpielChequers, Wiki groot, Wikidio, Xophist, Youandme, Yug, 187 anonymous edits Image Sources, Licenses and Contributors

Image:Ankireview.png Source: http://en.wikipedia.org/w/index.php?title=File:Ankireview.png License: GNU General Public License Contributors: Damien Elmes License

Creative Commons Attribution-Share Alike 3.0 Unported

http:/ / creativecommons. org/ licenses/ by-sa/ 3. 0/