Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!swrinde!cs.utexas.edu!uunet!looking!brad From: brad@looking.on.ca (Brad Templeton) Newsgroups: comp.compression Subject: Re: fast string compr.? Message-ID: <1991May25.163433.21610@looking.on.ca> Date: 25 May 91 16:34:33 GMT References: <1991May23.235530.11443@looking.on.ca> <24May91.206106.345@franklin.com> Distribution: comp Organization: Looking Glass Software Ltd. Lines: 10 I apologize if I was a bit behind the times. The spelling checkers I use are both of the hash variety, and I have little trouble with them. Hashing variants run into danger on suggesting corrections, because you examine a couple of hundred permutations in the dictionary and this makes it likely you will run into an error, but I still think it can be put below a threshold. Of course you are right that it takes one user who doesn't understand this to cause nasty complaints... -- Brad Templeton, ClariNet Communications Corp. -- Waterloo, Ontario 519/884-7473