Apart from improving the systems' accuracies in both cases, we achieve the best result to date in greedy shift-reduce parsing on the WSJ.
• Given a subset S of R(c, γ G ), the previously shown constituent decomposability property implies that there exists at least one transition sequence starting from c that generates the tree S ∪(γ c \γ G )∪E, where E is a set of erroneous constituents containing one such constituent per element of (α c \ α G ).