An efficient context-free parsing algorithm
Communications of the ACM
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
Unbounded dependency: tying strings to rings
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
A distributed multi-agent architecture for natural language processing
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
A parallel parser for spoken natural language
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
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
| Hi-index | 0.00 |
The properties of distributed representations and memory systems are explored as a potential basis for non-deterministic parsing mechanisms. The structure of a distributed chart parsing representation is outlined. Such a representation encodes both immediate-dominance and terminal projection information on a single composite memory vector. A parsing architecture is described which uses a permanent store of context-free rule patterns encoded as split composite vectors, and two interacting working memory units. These latter two units encode vectors which correspond to the active and inactive edges of an active chart parsing scheme. This type of virtual parsing mechanism is compatible with both a macro-level implementation based on standard sequential processing and a micro-level implementation using a massively parallel architecture.