Abstract
We present the Confluent Preorder Parser (CPP) in which syntactic parsing is achieved via a holistic transformation from the sentence representation to the desired parse tree representation. Simulation results show that CPP has achieved excellent generalization performance and is capable of handling erroneous sentences and resolving syntactic ambiguities. An analysis is presented which elucidates the operations of CPP as governed by a finite state automaton. The parsing is interpreted as a series of decision makings during the process. Based on this formalism, syntactic parsing and generalization by CPP can be explained in terms of state transitions.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
D. S. Blank, L.A. Meeden, and J. B. Marshall. Exploring the symbolic/subsymbolic continuum: A case study of RAAM. In J. Dinsmore, editor, The Symbolic and Connectionist Paradigms: Closing the Gap, pages 113–148. Lawrence Erlbaum Associates, Hillsdale, NJ, 1992.
D. J. Chalmers. Syntactic transformations of distributed representations. In N. Sharkey, editor, Connectionist Natural Language Processing, pages 46–55. Intellect Books, 1992.
L. Chrisman. Learning recursive distributed representations for holistic computation. Connection Science, 3:345–366, 1991.
J. L. Elman. Finding structure in time. Cognitive Science, 14:179–211, 1990.
C. Giles, C. Miller, D. Chen, H. Chen, G. Sun, and Y. Lee. Learning and extracting finite state automata with second-order recurrent neural networks. Neural Computation, 4(3):393–405, 1992.
K. S. Ho and L. W. Chan. Syntactic parsing using RAAM. In Proc. World Congress on Neural Networks, volume 1, pages 485–488, 1995.
J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading:Mass, 1979.
A. N. Jain and A. H. Waibel. Incremental parsing by modular recurrent connectionist networks. In D. S. Touretzky, editor, Advances in Neural Information Processing Systems 2, pages 364–371, San Mateo, CA, 1990. Morgan Kaufmann.
S. C. Kwasny and K. A. Faisal. Symbolic parsing via subsymbolic rules. In J. Dinsmore, editor, The Symbolic and Connectionist Paradigms: Closing the Gap, pages 209–236. Lawrence Erlbaum, Hillsdale, NJ, 1992.
R. Miikkulainen. Subsymbolic case-role analysis of sentences with embedded clauses. Technical Report AI93-202, Department of Computer Sciences, the University of Texas at Austin, 1993.
J. Pollack and D. Waltz. Massively parallel parsing: A strongly interactive model of natural language interpretation. Cognitive Science, 9:51–74, 1985.
J. B. Pollack. Recursive distributed representations. Artificial Intelligence, 46:77–105, 1990.
R. Watrous and G. Kuhn. Induction of finite state languages using second-order recurrent networks. In J. Moody, S. Hanson, and R. Lippmann, editors, Advances in Neural Information Processing Systems 4, pages 309–316, San Mateo, CA, 1992. Morgan Kaufmann.
S. Wermter. Hybrid Connectionist Natural Language Processing. Chapman & Hall, London, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ho, K.S.E., Chan, L.W. (1996). Confluent preorder parser as finite state automata. In: von der Malsburg, C., von Seelen, W., Vorbrüggen, J.C., Sendhoff, B. (eds) Artificial Neural Networks — ICANN 96. ICANN 1996. Lecture Notes in Computer Science, vol 1112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61510-5_151
Download citation
DOI: https://doi.org/10.1007/3-540-61510-5_151
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61510-1
Online ISBN: 978-3-540-68684-2
eBook Packages: Springer Book Archive