Tail-recursive Distributed Representations and Simple Recurrent Networks

References

• Berg , G. ( 1992 ) A connectionist parser with recursive sentence structure and lexical disambiguation. Proceedings ofAAAI-92, the Tenth National Conference on Artificial Intelligence , pp. 32 – 37 .
   Google Scholar
• Blank , D.S. , Meeden , L.A. and Marshall , J.B. ( 1992 ) Exploring the symbolic/subsymbolic continuum: a case study of RAAM. In J. Dinsmore (Ed.), Closing the Gap: Symbolism vs. Connectionism. Hillsdale , NJ : Lawrence Erlbaum Associates.
   Google Scholar
• Chalmers , D.J. ( 1990 ) Syntactic transformations on distributed representations. Connection Science , 2 , 53 – 62 .
   Google Scholar
• Chrisman , L. ( 1991 ) Learning Recursive Distributed Representations for Holistic Computation. Technical Report CMU-CS-91–154. , Pittsburgh : School of Computer Science, Carnegie Mellon University.
   Google Scholar
• Elman , J.L. ( 1990 ) Finding structure in time. Cognitive Science , 14 , 179 – 212 .
   Web of Science ®Google Scholar
• Elman , J.L. ( 1991 ) Distributed representations, simple recurrent networks, and grammatical structure. Machine Learning , 7 , 195 – 225 .
   Web of Science ®Google Scholar
• Fodor , J.A. and Pylyshyn , Z.W. ( 1988 ) Connectionism and cognitive architecture: a critical analysis. In S. Pinker & J. Mehler (Eds) , Connections and Symbols. , Cambridge , MA : p:MIT Press.
   Google Scholar
• Kalman , B.L. ( 1990 ) Super linear learning in back propagation neural nets. Technical Report WUCS-90–21. , St Louis : Department of Computer Science, Washington University.
   Google Scholar
• Kalman , B.L. and Kwasny , S.C. ( 1991 ) A superior error function for training neural nets. Proceedings of the International Joint Conference on Neural Networks , Vol. 2 , Seattle , WA , pp. 40 – 52 .
   Google Scholar
• Kalman , B.L. and Kwasny , S.C. ( 1994 ) High performance training of feedforward and simple recurrent networks. Technical Report WUCS-94–29. , St Louis : Department of Computer Science, Washington University.
   Google Scholar
• Knuth , D.E. ( 1973 ) The Art of Computer Programming. Volume 1: Fundamental Algorithms. Reading , MA : p:Addison-Wesley.
   Google Scholar
• Kwasny , S.C. and Faisal , K.A. ( 1992 ) Symbolic parsing via subsymbolic rules. , In J. Dinsmore (Ed.), Closing the Gap: Symbolism vs. Connectionism. Hillsdale , NJ : Lawrence Erlbaum Associates.
   Google Scholar
• Kwasny , S.C. and Kalman , B.L. ( 1992 ) A recurrent deterministic parser. Proceedings of the Fourth Midwest Artificial Intelligence and Cognitive Science Society Conference. , Huntsville , AL : Intergraph Corporation.
   Google Scholar
• Kwasny , S.C , Kalman , B.L. and Chang , N. ( 1993 ) Distributed patterns as hierarchical structures. Proceedings of the World Congress on Neural Networks , Vol. II . Portland , OR , pp. 198 – 201 .
   Google Scholar
• Plate , A.A. ( 1991 ) Holographic reduced representations. Technical Report CRG-TR-91–1. , Toronto : Department of Computer Science, University of Toronto.
   Google Scholar
• Pollack , J. ( 1989 ) Implications of recursive distributed representations. In D.S. Touretzky (Ed.), Advances in Neural Information Processing Systems. , Los Gatos , CA : p:Morgan Kaufmann.
   Google Scholar
• Pollack , J. ( 1990 ) Recursive distributed representations. Artificial Intelligence , 46 , 77 – 105 .
   Web of Science ®Google Scholar
• Sperduti , A. ( 1993 a) Labeling RAAM. TR-93–029. , Berkeley , CA : International Computer Science Institute.
   Google Scholar
• Sperduti , A. ( 1993 b) On some stability properties of the LRAAM model. , TR-93–031. Berkeley , CA : International Computer Science Institute.
   Google Scholar
• Stolcke , A. and Wu , D. ( 1992 ) Tree matching with recursive distributed representations. , TR-92–025. Berkeley , CA : International Computer Science Institute.
   Google Scholar
• Williams , R.J. and Zipser , D. ( 1989 ) A learning algorithm for continually running fully recurrent neural networks. Neural Computation , 1 , 270 – 280 .
   Web of Science ®Google Scholar