Importance

Loading Importance Indicators...

Abstract

Using LZW data compression/decompression processing techniques, textual input data is compressed by parsing consecutive words of the text into phrases and storing the phrases in a dictionary with compressed phrase codes associated therewith. The textual input data is searched by determining the longest match with the stored phrases in the dictionary and the compressed phrase code associated with the longest match is output to a compressed text database and stored at a location thereof. A list of references is maintained associated with each stored phrase to the locations in the compressed text database at which the compressed phrase code for the phrase is stored. Lists of word-to-phrase references are also created providing references for each distinct word encountered in the text to the stored phrases containing the word. Textual queries applied against the compressed text database utilize the dictionary and reference lists to access compressed database references and to decompress text in both directions from a referenced compressed text database location in order to provide information relative to the query.

Loading the Abstract Image...

First Claim