... 348–352,Uppsala, Sweden, 11-16 July 2010.c2010 Association for Computational LinguisticsHierarchical A∗ Parsing with Bridge Outside ScoresAdam Pauls and Dan KleinComputer Science DivisionUniversity ... . , φn with weights w1, . . . , wn, the conclu-sion φ0can be formed with weight g(w1, . . . , wn)and priority p(w1, . . . , wn).These deduction rules are “executed” withina ... coarse grammars to speed up pars-ing without sacrificing optimality. Pauls andKlein (2009) showed that a hierarchy of coarsegrammars outperforms standard A∗ parsing for arange of grammars. HA∗operates...