<!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>Bidirectional Hindi-Punjabi Machine Translation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Mukund K Roy</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Karunesh K Arora</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sunita Arora</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>SNLP Lab</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Noida</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Uttar Pradesh</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>India</string-name>
        </contrib>
      </contrib-group>
      <abstract>
        <p>This paper presents the development and comprehensive assessment of a Hindi-Punjabi machine translation system tailored specifically for the MTIL (Machine Translation for Indian Languages) track of FIRE 2023. Leveraging neural machine translation techniques, we developed a robust translation model to facilitate seamless communication between Hindi and Punjabi, two prominent Indian languages despite low resource availability. The methodology involved fine-tuning a pretrained NLLB-1.3B to adapt to the Hindi-Punjabi translation task. To evaluate the efficacy of the translation system, we conducted comprehensive experiments using standard evaluation metrics on FLORES, as well as, on our own testset. Our results demonstrate promising performance of Punjabi-Hindi language pair, showcasing highest score in terms of BLEU, chrF and TER metrics across all domain specific translations in the track. Similarly, our Hindi-Punjabi pair also scored the highest in all domains except Governance domain where our chrF and COMET scores marginally second highest though BLEU and TER were still the highest. The findings underscore the viability and potential of our developed machine translation system, contributing to the advancement of translation technology for Indian languages in diverse applications.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Machine Translation</kwd>
        <kwd>Hindi-Punjabi</kwd>
        <kwd>Transformer based NMT</kwd>
        <kwd>NLLB-200</kwd>
        <kwd>Finetuning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        One of the key advancements in NMT was the development of the encoder-decoder architecture
