<!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>An Information Retrieval System for FIRE 2016 Microblog Track</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Trishnendu Ghorai</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of CST IIEST</institution>
          ,
          <addr-line>Shibpur</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper describes our approaches to FIRE (Forum for Information Retrieval Evaluation) 2016 Microblog track. The main aim of this track was to develop an information retrieval system that can identify relevant tweets posted during a disaster event. The relevance is measured with respect to some predefined topics provide by the track organizers. In this working note we have given the description of the system which has taken part in this year's FIRE track as well as has analysed the performance of the system. FIRE; information retrieval; tweet; relevancy;</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 INTRODUCTION</title>
      <p>
        User written informal microblogs, like tweets, are quite important
and a big source of real time information. As this microblogs are
quite informal and doesn’t obey standard vocabulary, thus special
information retrieval system and recommendation systems are
needed to retrieve information from this microblogs. To boost the
retrieval performance of information retrieval system FIRE has
introduced this track this year [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. In this task the participant IR
systems have to find relevant tweets from a set of tweets posted
during the recent disaster time. The initial dataset consists of
around 50,000 tweets from twitter that were posted in a recent
Nepal earthquake. The relevancy of the tweet is measured with
respect to topics, which will identify different resources that are
available or required during the disaster time. The organizers
provide a set of seven topics in the standard TREC format. The
main challenge of the task is to tackle the nosiness of the tweets
and at the same time find most relevant tweets. To deal with the
problem of noise we have applied a preprocessing phase on tweets
which will remove all noisy data from the tweets. The tweets are
converted to a bag of words to ease up the scoring process. To
calculate relevance, we have developed two different scoring and
raking methods. The topics are optimized by constructing new
queries based on the previous topics.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2 SYSTEM OVERVIEW</title>
      <p>In this section we have described the system architecture for the
data challenge. The system consists of tweet preprocessing, query
generation, scoring of tweets and result analysis.
1)
2)
3)
4)
1)
2)
3)
5)</p>
      <p>Punctuation removal – Punctuations are removed from
each tweet. We have not given any extra importance to
hash tags, all ‘#’ symbols are also removed.</p>
      <p>Case folding – All the capital letters in the tweets are
converted to small letters
Stop word removal – All commonly used English words
which do not have much significance on the subject
matter of the tweet but are used only for semantic reasons
are removed. A list of top most frequently used words
(around 500 words) are used as stop word list. And from
the tweet the words that are present in the stop word list
are removed.</p>
      <p>Non ASCII character – In addition, we have removed all
non ASCII characters which come to tweet due to the use
of emoticons and other symbol
Constructing bag of word – Each tweet is then splited
into words and are converted to a set of words. Each set
represents the collection of the distinct word that are
present in the tweet. Each bag of word is identified by the
tweet id of the tweet which is unique to the tweet and can
be used to track it in next steps.</p>
    </sec>
    <sec id="sec-3">
      <title>2.1 Brief Overview</title>
      <p>In this task, a set of previously collected tweets (more specifically
tweet ids) on Nepal Earthquake 2015 was provided. And
alongside 7 queries were given in the traditional TREC format (an
XML like format). The goal of this task was to find most relevant
tweets from the set of tweets based on the queries.</p>
      <p>Our system has mainly four components as follows,</p>
      <p>Tweet Preprocessing – As tweets are informally written,
tweets generally contain a lot of noise and unnecessary
data. For this reason, in preprocessing stage data filters are
applied on the tweets to get rid of the unwanted data.</p>
      <p>Query Construction – The topics are provided have three
parts, namely tittle, narration and description. To get more
relevant tweets, a new set of queries is constructed from
this given topic.</p>
      <p>Scoring of tweets – Once the queries are constructed each
tweet are scored based on each query. Two different
approaches have been used in scoring the tweets.</p>
      <p>Final filtering – When each tweet gets a score against
each topic, a heuristic threshold has been set to get good
quality tweets.</p>
    </sec>
    <sec id="sec-4">
      <title>2.2 Tweet Preprocessing</title>
      <p>The following steps have been taken to preprocess the tweet text.
2)</p>
    </sec>
    <sec id="sec-5">
      <title>2.3 Query Construction</title>
      <p>Topics are made of three fields, namely the title, description and
narratives. Titles contain several three or four keys, while
descriptions are one-sentence long statements of the users’
information needs; narratives are paragraph-length descriptions of
the tweets that the users want to receive and are the long
description. Each topic is assigned one topic id which can be used
to uniquely specify one topic in submission stage. Query
construction part consists of two different phases described as
follows:
1)</p>
      <p>
        Keyword Extraction – As nouns in a sentence holds most
of the information, we choose nouns in the topics as the
keywords for the query. We have used Stanford
Part-OfSpeech Tagger[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] to label different parts-of-speech first
and then collected words which have been identified as
Noun.
      </p>
      <p>Giving weight to keywords – As all the topics can be
broadly classified into two groups based on if it wants to
retrieve tweets on ‘availability’ or ‘requirement’. For this
reason, the words like ‘availability’ or ‘requirement’ have
been assigned more weight than the other key words in the
topics.</p>
      <p>Each query can be expressed as a set of keywords where each
keyword is assigned a definite weight and each query is assigned
the topic ids to identify each query in later stage.</p>
    </sec>
    <sec id="sec-6">
      <title>2.4 Scoring</title>
      <p>After construction of queries, each bag of words corresponding to
