Confluent Preorder Parsing of Deterministic Grammars

Connection Science

Volumn 9, Issue 3, 1997, Pages 269-294

  Ho, Kei Shiu Edward ^a   Chan, Lai Wan ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Confluent preorder parser; Connectionist syntactic parsing; Holistic parsing; Lexical category disambiguation; Linearization of a hierarchical parse tree; Neural networks; Parsing erroneous sentences; RAAM

Indexed keywords

EID: 0347739439     PISSN: 09540091     EISSN: None     Source Type: Journal    
DOI: 10.1080/095400997116649     Document Type: Article

References (19)

1. Aho, A.V., Sethi, R. & Ullman, J.D. (1986) Compilers: Principles, Techniques, and Tools. Reading, MA: Addison-Wesley.
2. Allen, J. (1995) Natural Language Understanding. Redwood City, CA: Benjamin/Cummings.
3. Berg, G. (1992) A connectionist parser with recursive sentence structure and lexical disambiguation. Proceedings of the Tenth Conference on Artificial Intelligence, pp. 32-37. Cambridge: MIT Press.
4. Blank, D.S., Meeden, L.A. & Marshall, J.B. (1992) Exploring the symbolic/subsymbolic continuum: A case study of RAAM. In J. Dinsmore (Ed.), The Symbolic and Connectionist Paradigms: Closing the Gap, pp. 113-148. Hillsdale, NJ: Lawrence Erlbaum Associates.
5. Chalmers, D.J. (1992) Syntactic transformations of distributed representations. In N. Sharkey (Ed.), Connectionist Natural Language Processing, pp. 46-55. Boston: Kluwer Academic.
6. Chrisman, L. (1991) Learning recursive distributed representations for holistic computation. Connection Science, 3, 345-366.
7. Elman, J.L. (1991) Incremental learning, or The importance of Starting Small. CRL Technical Report 9101, Center for Research in Language, University of California, San Diego.
8. Ho, K.S.E. & Chan, L.W. (1994) Representing sentence structures in neural networks. Proceedings of the International Conference in Neural Information Processing Systems, Vol. 3, pp. 1452-1467.
9. Ho, K.S.E. & Chan, L.W. (1997) Efficient connectionist representations of parse trees for syntactic parsing (in press).
10. Jain, A.N. & Waibel, A.H. (1990) Incremental parsing by modular recurrent connectionist networks. In D.S. Touretzky (Ed.), Advances in Neural Information Processing Systems 2, pp. 364-371. San Mateo, CA: Morgan Kaufmann.
11. Kwasny, S.C. & Faisal, K.A. (1992) Symbolic parsing via subsymbolic rules. InJ. Dinsmore (Ed.), The Symbolic and Connectionist Paradigms: Closing the Gap, pp. 209-236. Hillsdale, NJ: Lawrence Erlbaum Associates.
12. Kwasny, S.C. & Kalman, B.L. (1993) Tail-Recursive Distributed Representations and Simple Recurrent Networks. Technical Report WUCS-93-52, Department of Computer Science, Washington University.
13. Miikkulainen, R. (1993) Subsymbolic Case-Role Analysis of Sentences with Embedded Clauses. Technical Report AI93-202, Department of Computer Sciences, University of Texas at Austin.
14. Pollack, J.B. (1990) Recursive distributed representations. Artificial Intelligence, 46, 77-105.
15. Pollack, J. & Waltz, D. (1985) Massively parallel parsing: A strongly interactive model of natural language interpretation. Cognitive Science, 9, 51-74.
16. Reilly, R. (1990) Connectionist techniques for on-line parsing. Network, 3, 37-45.
17. Rumelhart, D.E., Hinton, G.E. & Williams, R.J. (1986) Learning internal representations through error propagation. In D.E. Rumelhart, J.L. McClelland & The PDP Research Group (Eds), Parallel Distributed Processing: Experiments in the Microstructure of Cognition, Vol. 1, pp. 318-362. Cambridge: MIT Press.
18. Stolcke, A. & Wu, D. (1992) Tree Matching with Recursive Distributed Representations. Technical Report TR-92-025, International Computer Science Institute, Berkeley.
19. Wermter, S. (1995) Hybrid Connectionist Natural Language Understanding. London: Chapman & Hall.