Traditional approaches to automatic text summarization focus on identifying important content, usually at sentence level Nenkova and McKeown (2011). With the identified important sentences, a summarization system can extract them to form an output summary. In recent years, extractive methods for summarization have proven effective in many systems Carbonell and Goldstein (1998); Mihalcea and Tarau (2004); McDonald (2007); Cao et al. (2015a). In previous works that use extractive methods, text summarization is decomposed into two subtasks, i.e., sentence scoring and sentence selection.
aims to assign an importance score to each sentence, and has been broadly studied in many previous works. Feature-based methods are popular and have proven effective, such as word probability, TF*IDF weights, sentence position and sentence length featuresLuhn (1958); Hovy and Lin (1998); Ren et al. (2017). Graph-based methods such as TextRank Mihalcea and Tarau (2004) and LexRank Erkan and Radev (2004) measure sentence importance using weighted-graphs. In recent years, neural network has also been applied to sentence modeling and scoring Cao et al. (2015a); Ren et al. (2017).
For the second step, sentence selection adopts a particular strategy to choose content sentence by sentence. Maximal Marginal Relevance Carbonell and Goldstein (1998)
based methods select the sentence that has the maximal score and is minimally redundant with sentences already included in the summary. Integer Linear Programming based methodsMcDonald (2007) treat sentence selection as an optimization problem under some constraints such as summary length. Submodular functions Lin and Bilmes (2011) have also been applied to solving the optimization problem of finding the optimal subset of sentences in a document. Ren et al. (2016) train two neural networks with handcrafted features. One is used to rank sentences, and the other one is used to model redundancy during sentence selection.
In this paper, we present a neural extractive document summarization (NeuSum) framework which jointly learns to score and select sentences. Different from previous methods that treat sentence scoring and sentence selection as two tasks, our method integrates the two steps into one end-to-end trainable model. Specifically, NeuSum is a neural network model without any handcrafted features that learns to identify the relative importance of sentences. The relative importance is measured as the gain over previously selected sentences. Therefore, each time the proposed model selects one sentence, it scores the sentences considering both sentence saliency and previously selected sentences. Through the joint learning process, the model learns to predict the relative gain given the sentence extraction state and the partial output summary.
The proposed model consists of two parts, i.e., the document encoder and the sentence extractor. The document encoder has a hierarchical architecture, which suits the compositionality of documents. The sentence extractor is built with recurrent neural networks (RNN), which provides two main functionalities. On one hand, the RNN is used to remember the partial output summary by feeding the selected sentence into it. On the other hand, it is used to provide a sentence extraction state that can be used to score sentences with their representations. At each step during extraction, the sentence extractor reads the representation of the last extracted sentence. It then produces a new sentence extraction state and uses it to score the relative importance of the rest sentences.
We conduct experiments on the CNN/Daily Mail dataset. The experimental results demonstrate that the proposed NeuSum by jointly scoring and selecting sentences achieves significant improvements over separated methods. Our contributions are as follows:
We propose a joint sentence scoring and selection model for extractive document summarization.
The proposed model can be end-to-end trained without handcrafted features.
The proposed model significantly outperforms state-of-the-art methods and achieves the best result on CNN/Daily Mail dataset.
2 Related Work
Extractive document summarization has been extensively studied for years. As an effective approach, extractive methods are popular and dominate the summarization research. Traditional extractive summarization systems use two key techniques to form the summary, sentence scoring and sentence selection. Sentence scoring is critical since it is used to measure the saliency of a sentence. Sentence selection is based on the scores of sentences to determine which sentence should be extracted, which is usually done heuristically.
Many techniques have been proposed to model and score sentences. Unsupervised methods do not require model training or data annotation. In these methods, many surface features are useful, such as term frequency Luhn (1958), TF*IDF weights Erkan and Radev (2004), sentence length Cao et al. (2015a) and sentence positions Ren et al. (2017). These features can be used alone or combined with weights.
Graph-based methods Erkan and Radev (2004); Mihalcea and Tarau (2004); Wan and Yang (2006) are also applied broadly to ranking sentences. In these methods, the input document is represented as a connected graph. The vertices represent the sentences, and the edges between vertices have attached weights that show the similarity of the two sentences. The score of a sentence is the importance of its corresponding vertex, which can be computed using graph algorithms.
use a Naive Bayes classifier to learn feature combinations.Conroy and O’leary (2001)
further use a Hidden Markov Model in document summarization.Gillick and Favre (2009) find that using bigram features consistently yields better performance than unigrams or trigrams for ROUGE Lin (2004) measures.
Carbonell and Goldstein (1998) proposed the Maximal Marginal Relevance (MMR) method as a heuristic in sentence selection. Systems using MMR select the sentence which has the maximal score and is minimally redundant with previous selected sentences. McDonald (2007) treats sentence selection as an optimization problem under some constraints such as summary length. Therefore, he uses Integer Linear Programming (ILP) to solve this optimization problem. Sentence selection can also be seen as finding the optimal subset of sentences in a document. Lin and Bilmes (2011) propose using submodular functions to find the subset.
Recently, deep neural networks based approaches have become popular for extractive document summarization. Cao et al. (2015b)
develop a novel summary system called PriorSum, which applies enhanced convolutional neural networks to capture the summary prior features derived from length-variable phrases.Ren et al. (2017) use a two-level attention mechanism to measure the contextual relations of sentences. Cheng and Lapata (2016) propose treating document summarization as a sequence labeling task. They first encode the sentences in the document and then classify each sentence into two classes, i.e., extraction or not. Nallapati et al. (2017) propose a system called SummaRuNNer with more features, which also treat extractive document summarization as a sequence labeling task. The two works are both in the separated paradigm, as they first assign a probability of being extracted to each sentence, and then select sentences according to the probability until reaching the length limit. Ren et al. (2016) train two neural networks with handcrafted features. One is used to rank the sentences to select the first sentence, and the other one is used to model the redundancy during sentence selection. However, their model of measuring the redundancy only considers the redundancy between the sentence that has the maximal score, which lacks the modeling of all the selection history.
3 Problem Formulation
Extractive document summarization aims to extract informative sentences to represent the important meanings of a document. Given a document containing sentences, an extractive summarization system should select a subset of to form the output summary . During the training phase, the reference summary and the score of an output summary under a given evaluation function are available. The goal of training is to learn a scoring function which can be used to find the best summary during testing:
where is length limit of the output summary. In this paper, is the sentence number limit.
Previous state-of-the-art summarization systems search the best solution using the learned scoring function with two methods, MMR and ILP. In this paper, we adopt the MMR method. Since MMR tries to maximize the relative gain given previous extracted sentences, we let the model to learn to score this gain. Previous works adopt Rouge recall as the evaluation considering the DUC tasks have byte length limit for summaries. In this work, we adopt the CNN/Daily Mail dataset to train the neural network model, which does not have this length limit. To prevent the tendency of choosing longer sentences, we use Rouge F1 as the evaluation function , and set the length limit as a fixed number of sentences.
Therefore, the proposed model is trained to learn a scoring function of the Rouge F1 gain, specifically:
where is the set of previously selected sentences, and we omit the condition of for simplicity. At each time , the summarization system chooses the sentence with maximal Rouge F1 gain until reaching the sentence number limit.
4 Neural Document Summarization
Figure 1 gives the overview of NeuSum, which consists of a hierarchical document encoder, and a sentence extractor. Considering the intrinsic hierarchy nature of documents, that words form a sentence and sentences form a document, we employ a hierarchical document encoder to reflect this hierarchy structure. The sentence extractor scores the encoded sentences and extracts one of them at each step until reaching the output sentence number limit. In this section, we will first introduce the hierarchical document encoder, and then describe how the model produces summary by joint sentence scoring and selection.
4.1 Document Encoding
We employ a hierarchical document encoder to represent the sentences in the input document. We encode the document in two levels, i.e., sentence level encoding and document level encoding. Given a document containing sentences. The sentence level encoder reads the -th input sentence and constructs the basic sentence representation . Here we employ a bidirectional GRU (BiGRU) Cho et al. (2014) as the recurrent unit, where GRU is defined as:
where , and are weight matrices.
The BiGRU consists of a forward GRU and a backward GRU. The forward GRU reads the word embeddings in sentence from left to right and gets a sequence of hidden states, . The backward GRU reads the input sentence embeddings reversely, from right to left, and results in another sequence of hidden states, :
where the initial states of the BiGRU are set to zero vectors, i.e., and .
After reading the words of the sentence , we construct its sentence level representation by concatenating the last forward and backward GRU hidden vectors:
We use another BiGRU as the document level encoder to read the sentences. With the sentence level encoded vectors as inputs, the document level encoder does forward and backward GRU encoding and produces two list of hidden vectors: and . The document level representation of sentence is the concatenation of the forward and backward hidden vectors:
We then get the final sentence vectors in the given document: . We use sentence and its representative vector interchangeably in this paper.
4.2 Joint Sentence Scoring and Selection
Since the separated sentence scoring and selection cannot utilize the information of each other, the goal of our model is to make them benefit each other. We couple these two steps together so that: a) sentence scoring can be aware of previously selected sentences; b) sentence selection can be simplified since the scoring function is learned to be the Rouge score gain as described in section 3.
Given the last extracted sentence , the sentence extractor decides the next sentence
by scoring the remaining document sentences. To score the document sentences considering both their importance and partial output summary, the model should have two key abilities: 1) remembering the information of previous selected sentences; 2) scoring the remaining document sentences based on both the previously selected sentences and the importance of remaining sentences. Therefore, we employ another GRU as the recurrent unit to remember the partial output summary, and use a Multi-Layer Perceptron (MLP) to score the document sentences. Specifically, the GRU takes the document level representationof the last extracted sentence as input to produce its current hidden state . The sentence scorer, which is a two-layer MLP, takes two input vectors, namely the current hidden state and the sentence representation vector , to calculate the score of sentence .
where , and are learnable parameters, and we omit the bias parameters for simplicity.
When extracting the first sentence, we initialize the GRU hidden state
with a linear layer with tanh activation function:
where and are learnable parameters, and is the last backward state of the document level encoder BiGRU. Since we do not have any sentences extracted yet, we use a zero vector to represent the previous extracted sentence, i.e., .
With the scores of all sentences at time , we choose the sentence with maximal gain score:
4.3 Objective Function
Inspired by Inan et al. (2017), we optimize the Kullback-Leibler (KL) divergence of the model prediction and the labeled training data distribution . We normalize the predicted sentence score with softmax function to get the model prediction distribution :
During training, the model is expected to learn the relative Rouge F1 gain at time step with previously selected sentences . Considering that the F1 gain value might be negative in the labeled data, we follow previous works (Ren et al., 2017) to use Min-Max Normalization to rescale the gain value to :
We then apply a softmax operation with temperature (Hinton et al., 2015) 111We set empirically according to the model performance on the development set. to produce the labeled data distribution as the training target. We apply the temperature as a smoothing factor to produce a smoothed label distribution :
Therefore, we minimize the KLloss function :
A large scale dataset is essential for training neural network-based summarization models. We use the CNN/Daily Mail dataset (Hermann et al., 2015; Nallapati et al., 2016) as the training set in our experiments. The CNN/Daily Mail news contain articles and their corresponding highlights. The highlights are created by human editors and are abstractive summaries. Therefore, the highlights are not ready for training extractive systems due to the lack of supervisions.
We create an extractive summarization training set based on CNN/Daily Mail
corpus. To determine the sentences to be extracted, we design a rule-based system to label the sentences in a given document similar toNallapati et al. (2017). Specifically, we construct training data by maximizing the Rouge-2 F1 score. Since it is computationally expensive to find the global optimal combination of sentences, we employ a greedy approach. Given a document with sentences, we enumerate the candidates from -combination to -combination . We stop searching if the highest Rouge-2 F1 score in is less than the best one in . Table 1 shows the data statistics of the CNN/Daily Mail dataset.
We conduct data preprocessing using the same method222https://github.com/abisee/cnn-dailymail in See et al. (2017), including sentence splitting and word tokenization. Both Nallapati et al. (2016, 2017) use the anonymized version of the data, where the named entities are replaced by identifiers such as entity4. Following See et al. (2017), we use the non-anonymized version so we can directly operate on the original text.
|#(Ref / Document)||1||1||1|
|Doc Len (Sentence)||31.58||26.72||27.05|
|Doc Len (Word)||791.36||769.26||778.24|
|Ref Len (Sentence)||3.79||4.11||3.88|
|Ref Len (Word)||55.17||61.43||58.31|
5.2 Implementation Details
The vocabulary is collected from the CNN/Daily Mail training data. We lower-case the text and there are 732,304 unique word types. We use the top 100,000 words as the model vocabulary since they can cover 98.23% of the training data. The size of word embedding, sentence level encoder GRU, document level encoder GRU are set to 50, 256, and 256 respectively. We set the sentence extractor GRU hidden size to 256.
We initialize the model parameters randomly using a Gaussian distribution with Xavier scheme(Glorot and Bengio, 2010). The word embedding matrix is initialized using pre-trained 50-dimension GloVe vectors (Pennington et al., 2014)333https://nlp.stanford.edu/projects/glove/. We found that larger size GloVe does not lead to improvement. Therefore, we use 50-dim word embeddings for fast training. The pre-trained GloVe vectors contain 400,000 words and cover 90.39% of our model vocabulary. We initialize the rest of the word embeddings randomly using a Gaussian distribution with Xavier scheme. The word embedding matrix is not updated during training. We use Adam (Kingma and Ba, 2015)
as our optimizing algorithm. For the hyperparameters of Adam optimizer, we set the learning rate, two momentum parameters and respectively, and
. We also apply gradient clipping(Pascanu et al., 2013) with range during training. We use dropout (Srivastava et al., 2014) as regularization with probability after the sentence level encoder and
after the document level encoder. We truncate each article to 80 sentences and each sentence to 100 words during both training and testing. The model is implemented with PyTorch(Paszke et al., 2017). We release the source code and related resources at https://res.qyzhou.me.
At test time, considering that LEAD3 is a commonly used and strong extractive baseline, we make NeuSum and the baselines extract 3 sentences to make them all comparable.
We compare NeuSum model with the following state-of-the-art baselines:
The commonly used baseline by selecting the first three sentences as the summary.
Ren et al. (2017) propose an extractive summarization system which considers the contextual information of a sentence. We train this baseline model with the same training data as our approach.
Cheng and Lapata (2016) propose an extractive system which models document summarization as a sequence labeling task. We train this baseline model with the same training data as our approach.
Nallapati et al. (2017) propose to add some interpretable features such as sentence absolute and relative positions.
Pointer-Generator Network (PGN). A state-of-the-art abstractive document summarization system proposed by See et al. (2017), which incorporates copying and coverage mechanisms.
5.4 Evaluation Metric
We employ Rouge (Lin, 2004)
as our evaluation metric.Rouge measures the quality of summary by computing overlapping lexical units, such as unigram, bigram, trigram, and longest common subsequence (LCS). It has become the standard evaluation metric for DUC shared tasks and popular for summarization evaluation. Following previous work, we use Rouge-1 (unigram), Rouge-2 (bigram) and Rouge-L (LCS) as the evaluation metrics in the reported experimental results.
We use the official ROUGE script444http://www.berouge.com/ (version 1.5.5) to evaluate the summarization output. Table 2 summarizes the results on CNN/Daily Mail data set using full length Rouge-F1555The ROUGE evaluation option is, -m -n 2 evaluation. It includes two unsupervised baselines, LEAD3 and TextRank. The table also includes three state-of-the-art neural network based extractive models, i.e., CRSum, NN-SE and SummaRuNNer. In addition, we report the state-of-the-art abstractive PGN model. The result of SummaRuNNer is on the anonymized dataset and not strictly comparable to our results on the non-anonymized version dataset. Therefore, we also include the result of LEAD3 on the anonymized dataset as a reference.
scores have a 95% confidence interval of at most0.22 as reported by the official ROUGE script. The improvement is statistically significant with respect to the results with superscript mark.
NeuSum achieves 19.01 Rouge-2 F1 score on the CNN/Daily Mail dataset. Compared to the unsupervised baseline methods, NeuSum performs better by a large margin. In terms of Rouge-2 F1, NeuSum outperforms the strong baseline LEAD3 by 1.31 points. NeuSum also outperforms the neural network based models. Compared to the state-of-the-art extractive model NN-SE (Cheng and Lapata, 2016), NeuSum performs significantly better in terms of Rouge-1, Rouge-2 and Rouge-L F1 scores. Shallow features, such as sentence position, have proven effective in document summarization (Ren et al., 2017; Nallapati et al., 2017). Without any hand-crafted features, NeuSum performs better than the CRSum and SummaRuNNer baseline models with features. As given by the 95% confidence interval in the official Rouge script, our model achieves statistically significant improvements over all the baseline models. To the best of our knowledge, the proposed NeuSum model achieves the best results on the CNN/Daily Mail dataset.
We also provide human evaluation results on a sample of test set. We random sample 50 documents and ask three volunteers to evaluate the output of NeuSum and the NN-SE baseline models. They are asked to rank the output summaries from best to worst (with ties allowed) regarding informativeness, redundancy and overall quality. Table 3 shows the human evaluation results. NeuSum performs better than the NN-SE baseline on all three aspects, especially in redundancy. This indicates that by jointly scoring and selecting sentences, NeuSum can produce summary with less content overlap since it re-estimates the saliency of remaining sentences considering both their contents and previously selected sentences.
6.1 Precision at Step-
We analyze the accuracy of sentence selection at each step. Since we extract 3 sentences at test time, we show how NeuSum performs when extracting each sentence. Given a document in test set , NeuSum predicted summary , its reference summary , and the extractive oracle summary with respect to and (we use the method described in section 5.1 to construct ), we define the precision at step as :
where is the sentence extracted at step , and is the indicator function defined as:
Figure 3 shows the precision at step of NN-SE baseline and our NeuSum. It can be observed that NeuSum achieves better precision than the NN-SE baseline at each step. For the first sentence, both NeuSum and NN-SE achieves good performance. The NN-SE baseline has 39.18% precision at the first step, and NeuSum outperforms it by 1.2 points. At the second step, NeuSum outperforms NN-SE by a large margin. In this step, the NeuSum model extracts 31.52% sentences correctly, which is 3.24 percent higher than 28.28% of NN-SE. We think the second step selection benefits from the first step in NeuSum since it can remember the selection history, while the separated models lack this ability.
However, we can notice the trend that the precision drops fast after each selection. We think this is due to two main reasons. First, we think that the error propagation leads to worse selection for the third selection. As shown in Figure 2, the and are 40.38% and 31.52% respectively, so the history is less reliable for the third selection. Second, intuitively, we think the later selections are more difficult compared to the previous ones since the most important sentences are already selected.
6.2 Position of Selected Sentences
Early works Ren et al. (2017); Nallapati et al. (2017) have shown that sentence position is an important feature in extractive document summarization. Figure 2 shows the position distributions of the NN-SE baseline, our NeuSum model and oracle on the CNN/Daily Mail test set. It can be seen that the NN-SE baseline model tends to extract large amount of leading sentences, especially the leading three sentences. According to the statistics, about 80.91% sentences selected by NN-SE baseline are in leading three sentences.
In the meanwhile, our NeuSum model selects 58.64% leading three sentences. We can notice that in the oracle, the percentage of selecting leading sentences (sentence 1 to 5) is moderate, which is around 10%. Compared to NN-SE, the position of selected sentences in NeuSum is closer to the oracle. Although NeuSum also extracts more leading sentences than the oracle, it selects more tailing ones. For example, our NeuSum model extracts more than 30% of sentences in the range of sentence 4 to 6. In the range of sentence 7 to 13, NN-SE barely extracts any sentences, but our NeuSum model still extract sentences in this range. Therefore, we think this is one of the reasons why NeuSum performs better than NN-SE.
We analyze the sentence position distribution and offer an explanation for these observations. Intuitively, leading sentences are important for a well-organized article, especially for newswire articles. It is also well known that LEAD3 is a very strong baseline. In the training data, we found that 50.98% sentences labeled as “should be extracted” belongs to the first 5 sentences, which may cause the trained model tends to select more leading sentences. One possible situation is that one sentence in the tail of a document is more important than the leading sentences, but the margin between them is not large enough. The models which separately score and select sentences might not select sentences in the tail whose scores are not higher than the leading ones. These methods may choose the safer leading sentences as a fallback in such confusing situation because there is no direct competition between the leading and tailing candidates. In our NeuSum model, the scoring and selection are jointly learned, and at each step the tailing candidates can compete directly with the leading ones. Therefore, NeuSum can be more discriminating when dealing with this situation.
Conventional approaches to extractive document summarization contain two separated steps: sentence scoring and sentence selection. In this paper, we present a novel neural network framework for extractive document summarization by jointly learning to score and select sentences to address this issue. The most distinguishing feature of our approach from previous methods is that it combines sentence scoring and selection into one phase. Every time it selects a sentence, it scores the sentences according to the partial output summary and current extraction state. Rouge evaluation results show that the proposed joint sentence scoring and selection approach significantly outperforms previous separated methods.
We thank three anonymous reviewers for their helpful comments. We also thank Danqing Huang, Chuanqi Tan, Zhirui Zhang, Shuangzhi Wu and Wei Jia for helpful discussions. The work of this paper is funded by the project of National Key Research and Development Program of China (No. 2017YFB1002102) and the project of National Natural Science Foundation of China (No. 91520204). The first author is funded by the Harbin Institute of Technology Scholarship Fund.
- Cao et al. (2015a) Ziqiang Cao, Furu Wei, Li Dong, Sujian Li, and Ming Zhou. 2015a. Ranking with recursive neural networks and its application to multi-document summarization. In AAAI, pages 2153–2159.
Cao et al. (2015b)
Ziqiang Cao, Furu Wei, Sujian Li, Wenjie Li, Ming Zhou, and WANG Houfeng.
Learning summary prior representation for extractive summarization.
Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 2: Short Papers), volume 2, pages 829–833.
- Carbonell and Goldstein (1998) Jaime Carbonell and Jade Goldstein. 1998. The use of mmr, diversity-based reranking for reordering documents and producing summaries. In Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval, pages 335–336. ACM.
- Cheng and Lapata (2016) Jianpeng Cheng and Mirella Lapata. 2016. Neural summarization by extracting sentences and words. In Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 484–494, Berlin, Germany. Association for Computational Linguistics.
- Cho et al. (2014) Kyunghyun Cho, Bart van Merrienboer, Caglar Gulcehre, Dzmitry Bahdanau, Fethi Bougares, Holger Schwenk, and Yoshua Bengio. 2014. Learning phrase representations using rnn encoder–decoder for statistical machine translation. In Proceedings of EMNLP 2014, pages 1724–1734, Doha, Qatar. Association for Computational Linguistics.
- Conroy and O’leary (2001) John M Conroy and Dianne P O’leary. 2001. Text summarization via hidden markov models. In Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval, pages 406–407. ACM.
Erkan and Radev (2004)
Günes Erkan and Dragomir R Radev. 2004.
Lexrank: Graph-based lexical centrality as salience in text
Journal of Artificial Intelligence Research, 22:457–479.
- Gillick and Favre (2009) Dan Gillick and Benoit Favre. 2009. A scalable global model for summarization. In Proceedings of the Workshop on Integer Linear Programming for Natural Langauge Processing, pages 10–18. Association for Computational Linguistics.
- Glorot and Bengio (2010) Xavier Glorot and Yoshua Bengio. 2010. Understanding the difficulty of training deep feedforward neural networks. In Aistats, volume 9, pages 249–256.
- Hermann et al. (2015) Karl Moritz Hermann, Tomas Kocisky, Edward Grefenstette, Lasse Espeholt, Will Kay, Mustafa Suleyman, and Phil Blunsom. 2015. Teaching machines to read and comprehend. In Advances in Neural Information Processing Systems, pages 1693–1701.
- Hinton et al. (2015) Geoffrey Hinton, Oriol Vinyals, and Jeff Dean. 2015. Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531.
- Hovy and Lin (1998) Eduard Hovy and Chin-Yew Lin. 1998. Automated text summarization and the summarist system. In Proceedings of a workshop on held at Baltimore, Maryland: October 13-15, 1998, pages 197–214. Association for Computational Linguistics.
- Inan et al. (2017) Hakan Inan, Khashayar Khosravi, and Richard Socher. 2017. Tying word vectors and word classifiers: A loss framework for language modeling. In Proceedings of 5th International Conference for Learning Representations.
- Kingma and Ba (2015) Diederik Kingma and Jimmy Ba. 2015. Adam: A method for stochastic optimization. In Proceedings of 3rd International Conference for Learning Representations, San Diego.
- Kupiec et al. (1995) Julian Kupiec, Jan Pedersen, and Francine Chen. 1995. A trainable document summarizer. In Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval, pages 68–73. ACM.
- Lin (2004) Chin-Yew Lin. 2004. Rouge: A package for automatic evaluation of summaries. In Text summarization branches out: Proceedings of the ACL-04 workshop, volume 8. Barcelona, Spain.
- Lin and Bilmes (2011) Hui Lin and Jeff Bilmes. 2011. A class of submodular functions for document summarization. In Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies-Volume 1, pages 510–520. Association for Computational Linguistics.
- Luhn (1958) Hans Peter Luhn. 1958. The automatic creation of literature abstracts. IBM Journal of research and development, 2(2):159–165.
- McDonald (2007) Ryan McDonald. 2007. A study of global inference algorithms in multi-document summarization. In European Conference on Information Retrieval, pages 557–564. Springer.
- Mihalcea and Tarau (2004) Rada Mihalcea and Paul Tarau. 2004. Textrank: Bringing order into text. In Proceedings of the 2004 conference on empirical methods in natural language processing.
- Nallapati et al. (2017) Ramesh Nallapati, Feifei Zhai, and Bowen Zhou. 2017. Summarunner: A recurrent neural network based sequence model for extractive summarization of documents. In AAAI, pages 3075–3081.
- Nallapati et al. (2016) Ramesh Nallapati, Bowen Zhou, Ça glar Gulçehre, and Bing Xiang. 2016. Abstractive text summarization using sequence-to-sequence rnns and beyond. In Proceedings of The 20th SIGNLL Conference on Computational Natural Language Learning.
- Nenkova and McKeown (2011) Ani Nenkova and Kathleen McKeown. 2011. Automatic summarization. Foundations and Trends® in Information Retrieval, 5(2–3):103–233.
- Pascanu et al. (2013) Razvan Pascanu, Tomas Mikolov, and Yoshua Bengio. 2013. On the difficulty of training recurrent neural networks. ICML (3), 28:1310–1318.
- Paszke et al. (2017) Adam Paszke, Sam Gross, Soumith Chintala, Gregory Chanan, Edward Yang, Zachary DeVito, Zeming Lin, Alban Desmaison, Luca Antiga, and Adam Lerer. 2017. Automatic differentiation in pytorch.
- Pennington et al. (2014) Jeffrey Pennington, Richard Socher, and Christopher D. Manning. 2014. Glove: Global vectors for word representation. In Empirical Methods in Natural Language Processing (EMNLP), pages 1532–1543.
- Řehůřek and Sojka (2010) Radim Řehůřek and Petr Sojka. 2010. Software Framework for Topic Modelling with Large Corpora. In Proceedings of the LREC 2010 Workshop on New Challenges for NLP Frameworks, pages 45–50, Valletta, Malta. ELRA.
Ren et al. (2017)
Pengjie Ren, Zhumin Chen, Zhaochun Ren, Furu Wei, Jun Ma, and Maarten de Rijke.
Leveraging contextual sentence relations for extractive summarization using a neural attention model.In Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 95–104, New York, NY, USA. ACM.
- Ren et al. (2016) Pengjie Ren, Furu Wei, CHEN Zhumin, MA Jun, and Ming Zhou. 2016. A redundancy-aware sentence regression framework for extractive summarization. In Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers, pages 33–43.
- See et al. (2017) Abigail See, Peter J. Liu, and Christopher D. Manning. 2017. Get to the point: Summarization with pointer-generator networks. In Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 1073–1083, Vancouver, Canada. Association for Computational Linguistics.
- Srivastava et al. (2014) Nitish Srivastava, Geoffrey E Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov. 2014. Dropout: a simple way to prevent neural networks from overfitting. Journal of Machine Learning Research, 15(1):1929–1958.
- Wan and Yang (2006) Xiaojun Wan and Jianwu Yang. 2006. Improved affinity graph based multi-document summarization. In Proceedings of the human language technology conference of the NAACL, Companion volume: Short papers, pages 181–184. Association for Computational Linguistics.