In principle, w could have been tuned by maximizing conditional probability or maximizing margin.
these two options require either marginalization or numerical optimization, neither of which is tractable over the space of output sentences y and correspondences h. In contrast, the perceptron algorithm requires only a decoder that computes f (x; w).