Unbounded length contexts for PPM
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
The prediction by partial matching (PPM) data compression scheme has set the performance standard in lossless compression of text throughout the past decade. The original algorithm was first published in 1984 by Cleary and Witten, and a series of improvements was described by Moffat (1990), culminating in a careful implementation, called PPMC, which has become the benchmark version. This still achieves results superior to virtually all other compression methods, despite many attempts to better it. PPM, is a finite-context statistical modeling technique that can be viewed as blending together several fixed-order context models to predict the next character in the input sequence. Prediction probabilities for each context in the model are calculated from frequency counts which are updated adaptively; and the symbol that actually occurs is encoded relative to its predicted distribution using arithmetic coding. The paper describes a new algorithm, PPM*, which exploits contexts of unbounded length. It reliably achieves compression superior to PPMC, although our current implementation uses considerably greater computational resources (both time and space). The basic PPM compression scheme is described, showing the use of contexts of unbounded length, and how it can be implemented using a tree data structure. Some results are given that demonstrate an improvement of about 6% over the old method.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Compression of individual sequences via variable-rate coding
Ziv, J., & Lempel, A. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055934 · Cited by 3,432
Prediction and Entropy of Printed English
Shannon, C. E. (1951) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1951.tb01366.x · Cited by 2,686
Cited by
Online Sequential Prediction via Incremental Parsing: The Active LeZi Algorithm
Gopalratnam, K., & Cook, D. (2007) · IEEE Intelligent Systems · doi:10.1109/mis.2007.15 · Cited by 143
“PPM algorithms consider different-order Markov models in order to build a probability distribution [3].”
MethodA Note on Brain Actuated Spelling with the Berlin Brain-Computer Interface
Blankertz, B., Krauledat, M., Dornhege, G., Williamson, J., Murray-Smith, R., & Müller, K.-R. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-73281-5_83 · Cited by 106
“The implemented language model is a modified partial predictive-match (PPM) model ([21,22]), which comes close to the maximum possible compression for English ([23]).”
MethodCasagrande, F. D., Torresen, J., & Zouganeli, E. (2019) · IEEE Access · doi:10.1109/access.2019.2933994 · Cited by 13
“This last step is performed by the Prediction Partial Matching algorithm (PPM) [39], [40].”
Method
Metadata
- Authors
- Cleary, J. G., Teahan, W. J., & Witten, I. H.
- Venue
- Proceedings DCC '95 Data Compression Conference
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2002-11-19
- Pages
- 52-61
- ISSN
- 1068-0314 (ISSN-L)
- OpenAlex
- W2157906202
- Cited by
- 130
- References
- 2
- FWCI
- 11.15
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.