Knowledge extraction from transducer neural networks

Applied Intelligence

Volumn 12, Issue 1-2, 2000, Pages 27-42

  Wermter, Stefan ^a  

^a UNIVERSITY OF SUNDERLAND   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; CONFORMAL MAPPING; ERROR ANALYSIS; FUNCTIONS; KNOWLEDGE REPRESENTATION; LEARNING SYSTEMS; SET THEORY; STATISTICAL METHODS;

CONNECTIONIST LEARNING; DYNAMIC LEARNING ANALYSIS; KNOWLEDGE EXTRACTION; NEURAL NETWORK LEARNING; SRN NETWORKS; SYMBOLIC INTERPRETATION; TRANSDUCER EXTRACTION;

RECURRENT NEURAL NETWORKS;

EID: 0033903744     PISSN: 0924669X     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1008320219610     Document Type: Article

References (39)

1. S. Hölldobler, "A structured connectionist unification algorithm," in Proceedings of the National Conference of the American Association on Artificial Intelligence 90, Boston, MA, 1990, pp. 587-593.
2. F. Kurfeß, "Unification on a connectionist simulator," in Artificial Neural Networks edited by T. Kohonen, K. Mäkisara, O. Simula, and J. Kangas, North-Holland, pp. 471-476, 1991.
3. A. Sperduti, A. Starita, and C. Goller, "Learning distributed representations for the classifications of terms," in Proceedings of the International Joint Conference on Artificial Intelligence, Montreal, 1995, pp. 494-515.
4. S. Wermter, Hybrid Connectionist Natural Language Processing, Chapman and Hall, Thomson International: London, UK, 1995.
5. J. Hallam (ed.), "Hybrid Problems, Hybrid Solutions," IOS Press: Sheffield, UK, 1996, in Proceedings of the 10th Biennial Conference on Aland Cognitive Science (AISB-95), Amsterdam.
6. L.R. Medsker, Hybrid Intelligent Systems, Kluwer Academic Publishers: Boston, 1995.
7. R. Sun, "Schemas, logics and neural assemblies," Applied Intelligence, vol. 5, pp. 83-102, 1995.
8. S. Wermter, E. Riloff, and G. Scheler, Connectionist, Statistical and Symbolic Approaches to Learning for Natural Language Processing, Springer: Berlin, 1996.
9. J.L. Elman, E.A. Bates, M.H. Johnson, A. Karmiloff-Smith, D. Parisi, and K. Plunkett, Rethinking Innateness, MIT Press: Cambridge, MA, 1996.
10. M.W. Craven, "Extracting Comprehensible Models from Trained Neural Networks," Ph.D. Thesis, University of Wisconsin-Madison, 1996.
11. S. Wermter, "Preference moore machines for neural fuzzy integration," in Proceedings of the International Joint Conference on Artificial Intelligence, Stockholm, 1999, pp. 840-845.
12. R. Andrews and J. Diederich, Rules and Networks, Queensland University of Technology: Brisbane, Australia, 1996.
13. S. Abe, M. Kayama, H. Takenaga, and T. Kitamura, "Extracting algorithms from pattern classification neural networks," Neural Networks, vol. 6, no. 5, pp. 729-735, 1993.
14. J. Shavlik, "A framework for combining symbolic and neural learning," in Artificial Intelligence and Neural Networks: Steps Towards Principled Integration, edited by V. Honavar and L. Uhr, Academic Press: San Diego, pp. 561-580, 1994.
15. G.E. Hinton, "Learning distributed representations of concepts," in Proceedings of the 8th Meeting of the Cognitive Science Society, 1986.
16. R.P. Gorman and T.J. Sejnowski, "Analysis of hidden units in a layered network trained to classify sonar targets," Neural Networks, vol. 1, pp. 75-89, 1988.
17. J.L. Elman, "Language as a dynamical system," in Mind as Motion: Explorations in the Dynamics of Cognition, edited by R.F. Port and T. van Gelder, MIT: Cambridge, MA, pp. 195-225, 1995.
18. C.L. Giles and C.W Omlin, "Extraction, insertion and refinement of symbolic rules in dynamically driven recurrent neural networks," Connection Science, vol. 5, pp. 307-337, 1993.
19. C.W. Omlin and C.L. Giles, "Extraction of rules from discrete-time recurrent neural networks," Neural Networks, vol. 9, no. 1, pp. 41-52, 1996.
20. J. Wiles and J. Elman, "Learning to count without a counter: a case study of dynamics and activation landscapes in recurrent networks," in Proceedings of the AAAI Workshop on Computational Cognitive Modeling: Source of the Power, Portland, Oregon, 1996.
21. S. Wermter and V. Weber, "SCREEN: Learning a flat syntactic and semantic spoken language analysis using artificial neural networks," Journal of Artificial Intelligence Research, vol. 6, no. 1, pp. 35-85, 1997.
22. S. Wermter and M. Meurer, "Building lexical representations dynamically using artificial neural networks," in Proceedings of the International Conference of the Cognitive Science Society, Stanford, 1997, pp. 802-807.
23. S. Wermter and M. Löchel, "Learning dialog act processing," in Proceedings of the International Conference on Computational Linguistics, Copenhagen, Denmark, 1996, pp. 740-745.
24. J.L. Elman, "Distributed representations, simple recurrent networks, and grammatical structure," Machine Learning, vol. 7, pp. 195-226, 1991.
25. S. Wermter, "The hybrid approach to artificial neural network-based language processing," in A Handbook of Natural Language Processing, edited by R. Dale, H. Moisl, and H. Somers, Marcel Dekker, 2000.
26. T.L. Booth, Sequential Machines and Automata Theory, John Wiley: New York, 1967.
27. Z. Kohavi, Switching and Finite Automata Theory, McGrawHill: New York, 1970.
28. M.W Shields, An Introduction to Automata Theory, Blackwell Scientific Publications: London, 1987.
29. J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison Wesley: Reading, MA, 1979.
30. P.S. Churchland and T.J. Sejnowski, The Computational Brain, MIT Press: Cambridge, MA, 1992.
31. T. Winograd, Language as a Cognitive Process. Addison-Wesley: Reading, MA, 1983.
32. R. Kaplan, "Finite state technology." in Survey of the State of the Art in Human Language Technology, edited by R.A. Cole, J. Mariani, H. Uszkoreit, A. Zaenen, V. Zue, G. Varile, and A. Zampolli, NSF: EU, 1995, pp. 419-422.
33. E.S. Santos, "Fuzzy sequential functions," Journal of Cybernetics, vol. 3, no. 3, pp. 15-31, 1973.
34. S.C. Kremer, "On the computational power of Elman-style recurrent networks," IEEE Transactions on Neural Networks, vol. 6, no. 4, pp. 1000-1004, 1995.
35. S.C. Kremer, "A theory of grammatical induction in the connectionist paradigm," Technical Report, Ph.D. dissertation, Dept. of Computing Science, University of Alberta, Edmonton, 1996.
36. M.W. Goudreau and C.L. Giles, "On recurrent neural networks and representing finite-state recognizers," in Proceedings of the Third International Conference on Neural Networks, 1995, pp. 51-55.
37. M.W. Goudreau, C.L. Giles, S.T. Chakradhar, and D. Chen, "First-order vs. second-order single layer recurrent neural networks," IEEE Transactions on Neural Networks, vol. 5, no. 3, pp. 511-513, 1994.
38. C.L. Giles, C.B. Miller, D. Chen, H.H. Chen, G.Z. Sun, and Y.C. Lee, "Learning and extracted finite state automata with second-order recurrent neural networks," Neural Computation, vol. 4, no. 3, pp. 393-405, 1992.
39. P. Tino, B.G. Home, C.L. Giles, and P.C. Collingwood, "Finite state machines and recurrent neural networks," Technical Report CS-TR-3396, University of Maryland, College Park, 1995.