Formally, our model aims at maximizing the conditional probability p(y|x), which is decomposed as: where s = {b k i:j } denotes the set of segments that leads to y through a specific combination.
4 we divide the problem of extracting discontiguous entities into two subtasks, namely segment extraction and segment merging.