From: utzoo!decvax!ucbvax!C70:info-cpm
Newsgroups: fa.info-cpm
Title: Fast spelling checker
Article-I.D.: ucb.1732
Posted: Tue Aug 10 00:18:28 1982
Received: Thu Aug 12 04:56:20 1982

>From MADLER@Mit-Mc Tue Aug 10 00:17:46 1982
The search is binary (through the memory pointer to correct sector).
After that, it is sequential because of the packing method of the dictionary.
I think that the best suggestion I have received so far is to alphabetize
the input file in memory (can't be THAT many unique words), compare those
words to the dictionary, and then use the words in memory to write out
the marked file with a second pass of the input file.   This will serve
to eliminate the largest problem:  head travel.

More thoughts are welcome!
-Michael