<!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>Experiments with the Eurospider Retrieval System for CLEF 2000</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Martin Braschler</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Peter Schäuble</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Zürich</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Switzerland</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>braschler</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>schauble}@eurospider.com</string-name>
        </contrib>
      </contrib-group>
      <abstract>
        <p>This paper describes the experiment setup that we used for our CLEF participation and gives a preliminary analysis of the results that were obtained. We participated in the multilingual and monolingual tasks with three runs each. For our experiments, we investigated query translation using different approaches, as well as document translation. A main focus was the use of so-called similarity thesauri for query translation. Our approach produced promising results, and shows potential for future adaptations.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>This paper describes our experiments conducted for CLEF 2000. We will start by outlining our system
setup, including details of the collection and indexing. The paper continues with a description of the
particular characteristics of the individual experiments, followed by a preliminary analysis of our results.
The paper closes with a discussion of our findings.</p>
      <p>Eurospider participated in the multilingual and monolingual retrieval tasks. For multilingual retrieval, we
investigated both document and query translation, as well as a combination of the two approaches. For
translation, we used similarity thesauri, a bilingual wordlist and a machine translation system. Various
combinations of these resources were tested and are discussed in the following.
We used training data provided by the Schweizerische Depeschenagentur (SDA, the Swiss national news
wire) to build German/French and German/Italian similarity thesauri. Some of this data is well known as
part of the TREC6-8 CLIR test collection. All in all, we used a total of 11 years of news reports. While
SDA produces German, French and Italian news reports, it is important to note that these stories are not
actual translations. They are written by different editorial staff in different places, to suit the interests of
the different audiences. Therefore, the SDA training collection is a comparable corpus (as compared to a
parallel corpus, which contains actual translations of all items). The ability of the similarity thesaurus
calculation process to deal with comparable corpora is a major advantage, since these are usually much
easier to obtain than the rare parallel corpora.</p>
      <p>Unfortunately, we were not able to obtain suitable German/English training data to also build a
German/English thesaurus. Instead, we opted to use a bilingual German/English wordlist. As will be
shown below, this likely was a big disadvantage.</p>
      <p>Bilingual wordlist: As just mentioned, we used a German/English bilingual wordlist for German/English
crosslingual retrieval. We assembled this list from various free sources on the Internet. This means that the
wordlist is simplistic in nature (just translation pairs, no additional information such as grammatical
properties or word senses) and noisy (i.e. there is a substantial amount of incorrect entries).
Machine translation system: For a limited number of language pairs, commercial end-user machine
translation products are available nowadays. Since these systems are very cheap and run on standard PC
hardware, we decided to try and link such a product with both our translation component and our retrieval
software. We therefore used MT to translate the document collection, enabling us to use the translated
documents in our retrieval system, and also to translate the queries, combining those with the translation
output from the similarity thesaurus.</p>
      <p>We used the standard RotondoSpider retrieval system developed at Eurospider for indexing and retrieval.
Additional components were used for query translation and blind feedback.</p>
      <p>Indexing of German documents and queries used the Spider German stemmer, which is based on a
dictionary coupled with a rule set for decompounding of German nouns.</p>
      <p>Indexing of French documents and queries used the Spider French rule-based stemmer. French accents
were retained, since we decided that the quality of the data from Le Monde ensured consistent use of
accenting.</p>
      <p>Indexing of Italian documents and queries used the Spider Italian rule-based stemmer. There was a simple
preprocessing that replaced the combination »vowel + quote« with an accented vowel, since the La
Stampa texts use this alternative way of representation for accented characters. This simple rule produces
some errors if a word was actually quoted, but the error rate was considered too small to justify the
development of a more sophisticated rule.</p>
      <p>
        Indexing of English documents used an adapted version of the Porter rule-based stemmer.
The Spider system was configured to use a straight Lnu.ltn weighting scheme for retrieval, as described in
        <xref ref-type="bibr" rid="ref5">(Singhal et al., 1996)</xref>
        .
      </p>
      <p>The ranked lists for the three multilingual runs were obtained as follows:
