String compress

Article View: alt.sources.d

Article #1535

#1535

From: Warren Vonroeschlaub
Date: Fri, 18 Dec 1992 19:00

21 lines
1357 bytes

  Does anyone have any routines for compressing strings by the same method as
the Microsoft Help system?  This involves finding substrings in the text that
appear more than once and figuring out which 128 are the most common
non-overlapping strings.  It then creates a list of those strings, and the MH
program uses character codes 127-255 to code for those.

  I thought this would be simple (it is certainly simple to decode), but I am
having trouble with one situation.  If the word "the" appears 20 times in the
text, I can't seem to prevent the system from also creating compression for "th"
and "he" (without an enormous 100 line hack).

  Please E-mail as I will be rn-less for the next few weeks.  Thanks.

 |  __L__
-|-  ___  Warren Kurt vonRoeschlaub
 |  | o | kv07@iastate.edu
 |/ `---' Iowa State University
/|   ___  Math Department
 |  |___| 400 Carver Hall
 |  |___| Ames, IA  50011
 J  _____

Technical Details

Message-ID: <1992Dec18.130028@IASTATE.EDU>

Path: arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!uwm.edu!ux1.cso.uiuc.edu!news.iastate.edu!IASTATE.EDU!kv07

Show Full Headers

Complete Article Headers

Newsgroups: alt.sources.d
Path: arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!uwm.edu!ux1.cso.uiuc.edu!news.iastate.edu!IASTATE.EDU!kv07
From: kv07@IASTATE.EDU (Warren Vonroeschlaub)
Subject: String compress
Message-ID: <1992Dec18.130028@IASTATE.EDU>
Sender: news@news.iastate.edu (USENET News System)
Reply-To: kv07@IASTATE.EDU (Warren Vonroeschlaub)
Organization: Ministry of Silly Walks
Date: Fri, 18 Dec 1992 19:00:28 GMT
Lines: 21