<!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>
      <journal-title-group>
        <journal-title>Conference and Labs of the Evaluation Forum, September</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>NLPIR-UNED at CheckThat! 2023: Ensemble of Classifiers for Check-Worthiness Estimation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Juan R. Martinez-Rico</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lourdes Araujo</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Juan Martinez-Romo</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>NLP &amp; IR Group, Dpto. Lenguajes y Sistemas Informáticos, Universidad Nacional de Educación a Distancia (UNED)</institution>
          ,
          <addr-line>Madrid 28040</addr-line>
          ,
          <country country="ES">Spain</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <volume>1</volume>
      <fpage>8</fpage>
      <lpage>21</lpage>
      <abstract>
        <p>This article outlines the NLPIR-UNED team's strategies for Task 1B in the CLEF 2023 CheckThat! Lab. The goal of this task is to determine if a text fragment from a tweet or a debate/speech is worth fact-checking. Our team devised three main approaches based on ensemble models for this binary classification task. For the English version of subtask 1B, which involves classifying text fragments from debates/speeches, we utilized an ensemble classifier composed of three transformer models that were fed diferent sentences from the debate/speech. On the other hand, for the Spanish version of subtask 1B, which requires classifying tweets, we have tried two more strategies, an ensemble classifier composed of three diferent transformer models in Spanish that receive the same tweet, and the one that we finally use: an ensemble classifier that combined a transformer model and two feed-forward neural networks (FFNN). The transformer model processes the tweet's text, while the two FFNNs receive as input TF-IDF vectors and LIWC features extracted from the text, respectively. With these approaches, our team achieved the fourth position in subtask 1B English and the same position for subtask 1B Spanish.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Check-worthiness Classification</kwd>
        <kwd>Transformer Models</kwd>
        <kwd>Ensemble of Classifiers</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Fake news is a growing problem that has been amplified by the rise of social media and the
ease of spreading misinformation online. This phenomenon can have serious consequences,
such as influencing political elections, spreading harmful health information, and causing social
unrest. Traditional fact-checking methods are often slow and labor-intensive, making them
inefective at keeping up with the speed at which false information can spread. This has led
to the development of automated methods to detect and combat fake news, such as machine
learning algorithms that can quickly analyze large volumes of data and identify suspicious
patterns. These automated methods have the potential to provide a more eficient and efective
approach to combating fake news.</p>
      <p>
        One of the fundamental tasks to perform if we want to detect fake news in news or message
lfows on a social network is the selection of the statements to check. This is precisely what task
1 of the CheckThat! Lab [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] aims to do. Our team has focused on variant B of this task, which
contemplates only the use of textual information, and in the English and Spanish languages. For
the English version the organizers provide a dataset generated from the transcript of a debate,
while for the Spanish version the dataset is composed of a series of tweets. In both cases each
instance is annotated with the values Yes if the sentence/tweet contains a factual statement and
may be harmful, or No otherwise.
      </p>
      <p>We have organized the rest of the article as follows: in Section 2 we make a brief review of the
