Abstract
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.- Anthology ID:
- 1991.iwpt-1.14
- Volume:
- Proceedings of the Second International Workshop on Parsing Technologies
- Month:
- February 13-25
- Year:
- 1991
- Address:
- Cancun, Mexico
- Editors:
- Masaru Tomita, Martin Kay, Robert Berwick, Eva Hajicova, Aravind Joshi, Ronald Kaplan, Makoto Nagao, Yorick Wilks
- Venue:
- IWPT
- SIG:
- SIGPARSE
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 117–126
- Language:
- URL:
- https://aclanthology.org/1991.iwpt-1.14
- DOI:
- Cite (ACL):
- Klaas Sikkel and Anton Nijholt. 1991. An Efficient Connectionist Context-Free Parser. In Proceedings of the Second International Workshop on Parsing Technologies, pages 117–126, Cancun, Mexico. Association for Computational Linguistics.
- Cite (Informal):
- An Efficient Connectionist Context-Free Parser (Sikkel & Nijholt, IWPT 1991)
- PDF:
- https://preview.aclanthology.org/revert-3132-ingestion-checklist/1991.iwpt-1.14.pdf