EITCLEFM1: We built one large unified index containing all the German documents plus all the English,
French and Italian documents in their German translations as obtained by MT. It is then possible to
perform straight monolingual German retrieval on this combined collection. An added benefit is the
avoidance of the merging problem: since only one search has to be performed on one index, merging of
multiple ranked lists is not necessary.</p>
      <p>
        EITCLEFM2: Our second submission has an entirely different focus. Instead of document translation, we
used only query translation for this experiment. We obtained individual runs for every language pair
(German/German, German/French, German/Italian, and German/English). For every language pair, we
used two different translation strategies (or in the case of German/German, two different retrieval
strategies). For retrieval of the French and Italian documents, we translated the German queries both using
an appropriate similarity thesaurus and using the MT system. For search on the English collection, we
again used the MT system, but additionally used the German/English bilingual wordlist. The two German
monolingual runs were a simple, straightforward retrieval run, and a run that was enhanced through blind
relevance feedback
        <xref ref-type="bibr" rid="ref1 ref2">(for a discussion of blind feedback and some possible enhancements to it, see e.g.
Mitra et al., 1998)</xref>
        . The choice of relevance feedback was to »imitate« the expansion effect of the
similarity thesaurus for the other languages. We expanded the query by the twenty statistically best terms
from the top 10 initially retrieved documents.
      </p>
      <p>The two runs per each language are merged by adding together the ranks of a document in both individual
runs to form a new score. In order to boost documents with high ranks, we used the logarithms of the
ranks of the documents in both experiments.</p>
      <p>new_score = log( rank_in_run_1 ) + log( rank_in_run_2 )
The step resulted in four runs, one per language combination. These were then merged by taking a
document each in turn from every run, thus producing the final ranked list.</p>
      <p>EITCLEFM3: The last multilingual experiment combines elements from both the QT and DT-based runs.
To produce the final ranked list, these two runs are merged by setting the score to the sum of the
logarithms of the ranks, as described above.</p>
      <p>Straight monolingual G
Blind feedback monoling. G
Sim. Thes. translated G/F
MT translated G/F
Sim. Thes. Translated G/I
MT translated G/I
Wordlist translated G/E
MT translated G/E
DT multiling. (EITCLEFM1)</p>
      <p>Combined G
Combined G/F
Combined G/I</p>
    </sec>
    <sec id="sec-2">
      <title>Monolingual Retrieval</title>
      <p>We also submitted three runs for the monolingual task named EITCLEFGG, EITCLEFFF and EITCLEFII
(German, French and Italian monolingual, respectively). These runs all use the full topics (all fields). As
mentioned earlier, they were produced mainly to serve as baselines for comparison. The main work was
invested into the multilingual experiments.</p>
      <p>EITCLEFGG: This was our German monolingual submission. It is the straight retrieval run that was used
to produce the EITCLEFM2 run (see above).</p>
      <p>EITCLEFFF and EITCLEFII: These two runs were also obtained through straight monolingual retrieval
using the French and Italian queries, respectively.</p>
      <sec id="sec-2-1">
        <title>EITCLEFM1</title>
        <p>Looking at the results, the document translation-based run outperforms the query translation-based run.
However, looking at the individual parts that make up the QT-based run, we notice that the translation
using the bilingual wordlist performs very badly. It seems likely that the actual difference would be a lot
smaller if a good English similarity thesaurus was available.</p>
        <sec id="sec-2-1-1">
          <title>Runs against Multilingual Collection Average Precision Comparison Avg. Prec. per Query</title>
          <p>The combined run produces the best results, and does so on a very consistent basis. As shown in table 2,
the vast majority of queries improves, often substantially, in terms of average precision when compared to
either the DT-only or QT-only run. The picture is less conclusive for the comparison between DT-only
and QT-only. We think that this shows that whereas both approaches have strengths, they nicely mix in the
combined run to boost performance.</p>
          <p>We also looked at the individual language pairs and at the impact of the different query translation
strategies.</p>
        </sec>
        <sec id="sec-2-1-2">
          <title>Runs against German Collection</title>
        </sec>
        <sec id="sec-2-1-3">
          <title>Average Precision</title>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>Straight</title>
      </sec>
      <sec id="sec-2-3">
        <title>Blind Feedback</title>
        <p>It seems like the blind feedback loop did not help boost performance. In any case, the difference is so
