<!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>LIA/LINA at the INEX 2012 Tweet Contextualization track</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Romain Deveaud</string-name>
          <email>romain.deveaud@univ-avignon.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Florian Boudin</string-name>
          <email>florian.boudin@univ-nantes.fr</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>LIA - University of Avignon</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>LINA - University of Nantes</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this paper we describe our participation in the INEX 2012 Tweet Contextualization track and present our contributions. We combined Information Retrieval, Automatic Summarization and Topic Modeling techniques to provide the context of each tweet. We rst formulate a speci c query using hashtags and important words in the Tweets to retrieve the most relevant Wikipedia articles. Then, we segment the articles into sentences and compute several measures for each sentence, in order to estimate their contextual relevance to the topics expressed by the Tweets. Finally, the best scored sentences are used to form the context. O cial results suggest that our methods performed very well compared to other participants.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>The INEX Tweet Contextualization tracks aims at providing a small bunch of
text (less than 500 words) that gives insights or additional information about
a given tweet. For example, when reading a tweet about Whitney Houston's
funerals, the user might want to know who is this person, why is she famous and
so on... One of the strict constraint was to extract this context from a Wikipedia
collection provided by the organizers, so there were several challenges to tackle.</p>
      <p>First, it was very important to retrieve relevant and important Wikipedia
articles that were related to the Tweets, and that were likely to provide some
useful context. Second, considering the word limit of the contexts, only very
little parts of these articles had to be kept. For this purpose we segmented
the top-ranked articles into sentences and used several measures to score them.
These measures range from classic word overlap or cosine similarity to conceptual
similarity using topic models.</p>
      <p>The rest of the paper is organized as follows. Section 2 describes the process
we followed to extract candidate sentences, which includes Tweet formatting and
document retrieval on Wikipedia. Then, we describe in Section 3 the various
sentence scoring methods we used in this work.</p>
    </sec>
    <sec id="sec-2">
      <title>Candidate Sentence Extraction</title>
      <p>Considering that the task is to provide context from Wikipedia text, one crucial
step was to retrieve Wikipedia articles that are highly relevant to the Tweet.
Hopefully, relevant articles contain important sentences that give lots of
contextual information.
2.1</p>
      <p>#HashtagSplitting and Tweet formatting
Hashtags in Tweets are very important pieces of information, since they are tags
that were generated by the user. Making a parallel with TREC-like topics, we
can view the hashtags as the title while the Tweet itself is the description.</p>
      <p>
        However the main problem with hashtags is that they often are composed
of several words concatenated together (e.g. #WhitneyHouston). We used an
algorithm based on Peter Novig's chapter on \Natural Language Corpus Data"
in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] to split the hashtags. For each Tweet, all the hashtags we converted into
a short keyword query.
      </p>
      <p>We also removed all the retweet mentions (RT), user mentions (@somebody)
and stopwords (based on the standard INQUERY stoplist) from the Tweets. The
nal output of this Tweet formatting process is a clean Tweet without stopwords
or useless mentions, as well as a very short and user-generated representation of
this Tweet.
2.2</p>
      <p>
        Retrieving Wikipedia articles
Retrieving relevant Wikipedia articles is the rst crucial part for nding
contextually relevant sentences. For this purpose we use the well-known Markov
Random Field model [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] to represent dependencies between query words. It has
indeed performed consistently well on several variety of ad-hoc search tasks
across the years.
      </p>
      <p>Given an initial Tweet T , the output of the method described in the previous
section is a set of hashtags HT and a set of terms QT . We then score Wikipedia
articles D according to the following function:</p>
      <p>s(HT ; QT ; D) = scoreMRF (HT ; D) + (1 )scoreMRF (QT ; D)
where is a free smoothing parameter which was empirically set to 0:8 for all our
experiments. We used the Sequential Dependance Model instantiation of MRF,
which is de ned as follows:
scoreMRF (Q; D) =</p>
      <p>T</p>
      <p>X fT (q; D)
+ O
+ U
q2Q
jQj 1
X fO(qi; qi+1; D)
i=1
jQj 1
X fU (qi; qi+1; D)
where the features weights are set according to the author's recommendation
( T = 0:85, O = 0:1, U = 0:05). fT , fO and fU are the log maximum likelihood
estimates of query terms in document D, computed over the target collection
with a Dirichlet smoothing ( = 2500).</p>
      <p>From the ranked list of Wikipedia articles, we only consider the 5 top articles
as relevant. The underlying assumption is that a Tweet may discuss only a very
limited amount of topics, due to the 140 characters limit. Since encyclopedic
topics are very well delimited between Wikipedia articles, we thought 5 articles
would treat roughly 4-5 to 10 di erent topics.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Sentence scoring</title>
      <p>After selecting the 5 best ranked Wikipedia articles with respect to a Tweet
T , the next step is sentence segmentation. Each article is split into sentences
which are the context candidates. We describe in this section the various scoring
methods we used to estimate their importance with respect to the Tweet context.
3.1</p>
      <p>
        Automatic summarization
