For sequential search problems, such as tagging and incremental parsing, beam search coupled with perceptron algorithms that account for potential search errors have been shown to be a powerful combination (Collins and Roark, 2004;Daumé and Marcu, 2005;Zhang and Clark, 2008;Huang et al., 2012).
sequential search algorithms, and in particular left-to-right beam search (Collins and Roark, 2004;Zhang and Clark, 2008), squeeze inference into a very narrow space.