Hypothetical: Making a word game and needing to check word..

[Taehl]

Of course. But I thought the goal was to avoid loading everything into memory?

[Robin]

Of course. But I thought the goal was to avoid loading everything into memory?

Even loading the full 228,000 words, and if each word took up 10 bytes, it would be 2 MB RAM used. Not enough to write a swapping mechanism for these days, I reckon.

[vrld]

In the same vain you shouldn't worry about runtime so much. For 250000 entries a hash will work just fine, even if there are collisions. Only when the number of words gets really big (and I mean really big, as in Google's search engine, or the wordnet database) you should invest your time in sophisticated data-structures and algorithms.

[josefnpat]

I have an English regex dictionary that I wrote, and here's the word library, maybe this helps.

I don't remember where I got this

words.english.txt

(217.3 KiB) Downloaded 90 times