<!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>BERTino: an Italian DistilBERT model</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Matteo Muffo</string-name>
          <email>e@indigo.ai</email>
          <email>matteo@indigo.ai</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Enrico Bertino</string-name>
          <email>e@indigo.ai</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Indigo.ai</institution>
          ,
          <addr-line>Via Torino 61, Milano</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>English.1 The recent introduction of Transformers language representation models allowed great improvements in many natural language processing (NLP) tasks. However, if on one hand the performances achieved by this kind of architectures are surprising, on the other their usability is limited by the high number of parameters which constitute their network, resulting in high computational and memory demands. In this work we present BERTino, a DistilBERT model which proposes to be the first lightweight alternative to the BERT architecture specific for the Italian language. We evaluated BERTino on the Italian ISDT, Italian ParTUT, Italian WikiNER and multiclass classification tasks, obtaining F1 scores comparable to those obtained by a BERTBASE with a remarkable improvement in training and inference speed.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Italiano. La recente introduzione dei</title>
      <p>Transformers come modelli di
rappresentazione del linguaggio naturale ha
permesso grandi avanzamenti sullo stato
dell’arte in molte applicazioni di Natural
Language Processing (NLP). Tuttavia, se
da una parte i risultati raggiunti da queste
architetture sono sorprendenti, dall’altra la
loro fruibilita` e` limitata dall’elevato
numero di parametri che costituiscono la
loro architettura, con conseguenti elevate
esigenze computazionali e di memoria.
In questo lavoro presentiamo BERTino,
un modello DistilBERT che e` la prima
1Copyright c 2020 for this paper by its authors. Use
permitted under Creative Commons License Attribution 4.0
International (CC BY 4.0).
alternativa leggera all’architettura BERT
specifica per la lingua italiana.
Abbiamo valutato BERTino sui task ISDT
italiano, ParTUT italiano, WikiNER italiano
e classificazione multiclasse, ottenendo
punteggi F1 paragonabili a quelli ottenuti
da un modello BERTBASE con un
notevole miglioramento nella velocita` di
addestramento e inferenza.</p>
      <sec id="sec-1-1">
        <title>1 Introduction</title>
        <p>
          In recent years the introduction of Transformers
language models allowed great improvements in
many natural language processing (NLP) tasks.
Among Transformer language models, BERT
          <xref ref-type="bibr" rid="ref5">(Devlin et al., 2018)</xref>
          affirmed itself as an
highperforming and flexible alternative, being able to
transfer knowledge from general tasks to
downstream ones thanks to the pretraining-finetuning
approach. The context-dependent text
representations provided by this model demonstrated to
be a richer source of information when compared
to static textual embeddings such as Word2Vec
          <xref ref-type="bibr" rid="ref12">(Mikolov et al., 2013)</xref>
          , GloVe
          <xref ref-type="bibr" rid="ref15">(Pennington et
al., 2014)</xref>
          , FastText
          <xref ref-type="bibr" rid="ref2">(Bojanowski et al., 2016)</xref>
          or
Sent2Vec
          <xref ref-type="bibr" rid="ref14">(Pagliardini et al., 2018)</xref>
          . However,
despite the substantial improvements brought by
BERT in the NLP field, the high number of
parameters that constitute its network makes its
usage prohibitive in resource-limited devices, both
at training and inference time, and with a
nonnegligible environmental impact. To address the
aforementioned problem, recent research proposes
several approaches to reduce the size of the BERT
network, such as DistilBERT
          <xref ref-type="bibr" rid="ref18 ref22">(Sanh et al., 2019)</xref>
          ,
MobileBERT
          <xref ref-type="bibr" rid="ref19">(Sun et al., 2020)</xref>
          or pruning
          <xref ref-type="bibr" rid="ref11 ref6">(Gordon et al., 2020; McCarley et al., 2019)</xref>
          .
        </p>
        <p>
          The experiments conducted in Virtanen et al.
(2019), de Vries et al. (2019) and Martin et al.
(2020) demonstrate that monolingual BERT
models outperform the same multilingual BERT
architecture
          <xref ref-type="bibr" rid="ref5">(Devlin et al., 2018)</xref>
          , justifying the
