With these notations, our proposed method can be formulated as the following optimization problem: where sent(g) and adj(g) indicate a set of sentences in g and a set of adjacent sentences in g, respectively.
our model tries to find the best sequence of sentences under the knapsack constraint so as to maximize the sum of weights and sentence coherence.