Learning stochastic regular grammars by means of a state merging method

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

Volumn 862 LNAI, Issue , 1994, Pages 139-152

  Carrasco, Rafael C ^a   Oncina, Jose ^a  

^a UNIVERSITY OF ALICANTE   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS; STOCHASTIC SYSTEMS;

EQUIVALENT STATE; PREFIX TREES; REGULAR GRAMMAR; SAMPLE SETS; STATE-MERGING; STOCHASTIC DETERMINISTIC REGULAR LANGUAGES;

TREES (MATHEMATICS);

EID: 84988545491     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58473-0_144     Document Type: Conference Paper

References (16)

1. E.M. Gold: Complexity of Automaton Identification from Given Data. Information and Control 37 (1978) 302-320.
2. D. Angluin: Identifying Languages from Stochastic Examples. Internal Report YALEU /DCS /RR-614 (1988).
3. F.J. Maryanski and T.L. Booth: Inference of Finite-State Probabilistic Grammars. IEEE Transactions on Computers C26 (1977) 521-536.
4. A. van der Mude and A. Walker: On the Inference of Stochastic Regular Grammars. Information and Control 38 (1978) 310-329.
5. A.W. Smith and D. Zipser: Learning Sequential Structure with the Real-Time Recurrent Learning Algorithm. International Journal of Neural Systems 1 (1989) 125-131.
6. J.B. Pollack: The Induction of Dynamical Recognizers. Machine Learning 7 (1991) 227-252.
7. C.L. Giles: Learning and Extracting Finite State Automata with Second Order Recurrent Neural Networks. Neural Computation 4 (1992) 393-405.
8. R.L. Wartous and G.M. Kuhn: Induction of Finite-state Languages Using Second-Order Recurrent Networks. Neural Computation 4 (1992) 406-414.
9. M.A. Castaño, F. Casacuberta, E. Vidal: Simulation of Stochastic Regular Grammars through Simple Recurrent Networks, in: New Trends in Neural Computation (Eds. J. Mira, J. Cabestany and A. Prieto). Springer Verlag, Lecture Notes in Computer Science 686 (1993) 210-215.
10. A. Stolcke and S. Omohundro: Hidden Markov Model Induction by Bayesian Model Merging. To appear in: Advances in Neural Information Processing Systems 5 (C.L. Giles, S.J. Hanson and J.D. Cowan eds.) Morgan Kaufman, Menlo Park, California (1993).
11. J. Oncina and P. García: Inferring Regular Languages in Polynomial Time, in: Pattern Recognition and Image Analysis (N. Pérez de la Blanca, A. Sanfeliu and E. Vidal eds.) World Scientific (1992).
12. K.S. Fu: Syntactic Pattern Recognition and Applications. Prentice Hall, Englewood Cliffs, N.J. (1982).
13. J.E. Hopcroft and J.D. Ullman: Introduction to Automata Theory, Languages and Computation. Addison Wesley, Reading, Massachusetts (1979).
14. W. Hoeffding: Probability inequalities for sums of bounded random variables. American Statistical Association Journal 58 (1963) 13-30.
15. W. Feller: An introduction to probability theory and its applications. John Wiley and Sons, New York (1950)
16. A.S. Reber: Implicit Learning of Artificial Grammars. Journal of Verbal Learning and Verbal Behaviour 6 (1967) 855-863.