The Entropy Of English Using Ppm-Based Models (1996)
| Venue: | In Data Compression Conference |
| Citations: | 31 - 6 self |
BibTeX
@INPROCEEDINGS{Teahan96theentropy,
author = {W. J. Teahan and John G. Cleary},
title = {The Entropy Of English Using Ppm-Based Models},
booktitle = {In Data Compression Conference},
year = {1996},
pages = {53--62},
publisher = {IEEE Computer Society Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper is to show that the difference between the best machine models and human models is smaller than might be indicated by these results. This follows from a number of observations: firsfly, the original human experiments used only 27 character English (letters plus space) against full 128 character ASCII text for most computer experiznents; secondly, using large amounts of priming text substantially improves PPM's performance; and thirdly, the PPM algorithm can k,e modified to perform better for English text. The result of this is machine performance down to 1.46 bpc
