Furthermore, we construct a weighted directed graph by matching the tree of the original sentence with semantic trees of each sense candidate.
(3) The basic principle is to count C 1,1 (the number of occurrences of w i and w j together), C 1,2 ( the number of occurrences of w i without w j ), C 2,1 (the number of occurrence of w j without w i ) and C 2,2 (the number of bigrams in the corpus that don't contains w i or w j ).