To represent a text set using n-gram graphs, we have implemented an update/merge operator between n-gram graphs of the same rank.
given two graphs, G 1 and G 2 , each representing a subset of the set of texts, we create a single graph that represents the merging of the two text subsets: The weights of the resulting graph's edges are calculated as follows: W i (e) = W 1 (e)+(W 2 (e)−W 1 (e))×l.