(Sutskever et al., 2014) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] wherein the encoder takes a source-language sentence as input and generates
a representation of its meaning. After that, the decoder part takes this representation and generates a
target-language sentence that is equivalent in meaning to the source sentence. Another major
advancement was from (Bahdanau et al., 2014; Vaswani et al., 2017) [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] where they developed attention
mechanisms. Attention mechanisms allow the decoder to focus on different parts of the source sentence
when generating the target sentence. This helps to improve the accuracy of translations by allowing the
decoder to pay attention to the most relevant information in the source sentence. The development of
transformer-based NMT models (Vaswani et al., 2017) [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] had also been a significant breakthrough.
Transformer models are based on a self-attention mechanism that allows them to process all parts of
the source sentence simultaneously, without the need for recurrent neural networks (RNNs). This makes
transformer models more efficient and scalable than RNN-based NMT models. To continue further,
(Tang et al., 2018; Firat et al., 2016, Johnson et al, 2017) [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ][
        <xref ref-type="bibr" rid="ref5">5</xref>
        ][
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] developed a multilingual models that
can translate between multiple languages. These models are trained on large amounts of data in multiple
languages, which allows them to learn the relationships between different languages more effectively.
One notable example of a multilingual NMT model is NLLB-200, developed by Meta AI (Costa-jussà
et al., 2022) [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. NLLB-200 is a single AI model that can translate across 200 different languages with
state-of-the-art results. NLLB-200 has the ability to translate between a wide ranges of languages,
including many low-resource languages. The NLLB model has been shown to achieve state-of-the-art
results on a variety of benchmark datasets.
      </p>
      <p>This paper outlines the building a high-performance translation model for the Hindi-Punjabi
language pair which poses a significant challenge due to the scarcity of parallel training data. To address
this limitation, we employed NLLB-200-3.3B, a state-of-the-art multilingual neural machine translation
model designed to excel in low-resource settings. NLLB-200's ability to effectively utilize data from
multiple languages, including Hindi and Punjabi, made it an ideal starting point for our translation
model. By fine-tuning NLLB-200 on a carefully curated dataset of parallel Hindi-Punjabi sentences,
we were able to achieve significant improvements in translation accuracy in compared to training a
transformer model from scratch using the available corpus. The resulting translation model
demonstrates the potential of NLLB-200 for low-resource machine translation tasks and its ability to
bridge the communication gap between speakers of Hindi and Punjabi.</p>
      <p>Our team participated in the FIRE-2023 MTIL challenge for both Punjabi to Hindi and Hindi to
Punjabi language pairs. We employed NLLB-200, a cutting-edge machine translation model optimized
for resource-constrained environments, as the foundation for our submissions. We further enhanced the
model's performance by training it on general domain data, governance domain data, and healthcare
domain data as described in next section. The effectiveness of our model was evaluated using chrF
(character-level F-score) [8], the official metric for the task. Our model achieved the highest chrF scores
Punjabi to Hindi in all domains. For Hindi to Punjabi language pairs, except for Governance domain,
our model again achieved highest chrF score among all participating teams.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Dataset</title>
      <p>The dataset for this task consisted of a parallel corpus of Hindi-Punjabi sentence pairs collected from
diverse domains, including General, Agriculture, Tourism, Education, Science &amp; Technology,
Governance, Health and News articles. Overall 140K parallel sentences were collected and curated for
this task. Majority of the corpus, though human translated, but needed some vetting, cleaning and
preprocessing before sending for training of the translation model. The dataset was split into training,
development, and test sets to facilitate model training and evaluation. In addition, FLORES test set [9]
is also used to evaluate the system which contains 1012 sentence pairs.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Methodology</title>
      <p>In order to build Hindi-Punjabi and Punjabi-Hindi translation models, we fine-tuned the
NLLB-2001.3B pretrained model with our corpus. For evaluating both the models, we used two datasets i.e. our
own (CDACN) test set containing 1000 sentences of mixed of domain and another publicly available
FLORES test set. It was necessary to maintain the fairness and avoid biasness.</p>
      <p>For our training purpose, we used SOTA Opennmt-Py toolkit which provides different
configurations of building NMT models to play with. In this work, we built Transformer model from
scratch and Fine-tuned model using the same toolkit. We used following methodology to train our
models:
3.1.</p>
    </sec>
    <sec id="sec-4">
      <title>Data preprocessing</title>
      <p>Preprocessing plays a pivotal role in training Neural Machine Translation (NMT) models within the
OpenNMT-py toolkit [10], serving as the foundational step in transforming raw textual data into a
format suitable for effective model learning and translation. Primarily, the preprocessing workflow
encompasses cleaning, tokenization, normalization, subword segmentation, and vocabulary
construction. Tokenization, the initial step in preprocessing, involves breaking the text into smaller
linguistic units, typically words or subword units, facilitating the model's understanding of the input.
Subword tokenization, often implemented using Byte Pair Encoding (BPE) or SentencePiece, is widely
preferred for its ability to handle Out of Vocabulary (OOV) words by splitting them into subword units,
promoting better generalization and handling of unseen vocabulary during translation. Subword
segmentation, using BPE or SentencePiece, further refines the tokenization process by breaking down
words into smaller subword units based on their frequency of occurrence within the dataset.
Normalization follows tokenization and involves standardizing the text by resolving issues such as
punctuation, casing, and other linguistic variations. Vocabulary construction is another pivotal aspect
of preprocessing in OpenNMT-py. It involves building a vocabulary set that comprises the most
frequent tokens or subword units from the training data. Careful selection of the vocabulary size is
crucial as it directly impacts the model's ability to generalize while also influencing the computational
requirements. The vocabulary size must strike a balance between coverage of commonly occurring
tokens and efficiency in model training. In OpenNMT-py, preprocessing is streamlined using the
‘preprocess.py’ script. This script takes the raw text data and performs the necessary preprocessing
steps, generating vocabulary files and training and validation datasets in a format compatible with the
NMT model.
3.2.</p>
    </sec>
    <sec id="sec-5">
      <title>Model Training</title>
      <p>As stated earlier, we fine-tuned the NLLB-200 pretrained model with our training dataset. We used
the NLLB-200-3.3B which is basically a transformer-based encoder-decoder architecture with 3.3B
parameters. It is trained on over 2TB of text data in 1220 language pairs, including 202 languages. The
model is mainly intended for research in MT, primarily for low-resourced languages. It can perform
translation of single sentence between 200 languages. Due to the dependency on this model, we
customized the SentencePiece model [11] to work on OpenNMT toolkit and used it as tokenization
method. The architecture of training model was also modified accordingly by incorporating 24 layers
Transformer Encoder Decoder. The Feed Forward Network (FFN) now had 8192 hidden units and word
vector size was doubled to become 1024. Similarly optimizing methods is also modified to use Standard
Gradient Descent method.</p>
      <p>The Model training begins with feeding the preprocessed parallel training data into the fine-tuning
framework. The framework splits the data into batches for efficient training. During the forward pass,
the input sentence in the source language is passed through the encoder of the NLLB-200 model. The
encoder generates a representation of the input sentence's meaning. The attention mechanism of this
architecture allows the decoder to concentrate only on relevant parts of the encoder's representation
while generating the output in the target language. The decoder generates a sequence of words in the
target language, one word at a time, based on the encoder's representation and the attention mechanism.
The predicted output sequence is compared to the actual target sequence to calculate the loss, which
represents the model's error. The loss is propagated backward through the model to update the weights
of the encoder and decoder. The optimizer adjusts the model's weights to minimize the loss, gradually
improving the model's ability to translate sentences accurately.</p>
    </sec>
    <sec id="sec-6">
      <title>4. Evaluation</title>
      <p>In this section, we have discussed about evaluation of our fine-tuned model using BLEU (Bilingual
Evaluation Understudy)[12], chrF (character-level F-score) [8], COMET (Crosslingual Optimized
Metric for Evaluation of Translation) [13] and TER (Translation Edit Rate) [14] metrics. BLEU is a
popular metric for evaluating machine translation (MT) systems. It is a precision-based metric that
calculates the percentage of n-grams (sequences of n words) that are correct in the translated output
compared to the reference translation. chrF is a metric for evaluating MT systems that is based on
character-level overlap between the translated output and the reference translation. chrF scores range
from 0 to 1, with 1 being a perfect score. chrF is less sensitive to word order than BLEU and is more
forgiving of errors in morphology and syntax. TER is a metric for evaluating MT systems that is based
on the number of edits (insertions, deletions, and substitutions) that need to be made to the translated
output to convert it into the reference translation. TER scores range from 0 to 1, with 0 being a perfect
score. In table 1, different metric scores on two test sets has been given.</p>
      <p>We also present our performance in FIRE 2023 MTIL track which aims to create a strong machine
translation system for converting text from one Indian language to another Indian language. There are
two main jobs in this track. Task 1 involves making a translation model for general domain, working
across 12 different Indian language pairs. Task 2, which is more specific, needs translation models
focused on the Governance and Healthcare domain.</p>
    </sec>
    <sec id="sec-7">
      <title>5. Results</title>
      <p>Language Pair
Punjabi-Hindi
Hindi-Punjabi
Punjabi-Hindi
Hindi-Punjabi
Punjabi-Hindi
Hindi-Punjabi</p>
      <p>BLEU
62.1954
50.9394
33.1194
56.8942
37.5176
65.0554</p>
      <p>Upon analyzing Table 1 and Table 2 of evaluation scores, it can be observed that the model Punjabi
to Hindi translation system is performing better than the Hindi to Punjabi system, although the dataset
used is same for both the direction. One of the main reason is that Punjabi is a more inflected language
than Hindi, which means that there are more cues for the translation systems to use when translating
from Punjabi to Hindi.</p>
      <p>On our internal CDACN and Flores testsets, the BLEU scores for all translation tasks range from
21.4 to 50.3. This suggests that our both translation systems are able to produce translations that are of
reasonable quality. The chrF scores for all translation tasks range from 48.1 to 69.8. This suggests that
the translation systems are able to produce translations that are fluent and natural-sounding. The TER
scores for all translation tasks range from 31.8 to 64.7. This suggests that the translation systems are
able to produce translations that are relatively accurate.</p>
      <p>In MTIL challenge chrF is the official metric of evaluation. Here our systems scored the highest of
all, reaching the score as high as 79.5775 and lowest being 60.8540 across all domain specific tasks.
BLEU and TER scores also corresponds the models' capacity to translate domain-specific language
with proficiency showcasing their robustness and adaptability.</p>
    </sec>
    <sec id="sec-8">
      <title>6. Conclusion</title>
      <p>In this paper, we presented our work of building Hindi-Punjabi bidirectional translation model using
fine-tuning methodology. Our system utilized the NLLB-200-3.3B pre-trained model to translate
between Hindi and Punjabi across the General, Governance, and Healthcare domains. Our models
achieved promising results in the MTIL track challenge in FIRE 2003, highlighting the efficacy of the
methodology applied to these machine translation models. These empirical findings also establish a
foundation future works of further advancements and exploration in the realm of domain-specific
machine translation.</p>
    </sec>
    <sec id="sec-9">
      <title>7. Acknowledgements</title>
      <p>We are sincerely thankful to the Ministry of Electronics and Information technology (Meity) for
funding the NLTM-ILTM. We also express our thanks to Shri Vivek Khaneja, Executive Director,
CDAC Noida for his constant support and motivation. Finally, we are thankful to the NPSF-AIRAWAT
for providing the GPU compute infrastructure.</p>
    </sec>
    <sec id="sec-10">
      <title>8. References</title>
      <p>Guzmán, P. Koehn, A. Mourachko, C. Ropers, S. Saleem, H. Schwenk, J. Wang, No language left
behind: Scaling human-centered machine translation, arXiv:2207.04672v3 [ (2022).
[8] M. Popović, chrf: character n-gram f-score for automatic mt evaluation, Association for</p>
      <p>Computational Linguistics, 2015, pp. 392–395. doi:10.18653/v1/W15-3049.
[9] F. Guzmán, P.J Chen, M. Ott, J. Pino, G. Lample, P. Koehn, V. Chaudhary, and M.A.Ranzato.,The
FLORES Evaluation Datasets for Low-Resource Machine Translation: Nepali–English and
Sinhala–English, 2019 In Proceedings of the 2019 Conference on Empirical Methods in Natural
Language Processing and the 9th International Joint Conference on Natural Language Processing
(EMNLP-IJCNLP), p. 6098–6111, Hong Kong, China. Association for Computational Linguistics.
[10] https://github.com/OpenNMT/OpenNMT-py
[11] T. Kudo and J. Richardson, "Sentencepiece: A simple and language independent subword
tokenizer and detokenizer for neural text processing", 2018, Proc. EMNLP, pp. 66-71.
[12] K. Papineni, S. Roukos, T. Ward, W.-J. Zhu, Bleu, Association for Computational Linguistics,
2001, p. 311. doi:10.3115/1073083.1073135.
[13] R. Rei, C. Stewart, A. C. Farinha, A. Lavie, Comet: A neural framework for mt evaluation,
Association for Computational Linguistics, 2020, pp. 2685–2702.
doi:10.18653/v1/2020.emnlpmain.213.
[14] M. Snover, B. Dorr, R. Schwartz, L. Micciulla, and J. Makhoul. "A Study of Translation Edit Rate
with Targeted Human Annotation". In Proceedings of the 7th Conference of the Association for
Machine Translation in the Americas, pages 223–231.
[15] B. Zoph, D. Yuret, J. May, K. Knight, Transfer learning for low-resource neural machine
translation, Association for Computational Linguistics, 2016, pp. 1568–1575.
doi:10.18653/v1/D16-1163.
[16] S. Gangopadhyay, G. Epili, P. Majumder, B. Gain, R. Appicharla, A. Ekbal, D. Sharma, Overview
of MTIL Track at FIRE 2023: Machine Translation for Indian Languages, in Proceedings of the
15th Annual Meeting of the Forum for Information Retrieval Evaluation, FIRE 2023, 2023.
[17] S. Gangopadhyay, G. Epili, P. Majumder, B. Gain, R. Appicharla, A. Ekbal, D. Sharma, Overview
of MTIL Track at FIRE 2023: Machine Translation for Indian Languages. In Working Notes of
FIRE’23, 2023.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Ilya</given-names>
            <surname>Sutskever</surname>
          </string-name>
          , Oriol Vinyals, and
          <string-name>
            <surname>Quoc</surname>
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Le</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Sequence to sequence learning with neural networks</article-title>
          .
          <source>In NeurIPS</source>
          .
          <fpage>3104</fpage>
          --
          <lpage>3112</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>D.</given-names>
            <surname>Bahdanau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Cho</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bengio</surname>
          </string-name>
          .
          <article-title>"Neural machine translation by jointly learning to attend and translate</article-title>
          .
          <source>" arXiv preprint arXiv:1409.1055</source>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Vaswani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shazeer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Parmar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Uszkoreit</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. N.</given-names>
            <surname>Gomez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Kaiser</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Polosukhin</surname>
          </string-name>
          , Attention is all you need,
          <volume>1706</volume>
          .03762v7 (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <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.-J.</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>
          , https://doi.org/10.48550/arXiv.
          <year>2008</year>
          .
          <volume>00401</volume>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>O.</given-names>
            <surname>Firat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Cho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bengio</surname>
          </string-name>
          <article-title>, Multi-way, multilingual neural machine translation with a shared attention mechanism</article-title>
          ,
          <source>Association for Computational Linguistics</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>866</fpage>
          -
          <lpage>875</lpage>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>N16</fpage>
          -1101.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M.</given-names>
            <surname>Johnson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Schuster</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q. V.</given-names>
            <surname>Le</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Krikun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Thorat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Viégas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wattenberg</surname>
          </string-name>
          , G. Corrado,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hughes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Dean</surname>
          </string-name>
          ,
          <article-title>Google's multilingual neural machine translation system: Enabling zero-shot translation, Transactions of the Association for Computational Linguistics 5 (</article-title>
          <year>2017</year>
          )
          <fpage>339</fpage>
          -
          <lpage>351</lpage>
          . doi:
          <volume>10</volume>
          .1162/tacl_a_
          <fpage>00065</fpage>
          .).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>N.</given-names>
            <surname>Team</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. R.</given-names>
            <surname>Costa-jussà</surname>
          </string-name>
          , J.
          <string-name>
            <surname>Cross</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          <string-name>
            <surname>Çelebi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Elbayad</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Heafield</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Heffernan</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Kalbassi</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Lam</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Licht</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Maillard</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Sun</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Wenzek</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Youngblood</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Akula</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Barrault</surname>
            ,
            <given-names>G. M.</given-names>
          </string-name>
          <string-name>
            <surname>Gonzalez</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Hansanti</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Hoffman</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Jarrett</surname>
            ,
            <given-names>K. R.</given-names>
          </string-name>
          <string-name>
            <surname>Sadagopan</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Rowe</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Spruit</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Tran</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Andrews</surname>
            ,
            <given-names>N. F.</given-names>
          </string-name>
          <string-name>
            <surname>Ayan</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Bhosale</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Edunov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Fan</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Gao</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Goswami</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>