tokens: I am afraid that without some complicated regularity conditions on the scoring function this is the best we can get , unless you consider the definition of an NP-hard optimization problem to be ' a problem for which , given a candidate solution S , we can in polynomial time verify whether S is optimal ' , in which case ' is-optimal ' is clearly P and it 's no fun at all:/
ner_tags: O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B-Variable O O O O O O O O B-Variable O O O O O O O O O O O O O O O O O O O O