<!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>Evaluating Pre-Trained Transformers on Italian Administrative Texts</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Serena Auriemma</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Martina Miliani</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alessandro Bondielli</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lucia C. Passaro</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alessandro Lenci</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science, University of Pisa</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Department of Philology</institution>
          ,
          <addr-line>Literature, and Linguistics</addr-line>
          ,
          <institution>University of Pisa</institution>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>University for Foreigners of Siena</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>In recent years, Transformer-based models have been widely used in NLP for various downstream tasks and in diferent domains. However, a language model explicitly built for the Italian administrative language is still lacking. Therefore, in this paper, we decided to compare the performance of five diferent Transformer models, pre-trained on general purpose texts, on two main tasks in the Italian administrative domain: Name Entity Recognition and multi-label document classification on Public Administration (PA) documents. We evaluate the performance of each model on both tasks to identify the best model in this particular domain. We also discuss the efect of model size and pre-training data on the performances on domain data. Our evaluation identifies UmBERTo as the best-performing model, with an accuracy of 0.71, an F1 score of 0.89 for multi-label document classification, and an F1 score of 0.87 for NER-PA.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Natural Language Processing</kwd>
        <kwd>Evaluation of Neural Language Models</kwd>
        <kwd>Domain Language</kwd>
        <kwd>Public Administration</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        models, such as BERT [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] and RoBERTa [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], have achieved significant improvements in several
