The line of investigation we pursue in this paper is to consider more efficient exact algorithms.
we test different variants of the classical A* algorithm (Hart et al., 1968), which has met with success in Penn Treebank parsing with context-free grammars (Klein and Manning, 2003;Pauls and Klein, 2009a;Pauls and Klein, 2009b).