<!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>Indian Language Summarization using Pretrained Sequence-to-Sequence Models</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ashok Urlana</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sahil Manoj Bhatt</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Nirmal Surange</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Manish Shrivastava</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Language Technologies Research Center</institution>
          ,
          <addr-line>KCIS, IIIT Hyderabad</addr-line>
          ,
          <country country="IN">India</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The ILSUM shared task focuses on text summarization for two major Indian languages- Hindi and Gujarati, along with English. In this task, we experiment with various pretrained sequence-to-sequence models to find out the best model for each of the languages. We present a detailed overview of the models and our approaches in this paper. We secure the first rank across all three sub-tasks (English, Hindi and Gujarati). This paper also extensively analyzes the impact of k-fold cross-validation while experimenting with limited data size, and we also perform various experiments with a combination of the original and a filtered version of the data to determine the eficacy of the pretrained models.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Indian language summarization</kwd>
        <kwd>Sequence-to-Sequence models</kwd>
        <kwd>Multilingual models</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Gujarati, MBart performed the best. In order to avoid overfitting, we have performed k-fold
cross-validation on the training dataset. We have observed that Hindi k-fold experiments had
better scores than the experiments performed with the full version of the released data. We
have applied several filters to assess the quality of the released datasets. Various combinations
of filtered and original data were used to determine the eficacy of the pretrained generation
models. We talk about our models, experiments and dataset filters later in this paper.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        Text summarization has been studied extensively, especially in the English language. Early
research in summarization focused on extractive approaches, wherein summary sentences were
chosen directly from the input text. On the other hand, abstractive approaches to summarization,
such as neural attention models[
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], Seq2Seq RNNs [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], Pointer-Generator networks [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]
focus on generating summaries that capture the meaning of the input text without necessarily
choosing sentences directly from the text. With the emergence of large neural language
models for generation tasks, abstractive approaches have become more popular and generate
high-quality summaries. While there have been various improvements in model architectures
and summarization techniques, a large part of the progress in English text summarization
can be attributed to the availability of large-scale datasets, such as CNN/DailyMail[
        <xref ref-type="bibr" rid="ref14 ref16">14, 16</xref>
        ],
Gigaword[
        <xref ref-type="bibr" rid="ref13 ref17">13, 17</xref>
        ], XSum[
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], etc.
      </p>
      <p>
        This is in contrast to Indic languages, where little work has been done in summarization or
related NLG tasks, such as headline generation. In recent times, however, there has been active
research in this area, with the release of datasets such as XL-Sum[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], MassiveSumm[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], etc. These
multilingual datasets consist of article-summary pairs from publicly available news domains,
including Indian languages such as Hindi, Gujarati, Bengali, etc. The IndicNLG Suite[
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]
released datasets for several Indic language NLG tasks, such as sentence summarization and
headline generation. More work needs to be done in this area to have models comparable to
English summarization models in performance.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Corpus Description</title>
      <p>
        The dataset released for this task has been collected from several leading Indian newspaper
websites. The English and Hindi datasets were scraped from indiatvnews1, and the Gujarati
data was created by scraping the divyabhaskar2 and gujarati.news183 websites. The Hindi and
Gujarati datasets include articles/summaries which contain English words or phrases which
have been code-mixed and script-mixed. Note that we have observed a few samples of English
and Gujarati datasets, where the summaries consists of only one word. The ILSUM training
data statistics are mentioned in Table 1. We have used the Indic[
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] tokenizer to generate the
counts in Table 1.
      </p>
      <sec id="sec-3-1">
        <title>1https://www.indiatvnews.com/ 2https://www.divyabhaskar.co.in/ 3https://gujarati.news18.com/</title>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Model Description</title>
      <p>
        The pretrained language models (PLMs) used for downstream tasks are pretrained using massive
amounts of unlabeled text data. A PLM encodes extensive linguistic knowledge into a vast
amount of parameters[
        <xref ref-type="bibr" rid="ref21">21</xref>
        ], which stimulates universal representations and improves generation
quality. We have experimented with various pretrained generation models to find the optimal
architecture.
      </p>
      <p>
        T5 [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] model proposes defining every NLP task in a text-to-text format. The model consists of
