vosmiura Wrote:Just had to post a screenshot of how cool this is getting...I also add context sentences (2 before and 2 after), unknowns and matchedMorpheme (so I know what's new and thus to be especially focused on), i+N and vocabRank (mostly for seeing how well these work to gauge difficulty; no real pedagogical purpose) and the subs2srs time (reference so I can watch a scene in full for extra context / to appease my curiosity).
Images, audio & subs auto extracted with subs2srs.
Furigana auto generated by Anki.
Gloss auto generated by jmrGloss plugin.
Cards ordered by iPlusN with the Morphology plugin.
vix86 Wrote:Anyway, one of the rough points I hit in just pondering how to build the app was dealing with the issue of "how do you programmatically build a deck such that its like Core2k and all sentences build on each other in an n+1 or n+2 fashion?" Is that basically what the Maximum cardinality matching algorithm does?No. You could use the plugin to write some code that would do that though:
0) Given some source corpus of cards C, empty deck D, and known db K.
1) Copy K to K'.
2) Using known db K', add all i+1 cards in C to deck D and db K'.
3) Repeat (2) until deck is as large as you want it or there are no more i+1 cards to add.
A maximum cardinality bipartite matching:
Given two distinct sets of things A and B (eg, A = words to learn, B = cards you can learn them from), there is a set S of all possible combinations of 1 to 1 pairings of things in A to things in B.
That is, A and B form a bipartite graph and thus S contains bipartite matchings of A and B. So a maximum cardinality bipartite matching is simply the largest member of S (ie, the combination of pairings which has the most pairings).
Edited: 2011-05-26, 11:31 am