Results 251 to 260 of about 112,618 (306)

Experiments in text file compression

Communications of the ACM, 1976
A system for the compression of data files, viewed as strings of characters, is presented. The method is general, and applies equally well to English, to PL/I, or to digital data. The system consists of an encoder, an analysis program, and a decoder. Two algorithms for encoding a string differ slightly from earlier proposals.
exaly   +2 more sources

Reorganizing compressed text

Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval, 2008
Recent research has demonstrated beyond doubts the benefits of compressing natural language texts using word-based statistical semistatic compression. Not only it achieves extremely competitive compression rates, but also direct search on the compressed text can be carried out faster than on the original text; indexing based on inverted lists benefits ...
Nieves R. Brisaboa   +3 more
openaire   +1 more source

A text compression algorithm

Information Systems, 1990
We present an algorithm using statistical information about word and digraph frequencies as well as the structural pattern concerning words with a common root and different suffixes. The single or composed most frequent words, included in a suitable dictionary, are encoded with a text pointer; the remaining words, where possible, are encoded according ...
SESSA, Maria Immacolata, PIERRO A.
openaire   +2 more sources

A Text Search Algorithm in Compressed Text

2021 International Conference on Information Technology (ICIT), 2021
A text search algorithm within compressed text using the compression algorithm in [1] is presented. This compression algorithm compresses a pair of letters into one letter through mapping the lower bytes of their unicodes into one unicode character. It utilizes the fact that the unicodes of a given natural language alphabet have the same upper byte ...
openaire   +1 more source

Home - About - Disclaimer - Privacy