This is not possible with a chart-based parser, in which complete derivations must be built first.
a shift-reduce parser is able to consider a much larger set of categories per word for a given input, achieving higher lexi-cal assignment accuracy than the C&C parser (Clark and Curran, 2007), even with the same supertagging model (Zhang and Clark, 2011;Xu et al., 2014).