Context-free parsing in Connectionist Networks

By M. Fanty. 1985

Subfields: Model Architectures, Computational Linguistics & Semantics

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Model Architectures

In Computational Linguistics & Semantics

Citations in the corpus

Survey of the State of the Art in Human Language Technology (2010, background): “For example, patterns of variation in fundamental frequency, duration, amplitude or intensity, pauses, and speaking rate have been shown to carry information about such prosodic elements as lexical stress, phrase breaks, and declarative or interrogative sentence form. Prosody consists of a phonologi”
Toward a connectionist model of recursion in human linguistic performance (1999, background): “One way of approaching the problem of dealing with recursion in connectionist models is to " hardwire " symbolic structures directly into the architecture of the network (e.g., Fanty, 1985; McClelland & Kawamoto, 1986; Miyata, Smolensky & Legendre, 1993; Small, Cottrell & Shastri, 1982).”
Recursive Distributed Representations (1990, background): “The limitation shows in the fact that pure connectionism has generated somewhat unsatisfying systems in this domain; for example, parsers for fixed length sentences [1-4], without embedded structures [5].”
Divide and Conquer with Neural Networks (2017, background): “Using neural networks to solve algorithmic tasks is an active area of current research, but its models can be traced back to context free grammars [4].”
Tensor Product Variable Binding and the Representation of Symbolic Structures in Connectionist Systems (1990, background): “• Fanty's [8] parser uses a purely local tensor product representation involving a positional role decomposition of trees.”