Will's blog

purpose: Will Kahn-Greene's blog of Miro, PyBlosxom, Python, GNU/Linux, random content, PyBlosxom, Miro, and other projects mixed in there ad hoc, half-baked, and with a twist of lemon

[ home | blog home | recent activity ]

Thu, 09 Sep 2004

GRE study thingy

I've got one of those GRE study guide prep book things and they have a wordlist of 3500 words that I should know. The breakdown is something like this:

That leaves 30% of the words to learn. Course, that's like 1000 words so I decided to put all the ones I didn't know in a wordlist file and wrote a quick application to pull up a random word from a random wordlist (the 3500 words are broken down into 50 or so wordlists) and give me the word and definition. I figure I'll start using them in emails and other digital correspondence and that way I'll cycle them into my vocabulary.

Feel free to join along in this little game of mine. It's a game I like to call, "I don't want to be studying--I want to be programming".

Comments:

Posted by Phil on Fri Sep 10 08:50:02 2004
> It's a game I like to call, "I don't want to be studying--I want to be programming".
Heh, I remember playing that game with SQL--in the end I decided better 5% studying than 0% studying, whatever gets you to study a little... :-)

--Phil.


Posted by Patrick Hall on Fri Sep 10 23:36:12 2004
Heh, that URL is my soon-to-be conversion to Pyblosxom ;)

Anyway, neat app!

You know, when I was learning Japanese characters, I got this book about memorizing the Kana (there are two sets of fifty). There is an appendix that explains a very cool way to memorize things, and it's funny to run across your app because I was thinking about how to code the technique up.

Basically, the idea was that you have you want to maximize the amount of time you spend on words that are hard for you to remember. It describes using index cards and a box, but of course it could be modeled with a data structure.

The card box is divided into a number of sub-boxes, more or less logarithmic-looking, in increasing size, like this:

|_|_|____|_______|

and you fill up the first compartment with cards until it's full. Then, you go through that set. If you remember a card, you can move it into the next container up. When there's space in the first container, you can add more -- but once the second container is filled up with learned cards, before you can move them into the third container, you have to check them again.

If you fail to remember, they go back into the first container.

The advantage is that the interval between checking the cards becomes greater and greater -- by the time a card finally gets into the last, big subcontainer, it's probably in your long-term memory.

I found it worked pretty well... but back in those days I didn't program. Anyway, it seems like something that would be easy to implement with a modified stack class.

Cheers,
Pat


Post a new comment:

Three things:

  1. New comments get placed in a "draft" status and will NOT show up on the site until I explicitly approve it. Sometimes that happens within 24 hours.
  2. I reserve the right to reject/remove inappropriate comments.
  3. Sometimes I'll reply to a comment directly in email--so make sure your email address is correct.

If you can't for some reason post a comment, send me an email: willg at bluesock dot org.

Your name:


Your e-mail address (this doesn't get displayed to anyone--sometimes I'll reply directly to you):


URL of your website (optional):


Comment:


Yes, I am a human!


pyblosxom::1.5-dev git-master

Copyright 1996 to 2012, Will Guaraldi Kahn-Greene, under the Creative Commons BY-SA 3.0 license

Creative Commons License
Will's Blog by William Kahn-Greene is licensed under a Creative Commons Attribution-ShareAlike 3.0 Unported License.