An estimate of an upper bound for the entropy of English
Computational Linguistics
Class-based n-gram models of natural language
Computational Linguistics
Hi-index | 0.00 |
The study of minimum entropy of English has a long history and has made a great progress, but only a few studies on other languages have been reported in literature so far. In this paper, we present a new method to estimate the minimum entropy of character in natural languages, based on two hypotheses of conservation of information quantity. We also verified the hypotheses empirically through experiments with two natural languages, Japanese and Chinese.