@inproceedings{ng-tomita-1991-probabilistic,
    title = "Probabilistic {LR} Parsing for General Context-Free Grammars",
    author = "Ng, See-Kiong  and
      Tomita, Masaru",
    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.18/",
    pages = "154--163",
    abstract = "To combine the advantages of probabilistic grammars and generalized LR parsing, an algorithm for constructing a probabilistic LR parser given a probabilistic context-free grammar is needed. In this paper, implementation issues in adapting Tomita{'}s generalized LR parser with graph-structured stack to perform probabilistic parsing are discussed. Wright and Wrigley (1989) has proposed a probabilistic LR-table construction algorithm for non-left-recursive context-free grammars. To account for left recursions, a method for computing item probabilities using the generation of systems of linear equations is presented. The notion of deferred probabilities is proposed as a means for dealing with similar item sets with differing probability assignments."
}