an encoder-decoder Transformer architecture finetuned on the C4 corpus. In our experiments,
we use both the T5-Base (220M parameters) and T5-Large (770M parameters) versions of the
model. Since T5 is trained on an English-only dataset, we also look at the multilingual variants
of the model for our experiments in Hindi and Gujarati. The MT5 model[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] uses an architecture
very similar to T5, and is trained on 101 languages, as described in the mC4 dataset. Owing to
the large size of the models, we only finetuned the base version (580M parameters) of the MT5
model (the large version has 1.2B parameters).
      </p>
      <p>
        BART [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] is a denoising autoencoder for pretraining seq2seq models, which is similar to
both BERT and GPT. Since it uses a bidirectional encoder like BERT, and an autoregressive
decoder like GPT. The model was trained by corrupting the text using a noising function, and
reconstructing the original text. We experiment with the BART-large model (406M parameters),
and then also try out versions of the BART model finetuned on diferent datasets, namely the
BART-Large-CNN and BART-Large-XSUM model, finetuned on the CNN-Daily Mail and XSUM
datasets respectively. We try out multilingual variants[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] of the BART model for Hindi and
Gujarati summarization experiments, namely the MBart-Large-50 (610M parameters) model[
        <xref ref-type="bibr" rid="ref22">22</xref>
        ],
trained on 50 languages.
      </p>
      <p>
        PEGASUS [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] uses the extracted gap sentences (GSG) self-supervised objective strategy to
train the encoder-decoder model. Rather than masking a smaller text span as in BART and
T5, PEGASUS masks the entire sentence. Later, it concatenates the gap sentences into pseudo
summaries. It chooses the sentences based on importance. In the same way as T5, PEGASUS
does not reconstruct full sequence of inputs but only masked sentences. The pretraining is
performed with C4[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] and HugeNews corpus. We finetune the PEGASUS-large model on the
ILSUM English corpus.
      </p>
      <p>
        BRIO [23] is a novel training paradigm to achieve neural abstractive summarization, wherein
a contrastive learning component is introduced to reinforce the abstractive model’s ability to
estimate the probability of system-generated summaries more precisely instead of using MLE
training alone. Two stages are involved in this approach: the first stage generates the candidates
using a pretrained sequence-to-sequence model, and next stage selects the best one.
ProphetNet [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] introduced a novel self-supervised objective, wherein the goal is to predict
the next- tokens, instead of just optimizing for one-step ahead predictions. We experiment
with ProphetNet in our English summarization experiments.
      </p>
      <p>
        IndicBART[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] is a pretrained sequence-to-sequence model trained on 11 Indic languages and
English. It follows the masked span reconstruction objective similar to MBart. In contrast
to available generation models, IndicBART utilizes the orthographic similarity between the
Indian languages to achieve better cross-lingual transfer learning capabilities. This model size
(244M) is much smaller than MBart and MT5 models with compact vocabulary. We finetune the
IndicBART model on Hindi and Gujarati datasets.
      </p>
      <p>Adapters: Recently proposed lightweight adapters[24] are efective at mitigating the overhead
of pretrained language models for downstream tasks. We can update the adapters during
ifnetuning and freezing most of the PLM parameters. In recent work[ 25], adapters were applied
to perform Gujarati text summarization. Adapters can not only speed up training time but are
also storage eficient since they require saving only adapter weights instead of entire finetuned
model weights.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Experiments and Results</title>
      <p>We have performed experiments under two diferent settings: the first is with the entire released
dataset (full data), and the other is where we split the dataset into 10 folds and utilize 90% data
(9 folds) for training and 10% data (1 fold) for validation. In both settings, the released data in
the validation phase was used for testing purposes and we report these results in Table 2. Note
that doing such k-fold cross validation experiments were also essential to evaluate our models’
performance because validation summaries were not provided to us.</p>
      <p>We use the standard ROUGE metric[26] to compute all the scores. We observed that PEGASUS
yields the best results for English when finetuned on the full data version in the validation
phase. We achieved the best results when we finetuned IndicBART and MBart using k-fold and
full data during the validation phase. Finetuning a model on k-fold data might sometimes lead
to better results than finetuning it on the entire dataset, which indicates that the dataset needs
to be studied more and appropriate filters need to be applied, to see which examples in the
dataset contribute to the model learning something useful. We discuss this in the next section.
Based on the results of the validation phase, we submit results from the best models in the
test phase. While PEGASUS and MBart still give us the best results for English and Gujarati
respectively, MT5 performs better than IndicBART for Hindi when finetuned on k-fold data.
Hyper-parameter settings are listed in Table 4.</p>
      <p>The multilingual models have been pretrained on large amounts of data, and they are suficiently
