@inproceedings{de-vreught-honig-1991-slow,
    title = "Slow and Fast Parallel Recognition",
    author = "de Vreught, Hans  and
      Honig, Job",
    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.15/",
    pages = "127--135",
    abstract = "In the first part of this paper a slow parallel recognizer is described for general CFG{'}s. The recognizer runs in $\Theta(n^3/p(n))$ time with $p(n) = O(n^2)$ processors. It generalizes the items of the Earley algorithm to double dotted items, which are more suited to parallel parsing. In the second part a fast parallel recognizer is given for general CFG{'}s. The recognizer runs in $O(log n)$ time using $O(n^6)$ processors. It is a generalisation of the Gibbons and Rytter algorithm for grammars in CNF."
}