%0 Conference Proceedings
%T An Efficient Connectionist Context-Free Parser
%A Sikkel, Klaas
%A Nijholt, Anton
%S Proceedings of the Second International Workshop on Parsing Technologies
%D 1991
%8 feb" 13 25"
%I Association for Computational Linguistics
%C Cancun, Mexico
%F sikkel-nijholt-1991-efficient
%X A connectionist network is defined that parses a grammar in Chomsky Normal Form in logarithmic time, based on a modification of Rytter’s recognition algorithm. A similar parsing network can be defined for an arbitrary context-free grammar. Such networks can be integrated into a connectionist parsing environment for interactive distributed processing of syntactic, semantic and pragmatic information.
%U https://aclanthology.org/1991.iwpt-1.14
%P 117-126