A connectionist approach to word sense disambiguation
A connectionist approach to word sense disambiguation
A study of tree adjoining grammars
A study of tree adjoining grammars
Mathematical and computational aspects of lexicalized grammars
Mathematical and computational aspects of lexicalized grammars
D-theory: talking about talking about trees
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
A computational model of tractable reasoning: taking inspiration from cognition
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
| Hi-index | 0.00 |
This paper presents a connectionist syntactic parser which uses Structure Unification Grammar as its grammatical framework. The parser is implemented in a connectionist architecture which stores and dynamically manipulates symbolic representations, but which can't represent arbitrary disjunction and has bounded memory. These problems can be overcome with Structure Unification Grammar's extensive use of partial descriptions.