<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Text Summarization of Product Titles</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Joan Xiao</string-name>
          <email>joan.xiao@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Robert Munro∗</string-name>
          <email>robert.munro@gmail.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Figure Eight, Inc.</institution>
          ,
          <addr-line>San Francisco, CA</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Lilt, Inc.</institution>
          ,
          <addr-line>San Francisco, CA</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2019</year>
      </pub-date>
      <abstract>
        <p>In this work, we investigate the problem of summarizing titles of e-commerce products. With the increase in popularity of voice shopping due to smart phones and (especially) in-home speech devices, it is necessary to shorten long text-based titles to more succinct titles that are appropriate for speech. We present two extractive summarization approaches using bi-directional long short-term memory encoder-decoder network with attention mechanism. The ifrst a pproach t reats t he p roblem a s a m ulti-class n amed entity recognition problem while the second approach treats it as a binary class named entity recognition problem. As a comparison, we also evaluate two abstractive summarization approaches using the same neural network architecture. We compare the results with automated (ROUGE) and human evaluation. Our experiment demonstrates the efectiveness of both extractive summarization approaches.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
      <p>Online marketplaces often have millions of products, and the
product titles are typically intentionally made quite long for the purpose
of being found by search engines. A typical 20-word title can be
easily skimmed when it is text, but it provides a bad experience
when it needs to be read out loud. With voice shopping estimated
to hit $40+ billion across U.S. and U.K. by 2022 1, short versions or
summaries of product titles are desired to improve user experience
with voice shopping.</p>
      <p>We worked with one of the largest online e-commerce platforms
which is also one of the largest producers of in-home devices. They
ifrmly believe that voice-based search is an important future
interface for online commerce and they are expanding into speech-based
shopping. With them, we identified that a desired short title should
• BRAND: brand name of the product
• FUNCTION: what the product does
• VARIATION: variation (color, flavor, etc.)
• SIZE: size information
• COUNT: count information</p>
      <p>A product title may or may not have all 5 attributes above - often
times VARIATION, SIZE, or COUNT may not be present. Some
examples of the original product titles and desired short titles are
shown in Figure 1.</p>
      <p>Summarization techniques are classified into two categories:
extractive and abstractive. Extractive summarization identifies and
extracts key segments of the text, then assembles them to compose
a summary. Abstractive summarization generates a summary from
scratch without being constrained to reusing phrases from the
original text.</p>
      <p>In this work we apply two extractive summarization and two
abstractive summarization approaches to summarize a dataset of
ecommerce product titles, and compare results using both ROUGE-1
and ROUGE-2 scores and human judgments. The evaluation results
show that extractive summarization models consistently perform
much better than abstractive summarization models.</p>
      <p>We conclude that extractive summarization is efective for title
summarization at scale. For titles up to 36 words in length, the
summarization is as good as human summarization.
2
2.1</p>
    </sec>
    <sec id="sec-2">
      <title>BACKGROUND &amp; RELATED WORK</title>
    </sec>
    <sec id="sec-3">
      <title>Extractive Summarization</title>
      <p>
        Most work on automatic summarization has been focusing on
extractive summarization. [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] proposed a simple approach to
extractive summarization by selecting top sentences ranked by the
number of top high frequency words that are contained in the
sentences. [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] enhanced this mechanism by utilizing additional
information such as cue words, title, heading words and sentence
location.
      </p>
      <p>
        Various approaches based on graphs [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], topic modeling [
        <xref ref-type="bibr" rid="ref33">33</xref>
        ]
and supervised learning have been proposed since then. Supervised
learning methods typically model this as a classification problem
on whether a sentence in the original document should be included
in the summary or not. Hidden Markov Models [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] and
Conditional Random Fields [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ] are among the most common supervised
learning techniques used for summarization.
      </p>
      <p>
        Recently deep neural networks [
        <xref ref-type="bibr" rid="ref21 ref22 ref23 ref35 ref7">7, 21–23, 35</xref>
        ] have become
popular for extractive summarization. To date, the majority of these
approaches focus on summarizing multiple documents, or a single
document with multiple sentences.
In our work we focus on extractive summarization on product
titles which are single "sentences", although the sentences here are
fragments of sentences. Since we identified that a desired short
title should contain only the words that fall into the 5 categories
(BRAND, FUNCTION, VARIATION, SIZE and COUNT), the problem
is reduced to identifying the words in these categories, which can be
treated as a Named Entity Recognition problem. Once the essential
words are identified, a short title can be composed by assembling
these words together.
2.2
      </p>
    </sec>
    <sec id="sec-4">
      <title>Named Entity Recognition</title>
      <p>Named Entity Recognition (NER) is a subtask of information
