At 2:56 PM -0400 on 8/3/10, charles hottel wrote about Re: OF what use are one-bit counts for a bit string?:
I remember reading about a spell check program written for Unix that used a hash type function and a bit table to look up whether or not a word was spelled correctly.
All a Spell Checker does is verify if the supplied string represents a VALIDLY spelled word not the CORRECT word (or correct spelling of the intended word). Getting the correct word requires the use of a GRAMMAR checker or using IEBEYBAL (ie: Proofreading the text). Science Fiction Author had a sequence in one of his early Xanth novels where one of the characters had to write an essay and used Homophones (words with the same pronunciation but different spellings [such as "to/too/two"]) so that when read out loud the text was correct but not when it was just viewed.
