Dynamical assessment of symbolic processes with backprop nets

Proceedings of the International Joint Conference on Neural Networks

Volumn 4, Issue , 2001, Pages 2838-2843

  Tabor, W ^a  

^a UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; CONTEXT FREE LANGUAGES; EIGENVALUES AND EIGENFUNCTIONS; LEARNING SYSTEMS; LYAPUNOV METHODS; MARKOV PROCESSES; MATRIX ALGEBRA; PROBABILITY;

PROBABILISTIC SYMBOLIC PROCESSES; SIMPLE RECURRENT NETWORKS;

RECURRENT NEURAL NETWORKS;

EID: 0034843277     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. A connectionist symbol manipulator that discovers the structure of context-free languages
2. Connectionist pushdown automata that learn context-free grammars
3. Infinite raam: A principled connectionist basis for grammatical competence
4. A recurrent network that performs a context-sensitive prediction task
5. Learning internal representations by error propagation
6. Backpropagation: The basic theory