extraction that seeks to locate and classify named entities in text into
pre-defined categories such as the names of persons, organizations,
locations, quantities, etc. NER systems have been created using
linguistic grammar-based techniques as well as statistical models
such as machine learning.</p>
      <p>
        Traditional machine learning approaches have been dominated
by applying Hidden Markov Models [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], Decision Trees [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ],
Support Vector Machines [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], and Conditional Random Fields [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]
to hand-crafted features. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] pioneered a neural network model
that requires little feature engineering and instead learns
important features from word embeddings [
        <xref ref-type="bibr" rid="ref31">31</xref>
        ] trained on large
quantities of unlabeled text. Since then, CNN, LSTM, and bidirectional
LSTM models using feature extractors for word and characters
([
        <xref ref-type="bibr" rid="ref1 ref15 ref16 ref19 ref25 ref34 ref8">1, 8, 15, 16, 19, 25, 34</xref>
        ]) have been reported to achieve
start-of-theart results on CoNLL-2003 NER task [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ].
      </p>
      <p>
        In our work we experiment with two NER based approaches for
extractive summarization.
2.3
The task of abstractive sentence summarization was formalized
around the DUC-2003 and DUC-2004 competitions [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ]. Inspired
by the success of attention model in neural machine translation, [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]
proposed a sequence-to-sequence encoder-decoder LSTM [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] with
attention mechanism for this problem, showing state-of-the-art
performance on the DUC tasks. Since then, more work using deep
neural networks has been done on focusing on handling
out-ofvocabulary words [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ] and discouraging repetition [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ].
      </p>
      <p>As a comparison with the extractive approaches, we experiment
with two abstractive summarization models on the same dataset.
3</p>
    </sec>
    <sec id="sec-5">
      <title>OUR APPROACHES</title>
      <p>We first manually extracted named entities corresponding to the
classes of BRAND, FUNCTION, VARIATION, SIZE, and COUNT,
then constructed ground truth labels separately for each model.
Once a model is trained, it makes prediction on titles from the test
set. In the case of extractive summarization models, shorter titles
are composed from the predicted named entities.</p>
      <p>Figure 2 illustrates how the labels for each model are generated
from the annotations of named entities of a product title. Figure 3
describes how a short title is generated from each model’s prediction
using the same example.
3.1</p>
    </sec>
    <sec id="sec-6">
      <title>Extractive Summarization (Multi-class NER)</title>
      <p>We treat the summarization problem as a multi-class sequence
labeling problem, where each class corresponds to the category
of a word in the product title, i.e., whether a word is a BRAND,
FUNCTION, VARIATION, SIZE, COUNT, or none of these. Once
we have the predicted classes of all words in the title, we create a
short (summary) title by concatenating all words that are classified
as having a non-trivial entity class.</p>
      <p>In this study, we obtained the ground-truth labels for NER using
the data annotation platform Figure Eight. Crowd workers were
asked to extract named entities (BRAND, FUNCTION, VARIATION,
SIZE, COUNT) from the product titles. We then construct a label for
each title using a BIO tag scheme. The product titles and these labels
(Figure 2) are then fed into a neural network. For each predicted
sequence of a title, we construct a short title using the named
entities extracted from the prediction, in the fixed order of BRAND,
FUNCTION, VARIATION, SIZE, COUNT (Figure 3).
3.2</p>
    </sec>
    <sec id="sec-7">
      <title>Extractive Summarization (Binary NER)</title>
      <p>In this approach, we treat the summarization problem as a binary
NER problem, where a word in a title belongs to the positive class if
the word is included in the summary, in contrast with the previous
multi-class NER model. We re-use the ground-truth labels from
multi-class NER task above by transforming each entity class to
the positive class ("1") and non-entity class to the negative class
("0"). The product titles and these labels are then fed into a neural
network (Figure 2).</p>
      <p>
        For each predicted sequence of a title, we construct a short title
