IEEE Transactions on Information Theory · 1988 · 55 citations · 12 references
ComputingComputer ScienceComputational LinguisticsNatural Language ProcessingSyntaxData CompressionLanguage ModelingParsingSyntactic AnalysisSyntax AnalysisText EncodingArithmetic CodingContext-free GrammarsEncodersEncoding AlgorithmsGrammar CompressionGrammar-based CompressionInformation CompressionParsing With Context-free Grammars
The use of syntactic information source models for the source encoding (data compression) of messages is described. Syntactic models formulated using context-free grammars augmented with derivation step probabilities are considered. Using an arithmetic coder as the low-level encoding unit, it is shown how practical encoding systems can be constructed from such models. Application of the techniques to the encoding of syntactically correct Pascal computer programs is described, and additional techniques including the use of symbol tables are introduced. The resultant syntactic encoders achieve compression of Pascal programs approaching 90%.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
12
Arithmetic coding for data compression
Ian H. Witten, Radford M. Neal, John G. Cleary · Communications of the ACM · 1987 · 2.9K citations · Full text
J. Rissanen, Glen G. Langdon · IBM Journal of Research and Development · 1979 · 739 citations
Variations on a theme by Huffman
Robert G. Gallager · IEEE Transactions on Information Theory · 1978 · 552 citations · Full text