The mention ranking approach can be represented as an unlabeled graph.
we allow any graph with edges A ⊆ {(m j , m i ) | j > i} such that for all j there is exactly one i with (m j , m i ) ∈ A (each anaphor has exactly one antecedent).