by including the words predicted in positive class, in the same order
as they appear in the original title (Figure 3).
3.3
For the abstractive summarization task, the ground-truth labels
are constructed from the annotated named entities in the order of
BRAND, FUNCTION, VARIATION, SIZE, and COUNT, same as in
the multi-class NER approach (Figure 2).
3.4
Since the ground-truth labels for the abstractive summarization
approach above are generated in a specific order, the words in the
short title may not occur in the same order as they do in the source.
We are curious to know whether the re-ordering of the words afects
the result of the summarization. Therefore, we made one change
from the ordered abstractive summarization approach, using the
same annotated named entities but keeping the words in the same
order as they originally appear in the source (Figure 2).
Model
NER_GOLD
Multi-class NER
Binary NER
Ordered Abstractive
Unordered Abstractive
We evaluated the four approaches with the standard ROUGE metric
[
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], reporting the F1 scores on each model’s test set for ROUGE-1
and ROUGE-2 against their corresponding ground truth labels.
      </p>
      <p>In addition, we selected 1000 random product titles from the test
set and asked the crowd workers to manually summarize them. The
crowd workers were instructed to summarize in a similar manner
to how the short titles of the NER model are generated: identify
keywords corresponding to BRAND, FUNCTION, VARIATION, SIZE
and COUNT, and then create a short title using these keywords in
the order they appear in this list.</p>
      <p>We then asked diferent crowd workers to compare the short
titles produced from the models with the human summarization
results on the following metrics:
• Accuracy: on the scale of 1-10, how accurately each short
title describes the product.
• Non-factualness: whether the short title has factual errors.</p>
      <p>Only the two abstractive models were compared with human
summarization.
• Succinctness: on the scale of 1-10, how succinct each short
title is. A short title is rated as 10 if it does not contain any
non-essential words that can be removed without afecting
how accurately it describes the product. The abstractive
models are excluded from this evaluation due to the
nonfactualness problem.</p>
      <p>For each metric above, 3 crowd workers were assigned to rate the
short titles of each product title, and the average of the 3 workers’
ratings is used as the aggregated rating.</p>
      <p>Finally, in order to have a single metric to evaluate the short
titles (excluding the titles generated from the abstractive models),
we combined the human evaluation ratings on accuracy and
succinctness by taking the average of these two ratings for each title.
4.3</p>
    </sec>
    <sec id="sec-8">
      <title>Model Architecture</title>
      <p>
        For simplicity, we used the same bi-directional LSTM encoder/decoder
network with attention mechanism for all 4 approaches. Both
encoder and decoder are two-layer LSTMs with 512 hidden units.
Dropout [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ] is used at the decoder and both source and target
word embeddings, and beam search of length 5 is used during
inference. We trained the models on Amazon SageMaker 2.
5
5.1
      </p>
    </sec>
    <sec id="sec-9">
      <title>RESULTS</title>
    </sec>
    <sec id="sec-10">
      <title>Results on Test Set</title>
    </sec>
    <sec id="sec-11">
      <title>Results Compared with Human</title>
    </sec>
    <sec id="sec-12">
      <title>Summarization</title>
      <p>Table 1 also shows the F1 scores of the ROUGE-1 and ROUGE-2
on the 1000 random titles when evaluated against human
summarization. For comparison purpose, we added the short titles
generated from the labels used by the NER model, and it is named as
"NER_Gold" in the table.</p>
      <p>ANOVA and post-hoc tests on ROUGE-1 scores show that there
is no significant diference between the two extractive models, the
extractive models are significantly better than both abstractive
models, and the unordered abstractive model is significantly better
than the ordered abstractive model.</p>
      <p>On ROUGE-2 scores, the binary NER model is significantly
better than the unordered abstractive model, which is better than
multi-class NER and NER_Gold, which are better than the ordered
abstractive model.</p>
      <p>It is interesting to note that the unordered abstractive model
achieves higher scores than the ordered abstractive model, and
it even achieves higher ROUGE-2 score than the multi-class NER
model. This suggests that preserving the order of the words in the
target labels has a significant impact on the abstractive model’s
performance.</p>
      <p>For both ROUGE-1 and ROUGE-2 scores, there is no statistically
significant diference between multi-class NER and NER_Gold.
5.3</p>
    </sec>
    <sec id="sec-13">
      <title>Human Evaluation on Accuracy</title>
      <p>Table 2 lists the average and standard deviation of the crowd
workers’ rating on all 5 versions of short titles, plus the human
summarized titles.</p>
      <p>ANOVA and post-hoc test on the ratings show results