First, we used some NLP scores that are widely used in the eld of automatic
summarization. For each candidate sentence S we computed:
{ the word overlap between S and QT , and between S and HT ,
{ the cosine similarity between S and QT , and between S and HT ,
{ the TextRank [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] score of S in the context of the article from which it belongs.
3.2
      </p>
      <p>Conceptual similarity
We the conceptual similarity measure, we wanted to estimate at which point a
candidate sentence is close to a thematic or a topic that may be related to the
Tweet. We used two sources from which we extracted the concepts: Wikipedia
and the Web.</p>
      <p>
        The Wikipedia source is a dump from July 2011 of the online
encyclopedia that contains 3,214,014 documents1. For the Web source, we removed the
spammed documents from the category B of the ClueWeb09 according to a
standard list of spams for this collection2. We followed authors recommendations [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]
and set the "spamminess" threshold parameter to 70. The resulting corpus is
composed of 29,038,220 web pages.
      </p>
      <p>
        We model the concepts using Latent Dirichlet Allocation [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], a generative
probabilistic topic model. We want to model topics that are highly related to
the Tweet, hence we perform LDA on the top-ranked Wikipedia or Web
documents originally retrieved using the scoring function de ned in 2.2. The
documents of the collection are modeled as mixtures over K topics each of which
1 http://dumps.wikimedia.org/enwiki/20110722/
2 http://plg.uwaterloo.ca/~gvcormac/clueweb09spam/
is a multinomial distribution over the vocabulary W . Each topic multinomial
distribution k is generated by a conjugate Dirichlet prior with parameter ,
while each document multinomial distribution d is generated by a conjugate
Dirichlet prior with parameter . Thus, the topic proportions for document d
are d, and the word distributions for topic k are k. In other words, d;k is the
probability of topic k occurring in document d (i.e. P (kjd)). Respectively, k;w
is the probability of word w belonging to topic k (i.e. P (wjk)).
      </p>
      <p>In our sense, a concept is a topic generated by LDA from these top-ranked
and supposedly highly relevant documents. Given a sentence S, a Tweet T and
the learned topics KT , the conceptual score of S is given by:
(S) =
1</p>
      <p>X
jKT j k2KT</p>
      <p>X P (kjd)P (djT ) X p(wjk) log
d w2W</p>
      <p>N !
dfw
where N is the total number of documents in the collection, and dfw is the
document frequency of w.
3.3</p>
      <p>Tweeted URLs as context
A large part of the Tweets of the collection come along with an URL. This URL
is the most important piece of context available, however the organizers judged
to label as \manual" all the runs that used this information. We were not aware
of this limitation and computed measures that are similar to the automatic
summarization ones.</p>
      <p>When a URL is present in the Tweet, we download the page and extract
its title as well as the content of the body. For each candidate sentence S we
computed:
{ the word overlap between S and the title of the web page, and between S
and the body content of the web page,
{ the cosine similarity between S and the title of the web page, and between</p>
      <p>S and the body content of the web page.
3.4</p>
      <p>Forming context
Our three runs follow the three types of measures we described above. After
every sentence have been attributed a score, they are ordered and the top-ranked
sentences are selected to form context (within the limit of 500 words).
4</p>
    </sec>
    <sec id="sec-4">
      <title>Conclusions</title>
      <p>In this paper we presented our contributions to the INEX 2012 Tweet
Contextualization Track. We used various techniques involving automatic summarization
and topic modeling algorithms to score the candidate sentences.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>David</surname>
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Blei</surname>
            ,
            <given-names>Andrew Y.</given-names>
          </string-name>
          <string-name>
            <surname>Ng</surname>
            , and
            <given-names>Michael I.</given-names>
          </string-name>
          <string-name>
            <surname>Jordan</surname>
          </string-name>
          .
          <article-title>Latent dirichlet allocation</article-title>
          .
          <source>J. Mach. Learn. Res.</source>
          ,
          <volume>3</volume>
          :
          <fpage>993</fpage>
          {
          <fpage>1022</fpage>
          ,
          <string-name>
            <surname>March</surname>
          </string-name>
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>Gordon</given-names>
            <surname>Cormack</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Mark</given-names>
            <surname>Smucker</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Charles</given-names>
            <surname>Clarke</surname>
          </string-name>
          .
          <article-title>E cient and e ective spam ltering and re-ranking for large web datasets</article-title>
          .
          <source>Information Retrieval</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Donald</given-names>
            <surname>Metzler</surname>
          </string-name>
          and
          <string-name>
            <given-names>W. Bruce</given-names>
            <surname>Croft</surname>
          </string-name>
          .
          <article-title>A markov random eld model for term dependencies</article-title>
          .
          <source>In Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval</source>
          ,
          <source>SIGIR '05</source>
          , pages
          <fpage>472</fpage>
          {
          <fpage>479</fpage>
          , New York, NY, USA,
          <year>2005</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>Rada</given-names>
            <surname>Mihalcea</surname>
          </string-name>
          and
          <string-name>
            <given-names>Paul</given-names>
            <surname>Tarau</surname>
          </string-name>
          . Textrank:
          <article-title>Bringing order into text</article-title>
          .
          <source>In Proceedings of the 2004 Conference on Empirical Methods in Natural Language Processing, EMNLP '04</source>
          , pages
          <fpage>404</fpage>
          {
          <fpage>411</fpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>Toby</given-names>
            <surname>Segaran</surname>
          </string-name>
          and
          <string-name>
            <given-names>Je</given-names>
            <surname>Hammerbacher. Beautiful Data: The Stories Behind Elegant Data Solutions. O'Reilly Media</surname>
          </string-name>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>