<!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>Semantic Re-ranking in Ad-hoc Robust Retrieval</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science, University of Bari \Aldo Moro" Via Orabona</institution>
          ,
          <addr-line>I-70125, Bari</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper proposes an investigation about a re-ranking strategy presented at SIGIR 2010. In that work we describe a re-ranking strategy in which the output of a semantic based IR system is used to re-weigh documents by exploiting inter-document similarities computed on a vector space. The space is built using the Random Indexing technique. The e ectiveness of the strategy has been evaluated in the context of the CLEF Ad-Hoc Robust-WSD Task, while in this paper we propose new experiments in the TREC Ad-Hoc Robust Track 2004.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        A general approach to overcome the word ambiguity problem in IR involves the
representation of documents by word meanings. Among the most investigated
techniques are those that rely on WordNet1 synsets through which groups of
synonym words are uniquely identi ed and linked to each other by semantic
relations. The Robust-WSD task at Cross Language Evaluation Forum (CLEF) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]
has shown that results improve when aggregation strategies are exploited. The
method proposed in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] describes a di erent approach to document aggregation
based on a variation of the \inter-document similarities " [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] idea. The method
combines two retrieval strategies that work at two di erent representation levels:
keyword and synset. The ranked list of documents retrieved using the
synsetbased representation (synset list) is exploited to re-rank the list of documents
retrieved using the keyword-based one (keyword list). The insight of this method
is that documents in the keyword list with the highest number of similar
documents in the synset list should climb in the result set. The approach tries to
re-weigh documents in response to a query by promoting those documents with
the highest number of supporters. In this context, a supporter is a document
with content similar to the target one. Inter-document similarities is computed
relying on the Random Index technique to build a vector space in which similar
documents are represented close.
      </p>
      <p>Let us denote by Lk and Ls the ranked lists of documents retrieved using
keywords and synsets representation, respectively. The idea behind our re-ranking
method is to give more evidence to the documents in Lk that are widely
supported by similar documents occurring in both lists.</p>
      <p>The method requires the following steps:
1 A semantic lexicon for the English language.
1. For each document di 2 Lk compute the supporters(di; ), which is the set
of documents fd1; :::d g Lk with the highest inter-document similarity
to di.
2. Get the overlap supporters = fdj 2 Ls : dj 2 supporters(di; )g which is
the set of documents occurring in both Ls and supporters.
3. Assign to di a new score S(di) taking into account supporting documents
computed in the step 2. Formally:
where</p>
      <p>S(di) =</p>
      <p>Ssupporters + (1</p>
      <p>) Sk(di)
Ssupporters =</p>
      <p>X
dj2overlap supporters</p>
      <p>Sk(dj ) Ss(dj )
(1)
(2)
and Sk(dj ) is the score of dj in Lk, while Ss(dj ) is the score of dj in Ls, and
is a free parameter used to smooth Ssupporters, which denotes the scores
combination of supporting documents.
2</p>
    </sec>
    <sec id="sec-2">
      <title>The new setting</title>
      <p>
        The proposed approach involves two retrieval strategies which work at two
