For the relation descriptor extraction problem, however, we expect that there is either a single relation descriptor sequence or no such sequence.
for a given relation instance, we only expect two kinds of label sequences: (1) All y i are O, and (2) exactly one y i is B-REL followed by zero or more consecutive I-REL while all other y i are O.