The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
The zero-frequency problem: estimating the probabilities of novel events in adaptive text compression
Open accessAbstract
Approaches to the zero-frequency problem in adaptive text compression are discussed. This problem relates to the estimation of the likelihood of a novel event occurring. Although several methods have been used, their suitability has been on empirical evaluation rather than a well-founded model. The authors propose the application of a Poisson process model of novelty. Its ability to predict novel tokens is evaluated, and it consistently outperforms existing methods. It is applied to a practical statistical coding scheme, where a slight modification is required to avoid divergence. The result is a well-founded zero-frequency model that explains observed differences in the performance of existing methods, and offers a small improvement in the coding efficiency of text compression over the best method previously known.>
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
Jeffreys, H., Moran, P. A. P., & Chatfield, C. (1922) · Nature · doi:10.1093/oso/9780198503682.001.0001 · Cited by 7,878
A universal algorithm for sequential data compression
Ziv, J., & Lempel, A. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055714 · Cited by 5,456
Fisher, R. A., Corbet, A. S., & Williams, C. B. (1943) · The Journal of Animal Ecology · doi:10.2307/1411 · Cited by 3,487
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
Arithmetic coding for data compression
Witten, I. H., Neal, R. M., & Cleary, J. G. (1987) · Communications of the ACM · doi:10.1145/214762.214771 · Cited by 2,877
Self-citationData Compression Using Adaptive Coding and Partial String Matching
Cleary, J., & Witten, I. (1984) · IEEE Transactions on Communications · doi:10.1109/tcom.1984.1096090 · Cited by 1,241
Self-citationBell, T., Cleary, J. G., & Witten, I. H. (1990) · Cited by 988
Self-citationRissanen, J., & Langdon, G. G. (1979) · IBM Journal of Research and Development · doi:10.1147/rd.232.0149 · Cited by 751
Urn models and their application
Johnson, N. L. (1977) · Cited by 682
A locally adaptive data compression scheme
Bentley, J. L., Sleator, D. D., Tarjan, R. E., & Wei, V. K. (1986) · Communications of the ACM · doi:10.1145/5684.5688 · Cited by 523
Generalized Kraft Inequality and Arithmetic Coding
Rissanen, J. J. (1976) · IBM Journal of Research and Development · doi:10.1147/rd.203.0198 · Cited by 510
Rissanen, J., & Langdon, G. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056282 · Cited by 454
Estimating the number of unseen species: How many words did Shakespeare know?
EFRON, B., & THISTED, R. (1976) · Biometrika · doi:10.1093/biomet/63.3.435 · Cited by 439
THE NUMBER OF NEW SPECIES, AND THE INCREASE IN POPULATION COVERAGE, WHEN A SAMPLE IS INCREASED
GOOD, I. J., & TOULMIN, G. H. (1956) · Biometrika · doi:10.1093/biomet/43.1-2.45 · Cited by 416
Source coding algorithms for fast data compression
Pasco, R. C. (1976) · Cited by 191
A general minimum-redundancy source-coding algorithm
Guazzo, M. (1980) · IEEE Transactions on Information Theory · doi:10.1109/tit.1980.1056143 · Cited by 59
Cited by
“Librispeech: an ASR corpus based on public domain audio books,”
Panayotov, V., Chen, G., Povey, D., & Khudanpur, S. (2015) · 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) · doi:10.1109/icassp.2015.7178964 · Cited by 6,072
Unsupervised Learning by Probabilistic Latent Semantic Analysis
Hofmann, T. (2001) · Machine Learning · doi:10.1023/a:1007617005950 · Cited by 2,456
An empirical study of smoothing techniques for language modeling
Chen, S. F., & Goodman, J. (1999) · Computer Speech & Language · doi:10.1006/csla.1999.0128 · Cited by 2,066
Content-based Recommender Systems: State of the Art and Trends
Lops, P., de Gemmis, M., & Semeraro, G. (2011) · Recommender Systems Handbook · doi:10.1007/978-0-387-85820-3_3 · Cited by 1,898
Head-Driven Statistical Models for Natural Language Parsing
Collins, M. (2003) · Computational Linguistics · doi:10.1162/089120103322753356 · Cited by 1,826
Metadata
- Authors
- Witten, I. H., & Bell, T. C.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1991-07
- Volume
- 37
- Issue
- 4
- Pages
- 1085-1094
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2113641473
- Cited by
- 729
- References
- 16
- FWCI
- 3.35
- Type
- journal article
- Language
- en
- Open access
- green
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.