<!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>Multilingual Transformer Ensembles for Portuguese Natural Language Tasks</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ruan Chaves Rodrigues</string-name>
          <email>ruanchaves93@gmail.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>J´essica Rodrigues da Silva</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pedro Vitor Quinta de Castro</string-name>
          <email>pedrovitorquinta@inf.ufg.br</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>N´adia F´elix Felipe da Silva</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anderson da Silva Soares</string-name>
          <email>anderson@inf.ufg.br</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science, Federal University of Sa ̃o Carlos</institution>
          ,
          <country country="BR">Brazil</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Institute of Informatics, Federal University of Goi ́as</institution>
          ,
          <country country="BR">Brazil</country>
        </aff>
      </contrib-group>
      <fpage>27</fpage>
      <lpage>38</lpage>
      <abstract>
        <p>Due to the technical gap between the language models available for low-resource languages and the state-of-the-art models available in English and Chinese, a simple approach that deploys automatic translation and ensembles predictions from Portuguese and English models is competitive with monolingual Portuguese approaches that may demand task-specific preprocessing and hand-crafted features. We performed our experiments on ASSIN 2 - the second edition of the Avalia¸c˜ao de Similaridade Semaˆntica e Inferˆencia Textual (Evaluating Semantic Similarity and Textual Entailment). On the semantic textual similarity task, we performed multilingual ensemble techniques to achieve results with higher Pearson correlation and lower mean squared error than BERTmultilingual, and on the textual entailment task, BERT-multilingual could be surpassed by automatically translating the corpus into English and then fine-tuning a large RoBERTa model over the translated texts.</p>
      </abstract>
      <kwd-group>
        <kwd>Semantic textual similarity</kwd>
        <kwd>Textual entailment</kwd>
        <kwd>Transformer architecture</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Although recent advances in Transformer architectures [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] have significantly
