<!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>IRn in the CLEF Robust WSD Task 2008</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Sergio Navarro, Fernando Llopis, Rafael Mun ̃oz Natural Language Processing and Information Systems Group University of Alicante</institution>
          ,
          <country country="ES">Spain</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper describes our participation in the Robust WSD Task within the CLEF 2008. The aim of this pilot task is exploring methods which can take profit of WSD information in order to improve the IR systems. In our approach we have used a passage based system jointly with a WordNet based expansion method for the collection documents and the queries using the two WSD systems runs provided by the organization. Furthermore we have experimented with two well known relevance feedback methods - LCA and PRF -, in order to figure out which is more suitable to take profit of the WSD query expansion based on Wordnet. Our best run has obtained a 4th place in the competition with a value of 0.4008 MAP. We conclude that LCA fits better than PRF to this task. And that our WSD expansion is useful for some query subsets. In future works we will study the features of the query subsets for which the performance of our system decreases.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>alternative and complementary methods. We believe that the solution pass through the use of
external resources. Since that these narrow collections usually do not reflect as many relations
between different related terms as in a standard collection - where usually there are more terms
related that have at least a document where they are coocurring -.</p>
      <p>Bearing in mind the efficiency of the system we have worked in a method which do not have
a great cost in the retrieval phase for our system. Thus, we have used a simple strategy of term
expansion for the collection documents and the queries, which is based on the WSD systems offered
by the organization.</p>
      <p>This paper is structured as follows: Firstly, it presents the main characteristics of the
IRn system focusing on the documents and query expansion strategy, and the relevance feedback
strategies, then it moves on to explain the experiments we have made to evaluate the system, and
finally it describes the results and conclusions.
2</p>
    </sec>
    <sec id="sec-2">
      <title>The IR-n System</title>
      <p>
        In our approach, we used IR-n - an information retrieval system based on passages -.
