Results 261 to 270 of about 112,618 (306)
Some of the next articles are maybe not open access.
ACM Computing Surveys, 1989
The best schemes for text compression use large models to help them predict which characters will come next. The actual next characters are coded with respect to the prediction, resulting in compression of information. Models are best formed adaptively, based on the text seen so far.
Timothy C. Bell +2 more
openaire +1 more source
The best schemes for text compression use large models to help them predict which characters will come next. The actual next characters are coded with respect to the prediction, resulting in compression of information. Models are best formed adaptively, based on the text seen so far.
Timothy C. Bell +2 more
openaire +1 more source
Text Data Compression Algorithms
, 1998 Contents 10 Text data compression algorithms 5 10.1 Text compression . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 10.2 Static Huffman coding . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 10.2.1 Encoding . .
Crochemore, Maxime, Lecroq, Thierry
openaire +3 more sources
Semi-lossless text compression
Data Compression Conference, 2004. Proceedings. DCC 2004, 2004A new notion, that of semi-lossless text compression, is introduced, and its applicability in various settings is investigated. First results suggest that it might be hard to exploit the additional redundancy of English texts, but the new methods could be useful in applications where the correct spelling is not important, such as in short emails, and ...
Yair Kaufman, Shmuel T. Klein
openaire +3 more sources
Approximate Searching on Compressed Text
15th International Conference on Electronics, Communications and Computers (CONIELECOMP'05), 2005The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of the pattern with the text can have a limited number of differences. This problem has diverse applications in information retrieval, computational biology and signal processing ...
Carlos Avendaño Pérez +2 more
openaire +1 more source
Text compression using prediction
Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '86, 1986In the compression of the text files, the dependencies between the successive characters should be exploited to as great an extent as possible. There are two obvious possibilities: either to detect and encode often occurring character strings, or to encode successors of character blocks. This paper presents two methods based on the latter approach.
Jukka Teuhola, Timo Raita
openaire +1 more source
ACM SIGACT News, 1993
A new approach to the "lossy" compression of text is described, based on the computational benefits of reading handwritten text, as opposed to text set in a more formal typographical style. Specifically, a new class of fonts, called vague fonts , are proposed which encode the vagueness of handwriting.
openaire +1 more source
A new approach to the "lossy" compression of text is described, based on the computational benefits of reading handwritten text, as opposed to text set in a more formal typographical style. Specifically, a new class of fonts, called vague fonts , are proposed which encode the vagueness of handwriting.
openaire +1 more source
Static compression for dynamic texts
Proceedings of IEEE Data Compression Conference (DCC'94), 2002The authors have explored the particular needs of large information retrieval systems, in which hundreds of megabytes of data are stored, retrieval is non-sequential, and new text is continually being appended. It has been shown that the word-based model can be adapted to cope well both with dynamic environments, and with situations in which decode ...
Alistair Moffat +2 more
openaire +1 more source
Compressed index for dynamic text
Data Compression Conference, 2004. Proceedings. DCC 2004, 2004This paper investigates how to index a text which is subject to updates. The best solution in the literature (P.Ferragina, et al., 1998) is based on suffix tree using O(n log n) bits of storage, where n is the length of the text. It supports finding all occurrences of a pattern P in O(|P|+occ) time, where occ is the number of occurrences.
Wing-Kai Hon +4 more
openaire +1 more source
Text Compression by Syntactic Pruning
2006We present a method for text compression, which relies on pruning of a syntactic tree. The syntactic pruning applies to a complete analysis of sentences, performed by a French dependency grammar. Sub-trees in the syntactic analysis are pruned when they are labelled with targeted relations.
Michel Gagnon, Lyne Da Sylva
openaire +1 more source
Morphological compression of Arabic text
Information Processing & Management, 1990Abstract The morphological compression of Arabic text is a compression technique that replaces some words in the original text by their roots and morphological patterns. This method is studied by developing a new method to reduce Arabic words to their roots and patterns, and by a compression algorithm that encodes reducible words into a three byte ...
Sabah S. Al-Fedaghi, Humoud B. Al-Sadoun
openaire +1 more source