HOME   ::   Back to the Paper   ::   References

Cernansky, M., Makula, M., and Benuskova, L. (2007) Organization of the state space of a simple recurrent network before and after training on recursive linguistic structures. Neural Networks, 20(2):236--244.

References (may not be complete)  [Original format]  [Sort by year]  [Sort by author]  [Sort by citations]

Chomsky, Syntactic structures, 1957 :: 40
Christiansen,Chater, Toward a connectionist model of recursion in human linguistic performance, 1999 :: 14
Elman, Finding structure in time, 1990 :: 49
erez-Ortiz,Schmidhuber, Kalman filters improve LSTM network performance in problems unsolvable by traditional recurrent nets, 2003 :: 1
Feldkamp,Prokhorov,Eagen,Yuan, Enhanced multistream Kalman filter training for recurrent networks, 1998 :: 1
Hanson,Negishi, On the emergence of rules in neural networks, 2002 :: 1
Kolen, The origin of clusters in recurrent neural network state space, 1994 :: 2
Kolen, Recurrent networks: state machines or iterated function systems, 1994 :: 2
Lawrence,Giles,Fong, Natural language grammatical inference with recurrent neural networks, 2000 :: 3
Parfitt, Aspects of anaphora resolution in artificial neural networks: Implications for nativism, 1997 :: 1
Ron,Singer,Tishby, The power of amnesia: learning probabilistic automata with variable memory length, 1996 :: 1
Servan-Schreiber,Cleeremans,McClelland, Graded state machines: the representation of temporal contingencies in Simple Recurrent Networks, 1989 :: 4
Wan,Nelson, Dual EKF methods, 2000 :: 1
Welch,Bishop, An introduction to the Kalman filter, 1995 :: 1
Werbos, Backpropagation through time; what it does and how to do it, 1990 :: 2
Williams,Zipser, A learning algorithm for continually running fully recurrent neural networks, 1989 :: 4
Williams,Zipser, Gradient-based learning algorithms for recurrent networks and their computational complexity, 1995 :: 1

 HOME   ::   Back to the Paper   ::   References Comments to: junwang4 you-know-at gmail.com Last update: 2/3/09