... Berkeley{adpauls,klein}@cs.berkeley.eduAbstractA∗parsing makes 1-best search efficient bysuppressing unlikely 1-best items. Existing k-best extraction methods can efficiently searchfor top derivations, but only after ... and Johnson, 2005), and discriminative train-ing (Och, 2003; McClosky et al., 2006). Themost efficient known algorithm for k-best parsing(Jim´enez and Marzal, 2000; Huang and Chiang,2005) ... off the agenda will be the k-best derivations.We refer to this approach as NAIVE. It is very in- efficient on its own, but it leads to the full algo-rithm.The correctness of this k-best algorithm...