In order to get the edges in E − E, we first collect a set of Subject-Verb-Object (SVO) triples D = {(s, v, o, c)} from a large dependency parsed text corpus, with c ∈ R + denoting the frequency of this triple in the corpus.
the additional edge set is then defined as We define S = {v | ∃(s, v, o) ∈ E syntactic } and set t = t ∪ S. for each pair of directly connected nodes in the KB graph G, we add an additional edge between those two nodes for each verb which takes the NPs represented by two nodes as subjects and objects (or vice versa) as observed in a text corpus.