Stochastic inference of regular tree languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1433, Issue , 1998, Pages 187-198

  Carrasco, Rafael C ^a   Oncina, Jose ^a   Calera, Jorge ^a  

^a UNIVERSITY OF ALICANTE   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS; FORESTRY; STOCHASTIC SYSTEMS;

LANGUAGE IDENTIFICATION; REGULAR TREE LANGUAGES; RELATIVE ENTROPY; STOCHASTIC INFERENCE; STRING LANGUAGES; STRUCTURAL INFORMATION; TREE LANGUAGES;

TREES (MATHEMATICS);

EID: 33846893464     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054075     Document Type: Conference Paper

References (13)

1. Aho, A.V. & Ullman, J.D. (1972): "The theory of parsing, translation and compiling. Volume I: Parsing." Prentice-Hall, Englewood Cliffs, NJ.
2. Angluin, D. (1982): Inference of reversible languages. Journal of the Association for Computing Machines 29, 741-765.
3. Calera, J. & Carrasco, R.C: (1998): Computing the relative entropy between regular tree languages. Submitted for publication.
4. Carrasco, R.C. (1997): "Inferencia de lenguajes rationales estocásticos." Ph.D. dissertation. Universidad de Alicante.
5. Carrasco, R.C. (1998): Accurate computation of the relative entropy between stochastic regular grammars. Theoretical Informatics and Applications. To appear.
6. Carrasco, R.C. & Oncina, J. (1994): Learning stochastic regular grammars by means of a state merging method in "Grammatical Inference and Applications" (R.C. Carrasco and J. Oncina, Eds.). Lecture Notes in Artificial Intelligence 862, Springer-Verlag, Berlin.
7. Cover, T.M. & Thomas, J.A. (1991): Elements of Information Theory. John Wiley and Sons, New York.
8. Hoeffding, W. (1963): Probability inequalities for sums of bounded random variables. American Statistical Association Journal 58, 13-30.
9. Hopcroft, J.E. & Ullman, J.D. (1979): "Introduction to automata theory, languages and computation." Addison Wesley, Reading, Massachusetts.
10. Oncina, J. &. García, P. (1994): Inference of rational tree sets. Universidad Politécnica de Valencia, Internal Report DSIC-ii-1994-23.
11. Sakakibara, Y. (1992): Efficient learning of context-free grammars from positive structural examples. Information and Computation 97, 23-60.
12. Stolcke, A. & Omohundro, S. (1993): Hidden Markov model induction by Bayesian model merging in "Advances in Neural Information Processing Systems 5" (C.L. Giles, S.J. Hanson and J.D. Cowan, Eds.). Morgan-Kaufman, Menlo Park, California.
13. Wetherell, C.S. (1980): Probabilistic Languages: A Review and Some Open Questions ACM Computing Survey 12 361-379