improved the state-of-the-art for several downstream natural language processing
tasks, such models usually require training to be performed with billions of
parameters on massive datasets. And as only major companies and research centers
can a↵ ord this process, a linguistic bias has arisen in the field: most
state-of-theart models are available only for the languages that predominate on the areas
where these entities are based, namely English and Chinese [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
      </p>
      <p>We demonstrate that, due to the current gap between the models available for
Portuguese and these two languages, a simple approach that deploys automatic
translation and ensembles predictions from Portuguese and English models is
competitive with monolingual approaches that may demand task-specific
preprocessing and hand-crafted features to achieve the same accuracy.</p>
      <p>
        For this purpose, we examine the e↵ ectiveness of multiple ensemble
techniques on the Semantic Textual Similarity (STS) and Recognizing Textual
Entailment (RTE) tasks proposed on the ASSIN 2 dataset3 [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], while fine-tuning
BERT-multilingual [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] over the original Portuguese datasets and RoBERTa [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]
over the automatic translation of the original datasets into English. In order to
ensure the reproducibility of our results, we have open-sourced our models and
experiments4.
      </p>
      <p>In section 2 we describe some of the related work for Transformer
architectures in low-resource languages. The approaches to the Transformer architecture
investigated in this paper are described in section 3. Section 4 shows the approach
considered for ensemble modeling. The experiments carried out for evaluating
our model for the ASSIN2 tasks are described in section 5. Section 6 finishes this
paper with its conclusions and proposals for future work.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>As Transformer architectures are reasonably recent, there are few works which
have attempted to apply large pretrained English models to other linguistic
domains. Fonseca fine-tuned the GPT-2 model in Portuguese, and his results5
indicate that this can become a viable approach for tackling text generation
problems in the Portuguese language.</p>
      <p>
        However, the strategy of automatically translating a dataset into a foreign
language and then ensembling models from distinct linguistic domains to address
a natural language processing task has already been throughly researched in the
past. In the field of sentiment analysis, Wan et al. [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] successfully improved the
accuracy of sentiment analysis on Chinese customer reviews by ensembling the
predictions produced from both the original Chinese dataset and its translation
into English, achieving combined results which were better than either approach
considered in isolation.
      </p>
      <p>
        Under di↵ erent circumstances, Araujo et al. [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] has shown that, for some
particular languages, simply translating the dataset into English and applying the
state-of-the-art sentiment analysis methods available for the English language
yielded better results than the existing language-specific approaches evaluated
during their experiments.
      </p>
      <p>
        Tian et al. [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] applied a similar approach for the Spanish STS task proposed
at SemEval-2017. After automatically translating the entire dataset, they applied
an ensemble of the state-of-the-art techniques available for the task. However,
they also included in his ensemble nine features that measured the quality of
the translated text, namely BLEU, GTM-3, NIST, -WER, -PER, Ol, -TERbase,
METEOR-ex and ROUGE-L.
      </p>
      <p>
        Belinkov et al. [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] have demonstrated that current Neural Machine
Translation (NMT) models, which include the external translation service utilized in
3 https://sites.google.com/view/assin2/
4 https://github.com/ruanchaves/assin/
5 https://medium.com/ensina-ai/ensinando-portugues-ao-gpt-2-d4aa4aa29e1d
our experiments, are highly vulnerable to adversarial noise, as well as natural
noise produced by native speakers of the language. Such noise cannot be easily
addressed by existing tools, such as spell checkers. Therefore, having features
that account for the quality of the translation are certainly helpful while
building ensembles with features extracted from translated text either through deep
learning methods or traditional natural language processing techniques.
      </p>
      <p>
        Although machine translation may be e↵ ective, it may not be suitable for
certain industrial settings, specially when one cannot a↵ ord to call an external
translation service several times. Tang et al. [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] trained a shared multilingual
encoder that successfully leveraged knowledge from English labeled data in Spanish
STS tasks, without requiring the annotation of hand-crafted features, or having
to resort to machine translation during inference. His results were consistently
better than those achieved by monolingual approaches, and they were able to
reach the same performance as the machine translation methods that were
evaluated during his experiments. Shared multilingual encoders for STS tasks have
also been trained by Chidambaram et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <p>Compared to the Portuguese language, a relatively large amount of
Transformer models have been trained for Spanish and other major Romance
languages. To the best of our knowledge, no large Transformer model trained
exclusively for Portuguese has ever been made publicly available, and no other
paper has ever investigated how Transformer architectures and machine
translation can be leveraged for natural language processing tasks in the Portuguese
language.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Transformer architectures</title>
      <p>
        Only two transformer architectures were considered for our experiments:
BERTmultilingual and RoBERTa. We started from pretrained models, which were
fine-tuned to a STS task through the Transformers library developed by Hugging
Face [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ].
3.1
      </p>
      <sec id="sec-3-1">
        <title>BERT-multilingual</title>
        <p>
          BERT stands for Bidirectional Encoder Representations from Transformers [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ].
Devised as an alternative to unidirectional language models, BERT pretrains
deep bidirectional representations that are simultaneously learned both for left
and right contexts. As a result, the last layers of a pretrained BERT model can
be fine-tuned to specific natural language tasks without requiring any substantial
modifications on its architecture.
        </p>
        <p>In order to define its prediction goal, BERT utilizes two training strategies.
One of them is called Masked LM (MLM). Before being fed into the model, 15%
of all tokens are replaced by either a random token or a fixed [MASK] token. In
this way, the model has the training goal to improve its ability to predict the
original token that occupied these positions.</p>
        <p>For its second strategy, the model is pretrained for a binarized Next Sentence
Prediction (NSP) task with sentences A and B, where B has an equal chance of
being either a randomized sentence or the actual next sentence after A.</p>
        <p>In our experiments, we utilized the multilingual, cased BERT model, trained
with 110 million parameters on 104 languages, including Portuguese. These
languages were chosen because they are the ones with the largest Wikipedias, and
the entire Wikipedia dump for each language was taken as the training data.
Although overrepresented languages were downsampled during the training stage,
no downsampling was performed among dialects within the same language. It
should also be noticed that Wikipedia does not impose any Portuguese dialect
for any of its articles, and therefore, it is not possible to di↵ erentiate between
them on its dumps.</p>
        <p>
          The flexibility of BERT has contributed to establish it as one of the main
paradigms for advancing the state-of-the-art in natural language processing
tasks. As of today, most state-of-the-art models are either directly or indirectly
based on the original BERT architecture [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ].
3.2
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>RoBERTa</title>
        <p>
          After the release of BERT, several authors studied the model and pointed out
architectural choices that should be reconsidered. The main issues lied on its
training strategies, the Masked LM and Next Sentence Prediction tasks. In fact,
some of the limitations found within these strategies had already been
acknowledged on the paper that first presented the BERT architecture [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ].
        </p>
        <p>
          In our experiments, we have used one of the models that improved on BERT
while trying to reach a proper training strategy: RoBERTa, which stands for
Robustly Optimized BERT Pretraining Approach [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. While maintaining the
same base architecture as BERT, RoBERTa improves on its results by removing
the next sentence prediction task, dynamically changing the masking pattern
applied to the training data, and increasing the training time, the size of the
batches, the volume of data and the input sequence length.
        </p>
        <p>
          As demonstrated by [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ], the Next Sentence Prediction (NSP) objective hurts
the performance of multilingual versions of BERT even more than it does when
it is trained on a single language. Therefore, in situations where both models
receive an input of the same quality, we can only expect that RoBERTa will
consistently perform better than BERT-multilingual.
        </p>
        <p>
          We can also expect better performance even when comparing multilingual
versions of RoBERTa with multilingual versions of BERT. In fact, Conneau et al.
[
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] recently released the a model called XLM-RoBERTa, which not only achieves
results better than BERT-multilingual, but also obtains results competitive with
monolingual versions of RoBERTa and other state-of-the-art monolingual models
after monolingual fine-tuning on the GLUE and XNLI benchmarks.
        </p>
        <p>Although there are versions of RoBERTa available which have been
previously fine-tuned on MNLI and the output of GPT-2, we performed our
experiments only on a pretrained version of RoBERTa which was based on the
architecture of BERT-large.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Ensemble Techniques</title>
      <p>For both STS and RTE tasks, BERT-multilingual was fine-tuned on the
original, Portuguese dataset, and RoBERTa was fine-tuned on the same dataset
after it was automatically translated into English. In this way, it can be said
that a stronger model (RoBERTa) is receiving an input of lower quality (an
automatically translated dataset) while the weaker model (BERT-multilingual) is
receiving an input of better quality (the original dataset).</p>
      <p>After fine-tuning, we tested two distinct ensemble techniques to combine the
predictions generated by both Transformers. The first one was averaging: the
fine-tuned models generated predictions for the test set, and then these scores
were averaged through an arithmetic mean to produce the final submission.</p>
      <p>
        The second technique utilized is most commonly known as stacking. A careful
and diagrammatic description of the stacking ensemble technique has been made
by Kyriakides et al. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. In this approach, BERT and RoBERTa are called base
learners (or level 0 learners), which will provide metadata to train a meta-learner
(or level 1 learner), which in our particular setup happens to be a Multilayer
Perceptron (MLP).
      </p>
      <p>The metadata was generated through K-fold cross validation over the entire
training set. Both BERT and RoBERTa were fine-tuned on their
corresponding training sets for each possible combination of K 1 folds. Therefore, an
ensemble made through K-fold stacking will generate K distinct BERT models
fine-tuned on the original dataset, and K distinct RoBERTa models fine-tuned
on the translated dataset.</p>
      <p>After generating 2K fine-tuned models, each one of them will generate
predictions for the fold from the training set which was missing during its fine-tuning
process. Although all labels from the training set are known to us, they are
temporarily ignored for the sake of generating the metadata for the MLP, and we
concatenate the predictions from all fine-tuned models. As a result, we will have
produced metadata for the entire training set, which will be used to train the
MLP.</p>
      <p>The MLP, our meta-learner, is trained while taking the metadata generated
by each transformer as its input, and the gold score for the sentence pairs of
the training set as the training goal. During this process, the MLP will try to
learn how to properly weight the contributions of each transformer on each score
range.</p>
      <p>After training the MLP, we fine-tune one BERT and one RoBERTa model
over their entire corresponding training sets, without considering any division
into folds. These models produce predictions, which are combined by the trained
MLP to produce the final predicted scores. If successful, this trained meta-learner
will have produced scores that are more accurate than the predictions generated
by either base learner considered in isolation.</p>
      <p>We did not test any averaging techniques other than a simple arithmetic
mean, and our MLP was made only of two Dense layers of 64 neurons with a
ReLU activation function followed by a single Dense layer of one neuron with a
linear activation function.</p>
      <p>It should be noticed that there is a trade-o↵ between improving the overall
performance of the ensemble and the amount of computational resources required
to fine-tune transformer models for a higher amount of folds. There are also
diminishing returns for increasing the amount of folds: although the accuracy
will initially increase, it is expected to stabilize after the folds become small
enough for the MLP to learn the general patterns present on the metadata.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Experimental Evaluation</title>
      <p>We evaluated the performance of our models on the ASSIN 2 dataset. Part of
our experiments were submitted during the ASSIN 2 workshop, and then their
accuracy was compared with the results obtained by the other participants.
In this section, we examine some particular features of the dataset and how
they influenced the obtained results. These results are described both in their
entirety and, in the case of the STS task, also separately for five distinct gold
score intervals.
5.1</p>
      <sec id="sec-5-1">
        <title>Dataset</title>
        <p>
          The dataset consists of sentence pairs in the Portuguese language, with
humanannotated scores for Semantic Textual Similarity and Textual Entailment. The
Semantic Textual Similarity task is available in the GLUE benchmark [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ] as the
Semantic Textual Similarity Benchmark (STS-B) [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ], and the Textual Entailment
task is available as Recognizing Textual Entailment (RTE) [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. Both tasks are
present on every ASSIN dataset.
        </p>
        <p>During our experiments, RTE was treated as being a regression task, exactly
like the STS task, rather than being a classification task. In other words, while
STS was treated as the task of predicting scores ranging from 1 to 5, RTE was
similarly treated as the task of predicting scores ranging from 0 to 1, taking
”None” as 0, ”Entailment” as 1. And then, before submitting our files to the
o cial evaluation script for the ASSIN 2 dataset, the entailment scores were
rounded up and converted back to their corresponding labels.</p>
        <p>
          Datasets for Brazilian and European Portuguese were released during the
first edition of ASSIN [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. Their sentence pairs were collected from Google News,
and had the linguistic complexity that can be expected from real-world sources.
However, during ASSIN 2, a single dataset was released which was purposefully
simple, without any named entities, instances of indirect speech or verbs not
conjugated in the present. Furthermore, a certain portion of the sentence pairs
in ASSIN 2 was translated from existing English datasets into Portuguese. In this
way, we were not able to distinguish such pairs from those which were created
from scratch, as there are not any labels on the dataset itself that indicate this
feature. We translated the ASSIN 2 dataset into English through Google Cloud
Translation API6 under its default settings.
        </p>
        <sec id="sec-5-1-1">
          <title>6 https://cloud.google.com/translate/docs/</title>
          <p>It should be noticed that we did not apply any preprocessing steps to the
datasets other than those required by the Transformer models themselves. We
also did not take any measures to modify or increase the quality of the translated
sentence pairs after they had been retrieved from the translation API.
5.2</p>
        </sec>
      </sec>
      <sec id="sec-5-2">
        <title>Results</title>
        <p>The Transformers (BERT and RoBERTa) were fine-tuned both on the standard
training and validation sets for ASSIN 2. After fine-tuning, they produced their
own predictions for each one of the available test sets. These predictions were
submitted to the standard evaluation script for the ASSIN datasets, both in
isolation and combined through two di↵ erent ensemble techniques: averaging
and 5-fold stacking.</p>
        <p>
          It can be seen on Table 1 that the best Pearson correlation for the STS
task has been achieved by combining the predictions from both Transformers
through an aritmetic mean, although 5-fold stacking achieved a mean squared
error considerably lower than any other of the evaluated approaches. For the
entailment task, RoBERTa singlehandedly performed better than either BERT
or any of the ensembles. However, 5-fold stacking achieved results pratically
equivalent to RoBERTa.
Reimers et al. [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] demonstrates that the Pearson correlation coe cient can be
misleading and especially ill-suited to predict the best STS system for natural
language processing tasks. In plagiarism detection, for instance, the STS system
may receive documents that have been previously pre-filtered. In this way, it will
only analyze documents that score above a certain threshold. And for semantic
search, Reimers 7 mentions that, as Okapi BM25 has a lower false positive
probability than BERT and other Transformer architectures, query results should be
pre-filtered through Okapi BM25 to build a clean candidate set, and then BERT
can be used to perform reranking among the selected candidates.
        </p>
        <p>With these concerns in mind, we have measured both Pearson correlation
and the mean squared error individually for five distinct gold score intervals.</p>
        <p>Regarding the mean squared error, in Figure 1 we can see that, while the
performance of BERT-multilingual linearly improves for higher gold scores, RoBERTa
performs exceptionally better than all other models for the lowest score range
between 1.0 and 1.4 . After this range, its performance suddenly decreases. And
after decreasing, it also starts to linearly improve.</p>
        <p>As sentence pairs on the lowest gold score intervals are very di↵ erent from
each other, one possible explanation is that they were able to maintain their high
degree of dissimilarity even after automatic translation. In this way, RoBERTa
was able to provide results closer to its performance for sentence pairs which
were originally written in English; and as expected, such results are consistently
better than what can be achieved through BERT-multilingual.</p>
        <p>Although averaging performed slightly better than 5-fold stacking on the
lowest score range, 5-fold stacking was able to provide a mean squared error
lower than any other model on all other score ranges.</p>
        <p>Regarding the Pearson correlation, it is interesting to notice that RoBERTa
provided results which were superior or otherwise competitive with all other
models except on the higher score interval between 4.5 and 5.0, and
BERTmultilingual has a performance inferior to all other models except on the same
higher score interval. Although 5-fold stacking failed to notice such
complementary behavior, it was possible to achieve results competitive with both models
for all score ranges by simply averaging their predictions.</p>
        <p>As we treated the RTE task as if it were a STS task with only two scores,
the results obtained by RoBERTa on this task can be explained by its ability
to accurately determine when two automatically translated sentence pairs are
totally dissimilar to each other, that is, when their entailment relationship is
equal to None. In other words, RoBERTa has a lower false positive probability
than BERT-multilingual or our evaluated ensemble approaches. As a result,
RoBERTa achieved not only high accuracy and Macro-F1 scores, but also a high
Matthews correlation coe cient.</p>
        <p>Therefore, for the RTE task, an ensemble will not be necessary, and we can
simply take the predictions produced by RoBERTa as our final result. However,
an ensemble made through 5-fold stacking is able to achieve equivalent results,
as it can recognize that BERT-multilingual performs consistently worse than
RoBERTa on this task, and thus it minimizes the weight given to the predictions
made by BERT-multilingual as much as possible.
7 https://github.com/huggingface/transformers/issues/876#issuecomment-536792338
Fig. 1: We break down the dataset into five parts determined by the intervals in
which their gold scores are located. Then we calculate the Pearson correlation
and the mean squared error of all experiments listed on Table 1 separately for
each one of these intervals.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Conclusions</title>
      <p>We have discovered that, for the evaluated Portuguese RTE task, automatically
translating the dataset into English and then fine-tuning a large RoBERTa model
over the translated dataset can produce better results than BERT-multilingual
or monolingual approaches that rely only on the resources natively available for
the Portuguese language.</p>
      <p>And although the same results could not be achieved in isolation by RoBERTa
on the STS task, state-of-the-art results in the Portuguese language for this task
can be achieved by combining the predictions made by BERT-multilingual and
RoBERTa through an adequate ensemble technique, which in some cases may
be as simple as taking the arithmetic mean of both predictions.</p>
      <p>In spite of the simplicity of our approach, we have achieved the best results for
the RTE task on the ASSIN 2 workshop. Later on, we also found out that simply
taking the arithmetic mean of the predictions generated by BERT and RoBERTa
was able to surpass all the Pearson correlation scores which had been achieved
by the participants to the STS task. We did not perform any preprocessing
on the training data, either before or after automatic translation. We also did
not take into account any features other than the predictions generated by the
Transformer architectures as they have been implemented in standard libraries.</p>
      <p>
        Therefore, we believe that there is room for significant improvements to our
results. For both tasks, it may be convenient to test more sophisticated
techniques for ensemble building [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]. And although our research was limited to
the ASSIN 2 dataset, it may be interesting to extend the same experiments to
its first edition, ASSIN 1. We should also investigate which linguistic features
were easily learned by our models, and which ones were not.
      </p>
      <p>
        For future experiments, new English models that reach the top positions on
the GLUE Benchmark Leaderboard8 for the STS-B and RTE tasks should be
considered, and these models may be combined or compared with Transformers
trained in Romance languages. For instance, experiments may be performed on
CamemBERT [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], with datasets automatically translated from Portuguese to
French.
      </p>
      <p>However, as a long-term strategy, we should also consider solutions which
entirely avoid the inevitable limitations of machine translation, such as training
our own Transformer models exclusively for the Portuguese language.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments</title>
      <p>The authors would like to acknowledge the support of the Institute of
Informatics at the Federal University of Goi´as, Americas Health Co., B2W Digital,
Datalawyer and Data-H Data Science and Artificial Intelligence.</p>
      <sec id="sec-7-1">
        <title>8 https://gluebenchmark.com/leaderboard/</title>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Agirre</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>M'arquez</surname>
          </string-name>
          , L.,
          <string-name>
            <surname>Wicentowski</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <source>Proceedings of the Fourth International Workshop on Semantic Evaluations (SemEval-</source>
          <year>2007</year>
          ).
          <article-title>Association for Computational Linguistics</article-title>
          , Prague, Czech Republic (
          <year>June 2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Anonymous</surname>
          </string-name>
          :
          <article-title>Cross-lingual ability of multilingual {bert}: An empirical study</article-title>
          . In: Submitted to International Conference on Learning Representations (
          <year>2020</year>
          ), https://openreview.net/forum?id=HJeT3yrtDr, under review
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3] Arau´jo,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Pereira</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Benevenuto</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.</surname>
          </string-name>
          :
          <article-title>A comparative study of machine translation for multilingual sentence-level sentiment analysis</article-title>
          .
          <source>Information Sciences</source>
          (
          <year>2019</year>
          ), http://www.sciencedirect.com/science/article/ pii/S0020025519309879
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Belinkov</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bisk</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Synthetic and natural noise both break neural machine translation (</article-title>
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Bentivogli</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dagan</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dang</surname>
            ,
            <given-names>H.T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Giampiccolo</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Magnini</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>The fifth PASCAL recognizing textual entailment challenge (</article-title>
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Chidambaram</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cer</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yuan</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sung</surname>
            ,
            <given-names>Y.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Strope</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kurzweil</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <article-title>Learning cross-lingual sentence representations via a multitask dual-encoder model (</article-title>
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Conneau</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Khandelwal</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goyal</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chaudhary</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wenzek</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <article-title>Guzm´an, F</article-title>
          .,
          <string-name>
            <surname>Grave</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ott</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zettlemoyer</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stoyanov</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Unsupervised cross-lingual representation learning at scale (</article-title>
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Devlin</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chang</surname>
            ,
            <given-names>M.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Toutanova</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Bert: Pre-training of deep bidirectional transformers for language understanding (</article-title>
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Fonseca</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Santos</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Criscuolo</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , Alu´ısio, S.:
          <article-title>Vis˜ao geral da avalia¸c˜ao de similaridade semˆantica e inferˆencia textual</article-title>
          .
          <source>Linguam´atica 8(2)</source>
          ,
          <fpage>3</fpage>
          -
          <lpage>13</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Kyriakides</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Margaritis</surname>
            ,
            <given-names>K.G.</given-names>
          </string-name>
          :
          <article-title>Hands-On Ensemble Learning with Python (07</article-title>
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ott</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goyal</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Du</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Joshi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Levy</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lewis</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zettlemoyer</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stoyanov</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Roberta: A robustly optimized bert pretraining approach (</article-title>
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Martin</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Muller</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          , Ortiz Su´arez, P.J.,
          <string-name>
            <surname>Dupont</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Romary</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Villemonte de la Clergerie</surname>
          </string-name>
          , E´.,
          <string-name>
            <surname>Seddah</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sagot</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>CamemBERT: a Tasty French Language Model</article-title>
          . arXiv e-prints arXiv:
          <year>1911</year>
          .
          <volume>03894</volume>
          (
          <year>Nov 2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Real</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fonseca</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          , Gonc¸alo Oliveira, H.:
          <article-title>The ASSIN 2 shared task: Evaluating Semantic Textual Similarity and Textual Entailment in Portuguese</article-title>
          .
          <source>In: Proceedings of the ASSIN 2 Shared Task: Evaluating Semantic Textual Similarity and Textual Entailment in Portuguese</source>
          . p. [In this volume].
          <source>CEUR Workshop Proceedings</source>
          , CEUR-WS.org (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Rei</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>The geographic diversity of nlp conferences</article-title>
          . https: //web.archive.org/web/20191009171059/http://www.marekrei.com/ blog/geographic
          <article-title>-diversity-of-nlp-conferences/ (</article-title>
          <year>2019</year>
          ), accessed:
          <fpage>2019</fpage>
          -10-09
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Reimers</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Beyer</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gurevych</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Task-oriented intrinsic evaluation of semantic textual similarity</article-title>
          .
          <source>In: Proceedings of COLING</source>
          <year>2016</year>
          ,
          <source>the 26th International Conference on Computational Linguistics: Technical Papers</source>
          . pp.
          <fpage>87</fpage>
          -
          <lpage>96</lpage>
          .
          <article-title>The COLING 2016 Organizing Committee</article-title>
          , Osaka,
          <source>Japan (Dec</source>
          <year>2016</year>
          ), https://www.aclweb.org/anthology/C16-1009
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Sagi</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rokach</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Ensemble learning: A survey</article-title>
          .
          <source>Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery</source>
          <volume>8</volume>
          (
          <issue>4</issue>
          ),
          <year>e1249</year>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Storks</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gao</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chai</surname>
          </string-name>
          , J.Y.:
          <article-title>Recent advances in natural language inference: A survey of benchmarks, resources, and approaches (</article-title>
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Tang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          , Cheng, S.,
          <string-name>
            <surname>Do</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Min</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ji</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yu</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          , Zhang, J.,
          <string-name>
            <surname>Chen</surname>
          </string-name>
          , H.:
          <article-title>Improving multilingual semantic textual similarity with shared sentence encoder for low-resource languages (</article-title>
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Tian</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>ECNU at SemEval-2017 task 1: Leverage kernel-based traditional NLP features and neural networks to build a universal model for multilingual and cross-lingual semantic textual similarity</article-title>
          .
          <source>In: Proceedings of the 11th International Workshop on Semantic Evaluation (SemEval-2017)</source>
          . pp.
          <fpage>191</fpage>
          -
          <lpage>197</lpage>
          . Association for Computational Linguistics, Vancouver, Canada (Aug
          <year>2017</year>
          ). https://doi.org/10.18653/v1/
          <fpage>S17</fpage>
          - 2028, https://www.aclweb.org/anthology/S17-2028
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Wan</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          :
          <article-title>Using bilingual knowledge and ensemble techniques for unsupervised chinese sentiment analysis</article-title>
          .
          <source>In: Proceedings of the Conference on Empirical Methods in Natural Language Processing</source>
          . pp.
          <fpage>553</fpage>
          -
          <lpage>561</lpage>
          . EMNLP '
          <volume>08</volume>
          ,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computational Linguistics, Stroudsburg, PA, USA (
          <year>2008</year>
          ), http://dl.acm.org/citation.cfm?id=
          <volume>1613715</volume>
          .
          <fpage>1613783</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Singh</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Michael</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hill</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Levy</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bowman</surname>
            ,
            <given-names>S.R.:</given-names>
          </string-name>
          <article-title>GLUE: A multi-task benchmark and analysis platform for natural language understanding (</article-title>
          <year>2019</year>
          ),
          <source>in the Proceedings of ICLR.</source>
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>Wolf</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Debut</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sanh</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chaumond</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Delangue</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cistac</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rault</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Louf</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Funtowicz</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brew</surname>
          </string-name>
          , J.:
          <article-title>Huggingface's transformers: State-of-the-art natural language processing (</article-title>
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>