Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!uupsi!sunic!news.funet.fi!funic!nntp.hut.fi!nntp!laca From: laca@vipunen.hut.fi (Laszlo C Balint) Newsgroups: comp.compression Subject: fast string compr.? Message-ID: Date: 20 May 91 12:18:38 GMT Sender: usenet@nntp.hut.fi (Usenet pseudouser id) Distribution: comp Organization: Helsinki University of Technology, Finland Lines: 17 Nntp-Posting-Host: vipunen.hut.fi I am looking for an algorithm to compress and decompress strings of variable length. The compressed sequence can be fixed length too, but the process should be effective and reversable. I need it for a spell checker, where the number of words might be huge, but all they have to fit in the memory becuase of a frequent access (~20 lookups/checked word). Any help appreciated, especially if a C(++) code :-) Thanks in advance, laca -- Laszlo C. Balint ( Hungarian on the go ) laca@vipunen.hut.fi ------------------------------------------------------------------ | ....That's all folks. Flames, if you must, by mail please. They're | | easier to ignore that way. (Tony Lezard, with(out) permission) |