Therefore, the history graph G 2 = (V 2 , E 2 ) is an undirected graph of keywords in the preceding utterances.
all vertices in V 2 are keywords extracted from one or more previous utterances, and the edge between two keywords implies that they co-occurred at least once.