However, the global optimum is expensive with a time complexity of O(|M||M * l |).
we approximately identify each mention sense independently: where P (C(m l )|s * j ), local context information (Section 3), denotes the probability of the local contexts of m l given its mention sense s * j .