We adopt a max-margin framework for this learning problem.
we aim to find parameter values that score the gold target trees higher than others: where ξ i ≥ 0 is the slack variable (non-zero values are penalized against) and ŷ i − y 1 is the hamming distance between the gold treeŷ i and a candidate parse y.