capable of handling the presence of code-mixing in the dataset, which we observe in the outputs
as well. The models generate good summaries and can add relevant English text in Hindi and
Gujarati examples where appropriate. For instance, the average number of English words in
Hindi and Gujarati training summaries is 0.25 and 1.91 respectively. For the test set released
for Hindi and Gujarati, the summaries generated by our models have an average of 0.23 and
1.44 English words per summary. Note that the average number of English words in Hindi
summaries is less because a large number of training samples are purely in Hindi and do not
contain any English words or characters.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Data Quality Assessment</title>
      <p>
        To verify the quality of the data, we have applied some of the filters mentioned in TeSum[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
Filters were applied include checking whether there are:
1. Empty instances
2. Duplicate pairs and summaries within the dataset
3. Cases where the first few sentences of the article itself are taken as the summary
4. Check whether the summary is ‘compressed enough’, i.e., we should not have summaries
comparable in size to the text that has to be summarized. Compression is a good measure
of telling us if the summary provided is a shortened version of the input document/text
or not.
      </p>
      <p>Filters counts for all the languages can be found in Table 5. It is important to note that, based
on our filters, only about 68% of the Hindi summaries are valid since many are simply the
ifrst few sentences of the article. It could also be one of the reasons for models giving better
results on k-fold data. Some of the folds in the training data might contain a large percentage of
high-quality, valid summaries while leaving out a significant number of summaries which we
consider invalid. Note that for Gujarati and English, the number of final valid article-summary
pairs is comparable to the original dataset size, which is why the top-performing models give
better results when finetuned on the whole dataset as compared to k-fold subsets.
6.1. Data Variation Experiments
The unavailability of large datasets is one of the main bottlenecks for neural models for text
generation. The existing summarization datasets for Indian languages are quite small. To
improve the model generation capabilities on limited dataset, we did k-fold cross-validation
on the best performing models (see Table 2). The mean ROUGE scores and standard deviation
scores over 10 runs are reported in Table 6. We did 10-fold cross-validation using the released
training dataset with the following combinations:</p>
      <sec id="sec-6-1">
        <title>1. Original data: Fine-tuned for 5 epochs with released training dataset</title>
        <p>2. Original + Filtered data: Finetuned for 3 epochs with original + 2 epochs with Filtered
data
3. Filtered data: Fine-tuned for 5 epochs with only filtered dataset
4. Filtered + Original data: Finetuned for 3 epochs with filtered data + 2 epochs with
original data</p>
        <p>To perform all the experiments, we used the ‘filtered data’ obtained after applying filters
mentioned in Table 5. To compare the models’ performance on diferent variations of the
training dataset, we have not made any changes in the validation data. As observed in Table 6,
the experiments performed with ‘original’ data produce better scores than the ‘filtered’ data.
Also, the models finetuned on the combination of the ‘filtered + original’ dataset performed
better compared to the ‘original+filtered’ combination.</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>7. Discussion and Conclusions</title>
      <p>While having better models finetuned exclusively on Indian languages might benefit research
in the area of Indian Language Summarization, creating larger, high-quality datasets for such
languages will surely lead to progress in this field. It might be interesting to look at sources
other than news websites as well, and to keep in mind the filters discussed earlier while creating
the dataset.</p>
      <p>For the ILSUM task, PEGASUS, MT5 and MBart give us the best results for English, Hindi and
Gujarati respectively. We conclude that the transformer-based pretrained seq2seq models are
capable of generating high-quality summaries for the ILSUM shared task.</p>
    </sec>
    <sec id="sec-8">
      <title>Acknowledgements</title>
      <p>We thank the organizers of the ILSUM shared task for their help and support.
[23] Y. Liu, P. Liu, D. Radev, G. Neubig, Brio: Bringing order to abstractive summarization,
arXiv preprint arXiv:2203.16804 (2022).
[24] J. Pfeifer, A. Rücklé, C. Poth, A. Kamath, I. Vulić, S. Ruder, K. Cho, I. Gurevych, Adapterhub:</p>
      <p>A framework for adapting transformers, arXiv preprint arXiv:2007.07779 (2020).
[25] Z. Zhao, P. Chen, To adapt or to fine-tune: A case study on abstractive summarization,
arXiv preprint arXiv:2208.14559 (2022).
[26] C.-Y. Lin, ROUGE: A package for automatic evaluation of summaries, in: Text
Summarization Branches Out, Association for Computational Linguistics, Barcelona, Spain, 2004, pp.
74–81. URL: https://aclanthology.org/W04-1013.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>T.</given-names>
            <surname>Hasan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bhattacharjee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. S.</given-names>
            <surname>Islam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Samin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.-F.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.-B.</given-names>
            <surname>Kang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. S.</given-names>
            <surname>Rahman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Shahriyar</surname>
          </string-name>
          , Xl-sum:
          <article-title>Large-scale multilingual abstractive summarization for 44 languages</article-title>
          , arXiv preprint arXiv:
          <volume>2106</volume>
          .13822 (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>D.</given-names>
            <surname>Varab</surname>
          </string-name>
          , N. Schluter,
          <article-title>MassiveSumm: a very large-scale, very multilingual, news summarisation dataset</article-title>
          ,
          <source>in: Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing</source>
          , Association for Computational Linguistics, Online and
          <string-name>
            <given-names>Punta</given-names>
            <surname>Cana</surname>
          </string-name>
          , Dominican Republic,
          <year>2021</year>
          , pp.
          <fpage>10150</fpage>
          -
          <lpage>10161</lpage>
          . URL: https://aclanthology.org/
          <year>2021</year>
          .emnlp-main.
          <volume>797</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2021</year>
          .emnlp-main.
          <volume>797</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Urlana</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Surange</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Baswani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Ravva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Shrivastava</surname>
          </string-name>
          , Tesum:
          <article-title>Human-generated abstractive summarization corpus for telugu</article-title>
          ,
          <source>in: Proceedings of the Language Resources and Evaluation Conference</source>
          , European Language Resources Association, Marseille, France,
          <year>2022</year>
          , pp.
          <fpage>5712</fpage>
          -
          <lpage>5722</lpage>
          . URL: https://aclanthology.org/
          <year>2022</year>
          .lrec-
          <volume>1</volume>
          .
          <fpage>614</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S.</given-names>
            <surname>Satapara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Modha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Modha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Mehta</surname>
          </string-name>
          ,
          <article-title>Fire 2022 ilsum track: Indian language summarization</article-title>
          ,
          <source>in: Proceedings of the 14th Forum for Information Retrieval Evaluation</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S.</given-names>
            <surname>Satapara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Modha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Modha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Mehta</surname>
          </string-name>
          ,
          <article-title>Findings of the first shared task on indian language summarization (ilsum): Approaches, challenges and the path ahead</article-title>
          ,
          <source>in: Working Notes of FIRE 2022 - Forum for Information Retrieval Evaluation</source>
          , Kolkata, India, December 9-
          <issue>13</issue>
          ,
          <year>2022</year>
          , CEUR Workshop Proceedings, CEUR-WS.org,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>L.</given-names>
            <surname>Xue</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Constant</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Roberts</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kale</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Al-Rfou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Siddhant</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Barua</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>Raffel, mt5: A massively multilingual pre-trained text-to-text transformer</article-title>
          , arXiv preprint arXiv:
          <year>2010</year>
          .
          <volume>11934</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Edunov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ghazvininejad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          ,
          <article-title>Multilingual denoising pre-training for neural machine translation</article-title>
          ,
          <source>Transactions of the Association for Computational Linguistics</source>
          <volume>8</volume>
          (
          <year>2020</year>
          )
          <fpage>726</fpage>
          -
          <lpage>742</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>R.</given-names>
            <surname>Dabre</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Shrotriya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kunchukuttan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Puduppully</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. M. Khapra</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Kumar</surname>
          </string-name>
          ,
          <article-title>Indicbart: A pre-trained model for natural language generation of indic languages</article-title>
          ,
          <source>arXiv preprint arXiv:2109.02903</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Saleh</surname>
          </string-name>
          , P. Liu, Pegasus:
          <article-title>Pre-training with extracted gap-sentences for abstractive summarization</article-title>
          ,
          <source>in: International Conference on Machine Learning, PMLR</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>11328</fpage>
          -
          <lpage>11339</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>M.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ghazvininejad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mohamed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Levy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Stoyanov</surname>
          </string-name>
          , L. Zettlemoyer, Bart:
          <article-title>Denoising sequence-to-sequence pre-training for natural language generation, translation, and comprehension</article-title>
          , arXiv preprint arXiv:
          <year>1910</year>
          .
          <volume>13461</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>C.</given-names>
            <surname>Rafel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shazeer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Roberts</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Narang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Matena</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. J.</given-names>
            <surname>Liu</surname>
          </string-name>
          , et al.,
          <article-title>Exploring the limits of transfer learning with a unified text-to-text transformer</article-title>
          .,
          <source>J. Mach. Learn. Res</source>
          .
          <volume>21</volume>
          (
          <year>2020</year>
          )
          <fpage>1</fpage>
          -
          <lpage>67</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>W.</given-names>
            <surname>Qi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Gong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Duan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , M. Zhou, Prophetnet:
          <article-title>Predicting future n-gram for sequence-to-sequence pre-training</article-title>
          , arXiv preprint arXiv:
          <year>2001</year>
          .
          <volume>04063</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>A. M. Rush</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Chopra</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Weston</surname>
          </string-name>
          ,
          <article-title>A neural attention model for abstractive sentence summarization</article-title>
          ,
          <source>CoRR abs/1509</source>
          .00685 (
          <year>2015</year>
          ). URL: http://arxiv.org/abs/1509.00685. arXiv:
          <volume>1509</volume>
          .
          <fpage>00685</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>R.</given-names>
            <surname>Nallapati</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Xiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <article-title>Sequence-to-sequence rnns for text summarization</article-title>
          ,
          <source>CoRR abs/1602</source>
          .06023 (
          <year>2016</year>
          ). URL: http://arxiv.org/abs/1602.06023. arXiv:
          <volume>1602</volume>
          .
          <fpage>06023</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>A.</given-names>
            <surname>See</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. J.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Manning</surname>
          </string-name>
          ,
          <article-title>Get to the point: Summarization with pointergenerator networks</article-title>
          ,
          <source>CoRR abs/1704</source>
          .04368 (
          <year>2017</year>
          ). URL: http://arxiv.org/abs/1704.04368. arXiv:
          <volume>1704</volume>
          .
          <fpage>04368</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>K. M. Hermann</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Kociský</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Grefenstette</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Espeholt</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Kay</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Suleyman</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Blunsom</surname>
          </string-name>
          ,
          <article-title>Teaching machines to read and comprehend</article-title>
          ,
          <source>CoRR abs/1506</source>
          .03340 (
          <year>2015</year>
          ). URL: http: //arxiv.org/abs/1506.03340. arXiv:
          <volume>1506</volume>
          .
          <fpage>03340</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>D.</given-names>
            <surname>Graf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Maeda</surname>
          </string-name>
          , English gigaword,
          <source>Linguistic Data Consortium, Philadelphia</source>
          <volume>4</volume>
          (
          <year>2003</year>
          )
          <fpage>34</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>S.</given-names>
            <surname>Narayan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. B.</given-names>
            <surname>Cohen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lapata</surname>
          </string-name>
          ,
          <article-title>Don't give me the details, just the summary! topicaware convolutional neural networks for extreme summarization</article-title>
          , ArXiv abs/
          <year>1808</year>
          .08745 (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>A.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Shrotriya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Sahu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Dabre</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Puduppully</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kunchukuttan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mishra</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. M. Khapra</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Kumar</surname>
          </string-name>
          ,
          <article-title>Indicnlg suite: Multilingual datasets for diverse nlg tasks in indic languages</article-title>
          ,
          <year>2022</year>
          . arXiv:
          <volume>2203</volume>
          .
          <fpage>05437</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>A.</given-names>
            <surname>Kunchukuttan</surname>
          </string-name>
          , The IndicNLP Library, https://github.com/anoopkunchukuttan/indic_ nlp_library/blob/master/docs/indicnlp.pdf,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. X.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-R.</given-names>
            <surname>Wen</surname>
          </string-name>
          ,
          <article-title>Pretrained language models for text generation: A survey</article-title>
          ,
          <source>arXiv preprint arXiv:2105.10311</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Tran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Chaudhary</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <article-title>Multilingual translation with extensible multilingual pretraining and finetuning</article-title>
          , CoRR abs/
          <year>2008</year>
          .00401 (
          <year>2020</year>
          ). URL: https://arxiv.org/abs/
          <year>2008</year>
          .00401. arXiv:
          <year>2008</year>
          .00401.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>