<!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>TIET at CLEF CheckThat! 2020: Veri ed Claim Retrieval</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Utsav Shukla</string-name>
          <email>ushukla_be17@thapar.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Aayushmaan Sharma</string-name>
          <email>aaayushmaan_be17@thapar.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Thapar Institute of Engineering and Technology</institution>
          ,
          <country country="IN">India</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Internet is the all-singing, all-dancing, multi-pronged tool of modern man, but, for its many bene ts it also presents us with daunting challenges. The user is bombarded with tons of information and it is becoming increasingly di cult to tell fact from ction. Consequently, over the past few years research work has intensi ed in this regard to better equip the user against false information and indoctrination. In this paper, we propose a system for automatic retrieval of supporting claims given an input claim. Our system uses elasticsearch along with a transformer model to generate a similarity score in two steps. We have submitted our system to CLEF-2020 Check That! Lab's Task-2: Claim Retrieval and our primary evaluations gave promising results which we will present, analyse and improve henceforth in the paper.</p>
      </abstract>
      <kwd-group>
        <kwd>Fact checking</kwd>
        <kwd>Information Retrieval</kwd>
        <kwd>Natural Language Processing</kwd>
        <kwd>Claim Retrieval</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The internet has come a really long way in the past couple of decades in terms
of acceptability and reach. And with easy accessibility to low-cost internet, and
wide-appeal of social media services like Twitter, there is an overabundance of
unveri ed information online. Now, this glaring lack of factual validation
combined with the lucrative carte blanche that the internet allows, has given way to
the taxing problem of gross misinformation and disregard for factual correctness.
Needless to say, this has been a green pasture for feckless rumour-mongers and
ill-intentioned propagandists. So, now more than ever, there is an exigent demand
for automatic fact checking to safeguard internet users from misinformation and
indoctrination. To that end, multiple investigative-journalistic fact-checking
organisations like Snopes, IFCN, Full Fact etc. have emerged. But, manual fact
checking is a very demanding and slow process that can take one full day to
research and write about a claim [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>
        Looking at these problems faced in manual fact checking, automated fact
checking can be very advantageous to fully automate or assist the existing
pipelines. There has been a signi cant amount of work in the eld of automated
fact checking in recent years. Various tasks have been formulated related to or
that come under automated fact checking [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. There are some research works
that use external knowledge sources too (Web in this case) for a fully automated
fact checking pipeline [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. A very similar methodology that aims at retrieving
already fact checked claims was proposed in a very recent work [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. To contribute
to the ongoing research in this regard, we, team Trueman from TIET, decided
to participate in the CLEF Check That! Lab's Task-2: Claim Retrieval [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <p>
        In this paper, we focus on one of the key components of a fact-checking
pipeline, that is, claim retrieval. The principles governing our approach are
simplicity, directness and scalability. Our system uses elastic search along with
transformer model similarity between the tweet and claim to generate a score in two
steps : exact matching of words using BM25 and then, an NLP-based model to
check for semantic similarities [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. The initial evaluation results were good with
the primary task being : fact checking of tweets by nding related, corroborating
claims in the corpus given for the task. However, to improve accuracy we
undertook manual analysis of faulty results and subsequently designed a suitable
experiment to make an attempt to troubleshoot the problems faced. Code for
our experiments and our results le can be found here1.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Methodology</title>
      <p>We propose an unsupervised system for the task. Our submitted system uses
elastic search BM25 score along with cosine similarity between two text pieces'
BERT encodings. Figure 1 shows the working of our submitted system.
1https://github.com/us241098/checkthat2020_submission
Firstly, all veri ed claims are indexed in elasticsearch. Ideally some preprocessing
like removing URLs, hashtags and @ sign should be performed before indexing,
but we skip this step as veri ed claims in the corpus are mostly free of these.
Creating this index ensures quick retrieval of related articles at the time of query.
At the time of query, we retrieve top 1000 matching claims for the query/tweet
along with their BM25 scores. BM scores are dependent on the exact match
between the words of claim and tweet and are assigned to every claim-tweet
pair. However, our initial experiments have shown that using just these scores
for ranking claims give underwhelming results, hence, we use transformer-based
similarity in our next step and update ranks after adding the scores assigned by
it.
Since BM25 similarity relies on exact word match between the text pieces, it fails
to capture the semantic similarity between claims and tweets. To compensate
for this, we have used a BERT ne-tuned on NLI data to generate encodings for
our text piece, we get the similarity between two encodings by computing cosine
distance between them. Based on the similarity we update the scores from BM25
and subsequently update the ranks. In our system's implementation we have used
the sentence transformer python package and bert base nli mean tokens model.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Results and Improvements</title>
      <p>In this section, results of our submission to Task 2 will be discussed and compared
to the best performing system. In the subsequent subsection, we will discuss the
cases where our system performs poorly and attempt to improve our submitted
system. Table 1 shows our system's result, metrics on which systems were
evaluated were MAP@1, 3, 5, all, Precision@1, 3, 5 and Reciprocal Rank@1, 3, 5.
Systems were ranked on the basis of performance on MAP@5. Our submission
was ranked 6th among 9 participants.
@1 @3 @5 - @1 @3 @5 @1 @3 @5
Buster.AI(1st) 0.897 0.926 0.929 0.929 0.895 0.32 0.195 0.895 0.923 0.927
trueman(6th) 0.743 0.768 0.773 0.782 0.74 0.267 0.164 0.74 0.766 0.771
trueman (unsubmitted) 0.757 0.797 0.80 0.808 0.759 0.283 0.173 0.759 0.798 0.802
3.1</p>
      <sec id="sec-3-1">
        <title>Analysis</title>
        <p>We manually analysed our results and found that our system made errors in the
following cases:</p>
        <p>Proper Noun Overlap: We observed that our system sometimes fails and
returns claims that do not have the same proper nouns as the query and
sometimes lets some proper nouns slip by. Table 2 shows some examples of the faulty
results vis-a-vis proper noun overlap.
Good to see the Nish- Video shows an amaz- The comedian and actor
ioka shot being replayed ing behind-the-back re- Tim Allen wrote a lengthy
again and again. . . that's turn by Japanese tennis Facebook post that
atwhat we should be talking player Yoshihito Nishioka. tacked liberals and
Demoabout. . . @MikeCTennis (10082) cratic politicians and was
(1051) shared widely in August
2019. (9254)</p>
        <p>Hyperlinks: We found that in many cases, the textual information in a
tweet is very vague and crucial information regarding the tweet is contained in a
hyperlink. So, to solve this problem we sought to extract article titles from the
hyperlinks. Some erroneous results dealing with hyperlinks are shown in Table
3.</p>
        <p>Hashtags (#) and At (@) sign: Upon analysis, we found out that our
system was having major trouble if crucial proper nouns were contained inside
a hashtag or at (@) sign. Some sample tweets showcasing this problem are
tabularised below in Table 4.
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Improvements to our submitted system:</title>
        <p>Learning from the above analysis we have added a new module to our
submitted system that takes removal of special symbols and noun overlap into account
and accordingly updates the similarity scores. Since more often than not
people put crucial (for retrieval purposes) information inside hashtags and at signs,
A spill by the Environ- A new study reporting
mental Protection Agency on the 2015 death of a
rendered the normally Colorado infant claims the
pristine blue Animas River event was the world's rst
a terrifying mustard yel- documented pot overdose.
low. (2558) (1838)
There are small islands
of re ants oating in the</p>
        <p>oodwaters from Tropical
Storm Harvey. (716)</p>
        <p>Actor Kurt Russell said
that he has never seen
a man as dedicated and
determined as President</p>
        <p>
          Trump. (3125)
in our improved system we separated the words contained in these signs
using regular expressions and prioritised them when checking for overlaps. Ideally,
overlap of all proper nouns should be prioritised and to that end we added a
module to reward proper noun overlaps. We calculate the overlap using
Levenshtein distance [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ].The more overlapped proper nouns in tweet and claim, the
higher scores reward. Table 1 shows performance of our improved system
trueman(unsubmitted), we can see our new system performs slightly better than our
submitted system on all evaluation metrics.
4
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusion and future work</title>
      <p>In this paper we proposed a system for retrieval of veri ed claims given a query
and submitted our results presented our results at CLEF-2020 Check That Lab!'s
Claim Retrieval task. We strove to resolve some of the issues that our system
faced initially by annotating and analysing faulty results, and managed to
improve our performance. Yet, we strongly believe that there is a margin for future
work to resolve some existing problems and to broaden the model's knowledge
source in order to achieve practical application. The problem that the model
was facing in regard to hyperlinks still needs some work in order to achieve full
resolution. Since most of the links shared were from news or media websites,
we think that title and byline retrieval from the hyperlinks will improve the
system's performance considerably. Also, inculcating Image modality to analyse
tweets with pictures merits future work in this regard. For the sake of this
research, we considered fact-checking websites as a knowledge source in order to
validate claims. We aspire to do the same and regard fact-checking and
investigative journalism websites as a knowledge source but in an Indian context. This
approach will improve our model's contextual sensibility and improve chances
of identifying factual incorrectness and misinformation signi cantly. We believe
that these approaches are good enough to merit signi cant future works and
further research.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Naeemul</given-names>
            <surname>Hassan</surname>
          </string-name>
          et al. \
          <article-title>The quest to automate fact-checking"</article-title>
          .
          <source>In: Proceedings of the 2015 Computation+ Journalism Symposium</source>
          .
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>James</given-names>
            <surname>Thorne</surname>
          </string-name>
          and
          <string-name>
            <given-names>Andreas</given-names>
            <surname>Vlachos</surname>
          </string-name>
          . \
          <source>Automated Fact Checking: Task Formulations</source>
          ,
          <article-title>Methods and Future Directions"</article-title>
          .
          <source>In: Proceedings of the 27th International Conference on Computational Linguistics. Santa Fe</source>
          , New Mexico, USA: Association for Computational Linguistics, Aug.
          <year>2018</year>
          , pp.
          <volume>3346</volume>
          {
          <fpage>3359</fpage>
          . url: https://www.aclweb.org/anthology/C18-1283.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Georgi</given-names>
            <surname>Karadzhov</surname>
          </string-name>
          et al. \
          <article-title>Fully Automated Fact Checking Using External Sources"</article-title>
          .
          <source>In: Proceedings of the International Conference Recent Advances in Natural Language Processing</source>
          ,
          <string-name>
            <surname>RANLP</surname>
          </string-name>
          <year>2017</year>
          . Varna, Bulgaria: INCOMA Ltd.,
          <string-name>
            <surname>Sept</surname>
          </string-name>
          .
          <year>2017</year>
          , pp.
          <volume>344</volume>
          {
          <fpage>353</fpage>
          . doi:
          <volume>10</volume>
          .26615/
          <fpage>978</fpage>
          -954-452-049-6_
          <fpage>046</fpage>
          . url: https://doi.org/10.26615/
          <fpage>978</fpage>
          -954-452-049-6_
          <fpage>046</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Shaden</given-names>
            <surname>Shaar</surname>
          </string-name>
          et al. \
          <article-title>That is a Known Lie: Detecting Previously FactChecked Claims"</article-title>
          . In:
          <article-title>Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics</article-title>
          . Online:
          <article-title>Association for Computational Linguistics</article-title>
          ,
          <year>July 2020</year>
          , pp.
          <volume>3607</volume>
          {
          <fpage>3618</fpage>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2020</year>
          .acl-main.
          <volume>332</volume>
          . url: https://www.aclweb.org/anthology/2020.acl-main.
          <volume>332</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Alberto</given-names>
            <surname>Barron-Cedeno</surname>
          </string-name>
          et al. Overview of CheckThat! 2020:
          <article-title>Automatic Identi cation and Veri cation of Claims in Social Media</article-title>
          .
          <year>2020</year>
          . arXiv:
          <year>2007</year>
          .
          <article-title>07997 [cs</article-title>
          .CL].
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Shaden</given-names>
            <surname>Shaar</surname>
          </string-name>
          et al. \
          <article-title>Overview of CheckThat! 2020 English: Automatic Identi cation and Veri cation of Claims in Social Media"</article-title>
          . In:
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Stephen</given-names>
            <surname>Robertson</surname>
          </string-name>
          and
          <string-name>
            <given-names>Hugo</given-names>
            <surname>Zaragoza</surname>
          </string-name>
          . \
          <article-title>The Probabilistic Relevance Framework: BM25 and Beyond"</article-title>
          .
          <source>In: Foundations and Trends in Information Retrieval</source>
          <volume>3</volume>
          (
          <issue>Jan</issue>
          .
          <year>2009</year>
          ), pp.
          <volume>333</volume>
          {
          <fpage>389</fpage>
          . doi:
          <volume>10</volume>
          .1561/1500000019.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>L.</given-names>
            <surname>Yujian</surname>
          </string-name>
          and
          <string-name>
            <given-names>L.</given-names>
            <surname>Bo</surname>
          </string-name>
          . \
          <string-name>
            <given-names>A Normalized</given-names>
            <surname>Levenshtein Distance Metric</surname>
          </string-name>
          <article-title>"</article-title>
          .
          <source>In: IEEE Transactions on Pattern Analysis and Machine Intelligence</source>
          <volume>29</volume>
          .6 (
          <issue>2007</issue>
          ), pp.
          <volume>1091</volume>
          {
          <fpage>1095</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>