Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

I upvoted this in hopes of generating some discussion about whether there might be a better way to do this. Here's one idea:

With very few exceptions, all of these words will contain at least one vowel. This suggests that we can (for the most part) compress the data from: (1) a list of 24 lists of words, to (2) a list of 6 sets of 2 lists of words.

So now "a" looks like this: bdefhjklmnptyz -a- abdeghilmnrstwxy

Now you can apply the same mnemonic trick to each of these word lists as the author does in the article, but you wind up only having to memorize 12 lists instead of 24, plus a slight overhead for non-vowel words (there are 4).

This can perhaps be improved further by removing redundancy somehow (though maybe not, as the redundant structure might be easiest to check mentally).



Author here. To be honest I posted it in the first place to hopefully generate some discussion about whether there might be a better way to do this(!). I think memorising 26 mnemonics is possible (and i disagree with the below commenter who says 124 individual words might be easier...) but perhaps the information can be further compressed. Can you elaborate on how your method works a little? How are the two lists derived?


Oh sorry, classic case of not realizing not everyone hears your thoughts :-)

For "a", there's a list where "a" is the first letter, and a list where "a" is the second. What I wrote out above is an attempt to show the structure. The letters on the left are possible prefixes for "a", the letters on the right are possible suffixes. Then I stuck "-a-" itself in the middle because that seems like a good visualization.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: