Accurate Computation of the Relative Entropy Between Stochastic Regular Grammars

@article{Carrasco1997AccurateCO,
  title={Accurate Computation of the Relative Entropy Between Stochastic Regular Grammars},
  author={Rafael C. Carrasco},
  journal={ITA},
  year={1997},
  volume={31},
  pages={437-444}
}
Works dealing with grammatical inference ofstochastic 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 itérative procedure to compute the relative entropy between two stochastic deterministic regular grammars is proposed, 

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

PAC-learnability of Probabilistic Deterministic Finite State Automata

Journal of Machine Learning Research • 2004
View 13 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Syntactic Pattern Récognition and Applications, 1982, Prentice Hall, Englewood Cliffs, New Jersey

K. S. Fu
vol. 31, n° 5, • 1997
View 1 Excerpt

and J

T. M. COVE
A. THOMAS, Eléments of Information Theory, • 1991

On the Inference of Stochastic Regular Grammars

A. van der Mude, A. Walker
Information and Control • 1978

and A

MUD A. VAN DER
WALKER, On the Inference of Stochastic Regular Grammars, Information and ControU • 1978
View 1 Excerpt

Similar Papers

Loading similar papers…