We adopt a maximum soft-margin framework for this learning problem.
we find parameters θ, U , V , W , and {ξ i } that minimize where ŷ i −y i 1 is the number of mismatched arcs between the two trees, and ξ i is a non-negative slack variable.