<!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>Bucharest, Romania
" e.m.williams@accenture.com (E. Williams); paul.rodrigues@accenture.com (P. Rodrigues);
sieu.tran@accenture.com (S. Tran)
~ http://www.DrPaulRodrigues.com/ (P. Rodrigues)</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Accenture at CheckThat! 2021: Interesting claim identification and ranking with contextually sensitive lexical training data augmentation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Evan Williams</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Paul Rodrigues</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sieu Tran</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Accenture</institution>
          ,
          <addr-line>800 N. Glebe Rd., Arlington, 22209</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Maryland</institution>
          ,
          <addr-line>7005 52nd Avenue, College Park, MD 20742</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2021</year>
      </pub-date>
      <volume>000</volume>
      <fpage>0</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>This paper discusses the approach used by the Accenture Team for CLEF2021 CheckThat! Lab, Task 1, to identify whether a claim made in social media would be interesting to a wide audience and should be fact-checked. Twitter training and test data were provided in English, Arabic, Spanish, Turkish, and Bulgarian. Claims were to be classified (check-worthy/not check-worthy) and ranked in priority order for the fact-checker. Our method used deep neural network transformer models with contextually sensitive lexical augmentation applied on the supplied training datasets to create additional training samples. This augmentation approach improved the performance for all languages. Overall, our architecture and data augmentation pipeline produced the best submitted system for Arabic, and performance scales according to the quantity of provided training data for English, Spanish, Turkish, and Bulgarian. This paper investigates the deep neural network architectures for each language as well as the provided data to examine why the approach worked so efectively for Arabic, and discusses additional data augmentation measures that should be useful to this problem.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;fact checking</kwd>
        <kwd>claim retrieval</kwd>
        <kwd>check-worthy</kwd>
        <kwd>social media</kwd>
        <kwd>BERT</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Labeled data for some machine learning tasks can be quite rare and valuable. Data labeling is a
time consuming task, and can be expensive if subject matter or language expertise are required.
Machine learning engineers know that generally, the larger the training set, the higher accuracy
the classifier will have [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], so they often request more data.
      </p>
      <p>Further, engineers have been taught to prefer balanced data sets to train more robust classifiers.
Most annotation processes yield unbalanced datasets naturally. Data scientists often have
four options: upsampling, downsampling, cost-sensitive learning, or active learning to seek
a balanced dataset through additional annotation. Downsampling reduces the data provided
to the learner, which removes valuable labeled data from the dataset. Active learning incurs
additional labeling cost. Upsampling is an attractive alternative. Upsampling in NLP application
areas could involve exact text duplication or text augmentation.</p>
      <p>The CLEF CheckThat! Labs provide shared training data for all the groups. This data provided
in 2020 and 2021 was naturally unbalanced, predominantly consisting of documents that are
not check-worthy.</p>
      <p>
        Last year we published a paper at CLEF CheckThat! which used back translation to balance
the classes in our Arabic training data. [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] The noise introduced by the machine translation
system provided for an improvement in classifier performance. This method resulted in the
best performing Arabic model in the Lab. For this year’s Lab, we again endeavored to generate
additional labeled data from the provided labeled data.
      </p>
      <p>This year we used a diferent technique, contextually sensitive lexical augmentation, and we
applied the approach to all the languages. Our technique uses BERT and RoBERTa models to
replace text from the provided sample to construct alternative samples for the positive class
tweets. We used this as additional training input to our transformer neural networks.</p>
      <sec id="sec-1-1">
        <title>1.1. CheckThat! Lab</title>
        <p>
          CLEF CheckThat! is a series of annual challenges to identify the best algorithms for automated
fact-checking. The 2021 Lab focused on social media and news articles. [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] Accenture focused on
Task 1 of this Lab, which required identification if a claim on Twitter was worth fact-checking,
and ranking the claim for how check-worthy the claim was. [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] This challenge focused on
Arabic, Bulgarian, English, Spanish, and Turkish.
        </p>
        <p>
          Accenture’s paper in the 2020 Lab reached 1st place in the English track, and 1st, 2nd, 3rd,
