A connectionist architecture for learning to parse

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn 1, Issue , 1998, Pages 531-537

  Henderson, James ^a   Lane, Peter ^a  

^a UNIVERSITY OF EXETER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; NETWORK ARCHITECTURE;

GENERALISATION; LEARN+; PARSE TREES; PRECISION AND RECALL; SIMPLE++; SPARSE DATA PROBLEM; SYNTACTIC PARSING;

SYNTACTICS;

EID: 34147179749     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. Eugene Charniak. forthcoming. Statistical techniques for natural language parsing. AI Magazine.
2. Jeffrey L. Elman. 1991. Distributed representations, simple recurrent networks, and grammatical structure. Machine Learning, 7:195-225.
3. Jerry A. Fodor and Zenon W. Pylyshyn. 1988. Connectionism and cognitive architecture: A critical analysis. Cognition, 28:3-71.
4. R. Garside, G. Leech, and G. Sampson (eds). 1987. The Computational Analysis of English: a corpusbased approach. Longman Group UK Limited.
5. James Henderson. 1996. A connectionist architecture with inherent systematicity. In Proceedings of the Eighteenth Conference of the Cognitive Science Society, pages 574-579, La Jolla, CA.
6. I. Melcuk. 1988. Dependency Syntax: Theory and Practice. SUNY Press.
7. D. E. Rumelhart, G. E. Hinton, and R. J. Williams. 1986. Learning internal representations by error propagation. In D. E. Rumelhart and J. L. Mc-Clelland, editors, Parallel Distributed Processing, Vol 1. MIT Press, Cambridge, MA.
8. Geoffrey Sampson. 1995. English for the Computer. Oxford University Press, Oxford, UK.
9. Lokendra Shastri and Venkat Ajjanagadde. 1993. From simple associations to systematic reasoning: A connectionist representation of rules, variables, and dynamic bindings using temporal synchrony. Behavioral and Brain Sciences, 16:417-451.