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
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
Dialogue Act Modeling for Automatic Tagging and Recognition of Conversational Speech
Stolcke, A., Ries, K., Coccaro, N., Shriberg, E., Bates, R., Jurafsky, D., Taylor, P., Martin, R., Ess-Dykema, C. V., & Meteer, M. (2000) · Computational Linguistics · doi:10.1162/089120100561737 · Cited by 1,108
Metabolic Reconstruction for Metagenomic Data and Its Application to the Human Microbiome
Abubucker, S., Segata, N., Goll, J., Schubert, A. M., Izard, J., Cantarel, B. L., Rodriguez-Mueller, B., Zucker, J., Thiagarajan, M., Henrissat, B., et al. (2012) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1002358 · Cited by 1,056
Recovering traceability links between code and documentation
Antoniol, G., Canfora, G., Casazza, G., De Lucia, A., & Merlo, E. (2002) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2002.1041053 · Cited by 967
An empirical study of smoothing techniques for language modeling
Chen, S. F., & Goodman, J. (1996) · Proceedings of the 34th annual meeting on Association for Computational Linguistics - · doi:10.3115/981863.981904 · Cited by 770
Two decades of statistical language modeling: where do we go from here?
Rosenfeld, R. (2000) · Proceedings of the IEEE · doi:10.1109/5.880083 · Cited by 735
Relating the metatranscriptome and metagenome of the human gut
Franzosa, E. A., Morgan, X. C., Segata, N., Waldron, L., Reyes, J., Earl, A. M., Giannoukos, G., Boylan, M. R., Ciulla, D., Gevers, D., et al. (2014) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1319284111 · Cited by 704
Data from eye-tracking corpora as evidence for theories of syntactic processing complexity
Demberg, V., & Keller, F. (2008) · Cognition · doi:10.1016/j.cognition.2008.07.008 · Cited by 570
Code completion with statistical language models
Raychev, V., Vechev, M., & Yahav, E. (2014) · Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/2594291.2594321 · Cited by 555
Zhou, J., Zhang, H., & Lo, D. (2012) · 2012 34th International Conference on Software Engineering (ICSE) · doi:10.1109/icse.2012.6227210 · Cited by 507
Identifying personal microbiomes using metagenomic codes
Franzosa, E. A., Huang, K., Meadow, J. F., Gevers, D., Lemon, K. P., Bohannan, B. J. M., & Huttenhower, C. (2015) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1423854112 · Cited by 497
Moffat, A., Neal, R. M., & Witten, I. H. (1998) · ACM Transactions on Information Systems · doi:10.1145/290159.290162 · Cited by 471
Self-citationLearning to construct knowledge bases from the World Wide Web
Craven, M., DiPasquo, D., Freitag, D., McCallum, A., Mitchell, T., Nigam, K., & Slattery, S. (2000) · Artificial Intelligence · doi:10.1016/s0004-3702(00)00004-7 · Cited by 464
Similarity-Based Models of Word Cooccurrence Probabilities
Dagan, I., Lee, L., & Pereira, F. C. N. (1999) · Machine Learning · doi:10.1023/a:1007537716579 · Cited by 375
Zhou, J. H., Zhang, H., & Lo, D. (2012) · doi:10.5555/2337223.2337226 · Cited by 372
An Efficient, Probabilistically Sound Algorithm for Segmentation and Word Discovery
Brent, M. R. (1999) · Machine Learning · doi:10.1023/a:1007541817488 · Cited by 351
IRSTLM: an open source toolkit for handling large scale language models
Federico, M., Bertoldi, N., & Cettolo, M. (2008) · Interspeech 2008 · doi:10.21437/interspeech.2008-271 · Cited by 321
Probabilistic finite-state machines - part I
Vidal, E., Thollard, F., de la Higuera, C., Casacuberta, F., & Carrasco, R. C. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.147 · Cited by 301
Intricacies of Collins' Parsing Model
Bikel, D. M. (2004) · Computational Linguistics · doi:10.1162/0891201042544929 · Cited by 265
On Prediction Using Variable Order Markov Models
Begleiter, R., El-Yaniv, R., & Yona, G. (2004) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1491 · Cited by 258
Semantics-Aware Content-Based Recommender Systems
de Gemmis, M., Lops, P., Musto, C., Narducci, F., & Semeraro, G. (2015) · Recommender Systems Handbook · doi:10.1007/978-1-4899-7637-6_4 · Cited by 258
A Sentence-Based Copy Detection Approach for Web Documents
Yerra, R., & Ng, Y.-K. (2005) · Lecture Notes in Computer Science · doi:10.1007/11539506_70 · Cited by 53
“We adopt the N -gram approach over word frequencies because (i) N -grams frequencies are largely independent of the type of documents from which they come from [5], (ii) N -grams handle novel words robustly and provide an elegant solution to the zero-frequency problem addressed by [13], which estimates the likelihood…”
Method
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.