3 ms·
> Few engineers could build a good spell checker without external libraries, giving a database of valid words. Writing a spell checker that quickly identifies
by Aurornis 1y ago
> Few engineers could build a good spell checker without external libraries, giving a database of valid words.
Writing a spell checker that quickly identifies if a word is in a list of valid words (the problem described in the article) is a trivial problem for anyone who has basic algorithms and data structure knowledge. It's the classic example for using a trie: https://en.wikipedia.org/wiki/Trie https://en.wikipedia.org/wiki/Trie
The problem described in the article is doing it within very limited storage space. How do you store your list of 200K words on a system with only 256K of memory? This is the challenging part.
- mandeepj 1y ago> How do you store your list of 200K words on a system with only 256K of memory? Your hard disk is almost always larger than your RAM. You only load into memory what's needed at the moment. I hope that gives a hint on how to proceed with the above problem.
- dhosek 1y agoBut you don’t necessarily even have a hard disk. You might only have a 320K floppy. Floppy-only computers were pretty common in the late 80s when I was in undergrad.
- unregistereddev 1y agoIndeed, I remember having to insert a dedicated 5 1/4" floppy in order to run spell check in Apple Writer on an Apple ][e.
- mandeepj 1y agoLet's replace "hard disk" with "external storage". Shall we?
- sib 1y agoThe article refers to the need to support machines that did not even have hard disk drives.
- Hackbraten 1y agoWhat's a hard disk?
- aidenn0 1y agoOK. You have no hard disk, just a 360K floppy.