consistent with the ROUGE-1 evaluation performed above: there is no
significant diference among the extractive models and among the
abstractive models. However, NER_Gold is rated as significantly
higher than the two NER models, due to the fact that the NER
models fail to identify some named entities in some cases. And
not surprisingly, human summarization is rated as being the most
accurate among all.
2https://aws.amazon.com/sagemaker/
5.4</p>
    </sec>
    <sec id="sec-14">
      <title>Human Evaluation on Non-Factualness</title>
      <p>
        The abstractive models are known to struggle with handling
out-ofvocabulary words and often make non-factual errors [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ]. We were
curious about whether the two abstractive models perform
diferently in terms of non-factualness. Table 4 shows the percentage
of the titles are rated as having factual errors. ANOVA Test shows
that there is no significant diference between the two abstractive
models.
5.5
      </p>
    </sec>
    <sec id="sec-15">
      <title>Human Evaluation on Succinctness</title>
      <p>As the abstractive models make factual errors, this evaluation
includes only the extractive models and human summarization.</p>
      <p>Table 3 shows the average and standard deviation of the human
evaluation results on succinctness. There is no statistical diference
among the extractive models and NER_Gold, but interestingly
human summarization is rated as the least succinct among all. Some
examples (Figure 4) indicate that human summarization tends to
include words related to product variations which are not captured
by the models, and human raters do not think these variations are
essential to describe the product.
5.6</p>
    </sec>
    <sec id="sec-16">
      <title>Combined Human Evaluation on Accuracy and Succinctness</title>
      <p>Table 3 also shows the average and standard deviation of the
combined human evaluation results. Again, there is no statistically
significant diference between the two extractive models, and it
is interesting to note that even though NER_Gold is significantly
better than the two extractive models, there is no statistically
significant diference between human summarization and any of the
other 3 versions.</p>
      <p>To understand how the ratings vary with the length of product
titles, we show in Figure 5 the average combined rating broken
down by number of words in the product titles. And Table 5 shows
the word count distribution of these product titles. We see that
the two NER models perform very close to human summarization
unless the product titles are extremely long (with more than 37
words, which accounts for only 0.2% of the titles).
6</p>
    </sec>
    <sec id="sec-17">
      <title>CONCLUSION</title>
      <p>We applied four diferent deep learning based approaches to product
title summarization on a dataset of 56,200 product titles and used
both ROUGE scores and human judgments to evaluate the results on
a random 1000 titles from the test set. The evaluation results show
that extractive summarization models consistently perform much
better than the abstractive summarization models, and overall there
is no statistically significant diference between the two extractive
models and human summarization.</p>
      <p>
        There are several avenues for future work. First, in this study we