different representation levels: keyword and synset. The synset level requires the
disambiguation of the whole collections: CLEF 2009 Ad-hoc Robust Task and
TREC Ad-Hoc Robust Track 2004. The TREC collection counts 528,155
documents, while the CLEF 2009 collection consists of 166,717 documents
disambiguated by the task organizers. The Word Sense Disambiguation (WSD)
algorithm [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] used by the CLEF organizers is not available, for this reason we
adopt our WSD strategy to disambiguate TREC documents. Our WSD method
is based on [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. It is important to underline that our WSD strategy obtains
similar results wrt [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] in terms of precision when the two WSD algorithms are
evaluated \in vitro". The WSD method used by the CLEF organizers obtains
0.578 as precision in SemEval-2007 All-Words Task, while our system obtains
0.59 in terms of precision using the dataset of Senseval-3 All-Words Task. The
two datasets are not directly comparable, but the results give an idea of the
effectiveness of both WSD strategies. To perform the WSD algorithm, several text
processing operations are required such as tokenization, part-of-speech tagging
and lemmatization. We adopt META [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], a text processing tool able to perform
all the necessary natural language processing steps.
      </p>
      <p>
        Moreover, to build the vector space in which similarity between documents is
computed, we adopt a strategy based on Random Indexing using a modi ed
version of Semantic Vectors package [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] able to work with large collections as TREC.
Our modi ed version works on computational aspects to improve performance
related to space and time.
      </p>
      <p>
        Finally, we built a retrieval system [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] based on Lucene and the Okapi BM25
model for both levels of representation: keyword and synset. Stemming and stop
word removal are applied to the keyword-based representation of documents and
topics. To evaluate the performance we executed several runs using the topics
provided in each track. In detail, the CLEF 2009 collection has 160 topics, while
the TREC collection has 259 topics. We used TITLE and DESCRIPTION topic
elds adopting two di erent boosting factors (TITLE=4, DESCRIPTION=1)
to highlight terms in the TITLE.
      </p>
      <p>
        More details about the adopted IR system are in [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], while the Random
Indexing strategy exploited in this work is thoroughly described in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Evaluation and Remarks</title>
      <p>
        The goal of the evaluation is to prove that the re-ranking method proposed in
[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] is able to obtain good performance when both a di erent collection and a
di erent WSD algorithm are involved.
      </p>
      <p>The proposed approach requires disambiguated documents. As well known,
WSD is a time consuming task. The disambiguation of the whole TREC
collection has required about 6 days using a Linux-based PC with Intel Core2Quad
processor having 6 GB of RAM, while, in CLEF collection, we rely on
disambiguated documents provided by the organizers. Comparing di erent WSD
algorithms is out of the scope of this work, while we want to evaluate the
contribution of synset-based document representation in our re-ranking approach.
We plan to perform CLEF disambiguation using our WSD method in future
evaluations.</p>
      <p>The evaluation was performed using the MAP and GMAP measures.
Table 1 summarizes the main results. Foremost, we evaluated each system alone
(Keyword and Synset). Keyword was used as baseline of the evaluation. Then,
we evaluated an aggregation strategy, CombSU M . In particular we adopted a
modi ed version of that strategy to assign di erent weights to each list
during aggregation. Finally, the result of the proposed method has been denoted
by ReRank. After a tuning step, we set the weights for Lk and Ls to 0:8 and
0:2, respectively. Moreover, we tested several values of 2 f0:1; 0:2; : : : ; 0:5g
and 2 f5; 10; 20; 40g. Table 1 reports only the best results and the involved
parameters and .</p>
      <p>The ReRank method achieves the best results in terms of MAP and GMAP
in both the collections. These improvements are signi cant with respect to the
baseline Keyword; we validated our experiments using the non parametric
Randomization test, setting to 5%. Results con rm our hypothesis: the ranking
provided by synsets (Ls) contributes signi cantly to the nal document score.
Moreover, it is important to underline that, despite using a di erent WSD
algorithm to disambiguate the TREC collection, the performance are not a ected.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Agirre</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Di Nunzio</surname>
            ,
            <given-names>G.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mandl</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Otegi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>CLEF 2009 Ad Hoc Track Overview: Robust-WSD Task</article-title>
          . In: Peters,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Di Nunzio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.M.</given-names>
            ,
            <surname>Kurimo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Mostefa</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.</surname>
          </string-name>
          , Pen~as,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Roda</surname>
          </string-name>
          ,
          <string-name>
            <surname>G</surname>
          </string-name>
          . (eds.)
          <article-title>Multilingual Information Access Evaluation I. Text Retrieval Experiments, 10th Workshop of the Cross-Language Evaluation Forum</article-title>
          ,
          <string-name>
            <surname>CLEF</surname>
          </string-name>
          <year>2009</year>
          , Corfu, Greece,
          <source>September 30 - October 2</source>
          ,
          <year>2009</year>
          , Revised Selected Papers. pp.
          <volume>36</volume>
          {
          <fpage>49</fpage>
          . Lecture Notes in Computer Science, Springer (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Basile</surname>
            , P., de Gemmis,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gentile</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Iaquinta</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lops</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Semeraro</surname>
          </string-name>
          , G.:
          <article-title>METAMultilanguagE Text Analyzer</article-title>
          .
          <source>In: Proceedings of the Language and Speech Technnology Conference-LangTech</source>
          . pp.
          <volume>28</volume>
          {
          <issue>29</issue>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Basile</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Caputo</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Semeraro</surname>
          </string-name>
          , G.:
          <article-title>UNIBA-SENSE @ CLEF 2009: Robust WSD Task</article-title>
          .
          <source>In: Multilingual Information Access Evaluation I. Text Retrieval Experiments, 10th Workshop of the Cross-Language Evaluation Forum</source>
          ,
          <string-name>
            <surname>CLEF</surname>
          </string-name>
          <year>2009</year>
          , Corfu, Greece,
          <source>September 30 - October 2</source>
          ,
          <year>2009</year>
          ,
          <string-name>
            <given-names>Revised</given-names>
            <surname>Selected</surname>
          </string-name>
          Papers -
          <source>CLEF (1). Lecture Notes in Computer Science</source>
          , vol.
          <volume>6241</volume>
          , pp.
          <volume>150</volume>
          {
          <fpage>157</fpage>
          . Springer (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Basile</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Caputo</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Semeraro</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>Integrating Sense Discrimination in a Semantic Information Retrieval System</article-title>
          . In: Soro,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Vargiu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Armano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            ,
            <surname>Paddeu</surname>
          </string-name>
          ,
          <string-name>
            <surname>G</surname>
          </string-name>
          . (eds.)
          <article-title>Information Retrieval and Mining in Distributed Environments</article-title>
          .
          <source>Studies in Computational Intelligence</source>
          , vol.
          <volume>324</volume>
          , pp.
          <volume>249</volume>
          {
          <fpage>256</fpage>
          . Springer (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Basile</surname>
            , P., de Gemmis,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lops</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Semeraro</surname>
          </string-name>
          , G.:
          <article-title>Combining knowledge-based methods and supervised learning for e ective italian word sense disambiguation</article-title>
          .
          <source>In: Proceedings of the 2008 Conference on Semantics in Text Processing</source>
          . pp.
          <volume>5</volume>
          {
          <fpage>16</fpage>
          . STEP '
          <volume>08</volume>
          ,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computational Linguistics, Morristown, NJ, USA (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Caputo</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Basile</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Semeraro</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>From fusion to re-ranking: a semantic approach</article-title>
          .
          <source>In: Proceeding of the 33rd international ACM SIGIR conference on Research and development in information retrieval</source>
          . pp.
          <volume>815</volume>
          {
          <fpage>816</fpage>
          . SIGIR '10,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA (
          <year>2010</year>
          ), http://doi.acm.
          <source>org/10</source>
          .1145/1835449.1835630
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Chan</surname>
            ,
            <given-names>Y.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ng</surname>
            ,
            <given-names>H.T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhong</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>Nus-pt: Exploiting parallel texts for word sense disambiguation in the english all-words tasks</article-title>
          .
          <source>In: Proceedings of the Fourth International Workshop on Semantic Evaluations (SemEval-2007)</source>
          . pp.
          <volume>253</volume>
          {
          <fpage>256</fpage>
          . Association for Computational Linguistics, Prague, Czech Republic (
          <year>June 2007</year>
          ), http://www.aclweb.org/anthology/S/S07/S07-1054
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Kozorovitzky</surname>
            ,
            <given-names>A.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kurland</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <article-title>From "identical" to "similar": Fusing retrieved lists based on inter-document similarities</article-title>
          . In: Azzopardi,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Kazai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            ,
            <surname>Robertson</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.E.</surname>
          </string-name>
          , Ruger,
          <string-name>
            <given-names>S.M.</given-names>
            ,
            <surname>Shokouhi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Yilmaz</surname>
          </string-name>
          , E. (eds.)
          <source>ICTIR. LNCS</source>
          , vol.
          <volume>5766</volume>
          , pp.
          <volume>212</volume>
          {
          <fpage>223</fpage>
          . Springer (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Widdows</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ferraro</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Semantic Vectors: A Scalable Open Source Package and Online Technology Management Application</article-title>
          .
          <source>In: Proc. of the 6th Int. Conf. on Language Resources and Evaluation (LREC</source>
          <year>2008</year>
          )
          <article-title>(</article-title>
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>