bs@augusta.UUCP (Burch Seymour) (08/11/87)
Thanks to all that responded. To summarize what I learned:
Spell hashes the word being checked into a "hand-optimized" bit vector.
If the bit is set, then it's a real word, otherwise it's wrong. There
is no checking done to compare the string to another string so when
collisions occur, as in my cases, they are assumed to be valid words.
Most people with 4.3 BSD systems said the words checked out as valid
on their systems. I assume since the program and table are the same
regardless of the underlying hardware. The System V spell caught these
examples, but I was told that it uses the same algorithm, just a different
hash table so other patterns could probably get by.
Apparently the hashing is good enough so the error rate for real misspelled
words is very small. The examples I gave a strange enough that I doubt
anyone would type them by mistake. Still, it makes me wonder if there
aren't cases of real errors that get passed by.
Disclaimer: The above info was summarized from the responses I received.
If it's correct, I take no credit,
If it's wrong, it ain't my fault....
--------------------------------------------------------------------------------
##### Gould Computer Systems Division
### in Sunny South Florida
##### ##### Burch Seymour
##### #### => ...!{seismo,sun,pur-ee,brl-bmd}!gould!bseymour
##### ##### => ...!{ihnp4!codas,allegra}!novavax!gould!bseymour
## => NOTE: Disregard header info. Email to above paths only.
#### => The opinions expressed are probably not worth disclaiming
================================================================================