Context Modeling for Text Compression

  • Daniel S. Hirschberg†
  • Debra A. Lelewer‡
Part of the The Kluwer International Series in Engineering and Computer Science book series (SECS, volume 176)


Adaptive context modeling has emerged as one of the most promising new approaches to compressing text. A finite-context model is a probabilistic model that uses the context in which input symbols occur (generally a few preceding characters) to determine the number of bits used to code these symbols. We provide an introduction to context modeling and recent research results that incorporate the concept of context modeling into practical data compression algorithms.


Memory Requirement Hash Table Data Compression Context Model Internal Memory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [A89]
    Abrahamson, D. M. An adaptive dependency source model for data compression. Commun. ACM 32, 1 (Jan., 1989), 77–83.MathSciNetCrossRefGoogle Scholar
  2. [BCW90]
    Bell, T., Clearly, J. G., and Witten, I. H. Text Compression, Prentice-Hall, Englewood Cliffs, N.J., 1990.Google Scholar
  3. [BM89]
    Bell, T. and Moffat, A. A note on the DMC data compression scheme. Comput. J. 32, 1 (Feb., 1989), 16–20.MathSciNetzbMATHCrossRefGoogle Scholar
  4. [BSTW86]
    Bentley, J. L., Sleator, D. D., Tarjan, R. E., and Wei, V. K. A locally adaptive data compression scheme. Commun. ACM 29, 4 (Apr., 1986), 320–330.CrossRefGoogle Scholar
  5. [CH87]
    Cormack, G. V. and Horspool, R. N. S. Data compression using dynamic Markov modeling. Comput. J. 30, 6 (Dec, 1987), 541–550.MathSciNetCrossRefGoogle Scholar
  6. [FG89]
    Fiala, E. R. and Greene, D. H. Data compression with finite windows. Commun. ACM 32, 4 (Apr., 1989), 490–505.CrossRefGoogle Scholar
  7. [HC86]
    Horspool, R. N. and Cormack, G. V. Dynamic Markov modelling — a prediction technique. Proc. International Conference on the System Sciences, Honolulu, HA. (Jan., 1986).Google Scholar
  8. [HC87]
    Horspool, R. N. and Cormack, G. V. A locally adaptive data compression scheme. Commun. ACM 16, 2 (Sept., 1987), 792–794.MathSciNetGoogle Scholar
  9. [H52]
    Huffman, D. A. A method for the construction of minimum-redundancy codes. Proc. IRE 40, 9 (Sept., 1952), 1098–1101.CrossRefGoogle Scholar
  10. [LR82]
    LANGDON, G. G. and Rissanen, J. J. A simple general binary source code. IEEE Trans. Inf. Theory 28, 5 (Sept., 1982), 800–803.zbMATHCrossRefGoogle Scholar
  11. [LR83]
    Langdon, G. G. and Rissanen, J. J. A double-adaptive file compression algorithm. IEEE Trans. Comm. 31, 11 (Nov., 1983), 1253–1255.zbMATHCrossRefGoogle Scholar
  12. [L91]
    Lelewer, D. A. Data Compression on Machines with Limited Memory, Ph. D. dissertation, Department of Information and Computer Science, University of California, Irvine, 1991.Google Scholar
  13. [LH91]
    Lelewer, D. A. and Hirschberg, D. S. Streamlining Context Models for Data Compression. Proc. Data Compression Conference, Snowbird, Utah (Apr., 1991), 313–322.Google Scholar
  14. [Mo89]
    Moffat, A. Word-based text compression. Software-Practice and Experience 19, 2 (Feb., 1989), 185–198.CrossRefGoogle Scholar
  15. [RL81]
    Rissanen, J. J. and Langdon, G. G. Universal modeling and coding. IEEE Trans. Inf. Theory 27, 1 (Jan., 1981), 12–23.MathSciNetzbMATHCrossRefGoogle Scholar
  16. [R82]
    Roberts, M. G. Local Order Estimating Markovian Analysis for Noiseless Source Coding and Authorship Identification, Ph. D. dissertation, Computer Science Dept., Stanford Univ.,, Stanford, 1982.Google Scholar
  17. [ST88]
    Storer, J. A. Data Compression: Methods and Theory, Computer Science Press, Rockville, Md., 1988.Google Scholar
  18. [W88]
    Williams, R. N. Dynamic-history predictive compression. Information Systems 13, 1 (Jan., 1988), 129–140.zbMATHCrossRefGoogle Scholar
  19. [W91A]
    Williams, R. N. Adaptive Data Compression, Kluwer Academic Publishers, Boston, 1991.zbMATHCrossRefGoogle Scholar
  20. [W91B]
    Williams, R. N. An extremely fast Ziv-Lempel data compression algorithm. Proc. Data Compression Conference, Snowbird, Utah (Apr., 1991), 362–371.Google Scholar
  21. [WNC87]
    Witten, I. H., Neal, R. M., and Cleary, J. G. Arithmetic coding for data compression. Commun. ACM 30, 6 (June, 1987), 520–540.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1992

Authors and Affiliations

  • Daniel S. Hirschberg†
    • 1
  • Debra A. Lelewer‡
    • 2
  1. 1.Department of Information and Computer ScienceUniversity of CaliforniaIrvineUSA
  2. 2.Computer Science Dept.California State Polytechnic UniversityPomonaUSA

Personalised recommendations