each tweet is assigned a score with respect to a query. We have
used two different scoring techniques for two separate runs.</p>
    </sec>
    <sec id="sec-7">
      <title>Method–1: Co-occurrence based Similarity</title>
      <p>
        This method is based on co-occurrence based similarity measure
[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. This method tries to find out how many words from the query
have also occurred in the tweet and scored the tweet based on that.
For a given tweet T = {t 1, t2 , ..., t n } and a given query Q = {q1,
q2 , ..., qn } the score of the tweet is calculated as follows:
      </p>
      <p>Score (T , Q) = | intersection of T ,Q | / | Q | , where | Q |
denotes number of elements in set Q.</p>
      <p>That is this score measure the fractions of common words in a
tweet and a query. The higher the fraction, higher the probability
that the tweet is relevant to the query.</p>
    </sec>
    <sec id="sec-8">
      <title>Method–2: WordNet</title>
    </sec>
    <sec id="sec-9">
      <title>Similarity</title>
      <p>
        The previous method is generally based on the co-occurrence
similarity which does not concern about the meaning wise
similarity of two words. This problem can be solved by
WordNet[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] based approach. WordNet is a lexical database of
English. Each word in WordNet has a set of cognitive synonyms
called synsets. Two find the similarity between two words we can
calculate the similarity between two synsets.
      </p>
      <p>For a given tweet T = {t1, t2 , ..., tn } and a given query Q = {q1,
q2 , ..., qn } the score of the tweet is calculated as follows:
based</p>
    </sec>
    <sec id="sec-10">
      <title>Semantic</title>
      <p>1)</p>
      <p>For each t i and q j we have first found the synsets of two
words say S1 and S2 respectively. Now for each term in
S1 and each term in S2 we have calculated wup
2)
3)
similarity.1 After this all wup score is added up and
normalized. This normalized score denotes the similarity
value between t i and q j
We iterate through all the terms in tweets and queries and
summed up all the similarity score of each pairs and
normalize it.</p>
      <p>This normalize score is the final score of the tweet respect
to that particular query.</p>
    </sec>
    <sec id="sec-11">
      <title>2.5 Final Filtering</title>
      <p>After scoring the tweets according to relevance to each
topic, we need to choose most relevant tweets for a given
topic. For this reason, we have taken a heuristically set
threshold based filtering method to choose most relevant
tweets. The threshold has been set to 0.25. That is the
tweets which have a score greater than 0.25 are considered
as relevant and are submitted. All other tweets have been
discarded.
3</p>
    </sec>
    <sec id="sec-12">
      <title>RESULT ANALYSIS</title>
      <sec id="sec-12-1">
        <title>Overall MAP 0.0203 0.0099</title>
      </sec>
      <sec id="sec-12-2">
        <title>Table-1</title>
        <p>As it can be clearly seen from the result, though the second
method uses a more deep similarity measure than the first
approach the first approach performs better than the second one.
The most probable reason for this is due to lack of grammar and
spelling wise correctness of tweets. Most of the tweets are
informally written microblogs, so using a standard English
dictionary based filters and standard semantics based methods are
not practically that much effective. While much simpler
cooccurrence based similarity measure outperforms it on the basis of
performance and running time and cost.
4</p>
      </sec>
    </sec>
    <sec id="sec-13">
      <title>CONCLUSION</title>
      <p>In this working note, we have presented a brief discussion on our
approach to FIRE 2016 microblog task. We have observed that
traditional dictionary and vocabulary based filtering techniques
are very inefficient for informally written documents like tweets.
The relatively simpler co-occurrence based methods suits well for
future work that also includes finding new filtering techniques and
parameters to tackle such informally written documents like
tweets.
1http://search.cpan.org/dist/WordNet-Similarity/lib/WordNet/Similarity/wup.pm</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>[1] http://nlp.stanford.edu/software/tagger.shtml.</mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Ekkachai</given-names>
            <surname>Naenudorn Suphakit Niwattanakul</surname>
          </string-name>
          , Jatsada Singthongchai and
          <string-name>
            <given-names>Supachanun</given-names>
            <surname>Wanapu</surname>
          </string-name>
          .
          <article-title>Using of jaccard coefficient for keywords similarity</article-title>
          . volume
          <volume>1</volume>
          , pages
          <fpage>380</fpage>
          -
          <lpage>384</lpage>
          ,
          <string-name>
            <given-names>Hong</given-names>
            <surname>Kong</surname>
          </string-name>
          ,
          <year>2013</year>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>[3] https://wordnet.princeton.edu/</mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S.</given-names>
            <surname>Ghosh</surname>
          </string-name>
          and
          <string-name>
            <given-names>K.</given-names>
            <surname>Ghosh</surname>
          </string-name>
          .
          <article-title>Overview of the FIRE 2016 Microblog track: Information Extraction from Microblogs Posted during Disasters</article-title>
          .
          <source>In Working notes of FIRE 2016 - Forum for Information Retrieval Evaluation</source>
          , Kolkata, India, December 7-
          <issue>10</issue>
          ,
          <year>2016</year>
          ,
          <string-name>
            <given-names>CEUR</given-names>
            <surname>Workshop</surname>
          </string-name>
          <article-title>Proceedings</article-title>
          . CEUR-WS.org,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>