slight that it can be considered meaningless. A per-query analysis shows that most queries are affected
very little by the feedback, and that the number of queries with a substantial increase or decrease in
average precision is exactly the same. This reinforces the conclusion that the feedback was not helpful in
this case.</p>
        <sec id="sec-2-3-1">
          <title>Runs against French Collection</title>
        </sec>
        <sec id="sec-2-3-2">
          <title>Average Precision</title>
        </sec>
      </sec>
      <sec id="sec-2-4">
        <title>Monolingual MT G/F</title>
      </sec>
      <sec id="sec-2-5">
        <title>Similarity Thesaurus G/F</title>
      </sec>
      <sec id="sec-2-6">
        <title>Combined G/F</title>
        <p>The French MT-based run outperforms the similarity thesaurus-based run quite substantially. However, a
sizable part of the difference can be attributed to five queries that failed completely using the thesaurus
(we consider a query a complete failure if the result has an average precision &lt; 0.01). For the rest of the
queries, the similarity thesaurus performed well, even outperforming the MT-based run by more than 10%
for eight queries in terms of average precision. The combined run gives a modest improvement over the
MT run. 20 queries benefit from the combination, whereas the performance of the remaining 14 queries
falls.</p>
        <sec id="sec-2-6-1">
          <title>Runs against Italian Collection Average Precision</title>
          <p>In Italian, the similarity thesaurus is closer to the performance of the MT-based run. Again, a big part of
the difference is due to 7 queries failing completely when using the thesaurus. The combination is quite an
improvement over the MT-only run, gaining 10% in average precision.</p>
        </sec>
        <sec id="sec-2-6-2">
          <title>Runs against English Collection</title>
        </sec>
        <sec id="sec-2-6-3">
          <title>Average Precision</title>
          <p>In English, the good performance of the MT-based run is striking. This probably is due to the main effort
in MT research still going into language combinations involving English. The poor performance of the run
using the bilingual wordlist is also noteworthy. While this might be partly due to shaky quality of the input
sources, we think that it underscores how important word sense disambiguation is, something which MT
and the similarity thesaurus try to address, but which is lacking from the wordlist. It seems obvious that
bilingual wordlists/dictionaries are not competitive without a serious investment of effort in that direction.
We are pleased to see that our runs compare very favorably when compared to other entries in CLEF.
Table 7 shows an analysis of per-query performance compared to the median performance of all
participants. Especially the multilingual runs performed strongly. The monolingual runs are more mixed,
which was to be expected, since we did not tune them specifically for performance. While German seems
to perform nicely, probably due to the compound analysis in the Spider stemming, the results for French
and Italian indicate room for improvement.</p>
        </sec>
        <sec id="sec-2-6-4">
          <title>Best</title>
        </sec>
        <sec id="sec-2-6-5">
          <title>Above</title>
        </sec>
        <sec id="sec-2-6-6">
          <title>Median</title>
        </sec>
        <sec id="sec-2-6-7">
          <title>Below Worst # queries</title>
          <p>0.4319
0.3306
0.2568
0.3636
0.3879
0.3753
0.1414
0.2809
40
40
40
37
34
34</p>
        </sec>
      </sec>
      <sec id="sec-2-7">
        <title>EITCLEFM1</title>
      </sec>
      <sec id="sec-2-8">
        <title>EITCLEFM2</title>
      </sec>
      <sec id="sec-2-9">
        <title>EITCLEFM3</title>
      </sec>
      <sec id="sec-2-10">
        <title>EITCLEFGG</title>
      </sec>
      <sec id="sec-2-11">
        <title>EITCLEFFF</title>
        <p>
          EITCLEFII