effort for pre-training Transformer models required
for specific languages. In this work we present
BERTino, a DistilBERT model pre-trained on a
large Italian corpus. This model proposes to be
the first general-domain, lightweight alternative to
BERT specific for the Italian language. We
evaluate BERTino on two Part Of Speech tagging tasks,
Italian ISDT
          <xref ref-type="bibr" rid="ref3">(Bosco et al., 2000)</xref>
          and Italian
ParTUT
          <xref ref-type="bibr" rid="ref17 ref7">(Sanguinetti and Bosco, 2015)</xref>
          , on the
Italian WikiNER
          <xref ref-type="bibr" rid="ref13">(Nothman et al., 2012)</xref>
          Named
Entity Recognition task and on a multi-class sentence
classification. Comparing the scores obtained by
BERTino, its teacher model and GilBERTo, the
first obtains performances comparable to the other
two architectures while sensibly decreasing the
fine-tuning and evaluation time. In Section 2 we
discuss the related works with a focus on
DistilBERT, in Section 3 we describe the corpus and the
pre-train followed by the results in Section 4.
2
        </p>
      </sec>
      <sec id="sec-1-2">
        <title>Related work</title>
        <p>In this section we will give a brief outline of the
inner workings for Transformers, then we overview
some lightweight alternatives to BERT.</p>
        <p>
          The introduction of Transformer blocks
          <xref ref-type="bibr" rid="ref20">(Vaswani et al., 2017)</xref>
          in language representation
models is a keystone in recent NLP. The attention
mechanism adopted by the Transformer encoder
allows to provide contextualized representations
of words, which proved to be a richer source of
information than static word embeddings. Attention
mechanism processes all words in an input
sentence simultaneously, allowing parallelization of
computations. This is a non-negligible
improvement with respect to models like ELMo
          <xref ref-type="bibr" rid="ref16">(Peters et
al., 2018)</xref>
          , which aim to provide contextualized
text representations using a bidirectional LSTM
network, processesing each word sequentially.
        </p>
        <p>
          Among language models that adopt
Transformer technology, BERT
          <xref ref-type="bibr" rid="ref5">(Devlin et al., 2018)</xref>
          affirmed itself as a flexible and powerful
alternative, being able to establish new
state-of-theart for 11 NLP tasks at the time of publication.
In its base version, this model adopts an hidden
size of 768 and is composed of 12 layers
(Transformer blocks), each of these involving 12
attention heads, for a total of 110 millions of
parameters. As outlined in Section 1, the high
number of parameters constituting BERT’s network
can result prohibitive for deployment in
resourcelimited devices and the computational effort is
not negligible. For this reason, great effort has
been devoted by researchers in order to propose
smaller but valid alternatives to the base version
of BERT. Gordon et al. (2020) studies how weight
pruning affects the performances of BERT,
concluding that a low level of pruning (30-40% of
weights) marginally affects the natural language
understanding capabilities of the network.
        </p>
        <p>McCarley et al. (2019) conducts a similar study
on BERT weight pruning, but applied to the
Question Answering downstream task specifically.</p>
        <p>
          Sanh et al. (2019) propose DistilBERT, a
smaller BERT architecture which is trained
using the knowledge distillation technique
          <xref ref-type="bibr" rid="ref7">(Hinton
et al., 2015)</xref>
          . Since the model that we propose
relies on this training technique, we propose a brief
description of knowledge distillation in section
2.1. DistilBERT leverages the inductive biases
learned by larger models during pre-training using
a triple loss combining language modeling,
distillation and cosine-distance losses. DistilBERT
architecture counts 40% less parameters but is able
to retain 97% of natural language understanding
performances with respect to the teacher model,
while being 60% faster.
        </p>
        <p>Sun et al. (2020) propose MobileBERT, a
compressed BERT model which aims to reduce the
hidden size instead of the depth of the
network. As DistilBERT, MobileBERT uses
knowledge distillation during pre-training but adopts a
BERTLARGE model with inverted bottleneck as
teacher.
2.1</p>
        <sec id="sec-1-2-1">
          <title>Knowledge distillation</title>
          <p>
            Knowledge distillation
            <xref ref-type="bibr" rid="ref7">(Hinton et al., 2015)</xref>
            is a
