Further, the function o calculates the overlap in terms of tokens of two spans and the function p returns the number of tokens in t that are not contained in g, i. e., those which are outside the overlap (both functions taking into account the class of the span).
the first part of the objective function represents the fraction of correctly proposed contiguous tokens, while the second part penalizes a span for containing too many tokens that are outside the best span.