In this section, we describe how to accurately represent a predicate in a specific context.
given a predicate p, its context c and all features {f1, f2, …, fn}, we represent predicate p as a vector: where is the relevance score between predicate p and feature fi under context c. In following we first develop a context-insensitive random walk algorithm which can estimate context-insensitive relevance score between a predicate p and a feature f, then we extend the algorithm by taking context into consideration.