1
1
7
6
0
3
29
22
23
17
7
7
0
2
1
6
5
7
10
15
9
8
22
17
0
0
0
0
0
0
Overall, we think the performance of the similarity thesaurus is very remarkable. While it did not produce
results equal to the MT-based runs, it is important to note that we were in a »worst-case scenario«: the
thesauri were built on a comparable corpus (no real translations, as opposed to a parallel corpora), and
there was absolutely no overlap in training data and the test collection. This means that similar
requirements for other translation scenarios can be quite easily matched. I.e., it would be easy to build
similarity thesauri with comparable performance for a multitude of additional language pairs, even exotic
ones, simply by gathering suitable training data, such as a sufficient amount of texts from a national
newspaper each. Also, the performance of the similarity thesaurus will get a sizeable boost when the
problems can be addressed that led to a complete failure in translation of a number of queries. We should
be able to do this by increasing the size of the thesaurus, which again is only a matter of processing more
training data. Note also that the thesaurus is very suited for situations in which the query length is much
shorter, such as Web searches. As shown during the Eurosearch project
          <xref ref-type="bibr" rid="ref1 ref2">(for a short description of
Eurosearch, see Braschler et al., 1998)</xref>
          , the expansion effect of the thesaurus is very beneficial for the
short queries. Machine translation system traditionally have problems with short, key-word style queries.
Document translation gave us some good results, and was feasible for a collection of the size of the CLEF
test collection. This means that DT should not be discounted for reasonably static collections with limited
size. Note, however, that some of the advantage we found for DT versus query translation may be due to
the inadequate performance from the wordlist we used for English. Also, QT clearly remains the only
possibility for huge or highly dynamic collections.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Acknowledgements</title>
      <p>Thanks go to the providers of the CLEF data and all the assessors doing the judgement work. Also, we
appreciate the data that was provided to us by SDA for building the similarity thesauri. Additional thanks
go to Patrick Frey for tuning the rules of the German stemmer and Min-Yen Kan for a lot of scripts
originally written for last year's TREC that proved a big help in doing these experiments.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <surname>(Braschler</surname>
          </string-name>
          et al.,
          <year>1998</year>
          )
          <string-name>
            <given-names>M.</given-names>
            <surname>Braschler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Peters</surname>
          </string-name>
          , E. Picchi,
          <string-name>
            <given-names>P.</given-names>
            <surname>Schäuble</surname>
          </string-name>
          .
          <article-title>Cross-Language Web Querying: The EuroSearch Approach</article-title>
          .
          <source>In Proceedings of the 2nd European Conference on Research and Advanced Technology for Digital Libraries</source>
          , pages
          <fpage>701</fpage>
          -
          <lpage>702</lpage>
          ,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <surname>(Mitra</surname>
          </string-name>
          et al.,
          <year>1998</year>
          )
          <string-name>
            <given-names>M.</given-names>
            <surname>Mitra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Singhal</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Buckley</surname>
          </string-name>
          .
          <article-title>Improving Automatic Query Expansion</article-title>
          .
          <source>In Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          , pages
          <fpage>206</fpage>
          -
          <lpage>214</lpage>
          ,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <source>(Qiu and Frei</source>
          ,
          <year>1993</year>
          )
          <string-name>
            <given-names>Y.</given-names>
            <surname>Qiu</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Frei</surname>
          </string-name>
          .
          <article-title>Concept Based Query Expansion</article-title>
          .
          <source>In Proceedings of the 16th ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          , Pittsburgh, PA, pages
          <fpage>160</fpage>
          -
          <lpage>169</lpage>
          ,
          <year>1993</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>(Sheridan</surname>
          </string-name>
          et al.,
          <year>1997</year>
          )
          <string-name>
            <given-names>P.</given-names>
            <surname>Sheridan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Braschler</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Schäuble</surname>
          </string-name>
          .
          <article-title>Cross-language information retrieval in a multilingual legal domain</article-title>
          .
          <source>In Proceedings of the First European Conference on Research and Advanced Technology for Digital Libraries</source>
          , pages
          <fpage>253</fpage>
          -
          <lpage>268</lpage>
          ,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>(Singhal</surname>
          </string-name>
          et al.,
          <year>1996</year>
          )
          <string-name>
            <given-names>A.</given-names>
            <surname>Singhal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Buckley</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Mitra</surname>
          </string-name>
          .
          <article-title>Pivoted Document Length Normalization</article-title>
          .
          <source>In Proceedings of the 19th ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          , pages
          <fpage>21</fpage>
          -
          <lpage>29</lpage>
          ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>