and 4th in the Arabic track. [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. This year, only one submission per team per language was
accepted for final reporting.
        </p>
      </sec>
      <sec id="sec-1-2">
        <title>1.2. Data Augmentation</title>
        <p>
          Data augmentation is considered an important component in Deep Learning workflows [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
These techniques are commonly applied in speech recognition (e.g. insertion of babble), and
computer vision (e.g. image rotation) systems, but are not as commonly applied in natural
language processing workflows due to diferences in resources and techniques based on language
and task. [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]
        </p>
        <p>Augmentation in an NLP context can take many forms. Words can be replaced with synonyms,
antonyms, hypernyms, homonyms, or semantic neighbors. Words can be deleted, or inserted
either randomly or where the lexical insertion best fits a language model. Words can be
misspelled intentionally, either phonetically or at the character level, with a deletion, insertion,
replacement or a swap of character sequence. There are numerous methods for NLP data
augmentation, but none are commonplace.</p>
        <p>
          [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] explored the use of text augmentation at the lexical level on five classification tasks,
including a subjective/objective discrimination task. For each sentence in a training set, the
researchers randomly selected between four operations-random lexical insertion, random
lexical substitution, random lexical deletion, and synonym replacement. They showed that by
applying these random augmentations, they were able to boost accuracy on all five classification
tasks. Further, in an ablation study, the researchers showed that each of the four operations
contributed to accuracy improvements. They noted that their augmentation strategy was
particularly beneficial to smaller datasets. The authors performed their experiments on
LSTMRNN and CNN architectures. We are not aware of any papers describing NLP augmentation as
input to transformer architectures for document classification tasks.
        </p>
        <p>This study uses one of the methods mentioned in the previous paragraph, lexical substitution,
but instead of applying these randomly, we use a contextual embedding model to choose the
most probable operations. We demonstrate this technique with two samples below. Each
invocation of the algorithm could produce a novel alternative sample.</p>
        <p>Original check-worthy tweet:</p>
        <p>The country is panic stricken over the #coronavirus, yet this flu season there
have been 9.7 million flu illnesses, 87,000 hospitalizations and 4800 deaths from
lfu, including 32 pediatric deaths. It’s time to stop the panic and put things into
perspective.</p>
        <p>Random Substitution 1:</p>
        <sec id="sec-1-2-1">
          <title>Random Substitution 2:</title>
          <p>The country is panic tweeting over the #coronavirus, yet this flu season there
have been 9.7 million flu illnesses, 87,000 illnesses, 46 deaths from flu, including 32
pediatric deaths. It’s time you stop the panic and put things into perspective.
The country remains panic stricken over the #coronavirus, yet this flu pand there
are been 9.7 million flu illnesses, 800,000 hospitalizations and 4800 deaths from flu,
including 32 pediatric deaths. It’s time to stop the panic and put things into policy.
Original check-worthy tweet:</p>
          <p>People aren’t surprised when I tell them there are 13,000 Covid-19 cases outside
China, or when I tell them this number doubles every 3 days. But when I tell them
that if growth continues at this rate, we’ll have 1.7 million cases in 3 weeks, they’re
astonished.</p>
          <p>Random Substitution 1:</p>
        </sec>
        <sec id="sec-1-2-2">
          <title>Random Substitution 2</title>
          <p>People aren’t surprised when I tell them there are 100,000 Covid-19 cases outside
Minnesota, or when we tell them this number grows every 3 days. So when I tell
them that if growth continues at this speed, we’ll have 1.7 million cases in 3 weeks,
they’re astonished.</p>
          <p>People aren’t surprised when I tell her there are 13,000 X-19 cases outside China,
than when I tell them this number doubled every 3 days. But when I tell them that
if growth continues at my forecast, we’ll have 1.7 million cases in 3 weeks, they’re
astonished.</p>
          <p>More information on this procedure, including the models used, can be found in Section 4.1</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>2. Exploratory Analysis</title>
      <p>Arabic. The provided training set contains a large number of tweets referencing
consequential political and human conflicts around the “Houthis movement". Notable portions of
the training data also focus on diplomatic disagreements around the Algerian-Qatar relations.
Political issues such as feminism are also discussed. Finally, a smaller set of tweets reference
COVID-19-related political events. The testing set contain mainly the latter two topics while
validation set largely contained the former two. Keywords that define these datasets include,
but not limited to, “Houthis", “Yemen", “Qatar", “Algerian", “feminist", and "Veros Koruna".</p>
      <p>Bulgarian. The training, testing, and validation sets all focus on COVID-19. However, the
tweets covers a rather varied set of topics, including political events, pandemic progression,
and scientific and informational statements about the virus. The most consistent keywords are
amalgamations of the term “COVID-19", including “Koronavirus", “Korona", “Coronavius", and
“Covid".</p>
      <p>Spanish. The conversations in the training, testing and validation sets are about political
issues including: government corruption, unemployment, economic instability, the importance
of education, political elections, and other related topics. Spanish President, Pedro Sanchez,
was named in a large number of tweets. Many tweets in the training set also mention climate
issues, which are rare in the validation and testing sets. Keywords that define these sets are
“President", “Sanchez", “government" and “economy".</p>
      <p>Turkish. The training, testing, and validation set topics are varied but mostly related to
Turkey domestic news, Turkish international afairs, and facts about Turkey as a country or
the Turkish people. The training contains a higher number of tweets covering Turkey’s
national/external debt, claims of mistreatment of children, the Syrian population, unemployment,
and the Turkish economy. Some keywords include “Turkey", “Turkish", “unemployment",
“President", “Erdogan", “presidential election" and “Istanbul".</p>
      <p>English. Tweets from all modeling sets are about COVID-19. The training set contains
many statements and information about COVID-19, global news about COVID-19, and
COVID19-related political decisions and events. The testing and validation set are more politically
oriented with most tweets mentioning a political event. The most frequent keywords include
“corona",“coronavirus" and other amalgamations of the term “COVID-19".</p>
      <sec id="sec-2-1">
        <title>2.1. Label Balance</title>
        <p>All of the datasets provided by the CheckThat! organizers had label bias which skewed each
dataset towards tweets that were not considered check-worthy. The Turkish dataset had the
highest percentage of check-worthy tweets (38%), followed by English (35%), Arabic (22%),
Bulgarian (13%), and Spanish (8%).</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. WordPiece Analysis</title>
        <p>Training</p>
        <p>Testing
Validation
Training</p>
        <p>Testing
Validation
Training</p>
        <p>Testing
Validation
Training</p>
        <p>Testing
Validation
Training</p>
        <p>Testing
Validation
Transformer models utilize WordPiece tokenization schemes that are dependant on the model
being evaluated. At the time of pre-training, the WordPiece algorithm determines which pieces
of words will be retained, and which will be discarded. An UNK token is utilized as a placeholder
in the lexicon, and used to represent WordPiece tokens received in novel input that did not get
utilized at model creation. We expect language samples which have a high amount of tokens
processed as UNK would perform poorly.</p>
        <p>We present our analysis in Table 2. Most notably, Arabic training set contains over 120K
WordPieces, the largest number across all five languages, second by just over 110K for Spanish.
In addition, Arabic training set produced a much lower rate of unknown tokens (0.291%)
compared to Spanish (2.313%). Unexpectedly, the RoBERTa tokenizers we used did not return
UNK tokens on any dataset provided by the CLEF CheckThat! organizers.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Transformer Architectures and Pre-trained Models</title>
      <sec id="sec-3-1">
        <title>3.1. Pre-trained Models</title>
        <p>
          In this work, we utilize BERT and RoBERTa models. The Bidirectional Encoder Representation
Transformer (BERT) is a transformer-based architecture that was introduced in 2018 [
          <xref ref-type="bibr" rid="ref7 ref8">7, 8</xref>
          ].
BERT has had a substantial impact on the field of NLP, and achieved state of the art results on 11
NLP benchmarks at the time of its release. RoBERTa, introduced by [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], modified various parts
of BERTs training process. These modifications include more training data, more pre-training
steps with bigger batches over more data, removing BERT’s Next Sentence Prediction, training
on longer sequences, and dynamically changing the masking pattern applied to the training
data [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ].
        </p>
        <p>For the Arabic Dataset, we used asafaya/arabic-bert-large [10], which was trained on an
Arabic version of OSCAR, an Arabic Wikipedia dump, and other Arabic resources. It contains a
vocabulary of length of 32,000.</p>
        <p>For Turkish and Spanish, we used dbmdz/bert-base-turkish-cased [11] and
geotrend/bertbase-es-cased [12] respectively. The Turkish BERT model contains a vocabulary of length 32,000
and the Turkish model contains a vocabulary of length 26,359.</p>
        <p>For English and for Bulgarian, we used roberta-large [13] and
iarfmoose/roberta-basebulgarian [14] respectively. The English RoBERTa model contains 50,265 WordPieces, and
the Bulgarian RoBERTa model contains 52,000 WordPieces.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Method</title>
      <sec id="sec-4-1">
        <title>4.1. Data Augmentation</title>
        <p>The organizers provided a training and a development set for each language. We created
80/20 stratified splits on each training set to create internal training and validation sets for
experimentation. We used the development set provided by organizers as a hold-out test set.
For each of the internal training datasets, we extracted positive labels and performed contextual
word embedding augmentation on each of the positive labels, one epoch at a time, repeating
until the number of positive labels at each epoch exceeded the number of negative labels.</p>
        <p>For each language, augmentation and training were done with BERT or RoBERTa models.
BERT-based contextual embedding models were used for Arabic [10], Spanish [12], and Turkish
[11], and RoBERTa-based contextual embedding models were used for English [13] and Bulgarian
[14]. We used [15]1 to apply Contextual Word Embedding Augmentation. This augmentation
type uses the surrounding words of a tweet to apply the most probable insertion or substitution
of a lexical item. We chose to only apply substitution.</p>
        <p>With Contextual Word Embedding Augmentation, the user must determine the probability
a token should be augmented. On the Bulgarian and Turkish datasets, we tried using no
augmentation (p = null) and augmentation at p = {0.1, 0.2, 0.3, 0.4, 0.5}. Additionally, we explored
back-translation using AWS translation. We appended back-translated check-worthy tweets to
the training set, using English as a pivot language. In the table below, we show the precision,
recall, and f1 score for check-worthy class on the Bulgarian dataset. The Turkish experiments
yielded similar results. For both languages, we found that augmentations at p = 0.1 resulted in a
significant increase in recall and f1 for check-worthy tweets, as we show in the table below.
Augmentations at higher probability thresh-holds also yielded better recall and f1 than our
null model, but not better than at p = 0.1. We found that augmentation at p=0.1 provided
better precision, recall and f1 than using back-translation (translation). Due to time and cost
limitations, we did not repeat back-translation experiments for other competition languages or
using other pivot languages.</p>
        <p>Based on this exploration (and due to the computational cost of this technique) we adopted p
= 0.1 for all languages.</p>
        <sec id="sec-4-1-1">
          <title>1https://github.com/makcedward/nlpaug</title>
          <p>For each language, BERT- or RoBERTa-augmented check-worthy examples were appended
to the training data and given a check-worthy label. In all languages, we found this improved f1
score for the check-worthy class when applied to our hold-out dev set. However, it’s possible
that this technique limited some models’ performance on the evaluation test set. The table
below displays the number of check-worthy augmented samples that were generated for each
language.</p>
        </sec>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Classification</title>
        <p>
          For both BERT and RoBERTa, we added an additional mean-pooling layer and dropout layer on
top of the model prior to the final classification layer. Adding these additional layers has been
shown to help prevent over-fitting while fine-tuning [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. We used an Adam optimizer with a
learning rate of 1.5e-5 and an epsilon of 1e-8. We use a binary cross-entropy loss function, 2
epochs, and a batch size of 32.
        </p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Ranking</title>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Results</title>
      <p>To generate rankings, the model’s outputs were fed through a SoftMax function. The diference
between the positive and negative class likelihoods were then used to rank tweets.
The oficial metric of the Lab was mAP for all languages. Table 5 lists our results. Arabic
performed the best with 0.658. This was followed by Bulgarian (0.497), Spanish (0.491), Turkish
(0.402), and English (0.101).</p>
      <p>The results from Arabic and English can be compared to Accenture’s results in CheckThat!
2020. Compared to last year, our team’s Arabic score increased and our team’s English score
decreased.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Discussion</title>
      <p>In Section 4.1, we showed that contextual embedding augmentation on top of the current
training data improved the f1 score of our systems. In the Lab ranking, however, we found that
the Accenture received the top results for Arabic, and performed less well for other languages.
Table 6 shows our mean average precision versus the number of training samples provided by
the CheckThat! organizers.</p>
      <p>We believe the transformer methods we employed to be highly sensitive to the quantity of
training data and distribution of topics across the split dataset. While we were able to generate
additional training data, and improve the results, we believe even more augmentation should
be employed where natural labeled text cannot be acquired.</p>
      <p>Back translation, which we employed last year, worked well for this problem. We employed
it only on Arabic, but expect the technique would work well for the other languages in the
Lab as well. We used Contextual Word Embedding Augmentation, this year, but limited our
transformations to swaps. Lexical insertion may show to be useful as well. Synonyms and
hypernym replacement would likely show advantage.</p>
      <p>Because of the computational cost of augmenting the data with contextual embedding
augmentation, we chose p = 0.1 for all languages. The optimal value is likely to be language and
task dependant. We would recommend a parameter search of this value.</p>
    </sec>
    <sec id="sec-7">
      <title>7. Conclusion</title>
      <p>This paper presents results from the Accenture Team for CLEF2021 CheckThat! Lab, Task 1, to
analyze English, Arabic, Spanish, Turkish, and Bulgarian social media to identify claims that
require fact-checking. We presented a methodology that provided NLP augmentation of the
training data to create additional synthetic training samples. We found this method improved
our results. This approach received the highest mean average precision in the Lab this year for
Arabic.
[10] A. Safaya, M. Abdullatif, D. Yuret, KUISAIL at SemEval-2020 task 12: BERT-CNN for
ofensive speech identification in social media, in: Proceedings of the Fourteenth Workshop
on Semantic Evaluation, International Committee for Computational Linguistics, Barcelona
(online), 2020, pp. 2054–2059. URL: https://www.aclweb.org/anthology/2020.semeval-1.271.
[11] S. Schweter, Berturk - bert models for turkish, 2020. URL: https://doi.org/10.5281/zenodo.</p>
      <p>3770924. doi:10.5281/zenodo.3770924.
[12] A. Abdaoui, C. Pradel, G. Sigel, Load what you need: Smaller versions of mutlilingual bert,
in: SustaiNLP / EMNLP, 2020.
[13] Y. Liu, M. Ott, N. Goyal, J. Du, M. Joshi, D. Chen, O. Levy, M. Lewis, L. Zettlemoyer, V.
Stoyanov, RoBERTa: A robustly optimized BERT pretraining approach, CoRR abs/1907.11692
(2019). URL: http://arxiv.org/abs/1907.11692. arXiv:1907.11692.
[14] A. Montgomerie, Token classification with subword tokenizers for bulgarian,
https://amontgomerie.github.io/2020/09/02/token-classification-bg.html, 2020.
[15] E. Ma, NLP augmentation, https://github.com/makcedward/nlpaug, 2019.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>S.</given-names>
            <surname>Dumais</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Platt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Heckerman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sahami</surname>
          </string-name>
          ,
          <article-title>Inductive learning algorithms and representations for text categorization</article-title>
          ,
          <source>in: Proceedings of the seventh international conference on Information and knowledge management</source>
          ,
          <year>1998</year>
          , pp.
          <fpage>148</fpage>
          -
          <lpage>155</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>E. M.</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: Posthoc fact-checking of claims using transformer-based models</article-title>
          , in: L.
          <string-name>
            <surname>Cappellato</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Eickhof</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Ferro</surname>
            ,
            <given-names>A</given-names>
          </string-name>
          . Névéol (Eds.), Working Notes of CLEF 2020 -
          <article-title>Conference and Labs of the Evaluation Forum</article-title>
          , Thessaloniki, Greece,
          <source>September 22-25</source>
          ,
          <year>2020</year>
          , volume
          <volume>2696</volume>
          <source>of CEUR Workshop Proceedings, CEUR-WS.org</source>
          ,
          <year>2020</year>
          . URL: http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2696</volume>
          /paper_226. pdf.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>P.</given-names>
            <surname>Nakov</surname>
          </string-name>
          , G. Da San Martino, T. Elsayed,
          <string-name>
            <given-names>A.</given-names>
            <surname>Barrón-Cedeño</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Míguez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Shaar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Alam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Haouari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hasanain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Mansour</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Hamdan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z. S.</given-names>
            <surname>Ali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Babulkov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Nikolov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. K.</given-names>
            <surname>Shahi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Struß</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Mandl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kutlu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y. S.</given-names>
            <surname>Kartal</surname>
          </string-name>
          ,
          <article-title>Overview of the CLEF-2021 CheckThat! lab on detecting check-worthy claims, previously fact-checked claims, and fake news</article-title>
          ,
          <source>in: Proceedings of the 12th International Conference of the CLEF Association: Information Access Evaluation Meets Multiliguality</source>
          , Multimodality, and Visualization, CLEF '
          <year>2021</year>
          , Bucharest, Romania (online),
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S.</given-names>
            <surname>Shaar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hasanain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Hamdan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z. S.</given-names>
            <surname>Ali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Haouari</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. K. Alex Nikolov</surname>
            ,
            <given-names>F. A.</given-names>
          </string-name>
          <string-name>
            <surname>Yavuz Selim Kartal</surname>
          </string-name>
          , G. Da San Martino, A.
          <string-name>
            <surname>Barrón-Cedeño</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Míguez</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Elsayed</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Nakov</surname>
          </string-name>
          ,
          <article-title>Overview of the CLEF-2021 CheckThat! lab task 1 on check-worthiness estimation in tweets and political debates</article-title>
          , in: Working Notes of CLEF 2021-
          <article-title>Conference and Labs of the Evaluation Forum</article-title>
          , CLEF '
          <year>2021</year>
          , Bucharest, Romania (online),
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M.</given-names>
            <surname>Raghu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Schmidt</surname>
          </string-name>
          ,
          <article-title>A survey of deep learning for scientific discovery</article-title>
          ,
          <year>2020</year>
          . arXiv:
          <year>2003</year>
          .11755.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Zou</surname>
          </string-name>
          , EDA:
          <article-title>Easy data augmentation techniques for boosting performance on text classification tasks</article-title>
          ,
          <source>in: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)</source>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Hong Kong, China,
          <year>2019</year>
          , pp.
          <fpage>6382</fpage>
          -
          <lpage>6388</lpage>
          . URL: https://www.aclweb.org/anthology/D19-1670. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>D19</fpage>
          -1670.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <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>
          , arXiv preprint arXiv:
          <year>1810</year>
          .
          <volume>04805</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>I.</given-names>
            <surname>Turc</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>
          ,
          <article-title>Well-read students learn better: On the importance of pre-training compact models</article-title>
          ,
          <year>2019</year>
          . arXiv:
          <year>1908</year>
          .08962.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <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>
          , CoRR abs/
          <year>1907</year>
          .11692 (
          <year>2019</year>
          ). URL: http://arxiv.org/abs/
          <year>1907</year>
          .11692. arXiv:
          <year>1907</year>
          .11692.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>