Creating a Probabilistic Graph for WordNet using Markov Logic Network
Lubomir Stanchev · 2016
The paper shows how to create a probabilistic graph for WordNet. A node is created for every word and phrase in WordNet. An edge between two nodes is labeled with the probability that a user that is interested in the source concept will also be interested in the destination concept. For example, an edge with weight 0.3 between "canine" and "dog" indicates that there is a 30% probability that a user who searches for "canine" will be interested in results that contain the word "dog". We refer to the graph as probabilistic because we enforce the constraint that the sum of the weights of all the edges that go out of a node add up to one. Structural (e.g., the word "canine" is a hypernym (i.e., kind of) of the word "dog") and textual (e.g., the word "canine" appears in the textual definition of the word "dog") data from WordNet is used to create a Markov logic network, that is, a set of first order formulas with probabilities. The Markov logic network is then used to compute the weights of the edges in the probabilistic graph. We experimentally validate the quality of the data in the probabilistic graph on two independent benchmarks: Miller and Charles and WordSimilarity-353.