<!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>The XLDB Group participation at CLEF 2005 ad hoc task</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Nuno Cardoso</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Leonardo Andrade</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alberto Simões</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mário J. Silva</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Faculdade de Ciências da Universidade de Lisboa Departamento de Informática, Universidade do Minho</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Grupo XLDB - Departamento de Informática</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper presents the 2005 participation of the XLDB Group in the CLEF monolingual and bilingual ad hoc tasks for Portuguese. We participated with an improved and extended configuration of the tumba! search engine software. We detail the new features and evaluate their performance.</p>
      </abstract>
      <kwd-group>
        <kwd>CLEF</kwd>
        <kwd>ad hoc</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        In 2004, the XLDB Group made its debut participation in CLEF, on the monolingual ad hoc Portuguese
retrieval task [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. The main goals were to obtain hands-on experience in joint evaluations of information
retrieval (IR) and evaluate tumba!, our web search engine [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], on this task. We learned that we had to come
up with new approaches and methods, as the strategy for searching and indexing large web collections has
to be different for the kind of document collections used in the CLEF ad hoc task.
      </p>
      <p>This year, we embraced the ad hoc task with the objective of evaluating new methods and algorithms
for the task:</p>
      <p>Implementation of new logic operators on query strings, to support expanded queries
Development of new methods for using all the topic information provided and merging the combined
result sets.</p>
      <p>Topics translation for submission of English to Portuguese bilingual runs.</p>
      <p>This paper is organized as follows: Section 2 describes our system and enumerates the main changes
from last year’s configuration. In Section 3, we present our evaluation goals and submitted runs. Section 4
presents the results obtained. Section 5 summarises our conclusions.
One of the main lessons learned from last year’s CLEF ad hoc task participation was that IR in large web
collections is quite different from IR on small text collections. Simple adjustments to a web search engine
aren’t sufficient if we want to use all the information provided for each topic instead of just a few terms
to query the CLEF ad hoc collection. This motivated the development of a set of new software, to handle
properly the task.</p>
      <p>We developed a new query expansion module that generates alternative queries from the descriptions
given. This module, called QuerCol (Queries Collator) is external to the core tumba! search engine, but
has an essential role in the production of the runs we submitted to CLEF in 2005.</p>
      <p>
        We also improved tumba! on its capability to properly rank poorly linked and tagged documents. To
rank the results for CLEF 2005, we developed a simplified version of the Okapi weighting algorithm [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ],
added support for the ’OR’ operator in query strings, and implemented new result set merging algorithms.
      </p>
      <p>
        With these new modules, our group is now taking the first steps to adopt the basic set of components
required for serious participation on in this kind of IR task – robust stemming, weighting scheme and blind
feedback [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>In the remainder of this Section, we detail the design of QuerCol, the newly developed query expansion
module, and the improvements made to the query processing sub-system of tumba!.
2.1</p>
      <sec id="sec-1-1">
        <title>Query Expansion</title>
        <p>
          The main conclusion of our CLEF 2004 participation was that, in order to achieve higher recall values, we
need to expand the title terms into alternative variants, as collections include many documents relevant to
the query topic without all the topic terms [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. So, this year we created multiple queries for each topic,
based on synonyms, morphological and lexical expansion of the title terms, and a selection of other terms
from the topic description.
        </p>
        <p>
          Query strings can now include the ’OR’ (disjunction) operator, which wasn’t supported by the query
server that we had in 2004. This enabled us to make extensive use of synonyms and morphological
variations of the title terms. Other systems and former CLEF participants, like David Nateau et al, experimented
query expansion modules based on the ’OR’ operator [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], and that inspired us to start QuerCol.
        </p>
        <p>
          QuerCol generates queries from a given topic using the following approach:
1. Eliminate common stop-words and CLEF-related stop-words. The latter include terms like
’document’ and ’relevant’, which are frequent in topic descriptions. We obtain these by selecting the top 5
most frequent terms from all topics.
2. Obtain title concepts. After stop-word elimination, we assume that all remaining title words are
rootterms of Boolean expressions in the disjunctive normal form, each representing a concept, which
must be present in all query strings derived from the topic. We used jspell to expand morphologically
the title concepts [
          <xref ref-type="bibr" rid="ref1 ref12">1, 12</xref>
          ]. Jspell is a morphological analyser based on derivation: words are created
applying a set of rules over a root term. This way, it is easy to check the root term and apply rules to
create word derivations for each title concept. From these, we only pick those having a frequency of
least 5 in the collection.
3. Obtain expanded concepts. For each topic title, we take the terms as a conjunction query, which is
submitted to the tumba! instance indexing the CLEF ad hoc collection. Then, we measure the tf x
idf value for each term in the topic’s set of words, for each document in the obtained result set. We
rank the top 8 terms and discard those with a document frequency lower than 5 in the collection. The
selected terms are called expanded concepts.
4. Compute the similarity between the title concepts and the expanded concepts. For instance, if the
title concepts are shark and attack, and the term strike is selected as an expanded concept, we want to
relate it to the attack concept, to create a query like shark attack OR shark strike. We used a database
of term co-occurrences of Portuguese terms developed by the Porto node of Linguateca, built from
two Portuguese corpora, CETEMPublico[
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] and WPT 03 [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. In the example above, we queried the
database for the top-20 terms that co-occur after the term shark. If strike is in the result, we can say
that the two terms belong to the same concept, and we add strike to the attack concept term list.
If an expanded concept isn’t associated to a concept, it is later added to the query string as a
disjunction. This means that expanded concepts don’t influence the result set lists, but contribute to
weighting the documents containing them.
5. Query string generation. In the end, each title concept is defined as a list of terms, selected both from
the expanded concepts and from the morphological expansions of the initial title terms. With all the
lists of concepts for each topic, we compute all term combinations as a m n matrix of m concepts
n term list size for each concept, and finally we merge them with disjunction operators to generate
a single query string.
        </p>
        <p>
          For the English to Portuguese bilingual ad hoc task, we devised the two following approaches:
1. Using the Babelfish web translation tool [14]. The topic strings were extracted and sent one at a time
to the translator and the translations replaced the original topic strings.
2. Using Example Based Machine Translation (EBMT) methods in parallel corpora [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. The
translations were made from a translation memory built from multilingual thesauri freely available on the
Internet (EuroVoc, Unesco thesaurus and others). The thesauri have not only simple term entries but
also multi-word entries that help in the translation of some word sequences. The translation memory
was then used to translate word sequences of the topics file. Words without a corresponding entry in
the translation memory were individually translated using Babelfish.
2.2
        </p>
      </sec>
      <sec id="sec-1-2">
        <title>Weighting and Ranking</title>
        <p>
          Sidra [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] is the indexing and ranking system used in the tumba! web search engine. Sidra provides support
for “all the terms” searches, exact phrase queries and field searches that restrict result sets to a specific
subdomain or document format. Sidra was primarily designed to rank web documents, as its original
ranking function relied mainly in metadata such as links’ anchor text, URL strings and page titles. However,
it performs poorly when handling document collections with scarce metadata, such as the CLEF ad hoc
collection. Sidra does not perform term stemming. The index terms are all the single works, indexed by a
full inverted file.
        </p>
        <p>To improve the performance of Sidra on CLEF, we made two major enhancements:
1. Implement a weighting function based on term frequency, to tackle the absence of meta-data.
2. Develop support for disjunction of terms expressions as queries to handle expanded queries created
by QuerCol.</p>
        <p>
          As weighting function, we implemented a simplified Okapi BM25 formula, without relevance
information [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. This way, the weighting effect is very similar to a simple tf*idf weighting function. The initial idea
was to develop a baseline for a future implementation of a full BM 25 schema, which is not yet available.
        </p>
        <p>Query strings submitted to Sidra are no longer interpreted as AND expressions of terms. Term
expressions with the logic ’OR’ operator can only be accepted in the Disjunctive Normal Form. Given that the
Sidra query servers handle each conjunction as a simple query, support for the ’OR’ operator consisted in
devising strategies for merging the result sets of ranked documents obtained in each sub-query. We used
two simple approaches:
Weight Merge: The final result set is obtained by sorting the weights of each result on the combined result
set. The final weight of a document present in more than one result set is the sum of the weights of
the document in each result set.</p>
        <p>Round-Robin Merge: The final result set is generated by sorting the result sets by the weight of the top
ranked document in the result set. Then, documents are picked from each result set using a
roundrobin rule. Documents already picked to the merged result set are ignored.</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>Runs</title>
      <p>For the ad hoc task, we submitted 5 runs for the Portuguese monolingual ad hoc task (4 regular runs
plus one mandatory run) and 4 for the English to Portuguese bilingual ad hoc task. As we were testing
implementations of the ’OR’ operator on tumba!, we selected the result set merging methods as a parameter
to measure which produced better results. Hence, we applied the Weight Merge algorithm to half the runs
plus the mandatory run, and Round Robin Merge to the other half (see Table 1).</p>
      <sec id="sec-2-1">
        <title>Monolingual Query Fusion Run</title>
      </sec>
      <sec id="sec-2-2">
        <title>Weight XLDBTumba01</title>
      </sec>
      <sec id="sec-2-3">
        <title>Manual</title>
        <p>Round Robin
XLDBTumba05</p>
      </sec>
      <sec id="sec-2-4">
        <title>Weight XLDBTumba02 XLDBTumba09</title>
      </sec>
      <sec id="sec-2-5">
        <title>Automatic Round Robin XLDBTumba06</title>
      </sec>
      <sec id="sec-2-6">
        <title>Bilingual Query Fusion Run</title>
      </sec>
      <sec id="sec-2-7">
        <title>EBMT translation Weight Round Robin XLDBTumba03 XLDBTumba07</title>
      </sec>
      <sec id="sec-2-8">
        <title>Babelfish Translation Weight Round Robin XLDBTumba04 XLDBTumba08 Table 1: Runs submitted to the ad hoc task</title>
        <p>In the monolingual task, we created runs XLDBTumba01 and XLDBTumba05 by manually adding
all kinds of synonyms and morphological expansions to the queries that seemed reasonable. We used it
as a baseline for evaluation against other submitted runs. For runs XLDBTumba02 and XLDBTumba06,
QuerCol automatically generated the queries. We aimed at obtaining result sets of the same level of quality
as for manually created runs, as QuerCol used the same query creation approach. XLDBTumba09 is a
mandatory run, with query strings automatically generated from the topics’ title and description fields
only.</p>
        <p>On the bilingual task, the goal of our participation was to have a preliminary evaluation of the EBMT
systems being developed at the Braga node of Linguateca.
4</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Results</title>
      <p>Run label
XLDBTumba01
XLDBTumba02
XLDBTumba05
XLDBTumba06
XLDBTumba03
XLDBTumba04
XLDBTumba07
XLDBTumba08
XLDBTumba09</p>
      <p>Retrieved</p>
      <p>Relevant</p>
      <p>Ret_rel</p>
      <p>Avg. Prec.</p>
      <p>R-Prec.</p>
      <p>Overall Prec.</p>
      <p>Overall Recall
the difference.</p>
      <p>The results of the monolingual runs are much better than the bilingual. This is likely a consequence
of some poor translations. We concluded that we were using thesauri with less quality than expected. As
we have overlaps (alternative translations coming from different thesauri), some of the used translations
came from the wrong thesaurus and were the source of the bad translation results. Table 2 shows that the
runs using EMBT translation obtained more relevant results with less retrieved documents, which is an
encouraging result.</p>
      <p>The relative performance of the best of our runs compared to other groups’ submissions is close to the
median. There are a few queries where our performance is much worse than the median for reasons that
we have yet to find. However, given that in 2005 our weighting algorithm was very simple, we believe that
an improvement here would likely raise the performance level of our software in future evaluations.
5</p>
    </sec>
    <sec id="sec-4">
      <title>Conclusion</title>
      <p>The results obtained this year represent show a major improvement since last year. This comes as a direct
consequence of the changes made to our IR system. Some of the developments for this CLEF task will be
incorporated in the next version of tumba!</p>
      <p>
        We have also identified further improvements, like extending QuerCol with a Portuguese stemmer.
This would create better term expansions and improve the ’clustering’ of terms from the same concept.
QuerCol’s generated queries also revealed some flaws that we need to amend, as there are concepts with
more than one term that shouldn’t be handled separately (for instance, Bill Clinton). Some morphological
expansions of title terms might also produce misleading variations. Finally, we could also incorporate the
software developed for our participation in GeoCLEF 2005 to expand geographic names in queries [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgements</title>
      <p>We would like to thank to Daniel Gomes, who managed the tumba! repository instance created for
supporting our participation in this joint evaluation. Thanks also to the developers of the tumba! search engine
and the Portuguese language tools used to assemble the runs. Our participation was partly financed by the
Portuguese Fundação para a Ciência e Tecnologia through grants POSI / PLP / 43931 / 2001 (Linguateca)
and POSI / SRI / 40193 / 2001 (GREASE).
[14] BabelFish Web Translation Tool. http://babelfish.altavista.com.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>João</given-names>
            <surname>José</surname>
          </string-name>
          Almeida and
          <string-name>
            <given-names>Ulisses</given-names>
            <surname>Pinto</surname>
          </string-name>
          .
          <article-title>Jspell - a module for generic natural language lexical analysis</article-title>
          .
          <source>In Actas do X Encontro da Associação Portuguesa de Linguística</source>
          , pages
          <fpage>1</fpage>
          -
          <lpage>15</lpage>
          , Évora,
          <year>1994</year>
          . in Portuguese. http://www.di.uminho.pt/~jj/pln/jspell1.ps.gz.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Martin</given-names>
            <surname>Braschler</surname>
          </string-name>
          and
          <string-name>
            <given-names>Carol</given-names>
            <surname>Peters</surname>
          </string-name>
          .
          <article-title>Cross-Language Evaluation Forum: Objectives, Results</article-title>
          , Achievements., volume
          <volume>7</volume>
          , chapter
          <issue>1-2</issue>
          , pages
          <fpage>7</fpage>
          -
          <lpage>31</lpage>
          . Kluwer Academic Publishers,
          <year>January 2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Nuno</given-names>
            <surname>Cardoso</surname>
          </string-name>
          , Bruno Martins, Leonardo Andrade, Marcirio Chaves, and
          <string-name>
            <given-names>Mário J.</given-names>
            <surname>Silva</surname>
          </string-name>
          . The XLDB Group at
          <article-title>GeoCLEF 2005</article-title>
          . In C. Peters, editor,
          <source>Working Notes for the CLEF 2005 Workshop</source>
          , Wien, Austria,
          <fpage>21</fpage>
          -
          <issue>23</issue>
          <year>September 2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Nuno</given-names>
            <surname>Cardoso</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Mário J.</given-names>
            <surname>Silva</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Miguel</given-names>
            <surname>Costa</surname>
          </string-name>
          . The XLDB Group at
          <article-title>CLEF 2004</article-title>
          . In C. Peters, editor,
          <source>Working Notes for the CLEF 2004 Workshop</source>
          , Bath, UK,
          <fpage>15</fpage>
          -
          <issue>17</issue>
          <year>September 2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Miguel</given-names>
            <surname>Costa</surname>
          </string-name>
          .
          <article-title>Sidra: a flexible web search system</article-title>
          .
          <source>Master's thesis</source>
          , Faculdade de Ciências da Universidade de Lisboa,
          <year>November 2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Bruno</given-names>
            <surname>Martins</surname>
          </string-name>
          and
          <string-name>
            <given-names>Mário J.</given-names>
            <surname>Silva</surname>
          </string-name>
          .
          <article-title>A statistical stydy of the wpt-03 corpus</article-title>
          .
          <source>Technical Report DI/FCUL TR-04-1</source>
          , Departamento de Informática da Faculdade de Ciências da Universidade de Lisboa,
          <year>April 2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>David</given-names>
            <surname>Nateau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Mario</given-names>
            <surname>Jarmasz</surname>
          </string-name>
          , Caroline Barrière, George Foster, and
          <string-name>
            <surname>Claude</surname>
          </string-name>
          St-Jacques.
          <article-title>Using COTS Search Engine and Custom Query Strategies at CLEF</article-title>
          . In C.Peters, editor,
          <source>Working Notes for the CLEF 2004 Workshop</source>
          , Bath, UK,
          <fpage>15</fpage>
          -
          <issue>17</issue>
          <year>September 2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S. E.</given-names>
            <surname>Robertson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Walker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Jones</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M. M.</given-names>
            <surname>Hancock-Beaulieu</surname>
          </string-name>
          .
          <article-title>Okapi at TREC-3</article-title>
          . In D. K. Harman, editor,
          <source>IST Special Publication 500-225: Overview of the Third Text REtrieval Conference (TREC 3)</source>
          , pages
          <fpage>109</fpage>
          -
          <lpage>126</lpage>
          , Gaithersburg,
          <string-name>
            <surname>MD</surname>
          </string-name>
          , USA,
          <year>1995</year>
          . Department of Commerce, National Institute of Standards and Technology.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Stephen</surname>
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Robertson</surname>
            , Steve Walker,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Jones</surname>
            , and
            <given-names>Micheline</given-names>
          </string-name>
          <string-name>
            <surname>Hancock-Beaulieu</surname>
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Gatford</surname>
          </string-name>
          .
          <article-title>Okapi at TREC-3</article-title>
          .
          <source>In Proceedings of the 3rd Text Retrieval Conference (TREC-3)</source>
          , pages
          <fpage>109</fpage>
          -
          <lpage>126</lpage>
          , Springfield, Virginia, USA,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Paulo</given-names>
            <surname>Rocha</surname>
          </string-name>
          and
          <string-name>
            <given-names>Diana</given-names>
            <surname>Santos</surname>
          </string-name>
          .
          <article-title>CETEMPúblico: Um corpus de grandes dimensões de linguagem jornalística portuguesa. In Actas do V Encontro para o processamento computacional da língua portuguesa escrita e falada (PROPOR'</article-title>
          <year>2000</year>
          ),
          <article-title>"</article-title>
          <string-name>
            <surname>Atibaia</surname>
          </string-name>
          , São Paulo, Brasil.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Mário</surname>
            <given-names>J. Silva.</given-names>
          </string-name>
          <article-title>The Case for a Portuguese Web Search Engine</article-title>
          .
          <source>In Proceedings of the IADIS International Conference WWW/Internet</source>
          <year>2003</year>
          ,
          <string-name>
            <surname>ICWI</surname>
          </string-name>
          <year>2003</year>
          , pages
          <fpage>411</fpage>
          -
          <lpage>418</lpage>
          , Algarve, Portugal, 5
          <article-title>-8 November 2003</article-title>
          . IADIS.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Alberto</surname>
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Simões</surname>
          </string-name>
          and João José Almeida. Jspell.pm
          <article-title>- a morphological analysis module for natural language processing</article-title>
          .
          <source>In Actas do XVII Encontro da Associação Portuguesa de Linguística</source>
          , pages
          <fpage>485</fpage>
          -
          <lpage>495</lpage>
          , Lisbon,
          <year>2001</year>
          . In Portuguese.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Harold</given-names>
            <surname>Somers</surname>
          </string-name>
          .
          <source>Review article: Example based machine translation</source>
          .
          <volume>14</volume>
          (
          <issue>2</issue>
          ):
          <fpage>113</fpage>
          -
          <lpage>157</lpage>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>