training technique that leverages the outputs of a
big network (called teacher) to train a smaller
network (the student). In general, in the context of
supervised learning, a classifier is trained in such
a way that the output probability distribution that
it provides is as similar as possible to the one-hot
vector representing the gold label, by
minimizing the cross-entropy loss between the two. By
receiving a one-hot vector as learning signal, a
model evaluated on the training set will provide an
output distribution with a near-one value in
correspondence of the right class, and all near-zero
values for other classes. Some of the near-zero
probabilities, however, are larger than the others
and are the result of the generalization
capabilities of the model. The idea of knowledge
distillation is to substitute the usual one-hot vector
representing gold labels with the output distribution of
the teacher model in the computation of the
crossentropy loss, in order to leverage the information
contained in the near-zero values of the teacher’s
output distribution. Formally, the knowledge
distillation loss is computed as:
          </p>
          <p>LKD = X ti log(si)
i
(1)
with ti being the output distribution of the teacher
model relative to the ith observation, and si being
the output distribution of the student model
relative to the ith observation.
3</p>
        </sec>
      </sec>
      <sec id="sec-1-3">
        <title>BERTino</title>
        <p>As outlined in section 1, we propose in this work
BERTino, a DistilBERT model pre-trained on a
general-domain Italian corpus. As for BERT-like
architectures, BERTino is task-agnostic and can
be fine-tuned for every downstream task. In this
section we will report details relative to the
pretraining that we conducted.
3.1</p>
        <sec id="sec-1-3-1">
          <title>Corpus</title>
          <p>
            The corpus that we used to pre-train BERTino
is the union of PAISA
            <xref ref-type="bibr" rid="ref9">(Lyding et al., 2014)</xref>
            and
ItWaC
            <xref ref-type="bibr" rid="ref1">(Baroni et al., 2009)</xref>
            , two general-domain
Italian corpora scraped from the web. While the
former is made up of short sentences, the latter
includes a considerable amount of long sentences.
Since our model can receive input sequences of
at most 512 tokens, as for BERT architectures,
we decided to apply a pre-processing scheme to
the ItWaC corpus. We split the sentences with
more than 400 words into sub-sentences, using
fixed points to create chunks that keep the
semantic sense of a sentence. In this way, most of the
long sentences contained in ItWaC are split into
sub-sentences containing less than 512 tokens. A
certain number of the final sentences still contain
more than 512 tokens and they will be useful for
training the parameters relative to the last entries
of the network.
          </p>
          <p>The PAISA corpus counts 7.5 million sentences
and 223.5 million words. The ItWaC corpus
counts 6.5 million sentences and 1.6 billion words
after preprocessing. Our final corpus counts 14
million sentences and 1.9 billion words for a
total of 12GB of text.
3.2</p>
        </sec>
        <sec id="sec-1-3-2">
          <title>Pre-training</title>
          <p>Teacher model The teacher model that we
selected to perform knowledge distillation during
the pre-training of BERTino is
dbmdz/bert-baseitalian-xxl-uncased, made by Bavarian State
Library2. We chose this model because it is the
Italian BERTBASE model trained on the biggest
corpus (81 GB of text), up to our knowledge.
Following Sanh et al. (2019), we initialized the weights
of our student model by taking one layer out of
two from the teacher model.</p>
          <p>Loss function We report the loss function used
to pre-train BERTino:</p>
          <p>L = 0:45LKD + 0:45LMLM + 0:1LCOS
(2)
with LKD being the knowledge distillation loss as
described in equation 1, LMLM being the masked
language modeling loss and LCOS being the
cosine embedding loss. Sanh et al. (2019) describe
the cosine embedding loss useful to “align the
directions of the student and teacher hidden states
vectors”. When choosing the weights of the three
loss functions, we wanted our model to learn from
the teacher and by itself in an equal way, so we
set the same weights for both LKD and LMLM .
Moreover, we considered the alignment of student
and teacher hidden states vectors marginal for our
objective, setting LCOS as 10% of the total loss.</p>
          <p>Architecture The architecture of BERTino is
the same as in DistilBERT. Our model adopts an
hidden size of 768 and is composed of 6
layers (Transformer blocks), each of which involving
12 attention heads. In this way BERTino’s
network results to have half the layers present in the
BERTBASE architecture.</p>
          <p>
            Training details To pre-train BERTino we used
