The dissertation of Andreas Stolcke is approved: University of ...

CHAPTER 6. EFFICIENT PARSING WITH STOCHASTIC CONTEXT-FREE GRAMMARS 163this incongruity into an advantage by using the LR parser as a probabilistic model its own right, and showhow LR probabilities can be extended to capture non-context-free contingencies.The problem of capturing more complex distributional constraints in natural language is clearlyimportant, but well beyond the scope of this chapter. We simply remark that it should be possible to define‘interesting’ non-standard probabilities in terms of Earley parser actions so as to better model non-context-freephenomena. Apart from such considerations, the choice between LR methods and Earley parsing is a typicalspace-time tradeoff. Even though an Earley parser runs with the same linear time and space complexity as anLR parser on grammars of the appropriate LR class, the constant factors involved will be much in favor of theLR parser as almost all the work has already been compiled into its transition and action table. However, thesize of LR parser tables can be exponential in the size of the grammar (due to the number of potential itemsubsets). Furthermore, if the generalized LR method is used for dealing with non-deterministic grammars(Tomita 1986) the runtime on arbitrary inputs may also grow exponentially.The bottom line is that each application’s needs have to be evaluated against the pros and consof both approaches to find the best solution. From a theoretical point of view, the Earley approach hasthe inherent appeal of being the more general (and exact) solution to the computation of the various SCFGprobabilities.6.7.4 Other related workThe literature on Earley-based probabilistic parsers is sparse, presumably because of the precedentset by the Inside/Outside algorithm, which is more naturally formulated as a bottom-up algorithm.Schabes (1991) shows that Earley’s algorithm can be augmented with the computation of inner andouter probabilities, in much the same way as presented here. However, the algorithm presented is not fullygeneral as it is restricted to sentences with bounded ambiguity, i.e., there are no provisions for handling unitproduction cycles. Schabes focuses on grammar estimation (using generalized inside and outside probabilities)and only mentions the potential for computing prefix probabilities.Magerman & Marcus (1991) are interested primarily in scoring functions to guide a parser efficientlyto the most promising parses. They use Earley-style top-down prediction only to suggest worthwhile parses,not to compute precise probabilities. 24Both Nakagawa (1987) and Päseler (1988) use a non-probabilistic Earley parser augmented with‘word match’ scoring. Though not truly probabilistic, these algorithms are similar to the Viterbi versiondescribed here, in that they find a parse that optimizes the accumulated matching scores (without regard torule probabilities). Prediction and completion loops do not come into play since no precise inner or forwardprobabilities are computed.Dan Jurafsky (personal communication) had written an Earley parser for the Berkeley RestaurantProject (BeRP) speech understanding system that computed forward probabilities for restricted grammars(without left-corner or unit production recursion). The parser now uses the methods described here to provide24 They argue that precise probabilities are inappropriate in natural language parsing.