Crates.io | spaced-rs |
lib.rs | spaced-rs |
version | 0.3.1 |
source | src |
created_at | 2022-05-22 17:34:49.839181 |
updated_at | 2022-08-28 14:58:49.489945 |
description | A small library implementing a sm2 inspired SR algorithm |
homepage | https://github.com/christhedevel/spaced-rs |
repository | https://github.com/christhedevel/spaced-rs |
max_upload_size | |
id | 591352 |
size | 49,749 |
This rust library aims to provide a simple and efficient but powerful implementation of a spaced repetition algorithm
$$P(t) = e^{-ft} = e^{-\frac{d}{m}t}$$
tries to make as little assumptions about item content/data as possible.
it does make the assumption though that the user in some way evaluates how each review event went.
provides two ways to adjust the result of the algorithm
For a better understanding of how the code works, read the source! (It is under 150 lines)
Modeling the forgetting curve requires including a bunch of parameters that can be quite arbitrary. To better set these values one would want a dataset of real review events and then try to fit the model to those items that performed the best. This approach though requires familiarity with such methods (which I don't have). Instead of doing this I'll instead rely on trying to best-guess some values and then introduce a way for the user to continuously evaluate the performance of the model. My hope is that I this way empirically can arrive at better default values for further and further revisions until I can create a fully data driven approach.
This library does not:
see ./LICENCE