To deal with these issues, we use a greedy search that keeps the consistency among spans and can return multiple spans for adjunct labels.
we evaluate F1 scores only for the span boundary match, shown by Table 4.