a batch size of 6 and an initial learning rate of
5 10 4, adopting Adam
            <xref ref-type="bibr" rid="ref15 ref8">(Kingma and Ba, 2014)</xref>
            as optimization algorithm. We chose 6 as batch
size due to the limited computational resources
available. Results described in section 4
demonstrate that the small batch size that we adopted
is sufficient to obtain a valid pre-trained model.
We trained our model on 4 Tesla K80 GPUs for
3 epochs, requiring 45 days of computation in
total. For some aspects of the training, we relied on
the Huggingface Transformers repository
            <xref ref-type="bibr" rid="ref22">(Wolf et
al., 2019)</xref>
            .
          </p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>2https://github.com/dbmdz/berts</title>
      <sec id="sec-2-1">
        <title>Results</title>
        <p>
          We tested the performances of BERTino on
benchmark datasets: the Italian ISDT
          <xref ref-type="bibr" rid="ref3">(Bosco et al.,
2000)</xref>
          and Italian ParTUT
          <xref ref-type="bibr" rid="ref17 ref7">(Sanguinetti and Bosco,
2015)</xref>
          Part Of Speech tagging tasks, and the
Italian WikiNER
          <xref ref-type="bibr" rid="ref13">(Nothman et al., 2012)</xref>
          Named
Entity Recognition task. To complete the evaluation
of the model, we also tested it on a multi-class
sentence classification task. In particular, we focused
on intent detection, a task specific to the context of
Dialogue Systems, creating a novel italian dataset
which is freely available at our repository3. The
dataset that we propose collects 2786 real-world
questions (2228 for training and 558 for testing)
submitted to a digital conversational agent. The
total number of classes in the dataset is 139.
        </p>
        <p>For the first two tasks mentioned, we fine-tuned
our model on the training set for 4 epochs with a
batch size of 32 and a learning rate of 5 10 5, for
the NER task we performed 5-fold splitting of the
dataset and fine-tuned BERTino for 2 epochs per
fold with a batch size of 32 and a learning rate of
5 10 5, while for the multi-class classification
task we fine-tuned our model for 14 epochs on the
training set with a batch size of 32 and a learning
rate of 5 10 5. To compare the results obtained,
we fine-tuned the teacher model and a GilBERTo
model4 on the same tasks with the same
hyperparameters. Tables 1, 2, 3 and 4 collect the F1
scores gathered in these experiments together with
fine-tuning and evaluation time. All the scores
reported represent the average computed over three
different runs. Results show that the teacher model
slightly outperforms BERTino, with an increase of
the F1 score of 0,29%, 5,15%, 1,37% and 1,88%
over the tasks analysed. However BERTino results
to be a sensibly faster network with respect to the
teacher model and GilBERTo, taking almost half
of the time to perform both fine-tuning and
evaluation. We can conclude from the last observation
that BERTino is able to retain most of the natural
language understanding capabilities of the teacher
model, even with a much smaller architecture.
5</p>
      </sec>
      <sec id="sec-2-2">
        <title>Conclusions</title>
        <p>In this work we presented BERTino, a DistilBERT
model which aims to be the first lightweight
alternative to BERT specific for the Italian language.
Our model has been trained on a general-domain
3https://github.com/indigo-ai/BERTino
4Available at https://github.com/idb-ita/GilBERTo
corpus and can then be finetuned with good
performances on a wide range of tasks like its larger
counterparts. BERTino showed comparable
performances with respect to both the teacher model
and GilBERTo in the Italian ISDT, Italian ParTUT,
Italian WikiNER and multi-class sentence
classification tasks while taking almost half of the time to
fine-tune, demonstrating to be a valid lightweight
alternative to BERTBASE models for the Italian
language.</p>
        <p>Model
