At the heart of the mapping algorithm lies the calculation of the conditional probability p(s|w) of selecting the Word-Net sense s given the Wikipage w. The sense s which maximizes this probability can be obtained as follows: The latter formula is obtained by observing that p(w) does not influence our maximization, as it is a constant independent of s. As a result, the most appropriate sense s is determined by maximizing the joint probability p(s, w) of sense s and page w. We estimate p(s, w) as: where score(s, w) = |Ctx(s) ∩ Ctx(w)| + 1 (we add 1 as a smoothing factor).
in our algorithm we determine the best sense s by computing the intersection of the disambiguation contexts of s and w, and normalizing by the scores summed over all senses of w in Wikipedia and WordNet.