To fix the semantics-equality above, we use the notion of the 'Other' tag in NER, which has the semantics of "all the rest".
for every d / ∈ T F G , a fine-grained tag 'd-Other' ∈ T F G and an edge 'd-Other'→'d' are automatically added to the graph, hence 'd-Other'∈ Fine(d).