Passagebased IR systems treats each document as a set of passages, with each passage defining a portion
of text or contiguous block of text. Unlike document-based systems, these systems can consider
the proximity of words with each other, that appear in a document in order to evaluate their
relevance [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
      </p>
      <p>
        The IR-n passage-based system differs from other systems of the same category with regard to
the method proposed for defining the passage - that is - using sentences as unit. Thus, passages
are defined by a number of consecutive sentences in a document [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
      </p>
      <p>IR-n uses stemmer and stopword lists to determine which information in a document will be
used for retrieval. For a list of stemmers and stopwords used by IR-n, see www.unine.ch/infor/clef.</p>
      <p>IR-n uses several weighting models. Weighting models allow the quantification of the similarity
between a text - a complete document or a passage in a document - and a query. Values are based
on the terms that are shared by the text and query and on the discriminatory importance of each
term.
2.1</p>
      <sec id="sec-2-1">
        <title>Expansion based on WordNet (WN) using WSD</title>
        <p>This method, is an attempt to manage the information provided by a WSD system in order to
overcome the problem of the mismatch between a concept in a query and in a document, and the
problems derived from the natural language ambiguity.</p>
        <p>The system expands terms within the queries and the collection documents. To carry out the
expansion, it first selects the most likely WN synset returned by the WSD system - in the event
of a tie it selects all the synsets with the maximum probability -. And afterwards, it generates the
term expansion using all synonyms belonging to the selected synset/s .</p>
        <p>In the phase of selecting the synset of a term, optionally IR-n can use two WSD systems in
order to limit the synset selection only to those synsets which have been ranked as the most likely
by one of the two WSD, and that at least has been ranked at second place by the other WSD
system.</p>
        <p>Finally, IR-n uses a parameter which allow, to configure the weight assigned for the terms
added to the query.
2.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Relevance Feedback</title>
        <p>
          Most IR systems use relevance feedback techniques [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]. These systems usually employ local
feedback. The local feedback assumes that top-ranked documents are relevant. The added terms
are, therefore, common terms from the top-ranked documents. Local feedback has become a
widely used relevance feedback technique. Although, it can deter retrieval, in case most of the
top-ranked documents are not relevant, results in TREC an CLEF conferences show that is an
effective technique [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ].
        </p>
        <p>
          In past works [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] we noticed that in spite of the improvements in the general results brought
by the relevance feedback - we used PRF [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] relevance feedback strategy -, this process also adds
wrong terms for the expansion in some of the cases. Therefore we decided to focus part of our
efforts on finding an alternative strategy for the relevance feedback, Thus, we are comparing in
this CLEF edition PRF with Local Context Analisy (LCA) [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], as alternate strategy.
        </p>
        <p>In the selection of terms, PRF gives more importance to those terms which have a higher
frequency in the top relevant documents than in the whole collection. An alternative query
expansion method relies on the Local Context Analysis (LCA), based on the hypothesis that a
common term from the top-ranked relevant documents will tend to co-occur with all query terms
within the top-ranked documents. That is an attempt to avoid including terms from top-ranked,
non-relevant documents in the expansion. Furthermore, in the case of polysemous words, this
method will help to retrieve documents more related to the sense of the query, since it is logical
to think that the user will use words from the domain associated with this sense to complete the
query. Indeed we think that in this year participation it could bebetter to use a method based on
the terms of the query as LCA, since that the expanded terms based on WN used in the query
and in all the documents, could boost performance of this relevance feedback strategy, improving
its ability for skipping non relevant documents.</p>
        <p>The IR-n architecture allows us to use query expansion based on either the most relevant
passages or the most relevant documents.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Training</title>
      <p>IR-n is a parameterizable system, which means that it can be adapted in line with the concrete
characteristics of the task at hand. The parameters for this configuration are the number of
sentences that form a passage, the weighting model to use, the type of expansion, the number of
documents/passages on which the expansion is based, the weight used for the WN based expanded
terms, the average number of words per document and the WSD system used.</p>
      <p>This section describes the training process that was carried out in order to obtain the best
possible features for improving the performance of the system.</p>
      <p>The collections and resources are described first, and the next section describes specific
experiments.
3.1</p>
      <sec id="sec-3-1">
        <title>Data Collection</title>
        <p>
          The organization has provided topics and document collections from previous CLEF campaigns
- from year 2001 to year 2006 - which were annotated by two different systems for word sense
disambiguation (WSD) developed by a group of the University of Barcelona (UBC) [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] and a
group of the National University of Singapore (NUS) [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. The documents are in English, and the
topics in both English and Spanish.
        </p>
        <p>The Table 1 and Table 2 show us the queries and collections used for training and test phases.</p>
        <p>Where the Topics No. column, is the range of queries used from the CLEF Ad-hoc task
competition of the indicated competition year - CLEF Year -.
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Experiments</title>
        <p>The experiment phase aims to establish the optimum values for the configuration of the system
for the collection.</p>
        <p>Below is a description of the input parameters of the system:</p>
        <p>The Passage size (ps): Number of sentences in a passage.</p>
        <p>Weight Model (wm): We used DFR weighting model.</p>
        <p>Relevance Feedback (relFB): Indicating which relevance feedback uses the system - PRF
or LCA.</p>
        <p>Relevance Feedback parameters: If exp has value 1, this denotes we use relevance
feedback based on passages. But, if exp has value 2, the relevance feedback is based on
documents. Moreover, num denotes the number of passages or documents that the relevance
feedback will use from the textual ranking and finally, term indicates the k terms extracted
from the best ranked passages or documents from the original query.</p>
        <p>WSD system used for the expansion of the Collection (WSDCOL): Indicate which
WSD system has been used or if none has been used for the documents expansion.
WSD system used for the expansion of the Query (WSDQuery): Indicate which
WSD system has been used or if none has been used for the query expansion.
Weight for the WN based Expanded Terms (wWN): Is the weight used for the
expanded terms using WN within the query.</p>
        <p>
          Our participation is limited to the English monolingual task. Thus, for the experiments we
have worked with DFR as the weighting schema. We have taken this decision based on the good
results obtained in previous works for this language [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
        </p>
        <p>We started the experiments looking for which was the best configuration for the collection, in
order to use it as baseline in our participation. Table 3 shows the best configurations obtained
with our passages based system without using neither relevance feedback techniques nor query
expansion based on WN.</p>
        <p>We have used the best run configuration - in MAP terms - , which uses a passage size of four
sentences, as the base configuration for the training phase. The next experiments have added
different combinations of values of relevance feedback and WN expansion parameters. In an attempt
of having an overview of the effect of use the WN expansion we show in the Figure 1 a graphic
with different combinations of WSDCOL and WSDQuery parameters - W SDCOL/W SDQuery
- with the best baseline run configuration, and the effect over the map measure of using a range
of values between 0 and 1 for the weight of the WN expanded terms of the query.</p>
        <p>We can see that the worst results - under the baseline results - are obtained for those runs
which use only expansion for the query - not for the collection -. The best run is the one which
uses NUS WSD system for expand the query and the collection. An finally we saw the method of
mixing the two WSD does not improve the run which only uses NUS WSD system. Due to time
restriction we do not have results mixing WSD systems for the expansion of the collection.</p>
        <p>The next table - Table 4 - shows MAP and Recall values for the best runs for each combination
of WSDCOL and WSDQuery parameters.</p>
        <p>In the Table 5, we show the best results obtained using LCA and PRF with each one of the
best runs of the Table 4.</p>
        <p>relFb
no
prf
lca
prf
lca
prf
lca
prf
lca
prf
lca</p>
        <p>WSD
COL
no
no
no
NUS
NUS
NUS
NUS
UBC
UBC
UBC
UBC
The organization of the task only have allowed to send 4 submission using WSD runs and 4 without
using WSD. Thus, we have sent to the task two runs without WSD: the baseline, and the best
run which used only LCA. And for the 4 WSD runs, we have sent the best run without relevance
feedback and the three best runs using relevance feedback.</p>
        <p>Due to problems related with using an incomplete test query set - we submitted our runs out
of time -. Thus, it has made that our results does not appear between the official task results.
Table 6 and Table 7 show the results obtained in the tasks Monolingual without WSD and in the
task with WSD respectively. The results are ordered by MAP. Also, we can see in this table our
ranking position in MAP terms within the competition results.</p>
        <p>runName
TestIRnSinColLCA</p>
        <p>TestIRnSinCol</p>
        <p>The best run submitted by the participants without using WSD in the competiton has obtained
a value of 0.4515 of MAP.</p>
        <p>The best run submitted by the participants using WSD has obtained a value of 0.4499 of MAP.</p>
        <p>On the one hand, opposite to what happens in training phase, all the runs which have used
WSD have obtained results for all the measures under the results of the run which have used LCA
without WSD. On the other hand these results show us that LCA as in the training phase always
improves the results respect the same configuration without its use.</p>
        <p>runName</p>
        <p>TestIRnUBC 0.2 LCA
TestIRnNUSSoloCol LCA</p>
        <p>TestIRnNUS 0.2 LCA</p>
        <p>TestIRnNUS 0.2</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusion and Future Work</title>
      <p>We conclude from those results that in spite our WSD approach has showed good results with the
training set, we have doubts about its suitability in general for all kind of queries. Since that we
have obtained contradictory results in the competition. In future works we will try to research
the causes of its behaviour with the competition query set, analysing the possible error sources
- the method itself, the wordnet organization or errors in disambiguation by the WSD systems
and its relation with the features of the queries.
6</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgement</title>
      <p>This research has been partially funded by the Spanish Government within the framework of the
TEXT-MESS (TIN-2006-15265-C06-01) project and by European Union (EU) within the
framework of the QALL-ME project (FP6-IST-033860).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Eneko</given-names>
            <surname>Agirre</surname>
          </string-name>
          and Oier Lopez de Lacalle.
          <article-title>Combining k-nn with svd for wsd</article-title>
          .
          <source>In Proceedings of the 4th International Workshop on Semantic Evaluations (SemEval</source>
          <year>2007</year>
          ), pages
          <fpage>341</fpage>
          -
          <lpage>345</lpage>
          , Prague, Czech Republic,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Yee</given-names>
            <surname>Seng</surname>
          </string-name>
          <string-name>
            <surname>Chan</surname>
          </string-name>
          , Ng Hwee Tou, and
          <string-name>
            <given-names>Zhong</given-names>
            <surname>Zhi</surname>
          </string-name>
          .
          <article-title>Exploiting parallel texts for word sense disambiguation in the english all-words tasks</article-title>
          .
          <source>In Proceedings of the 4th International Workshop on Semantic Evaluations (SemEval</source>
          <year>2007</year>
          ), pages
          <fpage>253</fpage>
          -
          <lpage>256</lpage>
          , Prague, Czech Republic,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Aitao</given-names>
            <surname>Chen and Fredric C.</surname>
          </string-name>
          <article-title>Gey. Combining Query Translation and Document Translation in Cross-Language Retrieval</article-title>
          . In Carol Peters, Julio Gonzalo,
          <string-name>
            <given-names>Martin</given-names>
            <surname>Braschler</surname>
          </string-name>
          , and et al., editors,
          <source>4th Workshop of the Cross-Language Evaluation Forum, CLEF 2003, Lecture notes in Computer Science, Lecture notes in Computer Science</source>
          , Trondheim, Norway,
          <year>2003</year>
          . SpringerVerlag.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Fernando</given-names>
            <surname>Llopis. IR-n: Un Sistema de Recuperacin de Informacin Basado</surname>
          </string-name>
          en Pasajes.
          <source>PhD thesis</source>
          , University of Alicante,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Sergio</given-names>
            <surname>Navarro</surname>
          </string-name>
          , Fernando Llopis, Rafael Mun˜oz, and Elisa Noguera.
          <article-title>Information Retrieval of Visual Descriptions with IR-n System based on Passages</article-title>
          .
          <source>In In on-line Working Notes, CLEF</source>
          <year>2007</year>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S. E.</given-names>
            <surname>Robertson</surname>
          </string-name>
          and
          <string-name>
            <given-names>K. Sparck</given-names>
            <surname>Jones</surname>
          </string-name>
          .
          <article-title>Relevance weighting of search terms</article-title>
          .
          <source>Journal of the American Society for Information Science</source>
          ,
          <volume>27</volume>
          (
          <issue>3</issue>
          ):
          <fpage>129</fpage>
          -
          <lpage>146</lpage>
          ,
          <year>1976</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Jinxi</given-names>
            <surname>Xu</surname>
          </string-name>
          and
          <string-name>
            <given-names>W. Bruce</given-names>
            <surname>Croft</surname>
          </string-name>
          .
          <article-title>Improving the effectiveness of information retrieval with local context analysis</article-title>
          .
          <source>ACM Trans. Inf</source>
          . Syst.,
          <volume>18</volume>
          (
          <issue>1</issue>
          ):
          <fpage>79</fpage>
          -
          <lpage>112</lpage>
          ,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>