Williams,Zipser -- A learning algorithm for continually running fully recurrent neural networks -- 1989 | ||
| Google Web Search
:: Google Scholar | ||
| 2007 | - | Organization of the state space of a simple recurrent network before and after training on recursive linguistic structures - Cernansky,Makula,Benuskova |
| Williams, R. J., & Zipser, D. (1989). A learning algorithm for continually running fully recurrent neural networks. Neural Computation, 1, 270-280.
| ||
| 1990 | - | Finding structure in time - Elman |
| Williams, R.J., & Zipser, D. (1988). A learning algorithm for continually running fully recurrent neural networks. Institute for Cognitive Science Report 8805. University of California, San Diego.
| ||
| 1998 | - | Getting the Point Across: The Effect of Recurrent Network Biases on the Evolution of a Simple Language - Tonkes |
| Williams, R. J. and Zipser, D. (1989). A learning algorithm for continually running fully recurrent neural networks. Neural Computation, 1(2):270-280.
| ||
| 2001 | - | On the Origins of Linguistic Structure: Computational models of the evolution of language - Tonkes |
| Williams, R. J. and Zipser, D. (1989). A learning algorithm for continually running fully recurrent neural networks. Neural Computation, 1(2):270-280.
| ||