@inproceedings{sikkel-nijholt-1991-efficient,
    title = "An Efficient Connectionist Context-Free Parser",
    author = "Sikkel, Klaas  and
      Nijholt, Anton",
    editor = "Tomita, Masaru  and
      Kay, Martin  and
      Berwick, Robert  and
      Hajicova, Eva  and
      Joshi, Aravind  and
      Kaplan, Ronald  and
      Nagao, Makoto  and
      Wilks, Yorick",
    booktitle = "Proceedings of the Second International Workshop on Parsing Technologies",
    month = feb # " 13-25",
    year = "1991",
    address = "Cancun, Mexico",
    publisher = "Association for Computational Linguistics",
    url = "https://preview.aclanthology.org/fix-sig-urls/1991.iwpt-1.14/",
    pages = "117--126",
    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."
}