论文信息 - Accurate Computation of the Relative Entropy Between Stochastic Regular Grammars

Accurate Computation of the Relative Entropy Between Stochastic Regular Grammars

Works dealing with grammatical inference of stochastic grammars often evaluate the relative entropy between the model and the true grammar by means of large test sets generated with the true distribution. In this paper, an iterative procedure to compute the relative entropy between two stochastic deterministic regular grammars is proposed.

Rafael C. Carrasco

[1] Thomas M. Cover,et al. Elements of Information Theory , 2005 .

[2] José Oncina,et al. Learning Stochastic Regular Grammars by Means of a State Merging Method , 1994, ICGI.

[3] Andreas Stolcke,et al. Hidden Markov Model} Induction by Bayesian Model Merging , 1992, NIPS.

[4] King-Sun Fu,et al. Syntactic Pattern Recognition And Applications , 1968 .

[5] Adrian Walker,et al. On the Inference of Stochastic Regular Grammars , 1978, Inf. Control..

[6] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .