bug in spell
Spencer W. Thomas
thomas%spline.uucp at utah-gr.UUCP
Fri Mar 6 14:57:50 AEST 1987
Spell uses a hash table to determine correctly spelled words. The
chance of a misspelled word hitting a `1' in the hash table is small,
but non-zero. Spell will pass many totally garbage sequences of
characters as being spelled "correctly". It is unfortunate that your
misspelling of "anniversary" gets a hit. We should note, however,
that spell would run *much* slower if it attempted to look each word
up in a dictionary.
=Spencer ({ihnp4,decvax}!utah-cs!thomas, thomas at utah-cs.ARPA)
More information about the Comp.bugs.4bsd.ucb-fixes
mailing list