Inferring stochastic regular grammars with recurrent neural networks

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

Volumn 1147, Issue , 1996, Pages 275-281

  Carrasco, Rafael C ^a   Forcada, Mikel L ^a   Santamaría, Laureano ^a  

^a UNIVERSITY OF ALICANTE   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS; COMPUTATIONAL LINGUISTICS; EXTRACTION; NETWORK LAYERS; PROBABILITY DISTRIBUTIONS; STOCHASTIC SYSTEMS;

GENERALIZATION PERFORMANCE; RECURRENT NETWORKS; REGULAR GRAMMAR; RELATIVE ENTROPY; TRANSITION PROBABILITIES;

RECURRENT NEURAL NETWORKS;

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

References (14)

1. Giles, C.L., Miller, C.B, Chen, D., Chen, H.H., Sun, G.Z., Lee, Y.C.: “Learning and Extracting Finite State Automata with Second-Order Recurrent Neural Networks” Neural Computation 4 (1992) 393-405.
2. Giles, C.L., Miller, C.B, Chen, D., Sun, G.Z., Chen, H.H., Lee, Y.C.: “Extracting and Learning an Unknown Grammar with Recurrent Neural Networks”, in Advances in Neural Information Processing Systems 4 (J- Moody et al., eds.), Morgan-Kaufmann, San Mateo, CA, 1992, p. 317-324.
3. Watrous, R.L., Kuhn, G.M.: “Induction of Finite-State Automata Using Second-Order Recurrent Networks” Advances in Neural Information Processing Systems 4 (J. Moody et al., Eds), Morgan-Kaufmann, San Mateo, CA, 1992, p. 306-316.
4. Watrous, R.L., Kuhn, G.M.: “Induction of Finite-State Languages Using Second- Order Recurrent Networks” Neural Computation 4 (1992) 406-414.
5. Omlin, C.W., Giles, C.L.: “Extraction of Rules from Discrete-Time Recurrent Neural Networks” Neural networks 9:1 (1996) 41-52.
6. Kolen, J.F.: “Fool’s Gold: Extracting Finite-State Automata from Recurrent Network Dynamics” in Advances in Neural Information Processing Systems 6 (C.L. Giles, S.J. Hanson, J.D. Cowan Eds.), Morgan-Kaufmann, San Mateo, CA, 1994, 501-508.
7. Casey, M.: “The Dynamics of Discrete-Time Computation with Application to Recurrent Neural Networks and Finite State Machine Extraction” Neural Computation (1996), to appear.
8. Blair, A.D., Pollack, J.B.: “Precise Analysis of Dynamical Recognizers”. Tech. Rep. CS-95-181, Comput. Sci. Dept., Brandeis Univ. (1996).
9. Elman, J.: “Finding Structure in Time” Cognitive Science 14 (1990) 179-211.
10. Castano, M.A., Casacuberta, F., E. Vidal,: “Simulation of Stochastic Regular Grammars through Simple Recurrent Networks”, in New Trends in Neural Computation (J. Mira, J. Cabestany and A. Prieto, Eds.). Lecture Notes in Computer Science 686, Springer-Verlag, Berlin, 1993, p. 210-215.
11. Carrasco, R.C., Oncina, J.: “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, 1994, p. 139-152.
12. Williams, R.J., Zipser, D.: “A learning algorithm for continually running fully recurrent neural networks” Neural Computation 1 (1989) 270-280.
13. Forcada, M.L., Carrasco, R.C.: “Learning the Initial State of a Second-Order Recurrent Neural Network during Regular-Language Inference” Neural Computation 7 (1995) 923-930.
14. Cover, T.M. and Thomas, J.A.: Elements of Information Theory, John Wiley and Sons, New York, 1991.