论文信息 - Entropies of Probabilistic Grammars

Entropies of Probabilistic Grammars

The usual concepts from information theory are defined and related to probabilistic grammars. The entropies of a derivation, a sentence and the average terminal symbol in a stream of sentences are calculated. How to maximize the information rate is shown, and the maximum is related to the classical notion of the capacity of a language.

Stephen Soule | S. Soule

[1] Sandra E. Hutchins. Moments of string and derivation lengths of stochastic context-free grammars , 1972, Inf. Sci..

[2] Taylor L. Booth,et al. Probabilistic Representation of Formal Languages , 1969, SWAT.

[3] Taylor L. Booth,et al. Applying Probability Measures to Abstract Languages , 1973, IEEE Transactions on Computers.

[4] Werner Kuich,et al. On the Entropy of Context-Free Languages , 1970, Inf. Control..

[5] J. Gillis,et al. Matrix Iterative Analysis , 1961 .

[6] D. Sankoff. Branching processes with terminal types: application to context-free grammars , 1971, Journal of Applied Probability.

[7] A. Gill. SWITCHING AND AUTOMATA THEORY. , 1970 .