TH> Awhile back someone posted a text compression/decompression
  > routine that was simple and easy to implement. I have made some
  > improvements and cleaned it up so that you can better understand
  > how it works.
TH> 'This is a new string that renders slightly better compression
  > using 'my mail reader packet database.
RC> This message is kind of old, but what did you use to generate the
  > dictionary?
As I had mentioned - the source text came from my message base, which
is the main reason I would be interested in compression and lookup.
RC> I'm interested in the basic theory behind it. It looks to be
  > quite ingenious whilst being very simple.
Yes, simplicity is a beautiful thing. 
It plays on the fact that text characters seem to come up in repeating
patterns, like 'th' in 'the' and 'then,' and 's ' because lots of
words end in 's'
RC> BTW if you're still after a copy of the PB reserved words, the
  > 3.0c and 3.2 demo has a file called RES-WORD.TXT. It's about 28k
  > so I won't post it in here unless the moderator specifically
  > requests/permits it. Here's a small sample:
I didn't notice it, I'll have to take a second look. 
I have the list already in place. It works quite well.
Thanks.
 
___ Blue Wave/QWK v2.12
--- Maximus/2 3.01
---------------