If we assume that the classifier returns a score, score(S i = c i ), corresponding to the likelihood of seeing label c i for argument S i , then, given a sentence, the unaltered inference task is solved by maximizing the overall score of the arguments, (1) In the presence of global constraints derived from linguistic information and structural considerations, our system seeks for a legitimate labeling that maximizes the score.
it can be viewed as the solution space is limited through the use of a filter function, F, that eliminates many argument labelings from consideration.