Instead, our objective is to show that high-performance domain WSD can be enabled with little effort by our framework.
pageRank Domain Glossaries as Graphs For each domain d ∈ D, we create an undirected graph is the set of concepts identified by term/gloss pairs in the domain glossary G d , i.e., V d := G d ; E d is the set of edges between pairs of concepts, where an edge {(t, g), (t , g )} exists if and only if t is such that t = t and t occurs in the bag of words of the gloss g of t. t is connected to all the domain senses of words used in its definition g. Graph-based WSD Given an input text, for each domain d ∈ D, we produce its bag of domain content words C d = {w 1 , w 2 , .