Abstract
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.
Author supplied keywords
Cite
CITATION STYLE
APA
Carrasco, R. C. (1997). Accurate computation of the relative entropy between stochastic regular grammars. Theoretical Informatics and Applications, 31(5), 437–444. https://doi.org/10.1051/ita/1997310504371
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free