Unbounded dependency: tying strings to rings

Authors:
Jon M. Slack
Affiliations:
Istituto per la Ricerca Scientifica e Tecnologica (I.R.S.T.), Povo (TN), Italy
Venue:
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Year:
1990

Citing 5
Cited 1

Sparse Distributed Memory

Sparse Distributed Memory
A parsing architecture based on distributed memory machines

ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
A logical semantics for feature structures

ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Distributed memory: a basis for chart parsing

COLING '86 Proceedings of the 11th coference on Computational linguistics
An algorithm for functional uncertainty

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1

Kanerva's sparse distributed memory: an object-oriented implementation on the connection machine

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper outlines a framework for connectionist representation based on the composition of connectionist states under vector space operators. The framwork is used to specify a level of connectionist structure defined in terms of addressable superposition space hierarchies. Direct and relative address systems can be defined for such structures which use the functional components of linguistic structures as labels. Unbounded dependency phenomena are shown to be related to the different properties of these labelling structures.