used the same neural network architecture for all models, so we did
not use the latest and greatest neural network architecture for NER,
and this is evident in the gap in accuracy between NER_Gold and
NER models when the product titles are longer (Figure 5). We plan to
adopt the state-of-the-art architectures such as Elmo [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] and Flair
[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] contextual embeddings for the two NER models for future study.
In addition, we plan to experiment with self-attention transformer
[
        <xref ref-type="bibr" rid="ref32">32</xref>
        ] based models such as OpenAI GPT [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], BERT [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] and [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
These models do not use recurrent neural networks therefore do
not restrict their prediction performance to short sequences, and
all have achieved competitive results on CoNLL 2003 NER task.
      </p>
      <p>
        Second, for abstractive summarization, even with the high
percentage of titles making non-factual errors (Table 4), the ROUGE-1
and ROUGE-2 and human evaluation on accuracy are still
considerably high, which suggests that abstractive summarization may
achieve good results if the non-factual errors are eliminated. We
plan to explore the copy mechanism in pointer and generator
approaches ([
        <xref ref-type="bibr" rid="ref22 ref27">22, 27</xref>
        ]) in future study.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Alan</given-names>
            <surname>Akbik</surname>
          </string-name>
          , Duncan Blythe, and
          <string-name>
            <given-names>Roland</given-names>
            <surname>Vollgraf</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Contextual String Embeddings for Sequence Labeling</article-title>
          .
          <source>In Proceedings of the 27th International Conference on Computational Linguistics</source>
          .
          <article-title>Association for Computational Linguistics</article-title>
          , Santa Fe, New Mexico, USA,
          <fpage>1638</fpage>
          -
          <lpage>1649</lpage>
          . https://www.aclweb.org/anthology/C18-1139
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Radford</given-names>
            <surname>Alec</surname>
          </string-name>
          , Narasimhan Karthik, Salimans Tim, and Ilya Sutskever Openai.
          <year>2018</year>
          .
          <article-title>Improving Language Understanding by Generative Pre-Training</article-title>
          .
          <source>Technical Report</source>
          . https://doi.org/10.1093/aob/mcp031
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Masayuki</given-names>
            <surname>Asahara</surname>
          </string-name>
          and
          <string-name>
            <given-names>Yuji</given-names>
            <surname>Matsumoto</surname>
          </string-name>
          .
          <year>2003</year>
          .
          <article-title>Japanese Named Entity Extraction with Redundant Morphological Analysis</article-title>
          .
          <source>In Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1 (NAACL '03)</source>
          .
          <article-title>Association for Computational Linguistics</article-title>
          , Stroudsburg, PA, USA,
          <fpage>8</fpage>
          -
          <lpage>15</lpage>
          . https://doi.org/10.3115/1073445.1073447
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Alexei</given-names>
            <surname>Baevski</surname>
          </string-name>
          , Sergey Edunov, Yinhan Liu, Luke S. Zettlemoyer, and
          <string-name>
            <given-names>Michael</given-names>
            <surname>Auli</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Cloze-driven Pretraining of Self-attention Networks</article-title>
          . CoRR abs/
          <year>1903</year>
          .07785 (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Dzmitry</given-names>
            <surname>Bahdanau</surname>
          </string-name>
          , Kyunghyun Cho, and
          <string-name>
            <given-names>Yoshua</given-names>
            <surname>Bengio</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Neural Machine Translation by Jointly Learning to Align and Translate</article-title>
          .
          <source>CoRR abs/1409</source>
          .0473 (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Daniel</surname>
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Bikel</surname>
            , Scott Miller,
            <given-names>Richard M.</given-names>
          </string-name>
          <string-name>
            <surname>Schwartz</surname>
          </string-name>
          , and
          <string-name>
            <surname>Ralph</surname>
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Weischedel</surname>
          </string-name>
          .
          <year>1997</year>
          .
          <article-title>Nymble: a High-Performance Learning Name-finder</article-title>
          .
          <source>In ANLP.</source>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Jianpeng</given-names>
            <surname>Cheng and Mirella Lapata</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Neural Summarization by Extracting Sentences and Words</article-title>
          .
          <source>CoRR abs/1603</source>
          .07252 (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Jason</surname>
            <given-names>P. C.</given-names>
          </string-name>
          <string-name>
            <surname>Chiu</surname>
            and
            <given-names>Eric</given-names>
          </string-name>
          <string-name>
            <surname>Nichols</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Named Entity Recognition with Bidirectional LSTM-CNNs. Transactions of the Association for Computational Linguistics 4 (</article-title>
          <year>2016</year>
          ),
          <fpage>357</fpage>
          -
          <lpage>370</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Ronan</given-names>
            <surname>Collobert</surname>
          </string-name>
          , Jason Weston, Léon Bottou, Michael Karlen, Koray Kavukcuoglu, and
          <string-name>
            <given-names>Pavel P.</given-names>
            <surname>Kuksa</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>Natural Language Processing (almost) from Scratch</article-title>
          .
          <source>Journal of Machine Learning Research</source>
          <volume>12</volume>
          (
          <year>2011</year>
          ),
          <fpage>2493</fpage>
          -
          <lpage>2537</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>John</surname>
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Conroy</surname>
          </string-name>
          and
          <string-name>
            <surname>Dianne P. O'Leary</surname>
          </string-name>
          .
          <year>2001</year>
          .
          <article-title>Text Summarization via Hidden Markov Models</article-title>
          .
          <source>In SIGIR.</source>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Jacob</surname>
            <given-names>Devlin</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ming-Wei</surname>
            <given-names>Chang</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Kenton</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and Kristina</given-names>
            <surname>Toutanova</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding</article-title>
          . CoRR abs/
          <year>1810</year>
          .04805 (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>H. P.</given-names>
            <surname>Edmundson</surname>
          </string-name>
          .
          <year>1969</year>
          .
          <article-title>New Methods in Automatic Extracting</article-title>
          .
          <source>J. ACM</source>
          <volume>16</volume>
          (
          <year>1969</year>
          ),
          <fpage>264</fpage>
          -
          <lpage>285</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Günes</given-names>
            <surname>Erkan and Dragomir R. Radev</surname>
          </string-name>
          .
          <year>2004</year>
          .
          <article-title>LexRank: Graph-based Lexical Centrality as Salience in Text Summarization</article-title>
          .
          <source>J. Artif. Intell. Res</source>
          .
          <volume>22</volume>
          (
          <year>2004</year>
          ),
          <fpage>457</fpage>
          -
          <lpage>479</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>Sepp</given-names>
            <surname>Hochreiter</surname>
          </string-name>
          and
          <string-name>
            <given-names>Jürgen</given-names>
            <surname>Schmidhuber</surname>
          </string-name>
          .
          <year>1997</year>
          .
          <article-title>Long Short-Term Memory</article-title>
          .
          <source>Neural Computation</source>
          <volume>9</volume>
          (
          <year>1997</year>
          ),
          <fpage>1735</fpage>
          -
          <lpage>1780</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Zhiheng</surname>
            <given-names>Huang</given-names>
          </string-name>
          , Wei Xu,
          <string-name>
            <given-names>and Kai</given-names>
            <surname>Yu</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Bidirectional LSTM-CRF Models for Sequence Tagging</article-title>
          .
          <source>CoRR abs/1508</source>
          .
          <year>01991</year>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Guillaume</surname>
            <given-names>Lample</given-names>
          </string-name>
          , Miguel Ballesteros, Sandeep Subramanian, Kazuya Kawakami, and
          <string-name>
            <given-names>Chris</given-names>
            <surname>Dyer</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Neural Architectures for Named Entity Recognition</article-title>
          .
          <source>In HLT-NAACL.</source>
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Chin-Yew Lin</surname>
          </string-name>
          .
          <year>2004</year>
          .
          <article-title>ROUGE: A Package For Automatic Evaluation Of Summaries</article-title>
          .
          <source>In ACL</source>
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Hans</surname>
            <given-names>Peter</given-names>
          </string-name>
          <string-name>
            <surname>Luhn</surname>
          </string-name>
          .
          <year>1958</year>
          .
          <article-title>The Automatic Creation of Literature Abstracts</article-title>
          .
          <source>IBM Journal of Research and Development</source>
          <volume>2</volume>
          (
          <year>1958</year>
          ),
          <fpage>159</fpage>
          -
          <lpage>165</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>Xuezhe</given-names>
            <surname>Ma</surname>
          </string-name>
          and
          <string-name>
            <surname>Eduard H. Hovy</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>End-to-end Sequence Labeling via Bidirectional LSTM-CNNs-CRF</article-title>
          .
          <source>CoRR abs/1603</source>
          .01354 (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>Andrew</given-names>
            <surname>McCallum</surname>
          </string-name>
          and
          <string-name>
            <given-names>Wei</given-names>
            <surname>Li</surname>
          </string-name>
          .
          <year>2003</year>
          .
          <article-title>Early results for Named Entity Recognition with Conditional Random Fields, Feature Induction and Web-Enhanced Lexicons</article-title>
          . In CoNLL.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>Ramesh</surname>
            <given-names>Nallapati</given-names>
          </string-name>
          , Feifei Zhai, and
          <string-name>
            <given-names>Bowen</given-names>
            <surname>Zhou</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>SummaRuNNer: A Recurrent Neural Network based Sequence Model for Extractive Summarization of Documents</article-title>
          .
          <source>In AAAI.</source>
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>Ramesh</surname>
            <given-names>Nallapati</given-names>
          </string-name>
          , Bowen Zhou, Cícero Nogueira dos Santos, ÃĞaglar GülÃğehre, and
          <string-name>
            <given-names>Bing</given-names>
            <surname>Xiang</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Abstractive Text Summarization using Sequence-tosequence RNNs and Beyond</article-title>
          . In CoNLL.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <surname>Ramesh</surname>
            <given-names>Nallapati</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bowen Zhou</surname>
          </string-name>
          , and Mingbo Ma.
          <year>2017</year>
          .
          <article-title>Classify or Select: Neural Architectures for Extractive Document Summarization</article-title>
          .
          <source>CoRR abs/1611</source>
          .04244 (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>Paul</given-names>
            <surname>Over</surname>
          </string-name>
          , Hoa Dang, and
          <string-name>
            <surname>Donna</surname>
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Harman</surname>
          </string-name>
          .
          <year>2007</year>
          .
          <article-title>DUC in context</article-title>
          .
          <source>Inf. Process. Manage</source>
          .
          <volume>43</volume>
          (
          <year>2007</year>
          ),
          <fpage>1506</fpage>
          -
          <lpage>1520</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <surname>Matthew</surname>
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Peters</surname>
            , Mark Neumann, Mohit Iyyer, Matt Gardner, Christopher Clark,
            <given-names>Kenton</given-names>
          </string-name>
          <string-name>
            <surname>Lee</surname>
          </string-name>
          , and
          <string-name>
            <surname>Luke</surname>
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Zettlemoyer</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Deep contextualized word representations</article-title>
          .
          <source>In NAACL-HLT.</source>
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>Erik</given-names>
            <surname>Tjong Kim Sang and Fien De Meulder</surname>
          </string-name>
          .
          <year>2003</year>
          .
          <article-title>Introduction to the CoNLL-2003 Shared Task: Language-Independent Named Entity Recognition</article-title>
          . In CoNLL.
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <surname>Abigail</surname>
            <given-names>See</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Peter J. Liu</surname>
            , and
            <given-names>Christopher D.</given-names>
          </string-name>
          <string-name>
            <surname>Manning</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Get To The Point: Summarization with Pointer-Generator Networks</article-title>
          .
          <source>In ACL.</source>
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>Satoshi</given-names>
            <surname>Sekine</surname>
          </string-name>
          .
          <year>1998</year>
          .
          <article-title>Description of the Japanese NE System Used for MET-2</article-title>
          . In MUC.
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <surname>Dou</surname>
            <given-names>Shen</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jian-Tao</surname>
            <given-names>Sun</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Hua</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Qiang</given-names>
            <surname>Yang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Zheng</given-names>
            <surname>Chen</surname>
          </string-name>
          .
          <year>2007</year>
          .
          <article-title>Document Summarization Using Conditional Random Fields</article-title>
          .
          <source>In IJCAI.</source>
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <surname>Nitish</surname>
            <given-names>Srivastava</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Geofrey E.</given-names>
            <surname>Hinton</surname>
          </string-name>
          , Alex Krizhevsky, Ilya Sutskever, and
          <string-name>
            <surname>Ruslan</surname>
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Salakhutdinov</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Dropout: a simple way to prevent neural networks from overfitting</article-title>
          .
          <source>Journal of Machine Learning Research</source>
          <volume>15</volume>
          (
          <year>2014</year>
          ),
          <fpage>1929</fpage>
          -
          <lpage>1958</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <surname>Florian</surname>
            <given-names>Strub</given-names>
          </string-name>
          , Harm de Vries, Jérémie Mary, Bilal Piot, Aaron C. Courville, and
          <string-name>
            <given-names>Olivier</given-names>
            <surname>Pietquin</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>End-to-end optimization of goal-driven and visually grounded dialogue systems</article-title>
          .
          <source>In IJCAI.</source>
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <surname>Ashish</surname>
            <given-names>Vaswani</given-names>
          </string-name>
          , Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones,
          <string-name>
            <given-names>Aidan N.</given-names>
            <surname>Gomez</surname>
          </string-name>
          , Lukasz Kaiser, and
          <string-name>
            <given-names>Illia</given-names>
            <surname>Polosukhin</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Attention Is All You Need</article-title>
          .
          <source>In NIPS.</source>
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <surname>Dingding</surname>
            <given-names>Wang</given-names>
          </string-name>
          , Shenghuo Zhu,
          <string-name>
            <given-names>Tao</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and Yihong</given-names>
            <surname>Gong</surname>
          </string-name>
          .
          <year>2009</year>
          .
          <article-title>Multi-Document Summarization using Sentence-based Topic Models</article-title>
          . In ACL/IJCNLP.
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <surname>Zhilin</surname>
            <given-names>Yang</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ruslan R. Salakhutdinov</surname>
          </string-name>
          , and William W. Cohen.
          <year>2016</year>
          .
          <article-title>Multi-Task Cross-Lingual Sequence Tagging from Scratch</article-title>
          .
          <source>CoRR abs/1603</source>
          .06270 (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>Wenpeng</given-names>
            <surname>Yin</surname>
          </string-name>
          and
          <string-name>
            <given-names>Yulong</given-names>
            <surname>Pei</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Optimizing Sentence Modeling and Selection for Document Summarization</article-title>
          .
          <source>In IJCAI.</source>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>