Two hyperedges {T k i → I k i,i } and {T k i → X} from T k i indicate that either there exists at least one mention starting with the i-th word (the former hyperedge), or there does not exist any such mention (the latter hyperedge).
for decoding, we perform the standard MAP inference on top of the complete hypergraph to find the most probable hyperpath.