diferent approaches carried out in recent years to the task of estimating the check-worthiness
of a statement, in Section 3 we explain our diferent approaches to this task, Section 4 discuss
the results obtained, and Section 5 contains our conclusions and future work.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        The task of estimating check-worthiness of a sentence has had diferent approaches as the
available models and tools have evolved. The approaches considered include word embeddings,
bag-of-words representations, and heuristic rules to classify claims, and multilayer perceptron
or support vector machine models [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], recurrent neural networks with attention, combining
word2vec embeddings, part-of-speech tags, and syntactic dependencies [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], learning-to-rank
approaches based on the MART algorithm, using word embeddings, named entities,
part-ofspeech tags, sentiment labels, and topics as features [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], k-nearest neighbors classifiers with
character n-gram representations, considering linguistic lexicons and named entities [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], or
support vector machines and random forests classifiers with information retrieval nutritional
labels as representations [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <p>
        Subsequently, more sophisticated representation models have been applied, such as training
a feed-forward neural network with Standard Universal Sentence Encoder embeddings and
using diferent variations of embeddings and training epochs [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>
        Finally, with the generalization of transformer models as a basic tool in almost any task
related to general language processing, most approaches have used this strategy [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], either using
pre-trained models in generic documents [
        <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
        ], in other languages [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], or in a specific domain
such as health [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. The approaches that have appeared more recently and have a superior
performance than the solo transformer models, are the ensembles of classifiers [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. These
models typically include two or more diferent transformer models, or transformers pre-trained
in diferent documents, or a combination of transformers and other types of classifiers such as
feed-forward neural networks (FFNN). In our proposal, we use these two types of approaches:
an ensemble with several transformers, and an ensemble composed of a transformer and two
FFNNs that allows incorporating lexical and text analysis features.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Approaches to Check-Worthiness Estimation</title>
      <p>In this 2023 edition of the CheckThat! Lab, the goal of subtask 1B is to determine if a given
tweet is worth checking (binary classification), taking into account whether this tweet contains
a factual statement that can be verified and whether it could be harmful. This task is ofered in
three languages: English, Spanish and Arabic. The organizers provide three diferent datasets
for each language with which the models can be developed, in addition to the test dataset used
for the competition. In Table 1 we can see the number of instances of each dataset for the
languages in which our team has participated.</p>
      <p>
        To tackle this subtask, our team has evaluated three strategies, all based on ensemble classifiers.
The first of them is an ensemble classifier composed of a transformer model, a feed forward
neural network (FFNN) whose inputs are TF-IDF vectors, and a FFNN whose inputs are text
analysis indicators. Here, the objective is to complement the latent features that a transformer
model is able to extract from plain text, with other types of features such as TF-IDF vectors
extracted from that same text, and the features provided by the text analysis tool Linguistic
Inquiry and Word Count (LIWC) [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
      </p>
      <p>The other two strategies are also ensemble classifiers but this time they contain three
transformer models although used diferently. In the subtask proposed for the English language, the
dataset is composed of sentences extracted from a debate and in the first column appears an
identifier that, after carefully examining the instances of training and test, we have assumed is
the order in which the sentences appeared in the debate. That is why we wanted to explore the
possibility of taking advantage of this information, making the ensemble classifier receive in its
input 3 the instance to be evaluated, and in its inputs 2 and 1 the two instances immediately prior
to the current one existing in the dataset, taking into account that there are gaps we assume
generated when making the training-dev-test partition. Our hypothesis is that providing context
information (previous sentences) to the sentence to be evaluated can be useful in determining
the check-worthiness of that sentence.</p>
      <p>For the subtask proposed in Spanish the dataset is composed of tweets, which we cannot
identify as related following any type of order. That is why we have chosen to use an ensemble
composed of three diferent transformer models pre-trained all of them in Spanish, hoping that
the diferent behaviors that each of them may have complement each other, achieving a superior
performance to each of them separately.</p>
      <p>We detail each of these approaches below. All used pre-trained transformer models have
been downloaded from https://huggingface.co/.</p>
      <sec id="sec-3-1">
        <title>3.1. Transformer-FFNN Ensemble</title>
        <p>3.1.1. Method
To check whether diferent types of input generated from the same text can complement each
other and lead to greater eficiency in detecting whether that text deserves to be verified, we
need to be able to handle these three types of input simultaneously for each instance of the
dataset. Therefore, we have developed an ensemble model (Figure 1) composed of a transformer</p>
        <p>TF-IDF Vectors</p>
        <p>Transformer
Pretrained Model
[CLS] First Token
Last Hidden Layer</p>
        <p>FFNN 1
Pretrained Model</p>
        <p>FFNN 2</p>
        <p>Pretrained Model
Hidden Layer</p>
        <p>Hidden Layer
that processes the text as a sequence, a FFNN classifier that admits as input that text in the
form of a TF-IDF vector, and a second FFNN classifier that has as inputs the discrete features
generated by the LIWC text analysis tool (93 features for the English language and 90 features
for the Spanish language). The hidden layers of the FFNNs and the first token of the last hidden
layer of the transformer (classification token) are concatenated and form the first layer of the
ensemble classifier. Behind this concatenation layer are two hidden layers and one output layer.
It is also possible to disable one of the hidden layers by configuration. Before training the
ensemble classifier, the transformer and the two FFNN models are trained separately on the
same dataset and stored in binary files. These models are then loaded in evaluation mode in the
ensemble classifier to prevent their parameters from being modified during ensemble training.</p>
        <sec id="sec-3-1-1">
          <title>3.1.2. Training Strategy</title>
          <p>To determine the configuration with the best performance, the system was configured to use
deterministic algorithms and the tests were repeated for 10 diferent random seeds, obtaining
the average of the precision, recall, and F1 measures. An early stopping mechanism has also
been implemented. This mechanism stores the updated state of parameters after each epoch and
stops training when there have been no improvements in the F1 measure over the dev dataset
in the last n epochs (default value 2), then selecting the saved configuration with the best F1
measure during that interval. After performing a grid search for each component separately and
for the ensemble classifier, the following hyperparameters have been selected for the English
language:
• FFNN hidden layer size: 1000.
• FFNN seed value: 0.
• FFNN max. epochs: 250.
• FFNN (TF-IDF) activation function: relu.
• FFNN (LIWC) activation function: sigmoid.
• Transformer pre-trained model: bert-base-uncased.
• Transformer max. sequence lenght: 128.
• Transformer max. epochs: 10.
• Transformer seed value: 63.
• Ensemble activation function: relu.
• Ensemble hidden layers: 2.
• Ensemble dropout: 0.</p>
          <p>• Ensemble max. epochs: 10.</p>
          <p>
            And for the Spanish language the same hyperparameters have been used except for the
following:
• FFNN seed value: 96.
• Transformer pre-trained model: bertin-project/bertin-roberta-base-spanish [
            <xref ref-type="bibr" rid="ref17">17</xref>
            ].
• Transformer seed value: 70.
          </p>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Ensemble of Transformers</title>
        <p>3.2.1. Method
In the English subtask, as discussed above, we wanted to take advantage of what appears to
be a flow of sentences to provide context for the sentence to be evaluated. For this, we have
developed an ensemble classifier (Figure 2) composed of three transformer models so that each
one can receive a diferent sentence. During the processing of the training and test datasets,
we look for the two instances that have the identifiers immediately before i - n, i - n - m to the
instance i to evaluate. These three sentences form the input of the ensemble classifier using
the class value of the instance i. As a pre-trained model, we use the same in each of the three
transformer components: bert-base-uncased.</p>
        <p>
          For the Spanish subtask, since the datasets contain tweets, we have assumed that they had
no relationship between them by adopting the strategy of providing the same sentence (tweet)
in the three inputs of the ensemble classifier, and use a diferent pre-trained model on each
transformer component. With this, we hoped that the diferent pre-trainings that each one has
had are somehow complementary and allow us to determine more precisely if the sentence to
evaluate is worth checking. Specifically, we have used the following models:
• Transformer 1: PlanTL-GOB-ES/roberta-large-bne [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ].
• Transformer 2: dccuchile/bert-base-Spanish-wwm-cased [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ].
        </p>
        <p>• Transformer 3: bertin-project/bertin-roberta-base-spanish.</p>
        <sec id="sec-3-2-1">
          <title>3.2.2. Training Strategy</title>
          <p>The hyperparameters used in both languages were as follows:
• Transformer max. sequence lenght: 128.</p>
          <p>Sequence i</p>
          <p>Sequence i - n</p>
          <p>Sequence i - n - m</p>
          <p>Transformer 1
Pretrained Model
[CLS] First Token
Last Hidden Layer</p>
          <p>Transformer 2
Pretrained Model
[CLS] First Token</p>
          <p>Last Hidden Layer
• Transformer max. epochs: 10.
• Transformer seed value: 63.
• Ensemble activation function: relu.
• Ensemble hidden layers: 2.
• Ensemble dropout: 0.</p>
          <p>• Ensemble max. epochs: 10.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Results</title>
      <p>This section describes the results obtained with the three strategies described. The F1 score on
the positive class is the evaluation measure used by the organizers in the competition.</p>
      <sec id="sec-4-1">
        <title>4.1. English Subtask</title>
        <p>The organizers provided three datasets for both languages: training, dev-test and test. Since
the values of F1 measure obtained for the English subtask with the test dataset were very high
even for the n-gram baseline, we also performed the evaluation joining the dev-test and test
datasets. In all cases the training has been done using only the training dataset. Table 2 shows
the averaged results of the models after 10 runs with diferent random seeds.</p>
        <p>The last column shows the F1 measure calculated on the test dataset, along with the reference
values provided by the baselines. As we can see, the FFNN with input in the form of TF-IDF
vectors is not able to overcome the baseline n-gram. On the other hand, the transformer model
bert-base-uncased outperforms the two ensemble classifiers, indicating that, at least in this
test dataset, the combination of models and inputs does not bring any improvement to the
classifier’s performance. In principle, ensemble models would be expected to outperform the
solo transformer model as they should be able to select the best information present in each
of their three inputs to evaluate a given sentence. It is possible that the context search that
we intended to use by looking for sentences before the current one is not working in this test
dataset because there is too much distance between them. Remember that we have assumed that
the identifier of each sentence is the order it has within the debate. Thus, having partitioned
the debate by randomly extracting sentences to create the train, test and dev-test datasets, the
sentences are no longer consecutive in these datasets. Regarding the other type of ensemble
classifier, we can also assume that in this test dataset the inputs of TF-IDF vectors and LIWC
features do not provide enough information to improve the behavior of the ensemble model.</p>
        <p>If we look at the evaluation carried out on the dev-test + test dataset, we see that in this case
the two ensemble models surpass to the transformer model alone, although by a small margin.
For the ensemble model that searches for previous sentences, performance may be improving
as two datasets have been rejoined, making the distances between the current sentence and
the two immediately preceding sentences smaller and contributing to this context information
more efectively.</p>
        <p>For the main submission, we selected the ensemble model that seeks context information in
two previous sentences (shown in Table 2 as Ensemble of Transformers). Although it does not
have the highest average F1 score, the diferences with the other models are minimal, and we
wanted to see how this approach performs in the competition. With this configuration we have
achieved the fourth best result among the eleven participating teams with an F1 measure of
0.851 (Table 3), being 0.898 the value obtained by the team classified in first position and 0.462
the one obtained by the baseline.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Spanish Subtask</title>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusions and Future Work</title>
      <p>To tackle the task of estimating the check-worthiness of a sentence or tweet, in this edition of
the CheckThat! Lab our team has evaluated several strategies that involve the use of ensemble
classifiers.</p>
      <p>One of them, has been based on the use of an ensemble classifier containing a transformer
model, a feed-forward neural network (FFNN) with TF-IDF vectors at the input, and a second
FFNN with features extracted by the text analysis tool LIWC. This model, as we expected, has
been able to surpass the solo transformer models in the Spanish subtask and is the one we have
used to make the main submission in this language, obtaining the fourth best result (F1 = 0.589)
among the seven participants. In this same subtask we have also evaluated an ensemble model
that contained three diferent transformer models in Spanish, obtaining similar results.</p>
      <p>In subtask in English language, the diferences between the results obtained by the ensemble
models and the transformer models alone have been much smaller, the latter surpassing the
ensemble in the test dataset. The main diference between both subtasks is the content of the
datasets: sentences of a debate in the subtask in English, and tweets in the subtask in Spanish.
This, in principle should not be the reason for this similarity in performance since ensemble
models usually perform better than solo transformers. Still, we have selected the ensemble
classifier composed of three transformer models fed with the current sentence and two previous
sentences to provide context information. With this configuration, our team has obtained the
fourth best F1 measure (0.851) among the eleven participating teams. We think that this model
can give good results when, for example, we are analyzing a text to identify the sentences that
are worth checking, because in this case we could select the two sentences immediately prior
to the current one, unlike what happens with the datasets of this subtask where not all the
sentences of the debate are available.</p>
      <p>In the future, we intend to further explore alternative methods of integrating diverse models
into an ensemble classifier, thereby expanding the range of features utilized in identifying
sentences that need to be verified.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>This work has been partially supported by the Spanish Ministry of Science and Innovation
within the DOTT-HEALTH Project (MCI/AEI/FEDER, UE) under Grant PID2019-106942RB-C32
and OBSER-MENH Project (MCIN/AEI/10.13039/501100011033 and NextGenerationEU/PRTR)
under Grant TED2021-130398B-C21 as well as project RAICES (IMIENS 2022).
Pre-Training of a Spanish Language Model using Perplexity Sampling, Procesamiento del
Lenguaje Natural 68 (2022) 13–23. URL: http://journal.sepln.org/sepln/ojs/ojs/index.php/
pln/article/view/6403.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>F.</given-names>
            and
            <surname>Alam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Barrón-Cedeño</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. S.</given-names>
            <surname>Cheema</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Hakimov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hasanain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Míguez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Mubarak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. K.</given-names>
            <surname>Shahi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Zaghouani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Nakov</surname>
          </string-name>
          ,
          <article-title>Overview of the CLEF-2023 CheckThat! Lab Task 1 on Check-Worthiness in Multimodal and Multigenre Content</article-title>
          , in: Working Notes of CLEF 2023-
          <article-title>Conference and Labs of the Evaluation Forum</article-title>
          , CLEF '
          <year>2023</year>
          , Thessaloniki, Greece,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>C.</given-names>
            <surname>Zuo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Karakas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Banerjee</surname>
          </string-name>
          ,
          <article-title>A hybrid recognition system for check-worthy claims using heuristics and supervised learning</article-title>
          ,
          <source>in: CEUR workshop proceedings</source>
          , volume
          <volume>2125</volume>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>C.</given-names>
            <surname>Hansen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Hansen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. G.</given-names>
            <surname>Simonsen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Lioma</surname>
          </string-name>
          ,
          <article-title>The Copenhagen Team Participation in the Check-Worthiness Task of the Competition of Automatic Identification and Verification of Claims in Political Debates of the CLEF-</article-title>
          2018
          <source>CheckThat! Lab</source>
          (
          <year>2018</year>
          )
          <article-title>8</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>K.</given-names>
            <surname>Yasser</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kutlu</surname>
          </string-name>
          , T. Elsayed, bigIR at CLEF 2018:
          <article-title>Detection and Verification of CheckWorthy Political Claims (</article-title>
          <year>2018</year>
          )
          <fpage>10</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>B.</given-names>
            <surname>Ghanem</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Montes-y Gomez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Rangel</surname>
          </string-name>
          , P. Rosso,
          <string-name>
            <surname>UPV-INAOE-Autoritas - Check That</surname>
          </string-name>
          :
          <article-title>Preliminary Approach for Checking Worthiness of Claims (</article-title>
          <year>2018</year>
          )
          <article-title>6</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>R.</given-names>
            <surname>Agez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Bosc</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Lespagnol</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mothe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Petitcol</surname>
          </string-name>
          , IRIT at CheckThat!
          <year>2018</year>
          ,
          <string-name>
            <surname>Cappellato</surname>
          </string-name>
          et al.[
          <volume>5</volume>
          ] (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>L.</given-names>
            <surname>Favano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. J.</given-names>
            <surname>Carman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. L.</given-names>
            <surname>Lanzi</surname>
          </string-name>
          , TheEarthIsFlat's Submission to CLEF'19 CheckThat! Challenge (
          <year>2019</year>
          )
          <fpage>12</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>E.</given-names>
            <surname>Williams</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rodrigues</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Novak</surname>
          </string-name>
          , Accenture at CheckThat! 2020:
          <article-title>If you say so: Post-hoc fact-checking of claims using transformer-based models</article-title>
          ,
          <source>Working Notes of CLEF 2020 - Conference and Labs of the Evaluation Forum</source>
          (
          <year>2020</year>
          )
          <article-title>12</article-title>
          . URL: http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2696</volume>
          / paper_226.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <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, in: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</article-title>
          , Volume
          <volume>1</volume>
          (Long and Short Papers),
          <year>2019</year>
          , pp.
          <fpage>4171</fpage>
          -
          <lpage>4186</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <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>
          , V. Stoyanov,
          <article-title>RoBERTa: A Robustly Optimized BERT Pretraining Approach</article-title>
          , arXiv:
          <year>1907</year>
          .11692 [cs] (
          <year>2019</year>
          ). URL: http://arxiv.org/abs/
          <year>1907</year>
          .11692.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>W.</given-names>
            <surname>Antoun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Baly</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Hajj</surname>
          </string-name>
          , Arabert:
          <article-title>Transformer-based model for arabic language understanding</article-title>
          , arXiv preprint arXiv:
          <year>2003</year>
          .
          <volume>00104</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>D. Q.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Vu</surname>
          </string-name>
          , A. T. Nguyen,
          <article-title>BERTweet: A pre-trained language model for English Tweets</article-title>
          , arXiv preprint arXiv:
          <year>2005</year>
          .
          <volume>10200</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>N.</given-names>
            <surname>Buliga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Raschip</surname>
          </string-name>
          , Zorros at CheckThat! 2022:
          <article-title>Ensemble Model for Identifying Relevant Claims in Tweets (</article-title>
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>J. W.</given-names>
            <surname>Pennebaker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. L.</given-names>
            <surname>Boyd</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Jordan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Blackburn</surname>
          </string-name>
          ,
          <article-title>The development and psychometric properties of LIWC2015</article-title>
          ,
          <source>Technical Report</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>A. G.</given-names>
            <surname>Fandiño</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Estapé</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Pàmies</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. L.</given-names>
            <surname>Palao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. S.</given-names>
            <surname>Ocampo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. P.</given-names>
            <surname>Carrino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. A.</given-names>
            <surname>Oller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. R.</given-names>
            <surname>Penagos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. G.</given-names>
            <surname>Agirre</surname>
          </string-name>
          , M. Villegas,
          <source>MarIA: Spanish Language Models, Procesamiento del Lenguaje Natural</source>
          <volume>68</volume>
          (
          <year>2022</year>
          ). URL: https://upcommons.upc.edu/handle/2117/367156# .YyMTB4X9A-0.mendeley. doi:
          <volume>10</volume>
          .26342/2022-68-3, publisher:
          <source>Sociedad Española para el Procesamiento del Lenguaje Natural.</source>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>J.</given-names>
            <surname>Cañete</surname>
          </string-name>
          , G. Chaperon,
          <string-name>
            <given-names>R.</given-names>
            <surname>Fuentes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-H.</given-names>
            <surname>Ho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Kang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Pérez</surname>
          </string-name>
          ,
          <article-title>Spanish Pre-Trained BERT Model and Evaluation Data</article-title>
          ,
          <source>in: PML4DC at ICLR</source>
          <year>2020</year>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>J. D. l. R. y. E. G. P. y. M. R. y. P. V. y. P. G. d. P. S. y. M.</given-names>
            <surname>Grandury</surname>
          </string-name>
          , BERTIN: Eficient
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>