Then, for each window, we predict whether it contains a (possibly partial) relation or not, and which tokens belong to a particular part of the relation.
for each token our model predicts one of four classes, None, Arg1, Arg2, or Conn. We illustrate the process using the first example from Table 1.