This section describes a fully unsupervised solution to this problem, computing the probability that a pattern supports a given relation, which will allow us to determine the most likely relation expressed in any sentence.
if a sentence contains two entities, e i and e j , connected through a pattern w, our model computes the probability that the pattern is expressing any relation -P (r|w)for any relation r defined in the knowledge base.