The transitivity constraints are formulated as These constraints ensure that when any two corefrent links (e.g., Ü , Ü ) among three mentions exist, the third one Ü must also be a link.
these constraints also bring huge time and space complexity with Ò ¿ constraints (n is number of candidate mention set M, which is larger than 700 in some documents), and cannot be solved in a restricted time and memory environment.