BERTino
Teacher model
GilBERTo</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <given-names>Marco</given-names>
            <surname>Baroni</surname>
          </string-name>
          , Silvia Bernardini, Adriano Ferraresi, and
          <string-name>
            <given-names>Eros</given-names>
            <surname>Zanchetta</surname>
          </string-name>
          .
          <year>2009</year>
          .
          <article-title>The wacky wide web: A collection of very large linguistically processed web-crawled corpora</article-title>
          .
          <source>Language Resources and Evaluation</source>
          ,
          <volume>43</volume>
          (
          <issue>3</issue>
          ):
          <fpage>209</fpage>
          -
          <lpage>226</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <given-names>Piotr</given-names>
            <surname>Bojanowski</surname>
          </string-name>
          , Edouard Grave, Armand Joulin, and
          <string-name>
            <given-names>Tomas</given-names>
            <surname>Mikolov</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Enriching word vectors with subword information</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <given-names>Cristina</given-names>
            <surname>Bosco</surname>
          </string-name>
          , Vincenzo Lombardo, Daniela Vassallo, and
          <string-name>
            <given-names>Leonardo</given-names>
            <surname>Lesmo</surname>
          </string-name>
          .
          <year>2000</year>
          .
          <article-title>Building a treebank for Italian: a data-driven annotation schema</article-title>
          .
          <source>In Proceedings of the Second International Conference on Language Resources and Evaluation (LREC'00)</source>
          , Athens, Greece, May.
          <source>European Language Resources Association (ELRA).</source>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>Wietse de Vries</surname>
          </string-name>
          , Andreas van Cranenburgh,
          <string-name>
            <surname>Arianna Bisazza</surname>
            , Tommaso Caselli, Gertjan van Noord,
            <given-names>and Malvina</given-names>
          </string-name>
          <string-name>
            <surname>Nissim</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Bertje: A dutch bert model</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <given-names>Jacob</given-names>
            <surname>Devlin</surname>
          </string-name>
          ,
          <string-name>
            <surname>Ming-Wei</surname>
            <given-names>Chang</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Kenton</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and Kristina</given-names>
            <surname>Toutanova</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Bert: Pre-training of deep bidirectional transformers for language understanding</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <given-names>Mitchell A.</given-names>
            <surname>Gordon</surname>
          </string-name>
          , Kevin Duh, and Nicholas Andrews.
          <year>2020</year>
          .
          <article-title>Compressing bert: Studying the effects of weight pruning on transfer learning.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <given-names>Geoffrey</given-names>
            <surname>Hinton</surname>
          </string-name>
          ,
          <source>Oriol Vinyals, and Jeff Dean</source>
          .
          <year>2015</year>
          .
          <article-title>Distilling the knowledge in a neural network</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <given-names>Diederik P.</given-names>
            <surname>Kingma</surname>
          </string-name>
          and
          <string-name>
            <given-names>Jimmy</given-names>
            <surname>Ba</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Adam: A method for stochastic optimization</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <given-names>Verena</given-names>
            <surname>Lyding</surname>
          </string-name>
          , Egon Stemle, Claudia Borghetti, Marco Brunello, Sara Castagnoli, Felice Dell'Orletta, Henrik Dittmann, Alessandro Lenci, and
          <string-name>
            <given-names>Vito</given-names>
            <surname>Pirrelli</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>The PAISA` corpus of Italian web texts</article-title>
          .
          <source>In Proceedings of the 9th Web as Corpus Workshop (WaC-9)</source>
          , pages
          <fpage>36</fpage>
          -
          <lpage>43</lpage>
          , Gothenburg, Sweden, April. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <given-names>Louis</given-names>
            <surname>Martin</surname>
          </string-name>
          ,
          <string-name>
            <surname>Benjamin Muller</surname>
          </string-name>
          , Pedro Javier Ortiz Sua´rez, Yoann Dupont,
          <string-name>
            <given-names>Laurent</given-names>
            <surname>Romary</surname>
          </string-name>
          , E´ ric de la Clergerie, Djame´ Seddah, and
          <string-name>
            <given-names>Benoˆıt</given-names>
            <surname>Sagot</surname>
          </string-name>
          .
          <year>2020</year>
          .
          <article-title>Camembert: a tasty french language model</article-title>
          .
          <source>Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics.</source>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <given-names>J. S. McCarley</given-names>
            ,
            <surname>Rishav Chakravarti</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Avirup</given-names>
            <surname>Sil</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Structured pruning of a bert-based question answering model</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <given-names>Tomas</given-names>
            <surname>Mikolov</surname>
          </string-name>
          , Kai Chen, Greg Corrado, and
          <string-name>
            <given-names>Jeffrey</given-names>
            <surname>Dean</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Efficient estimation of word representations in vector space</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <given-names>Joel</given-names>
            <surname>Nothman</surname>
          </string-name>
          , Nicky Ringland, Will Radford, Tara Murphy, and
          <string-name>
            <surname>James</surname>
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Curran</surname>
          </string-name>
          .
          <year>2012</year>
          .
          <article-title>Learning multilingual named entity recognition from Wikipedia</article-title>
          .
          <source>Artificial Intelligence</source>
          ,
          <volume>194</volume>
          :
          <fpage>151</fpage>
          -
          <lpage>175</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <given-names>Matteo</given-names>
            <surname>Pagliardini</surname>
          </string-name>
          , Prakhar Gupta, and
          <string-name>
            <given-names>Martin</given-names>
            <surname>Jaggi</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Unsupervised learning of sentence embeddings using compositional n-gram features</article-title>
          .
          <source>Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          , Volume
          <volume>1</volume>
          (
          <string-name>
            <surname>Long</surname>
            <given-names>Papers).</given-names>
          </string-name>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <surname>Jeffrey</surname>
            <given-names>Pennington</given-names>
          </string-name>
          , Richard Socher, and
          <string-name>
            <given-names>Christopher</given-names>
            <surname>Manning</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>GloVe: Global vectors for word representation</article-title>
          .
          <source>In Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP)</source>
          , pages
          <fpage>1532</fpage>
          -
          <lpage>1543</lpage>
          , Doha, Qatar, October. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <string-name>
            <given-names>Matthew E.</given-names>
            <surname>Peters</surname>
          </string-name>
          , Mark Neumann, Mohit Iyyer, Matt Gardner, Christopher Clark,
          <string-name>
            <given-names>Kenton</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and Luke</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Deep contextualized word representations</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <string-name>
            <given-names>Manuela</given-names>
            <surname>Sanguinetti and Cristina Bosco</surname>
          </string-name>
          ,
          <year>2015</year>
          . PartTUT: The Turin University Parallel Treebank, pages
          <fpage>51</fpage>
          -
          <lpage>69</lpage>
          . Springer International Publishing, Cham.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          <string-name>
            <given-names>Victor</given-names>
            <surname>Sanh</surname>
          </string-name>
          , Lysandre Debut, Julien Chaumond, and
          <string-name>
            <given-names>Thomas</given-names>
            <surname>Wolf</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Distilbert, a distilled version of bert: smaller, faster, cheaper and lighter</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          <string-name>
            <given-names>Zhiqing</given-names>
            <surname>Sun</surname>
          </string-name>
          , Hongkun Yu, Xiaodan Song, Renjie Liu,
          <string-name>
            <given-names>Yiming</given-names>
            <surname>Yang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Denny</given-names>
            <surname>Zhou</surname>
          </string-name>
          .
          <year>2020</year>
          .
          <article-title>Mobilebert: a compact task-agnostic bert for resource-limited devices</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          <string-name>
            <given-names>Ashish</given-names>
            <surname>Vaswani</surname>
          </string-name>
          , Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones,
          <string-name>
            <given-names>Aidan N.</given-names>
            <surname>Gomez</surname>
          </string-name>
          , Lukasz Kaiser, and
          <string-name>
            <given-names>Illia</given-names>
            <surname>Polosukhin</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Attention is all you need</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          <string-name>
            <given-names>Antti</given-names>
            <surname>Virtanen</surname>
          </string-name>
          , Jenna Kanerva, Rami Ilo, Jouni Luoma, Juhani Luotolahti, Tapio Salakoski, Filip Ginter, and
          <string-name>
            <given-names>Sampo</given-names>
            <surname>Pyysalo</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Multilingual is not enough: Bert for finnish</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          <string-name>
            <given-names>Thomas</given-names>
            <surname>Wolf</surname>
          </string-name>
          , Lysandre Debut, Victor Sanh, Julien Chaumond, Clement Delangue, Anthony Moi, Pierric Cistac, Tim Rault, R'emi Louf, Morgan Funtowicz, and
          <string-name>
            <given-names>Jamie</given-names>
            <surname>Brew</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Huggingface's transformers: State-of-the-art natural language processing</article-title>
          . ArXiv, abs/
          <year>1910</year>
          .03771.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>