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 greedily select higher scoring labeled spans subject to two constraints.