Given the current utterance graph G 1 = (V 1 , E 1 ) and the history graph is a set of vertices from G 2 which are directly connected to the words in V 1 .
v 3 contains the words of G 1 and their direct neighbor words in G 2 .