NLP tasks, and Transformers [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] lie at the core of many recent architectures [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Pre-trained
language models are advantageous in contexts where labelled data are limited while large
amounts of unlabelled data are available. This is the case for underrepresented languages or
specific domains. Indeed, several attempts have also been made to adapt these models to specific
domains via additional pre-training on domain data, which improved their performance[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
For example, BERT, one of the most widely used Transformer models, has several variants
in diferent domains: MedBERT [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] and BioBERT [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] are further pre-trained on clinical and
biomedical data, respectively, to solve medical-related tasks, such as biomedical NER or disease
prediction; SciBERT [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] is fine-tuned on a suite of tasks including sequence tagging, sentence
classification and dependency parsing on data from a variety of scientific domains; Legal
BERT [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] is pre-trained on English legislative documents, contracts and trial records for legal
text classification and sequence tagging. Nevertheless, a language model specifically built
for the Italian administrative domain is still lacking. Thus, we sought to explore the use of
generic models pre-trained on general text data for a specialized domain, such as PA.
Domainagnostic pre-trained models are often used as a baseline to which compare the performance of
domain-adapted models[
        <xref ref-type="bibr" rid="ref10 ref7">10, 7</xref>
        ]; alternatively, their performance is usually compared with that of
non-Transformer-based models, such as Conditional Random Field (CRF), Convolutional Neural
Network(CNN), Long Short Term Memory (LSTM) [
        <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
        ]. Very few approaches evaluate the
performance of diferent Transformer models on domain data, before choosing the one to adapt,
and most of them concern the medical domain. For instance, Polignano et al.[
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] created a
hybrid NER model for analyzing textual medical diagnoses in Spanish, based on a configuration
of diferent Transformer-based models and a CRF, to detect the best performing one for the task.
For the same purpose, Khan et al. [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] carried out a comparison of nine Transformer-based
models on a classification task of mentioning health twitter in English. Hence, we decided to
compare the performance of diferent Transformer-based models on two main NLP downstream
tasks, which we consider particularly congenial to the needs of PA: Named Entity Recognition
and Document Classification.
      </p>
      <p>
        Named Entity Recognition (NER) is the task of identifying and classifying entities mentioned
in unstructured text into predefined categories, e.g., proper names of people, places,
organizations, dates, etc. [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. A NER for PA, such as the one proposed by [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], includes other classes
that are particularly relevant to the administrative domain, such as the references to other
administrative documents, the legislative references, and organizations related explicitly to PA.
Identifying relevant entities in a document can facilitate intelligent access and search within
documents by municipalities.
      </p>
      <p>
        Similarly, the document classification task associates each document with a label related to
its content. It has extensive applications, including topic labeling, sentiment classification, and
spam detection [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. Since PA handles documents treating diferent aspects of the municipality,
such as Environment, Urban Planning, and Public Education, automatically classifying documents
according to their content can smooth the information retrieval process and simplify the
management and protocol of PA’s document repository. Transformer-based models have been
shown to handle these two tasks with remarkable results [
        <xref ref-type="bibr" rid="ref18 ref19 ref20 ref21">18, 19, 20, 21</xref>
        ]. Moreover, various
of-the-shelf models are available in Italian or have multilingual versions. Thus, we decided
to compare their performances in these two tasks in the domain of Italian administrative
documents without any additional domain pre-training. Given the inherent diferences of the
administrative language style from the standard Italian on which these models were pre-trained,
it is undoubtedly interesting to compare their performances on these two tasks to assess the
capabilities of such models in the PA scenario.
      </p>
      <p>Generally, Transformer-based models vary in size, number of parameters, pre-training
objective, and pre-training data. Hence, it is a challenging decision to select one of these models for
a specific downstream task. Therefore, we decided to assess their performance in the
administrative domain to identify which model best suits each of these tasks and for this particular
domain.</p>
      <p>The main contributions of this work are:
• a comparative evaluation of five Transformer-based models on two main downstream
tasks, namely NER and multi-label document classification in the administrative domain;
• the creation of a new Italian dataset for multi-label document classification in the
administrative domain, which we called atto;
• a comparison between Transformer-based models and a PA-specialized machine learning
model on NER.</p>
      <p>The rest of this paper is organized as follows. Section 2 provides a brief overview of the
Transformer models we considered for comparison. Section 3 presents the experimental details.
We describe the datasets, the parameter configuration used for fine-tuning the models on the
NER-PA and multi-label document classification tasks, the baselines, and the metrics used for
evaluation. Section 4 reports on the results and discusses them. Finally, Section 5 draws some
conclusions and highlights future works.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Transformer Models</title>
      <p>In this work we focus on Transformer-based models pre-trained on the Italian language or
available in a multilingual version, to identify which model represents the best choice for
handling administrative data, even in the absence of adaptive domain pre-training. We compare
the performance on NER-PA and PA multi-label document classification of 5
Transformerbased language models: BERT-base-Ita,1 UmBERTo,2 Multilingual BERT,3 XLM-RoBERTa,4 and
GePpeTto.5 .</p>
      <p>
        BERT [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] is a bidirectional Transformer model pre-trained on a multi-task objective (Masked
Language Modeling and Next Sentence Prediction) over vast amounts of text and can be
finetuned for various NLP downstream tasks. The Italian version of BERT, henceforth BERT-Ita,
was pre-trained on a Wikipedia dump and various texts from the OPUS corpora collection6 for
a total corpus size of 13 GB of texts.
      </p>
      <p>
        UmBERTo is a RoBERTa-based Language Model trained on a subset of the OSCAR corpus7
1https://huggingface.co/dbmdz/bert-base-italian-uncased
2https://huggingface.co/Musixmatch/umberto-wikipedia-uncased-v1
3https://huggingface.co/bert-base-multilingual-uncased
4https://huggingface.co/xlm-roberta-base
5https://huggingface.co/LorenzoDeMattei/GePpeTto
6https://opus.nlpl.eu
7https://oscar-corpus.com
containing about 70 GB of plain text. Compared to BERT, RoBERTa was trained longer, over
more data, and with larger training batch size. In addition, the training process was carried
out with a dynamic masking of tokens in place of the Next Sentence Prediction task [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. This
resulted in an improved performance of the model on various GLUE [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ] benchmark results.
UmBERTo is an expanded version of RoBERTa that contains two new features: Sentence Piece
Model and Whole Word Masking. Sentence Piece Model is a language independent tokenizer
that generates sub-word units specific to the chosen vocabulary size and corpus language. With
Whole Word Masking (WWM), if at least one of the tokens created by Sentence Piece Tokenizer
is chosen as a mask, the mask is applied to the entire word. Thus, only whole words are masked,
not sub-words.
      </p>
      <p>
        The multilingual version of BERT (mBERT) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] achieves language understanding by training
the MLM task with shared vocabulary and weights on Wikipedia texts from the 104 top languages.
Each training sample is a monolingual document, and there are no explicitly designed
crosslinguistic objectives or cross-linguistic data. Despite this, mBERT is successful in cross-linguistic
generalisation [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ].
      </p>
      <p>Another multilingual encoder is XLM-RoBERTa. This model was pre-trained on a significantly
larger amount of data, 2.5 TB of clean Common Crawl data in 100 diferent languages. Like
mBERT, XLM-RoBERTa pre-training task is solely monolingual MLM. It achieves state-of-the-art
results on several multilingual benchmarks, including XNLI, MLQA, and NER, outperforming
mBERT [24].</p>
      <p>GePpeTto [25] is the first autoregressive language model for Italian. It is built using the GPT-2
architecture [26]. The latter is a scale-up of GPT [27], with 10x parameters and 10x training
data. GPT-2 is a unidirectional generative Transformer model trained on next token prediction
given all of the previous words within some text. Its Italian version, GePpeTto was trained on a
collection of Wikipedia Text and the ItWac corpus [28], amounting to almost 13GB.</p>
      <p>The Transformer-based models we discussed difer with regard to pre-training objective, size,
and number of parameters. Moreover, they are also pre-trained on corpora of diferent sizes, as
highlighted in Table 1.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Experimental settings</title>
      <p>We aimed to compare the performance of five Transformer-based models on two diferent
tasks related to the administrative domain. To this end, we fine-tuned these five models on
two main downstream tasks in the administrative domain: NER-PA and multi-label document
classification. More specifically, we chose the base-cased version of all the models and
finetuned each model on two datasets, one for each task. We describe the used datasets in Section
3.1. We compared their performance in terms of precision, recall, F1 score, and accuracy while
analyzing the model pre-training and architecture efect on each task, as described in Section
3.5.</p>
      <sec id="sec-3-1">
        <title>3.1. Datasets</title>
        <p>In order to fine-tune the models on the NER task for the administrative domain, we selected a
corpus containing documents from the Italian Public Administration, i.e. the PA Corpus. The
corpus is annotated with domain entity labels. As for the multi-label document classification task,
we proposed a new dataset, named the Atto corpus, specifically for this purpose. Unfortunately,
the raw annotated dataset used in this paper cannot be released due to sensitive information
being present in the data. However, trained models (both for NER and document classification)
are available via huggingface8.
3.1.1. PA Corpus.</p>
        <p>
          It was first proposed in [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] for building a Named Entity Recognizer, named INFORMed PA,
specifically designed for the administrative domain. INFORMed PA extended the traditional
NER classes [29] (i.e. Person, Locations, Organizations, and Miscellaneous Entities) with other
classes representing the administrative domain. As for the traditional classes, the dataset
includes the class LOC, which is used for marking both geo-political entities (e.g., “Comune di
Pisa”) and locations (e.g., “via S. Maria 36, Pisa”); the class PER, which is used for identifying a
physical subjects; the class ORG, used for marking organizations such as Companies. As for
the PA-specific classes, it includes the following additional classes: ORG_PA, LAW, and ACT.
ORG_PA is used for labelling organizations specifically related to PA (e.g., the Municipality
Departments). LAW denotes instead legislative references. Finally, ACT marks references to
other administrative documents. In particular, ACT is further divided in several sub-classes.
Specifically, the annotation distinguishes their type (ACT_T), number (ACT_N), date (ACT_D),
functional tokens (ACT_X) and unparsable tokens (ACT_U). For example, the ACT Delibera
di Giunta Comunale numero 53 del 23/10/2016 is annotated as follows: Delibera di Giunta
comunale (ACT_T) numero (ACT_X) 53 (ACT_N) del (ACT_X) 23/10/2016 (ACT_D), while the
act DD/67/2012 is annotated as ACT_U.
        </p>
        <p>The corpus contains 460 documents taken from the Albo Pretorio Nazionale for a total of
724,623 tokens. The first 100 documents of the corpus were annotated using the aforementioned
Name Entities (NE) by two annotators, including one domain expert. Then, a CRF model
was trained using these documents and it was used to automatically annotate new documents.
Finally, two other annotators manually revised the entire output. The distribution of the diferent
NEs in the corpus, as well as examples, is listed in Table 2.</p>
        <p>The ATTO (Administrative Texts labeled by TOpic) corpus is a dataset that includes
administrative texts that are labeled with one or more topics (e.g., Environment, Construction, Urban
Planning, Social, etc.) pertaining to PA. The dataset was built upon a domain ontology created in
the context of the project SEMPLICE.9 The ontology contains approximately 2,700
administrative domain terms that domain experts divided into 13 classes, each corresponding to a diferent
sub-sector of the PA (e.g. Environment, Construction, Urban Planning, Social, etc.). We collected
up to about 1,000 documents for each of the 13 classes of topics. The collected data are a subset
of a dataset including documents from several Italian municipalities annotated and indexed by
topic. The complete list of considered topics, as well as their distribution, are shown in Table 3.</p>
        <p>The corpus was built by querying the whole PA document collection by topic. As each
document was associated with more than one topic in the original dataset, we only selected
unique documents (i.e., a document retrieved through two or more diferent topics was added
only once to the ATTO dataset). We further filtered the documents, to obtain high-quality data.
Specifically, we removed documents containing OCR-level errors, which were identified by
means of shallow matching rules. Finally, we removed documents with a length higher than
600 words. The final version of atto includes 11,019 documents.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Named Entity Recognition in the PA domain</title>
        <p>
          In order to evaluate the performances of the chosen Transformer models on Named Entity
Recognition for PA (NER-PA), we fine-tuned each model on the PA corpus (see Sec. 3.1.1).
First, the data are pre-processed to unify cross-sentence entities, merging sentences with a
common entity. Then, we split the dataset into 70% training, 20% validation, and 10% test. In
addition to the test set, we evaluated the models on a diferent test set of 25 documents from 25
various municipalities following the original approach proposed in [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. The goal of this further
analysis is to test the performance of the models on diferent templates and ways of referring
to entities employed by the various municipalities. As for the actual training, we fine-tuned
each model for five epochs with a learning rate of 2e-5. Due to diferences in model size and
limited hardware availability, we chose to vary the training batch size from model to model to
best fit our available memory, to obtain the best possible results for each model. The training
9SEMantic instruments for PubLIc administrators and CitizEns : www.semplicepa.it
was performed on a desktop computer equipped with an NVIDIA TITAN RTX graphic card.
BERT-Ita, mBERT and XLM-Roberta were fine-tuned with a batch size of 16, while GePpeTto
and UmBERTo with a batch size of 8 and 4, respectively. All models belong to the Huggingface
Transformers library.10
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Multi-label document classification</title>
        <p>As for the multi-label document classification on the atto dataset (see Sec. 3.1.2), the training
process was straightforward. We chose to perform 5-fold cross-validation, in order to ensure
the reliability of the results in absence of a test set. We first performed a preliminary evaluation
in order to find the best hyperparameters. By considering the per-epoch training and validation
loss, we concluded that all the models could be trained for 10 epochs before starting to overfit.
Thus, we fine-tuned our models for 10 epochs using a batch size of 16, 2e-5 as learning rate, and
a maximum sequence length of 512. The final results for each model are obtained by averaging
the performances on each training fold.</p>
      </sec>
      <sec id="sec-3-4">
        <title>3.4. Baselines</title>
        <p>
          For what concerns NER, we used as baseline the results obtained on the same datasets by
Informed PA [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ], a PA-specialized machine learning model based on the Stanford NER, using a
Conditional Random Field (CRF) as a learning algorithm.
        </p>
        <p>As for the baseline of the multi-label document classification task, we implemented a
Bidirectional LSTM (bi-LSTM) model. We constructed the model with one bi-LSTM layer with
256 neurons and a single dense output layer with 13 neurons since we have 13 labels in the
dataset. We chose the Sigmoid as the activation function and the binary-cross entropy as the
10https://huggingface.co/docs/Transformers/index
loss function. We also pre-processed the documents to feed the bi-LSTM removing line breaks,
typycal of administrative acts layout. We fed the neural network with 100-dimensional vector
representations of the first 250 tokens of each document obtained using Word2Vec [ 30]. We
performed 5-fold cross-validation on the ATTO corpus, as for all the other Transformer-based
models, and we trained the bi-LSTM for ten epochs with a batch size of 128. The final results of
the model are obtained by averaging the result of each training fold.</p>
      </sec>
      <sec id="sec-3-5">
        <title>3.5. Evaluation Metrics</title>
        <p>As the two considered tasks are fairly standard, we evaluated the performances on common
metrics for classification. We used micro and macro averages for precision, recall, and F1-score
for the NER-PA task. For the multi-label document classification, accuracy, precision, recall and
micro average F1-score were considered. Note that the micro average F1-score on multi-label
classification corresponds to the harmonic mean between precision and recall, while accuracy
refers to the number of data points for which the predicted set of labels is identical to the true
one over all the dataset.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Results and Discussion</title>
      <p>Table 4 summarizes the results of the models on the multi-label document classification task.
Diferences in performances are clearly minimal across all Transformer-based models, which
significantly outperform the baseline with regards to F1-score. The best performing model
was UmBERTo with an F1-score of 0.89 and an accuracy of 0.71. BERT-Ita and XLM-RoBERTa
both achieved an accuracy of 0.69 and an F1-score of 0.88, followed closely by GePpeTto which
achieved 0.67 accuracy and 0.87 F1-score. The worst performing model among Transformers
was mBERT, whose accuracy and F1-score were 0.65 and 0.86, respectively. Ultimately, the
bi-LSTM model achieved an accuracy of 0.55 and an F1-score of 0.39, both far below the average
score obtained by Transformers.</p>
      <p>These findings indicate that the most suited model for a multi-label classification task on
administrative documents is UmBERTo. This is probably due to the fact that, with respect to
the other monolingual Italian models (i.e., BERT-Ita and GePpeTto, UmBERTo), it has a bigger
size and was pre-trained on more data. While, comparing Bert-Ita and GePpeTto, despite the
models having approximately the same number of parameters and the same amount of data used
for pre-training, it appears that BERT-Ita represents a more suitable architecture to perform a
multi-label classification task than the generative model GePpeTto.</p>
      <p>Regarding the multilingual models, our results confirm what has been reported in the literature
for the general domain, i.e., the monolingual models perform better than their multilingual
counterparts [31]. Indeed, mBERT was the model with the lowest scores in both accuracy and
F1-score, and, although XLM-RoBERTa is almost three times as large as BERT-Ita in terms of
parameters, their performance was identical.</p>
      <p>As highlighted in Table 5, which shows the precision, recall, and F1-score obtained by the
models for each topic class, the ranking of the models is quite consistent across all classes: the
best-performing model, UmBERTo, obtained the highest F1-score in most cases, followed by
Bert-Ita and XLM-Roberta, GePpeTto, mBERT, and lastly the bi-LSTM model. Only two classes
constitute an exception: Trade and Business and Culture, tourism, and sport. In these cases, the
best-performing models were GePpeTto and XLM-Roberta, although the scores are still lower
when compared to the results of the other classes. That is probably related to the number of
documents labeled with these classes in the dataset, as they have fewer instances than all others
(see Table 3). Regarding the baseline, we can observe that the bi-LSTM performs poorly on
almost the whole dataset. Only in the Financial Service class, the most represented in the corpus,
the bi-LSTM achieves an F1-score of 0.88, comparable to that of the Transformer models.</p>
      <p>Table 6 provides the results of each model for the NER-PA task in terms of precision, recall,
and F1-score. These results refer to the scores obtained on the PA Corpus test set. Table 7 reports
the results obtained by the models on the additional dataset of 25 administrative documents
from 25 diferent municipalities.</p>
      <p>As for the multi-label document classification, the best performing model was UmBERTo,
with a micro average precision of 0.86, a recall of 0.89, and F1-score of 0.87. XLM-RoBERTa
obtained the same recall score as UmBERTo, but with lower precision and F1-score, respectively
of 0.83 and 0.86. BERT-Ita and mBERT achieved an equal precision of 0.83 and F1-score of 0.85.
BERT-Ita performed better than mBERT in terms of recall, with 0.88 compared to 0.87. Again,
the model that performed worse was GePpeTto with a micro average precision of 0.69, recall of
0.80, and F1-score of 0.74, deviating from the best model by about 0.13 F1-score points.</p>
      <p>On the 25 document dataset, the best-performing Transformer models was XLM-RoBERTa,
scoring 0.8, 0.88, and 0.84 on micro average precision, recall and F1-score, respectively. The
second best performing model was UmBERTo, followed by BERT-Ita and mBERT. GePpeTto
was the worst performing model with 0.63 precision, 0.78 recall, and an F1-score of 0.7.</p>
      <p>This performance comparison highlights that for the token classification task, the amount of
monolingual data used for pre-training appears to play a crucial role, together with the model’s
size. We observed that the best performing model on the PA corpus was UmBERTo, which is
pre-trained on a much larger sample of Italian texts with respect to all the other models. On
the 25 document sample, which includes a higher variability in terms of how Named Entities
are mentioned in the text, the larger model in terms of parameters, namely XLM-RoBERTa,
has a slight advantage over UmBERTo. Moreover, results show that a rather small generative
model, in comparison with current state-of-the-art ones such as GPT-3 [32], is the least suited
for fine-tuning on a token classification task.</p>
      <p>If we look at the detailed scores for each class on the 25 documents dataset, we can also
observe that the classes for which the Transformer models struggle the most are ORG_PA
P
R
F1
P
R
F1
P
R
F1
P
R
F1
P
R
F1
P
R
F1
P
R
F1
P
R
F1
P
R
F1
P
R
F1
P
R
F1
P
R
F1
mBERT
XLM-RoB.</p>
      <p>UmBERTo
GePpeTto
INFORMed</p>
      <p>PA
P
R
F1
P
R
F1
P
R
F1
P
R
F1
P
R
F1
and ACT_U (see Tab. 7 and 8). As for ORG_PA, this may be due to the fact that the names
of the organizations are more closely related to the individual Public Administration entity
(e.g., Settore LL.PP. - Public Work Sector; Uficio politiche abitative - Housing Policies Ofice).
Given that this dataset includes documents from 25 diferent municipalities, it is understandable
that even the best-performing models, namely UmBERTo and XLM-RoBERTa, may encounter
dificulty handling such variability in the nomenclature of PA organizations. On the other
hand, UmBERTo and XLM-RoBERTa seem to handle well the class ACT_U, which labeled the
unparsable token, i.e., the reference to the PA act expressed as a unique string that can vary in
terms of templates, such as n.12/2013; 67/96; 57/2008. On the contrary, BERT-Ita, mBERT, and
GePpeTto performed poorly on this class.</p>
      <p>
        We also computed the macro average of precision, recall, and F1-score for each model and
dataset to make our data comparable with the results obtained by INFORMed PA [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. Recall
that INFORMed PA is a NER for the Italian PA based on the Stanford NER using a Conditional
Random Field (CRF) as learning algorithm. The results of INFORMed PA on the PA Corpus are
shown in Table 6, while the results on the additional dataset of 25 documents are reported in
Table 7. By comparing the performance of our models with INFORMed PA on the PA Corpus,
we observed that it performed almost on par with GePpeTto, the worst performing
Transformerbased model, on all metrics. It obtained a precision of 0.74, 0.80 for recall, and an F1-score of 0.77.
In this regard, the best-performing Transformer model, UmBERTo, outperformed INFORMed
PA by a wide margin. Specifically, it scored 0.13 points higher in accuracy, 0.10 points higher in
mBERT
XLM-RoB.
      </p>
      <p>UmBERTo
GePpeTto
INFORMed</p>
      <p>PA
P
R
F1
P
R
F1
P
R
F1
P
R
F1
P
R
F1</p>
      <p>Measure ACT LAW</p>
      <p>LOC ORG ORG  PER MicAvg MacAvg
recall, and 0.12 points higher in F1-score. All the others models outperformed INFORMed PA of
at least 0.11 points in precision, 0.6 in recall, and 0.9 in F1-score. Surprisingly, the results of
INFORMed PA on the 25 documents dataset exceed those of the Transformer-based models in
terms of both precision and F1 score. We speculate that the CRF model is better able in dealing
with classes whose instance show a high degree of linguistic regularity. In particular, the model
seems to benefit from linguistic and shallow features such as word shape, n-grams, PoS-tags,
and the presence of complex terms. By performing a class-wise comparison between models, we
can observe that Transformer-based ones are more prone to errors in extracting Organization
classes (both ORG and ORG_PA), LAW and ACTS while remaining efective on the others, which
are arguably less dependent on the domain. In this case, in fact, their prediction capabilities
are closer to InformedPA. These results show that language models based on the Transformer
encoder architecture can guarantee higher performance when adequately trained on domain
data than traditional tools such as INFORMed PA. Conversely, when there is some variability
between the data on which the models are evaluated and the data used during the fine-tuning,
the performance of Transformers tends to sufer with respect to that of a CRF model.</p>
      <p>This means that to guarantee high performance on domain-specific linguistic data, such as
administrative texts, and in domain-specific tasks, such as the recognition of Public
Administration entities, the domain adaptation of the model via additional pre-training on domain-specific
data may prove to be necessary. In this way, the model should be better able to derive an
adequate representation of domain-specific terms and cope with the high degree of variability
mBERT
P
R
F1
P
R
F1
P
R
F1
P
R
F1
in how entities and acts are mentioned in bureaucracy documents. Thus, one of our future goals
will be to make a domain adaptation of the model that performed best in this comparison and
to extend further the suite of tasks more closely related to the PA domain on which the model
will be assessed.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>In this paper, we aimed to confront the performance of various Transformer-based models on
administrative texts. Our goal was to evaluate the performance of generic pre-trained models on
administrative data and to identify the most suitable model for this type of task in this particular
domain. To this end, we considered a multi-label document classification task and a Named
Entity Recognition task on Public Administration texts.</p>
      <p>Among the diferent kinds and sizes of Transformer models, UmBERTo was shown to be the
best option to handle both text and token classification tasks. It achieved the highest accuracy
of 0.71 and F1-score of 0.89 on the multi-label classification task and the highest micro average
precision, recall, and F1-score on the NER-PA task of 0.86, 0.89, and 0.87, respectively.</p>
      <p>
        While on multi-label document classification, no clear diferences emerged among
Transformer-based models, which outperformed the bi-LSMT model by a wide margin, we
have observed a much more significant variance in performances for the NER-PA task. This is
especially true if we consider encoder-only models such as UmBERTo and BERT and
encoderdecoder ones such as GePpeTto. Indeed, the latter performed worst in the NER-PA, both in
comparison with other Transformer-based models and with INFORMed PA [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
      </p>
      <p>Furthermore, we have observed that in the case of high variability in the data, document
structures, and the way in which entities are expressed, the best performances are obtained
with the domain-adapted CRF model INFORMed PA. These findings lead us to surmise that as a
future direction, it may be crucial to adapt Transformer-based language models to this domain
via additional pre-training steps in order to improve their performances.</p>
      <p>In addition, we also aim at extending the kind of tasks and the number of datasets related to
the Italian administrative domain in order to have more data available for the training and the
evaluation of the models. We also plan to anonymize these data to share them.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>This research has been funded by the Project “ABI2LE (Ability to Learning)”, funded by Regione
Toscana (POR Fesr 2014-2020). The project partners are University of Pisa, CoLing Lab and the
companies 01Semplice s.r.l. (coordinator), IPKOM s.r.l., and Insurance OnLine S.p.A.
ceedings of the 57th Annual Meeting of the Association for Computational Linguistics,
Association for Computational Linguistics, Florence, Italy, 2019, pp. 4996–5001. URL:
https://aclanthology.org/P19-1493. doi:10.18653/v1/P19-1493.
[24] A. Conneau, K. Khandelwal, N. Goyal, V. Chaudhary, G. Wenzek, F. Guzmán, E. Grave,
M. Ott, L. Zettlemoyer, V. Stoyanov, Unsupervised cross-lingual representation learning at
scale, arXiv preprint arXiv:1911.02116 (2019).
[25] L. De Mattei, M. Cafagna, F. Dell’Orletta, M. Nissim, M. Guerini, Geppetto carves italian
into a language model, arXiv preprint arXiv:2004.14253 (2020).
[26] A. Radford, J. Wu, R. Child, D. Luan, D. Amodei, I. Sutskever, et al., Language models are
unsupervised multitask learners, OpenAI blog 1 (2019) 9.
[27] A. Radford, T. Salimans, Gpt: Improving language understanding by generative
pretraining. arxiv (2018).
[28] M. Baroni, S. Bernardini, A. Ferraresi, E. Zanchetta, The wacky wide web: a collection
of very large linguistically processed web-crawled corpora, Language resources and
evaluation 43 (2009) 209–226.
[29] E. F. Sang, F. De Meulder, Introduction to the conll-2003 shared task: Language-independent
named entity recognition, arXiv preprint cs/0306050 (2003).
[30] T. Mikolov, I. Sutskever, K. Chen, G. S. Corrado, J. Dean, Distributed representations of
words and phrases and their compositionality, Advances in neural information processing
systems 26 (2013).
[31] M. Polignano, P. Basile, M. De Gemmis, G. Semeraro, V. Basile, Alberto: Italian bert
language understanding model for nlp challenging tasks based on tweets, in: 6th Italian
Conference on Computational Linguistics, CLiC-it 2019, volume 2481, CEUR, 2019, pp.
1–6.
[32] T. Brown, B. Mann, N. Ryder, M. Subbiah, J. D. Kaplan, P. Dhariwal, A. Neelakantan,
P. Shyam, G. Sastry, A. Askell, S. Agarwal, A. Herbert-Voss, G. Krueger, T. Henighan,
R. Child, A. Ramesh, D. Ziegler, J. Wu, C. Winter, C. Hesse, M. Chen, E. Sigler, M. Litwin,
S. Gray, B. Chess, J. Clark, C. Berner, S. McCandlish, A. Radford, I. Sutskever, D. Amodei,
Language models are few-shot learners, in: H. Larochelle, M. Ranzato, R. Hadsell, M. Balcan,
H. Lin (Eds.), Advances in Neural Information Processing Systems, volume 33, Curran
Associates, Inc., 2020, pp. 1877–1901. URL: https://proceedings.neurips.cc/paper/2020/file/
1457c0d6bfcb4967418bfb8ac142f64a-Paper.pdf.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , BERT:
          <article-title>Pre-training of deep bidirectional transformers for language understanding</article-title>
          ,
          <source>in: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          , Volume
          <volume>1</volume>
          (Long and Short Papers),
          <source>Association for Computational Linguistics</source>
          , Minneapolis, Minnesota,
          <year>2019</year>
          , pp.
          <fpage>4171</fpage>
          -
          <lpage>4186</lpage>
          . URL: https://aclanthology.org/ N19-1423. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>N19</fpage>
          -1423.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ott</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Joshi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Levy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Stoyanov</surname>
          </string-name>
          ,
          <article-title>Roberta: A robustly optimized bert pretraining approach</article-title>
          , arXiv preprint arXiv:
          <year>1907</year>
          .
          <volume>11692</volume>
          (
          <year>2019</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>
          , Ł. Kaiser,
          <string-name>
            <surname>I. Polosukhin</surname>
          </string-name>
          ,
          <article-title>Attention is all you need</article-title>
          ,
          <source>Advances in neural information processing systems</source>
          <volume>30</volume>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>X.</given-names>
            <surname>Qiu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Shao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <article-title>Pre-trained models for natural language processing: A survey</article-title>
          ,
          <source>Science China Technological Sciences</source>
          <volume>63</volume>
          (
          <year>2020</year>
          )
          <fpage>1872</fpage>
          -
          <lpage>1897</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S.</given-names>
            <surname>Gururangan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Marasović</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Swayamdipta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Beltagy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Downey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. A.</given-names>
            <surname>Smith,</surname>
          </string-name>
          <article-title>Don't stop pretraining: Adapt language models to domains and tasks, in: Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, Association for Computational Linguistics</article-title>
          , Online,
          <year>2020</year>
          , pp.
          <fpage>8342</fpage>
          -
          <lpage>8360</lpage>
          . URL: https://aclanthology.org/
          <year>2020</year>
          .acl-main.
          <volume>740</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2020</year>
          .acl-main.
          <volume>740</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>L.</given-names>
            <surname>Rasmy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Xie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Tao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhi</surname>
          </string-name>
          ,
          <article-title>Med-bert: pretrained contextualized embeddings on large-scale structured electronic health records for disease prediction</article-title>
          ,
          <source>NPJ digital medicine 4</source>
          (
          <year>2021</year>
          )
          <fpage>1</fpage>
          -
          <lpage>13</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>J.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Yoon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. H.</given-names>
            <surname>So</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kang</surname>
          </string-name>
          ,
          <article-title>Biobert: a pre-trained biomedical language representation model for biomedical text mining</article-title>
          ,
          <source>Bioinformatics</source>
          <volume>36</volume>
          (
          <year>2020</year>
          )
          <fpage>1234</fpage>
          -
          <lpage>1240</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>I.</given-names>
            <surname>Beltagy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cohan</surname>
          </string-name>
          ,
          <article-title>Scibert: A pretrained language model for scientific text</article-title>
          , arXiv preprint arXiv:
          <year>1903</year>
          .
          <volume>10676</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>I.</given-names>
            <surname>Chalkidis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Fergadiotis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Malakasiotis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Aletras</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Androutsopoulos</surname>
          </string-name>
          ,
          <article-title>Legal-bert: The muppets straight out of law school</article-title>
          , arXiv preprint arXiv:
          <year>2010</year>
          .
          <volume>02559</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>P.</given-names>
            <surname>Grouchy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Jain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Tian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Arora</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Ngai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. K.</given-names>
            <surname>Khattak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Dolatabadi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Koçak</surname>
          </string-name>
          ,
          <article-title>An experimental evaluation of transformer-based language models in the biomedical domain</article-title>
          , arXiv preprint arXiv:
          <year>2012</year>
          .
          <volume>15419</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>R.</given-names>
            <surname>Joshi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gupta</surname>
          </string-name>
          ,
          <article-title>Performance comparison of simple transformer and res-cnn-bilstm for cyberbullying classification</article-title>
          ,
          <source>arXiv preprint arXiv:2206.02206</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>C.</given-names>
            <surname>Lothritz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Allix</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Veiber</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Klein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. F. D. A.</given-names>
            <surname>Bissyande</surname>
          </string-name>
          ,
          <article-title>Evaluating pretrained transformer-based models on the task of fine-grained named entity recognition</article-title>
          ,
          <source>in: Proceedings of the 28th International Conference on Computational Linguistics</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>3750</fpage>
          -
          <lpage>3760</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>M.</given-names>
            <surname>Polignano</surname>
          </string-name>
          , M. de Gemmis, G. Semeraro,
          <article-title>Comparing transformer-based ner approaches for analysing textual medical diagnoses</article-title>
          .,
          <source>in: CLEF (Working Notes)</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>818</fpage>
          -
          <lpage>833</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>P. I.</given-names>
            <surname>Khan</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Razzak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Dengel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ahmed</surname>
          </string-name>
          ,
          <article-title>Performance comparison of transformer-based models on twitter health mention classification</article-title>
          ,
          <source>IEEE Transactions on Computational Social Systems</source>
          (
          <year>2022</year>
          )
          <fpage>1</fpage>
          -
          <lpage>10</lpage>
          . doi:
          <volume>10</volume>
          .1109/TCSS.
          <year>2022</year>
          .
          <volume>3143768</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sun</surname>
          </string-name>
          , J. Han,
          <string-name>
            <given-names>C.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>A survey on deep learning for named entity recognition</article-title>
          ,
          <source>IEEE Transactions on Knowledge and Data Engineering</source>
          <volume>34</volume>
          (
          <year>2020</year>
          )
          <fpage>50</fpage>
          -
          <lpage>70</lpage>
          . doi:
          <volume>10</volume>
          .1109/TKDE.
          <year>2020</year>
          .
          <volume>2981314</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>L. C.</given-names>
            <surname>Passaro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Lenci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gabbolini</surname>
          </string-name>
          ,
          <article-title>Informed pa: A ner for the italian public administration domain</article-title>
          ,
          <source>in: Fourth Italian Conference on Computational Linguistics CLiC-it</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>246</fpage>
          -
          <lpage>251</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Dyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Smola</surname>
          </string-name>
          , E. Hovy,
          <article-title>Hierarchical attention networks for document classification, in: Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Association for Computational Linguistics</article-title>
          , San Diego, California,
          <year>2016</year>
          , pp.
          <fpage>1480</fpage>
          -
          <lpage>1489</lpage>
          . URL: https://aclanthology.org/N16-1174. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>N16</fpage>
          -1174.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>C.</given-names>
            <surname>Lothritz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Allix</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Veiber</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Klein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. F. D. A.</given-names>
            <surname>Bissyande</surname>
          </string-name>
          ,
          <article-title>Evaluating pretrained transformer-based models on the task of fine-grained named entity recognition</article-title>
          ,
          <source>in: Proceedings of the 28th International Conference on Computational Linguistics</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>3750</fpage>
          -
          <lpage>3760</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>R.</given-names>
            <surname>Pappagari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Zelasko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Villalba</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Carmiel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Dehak</surname>
          </string-name>
          ,
          <article-title>Hierarchical transformers for long document classification</article-title>
          ,
          <source>in: 2019 IEEE Automatic Speech Recognition and Understanding Workshop (ASRU)</source>
          , IEEE,
          <year>2019</year>
          , pp.
          <fpage>838</fpage>
          -
          <lpage>844</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Shaheen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Wohlgenannt</surname>
          </string-name>
          , E. Filtz,
          <article-title>Large scale legal text classification using transformer models</article-title>
          , arXiv preprint arXiv:
          <year>2010</year>
          .
          <volume>12871</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>A.</given-names>
            <surname>Adhikari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ram</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <article-title>Docbert: Bert for document classification</article-title>
          , arXiv preprint arXiv:
          <year>1904</year>
          .
          <volume>08398</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>A.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Michael</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Hill</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Levy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. R.</given-names>
            <surname>Bowman</surname>
          </string-name>
          ,
          <article-title>Glue: A multi-task benchmark and analysis platform for natural language understanding</article-title>
          , arXiv preprint arXiv:
          <year>1804</year>
          .
          <volume>07461</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>T.</given-names>
            <surname>Pires</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Schlinger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Garrette</surname>
          </string-name>
          ,
          <article-title>How multilingual is multilingual BERT?</article-title>
          , in: Pro-
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>