Path: utzoo!censor!geac!torsqnt!news-server.csri.toronto.edu!mailrus!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!rpi!uupsi!sunic!news.funet.fi!funic!santra!fuug!demos!avg
From: avg@hq.demos.su (Vadim G. Antonov)
Newsgroups: comp.unix.questions
Subject: Re: spell and /usr/dict/words.
Message-ID: <1990Aug29.092719.6423@hq.demos.su>
Date: 29 Aug 90 09:27:19 GMT
References: <7385@star.cs.vu.nl> <517@sun13.scri.fsu.edu> <13668@smoke.BRL.MIL>
Reply-To: avg@hq.demos.su (Vadim G. Antonov)
Organization: DEMOS, Moscow, USSR
Lines: 11

In article <517@sun13.scri.fsu.edu> mayne@VSSERV.SCRI.FSU.EDU (William (Bill) Mayne) writes:
>... For relatively long strings there are many hash collisions which
>cause nonwords to be accepted.

	You could defeat such effects by splitting dictionary
	into several different pieces (with different hash-tables)
	and patch spell's shell script to call spellers like that:

		spell {hash1} | spell {hash2} | spell {hash3}

	The words not filtered out by all spellers will appear at the end.