5 Unary Merging Though this technique solves the problem with the structured perceptron for a simpler shift-reduce system, say for dependency grammar, the existence of unary actions, as mentioned in Section 2.1, requires additional effort in order to apply it to constituent parsing.
constituent parsing takes different numbers of SH state p: actions for each derivation, which means that the scores of two final states may contain different offset values.