<!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>ITC-irst at CLEF 2003: Monolingual, Bilingual, and Multilingual Information Retrieval</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Nicola Bertoldi</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>Marcello Federico</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>ITC-irst - Centro per la Ricerca Scientifica e Tecnologica I-38050 Povo</institution>
          ,
          <addr-line>Trento</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Multilingual Information Retrieval: Statistical approach</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper reports on the participation of ITC-irst in the Cross Language Evaluation Forum 2003; in particular, in the monolingual, bilingual, small multilingual, and spoken document retrieval tracks. Considered languages were English, French, German, Italian, and Spanish. With respect to our CLEF 2002 system, the statistical models for bilingual document retrieval have been improved, more languages have been considered, and a novel multilingual information retrieval system has been developed, which combines several bilingual retrieval models into a statistical framework. As in the last CLEF, bilingual models integrate retrieval and translation scores over the set of N-best translations of the source query.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        The statistical cross-language information retrieval
(CLIR) model presented in the 2002 CLEF
evaluation
        <xref ref-type="bibr" rid="ref2 ref4">(Federico and Bertoldi, 2002)</xref>
        was extended
in order to cope with a multilingual target
collection. Moreover, better query-translation
probabilities were obtained by exploiting bilingual
dictionaries and statistics from monolingual corpora.
Basically, the ITC-irst system presented in the 2002
CLEF evaluation was expanded with a module for
merging document rankings of different document
collections generated by different bilingual systems.
Each bilingual system features a statistical model,
which generates a list of the N-best query
translations, and a basic IR engine, which integrates scores,
computed by a standard Okapi model and a statistical
language model, over multiple translations.
Remarkably, training of the system’s parameters just requires
a bilingual dictionary, the target document collection,
and a document collection in the source language.
This paper is organized as follows. Section 2
introduces the statistical approach to multilingual IR.
Sections 3 briefly summarizes main features of our
system, and describes the retrieval procedure. Section 4
and 5 present experimental results for each tracks we
participated in. Section 6 closes the paper.
2.
Multilingual information retrieval can be defined as
the task of finding and ranking documents, which are
relevant for a given topic, within a collection of texts
in several language. As we know the language of
each document, we may view the multilingual target
collection as the union of distinct monolingual
collections.
2.1.
      </p>
      <sec id="sec-1-1">
        <title>Multilingual retrieval model</title>
        <p>Let a multilingual collection D contain documents
in L different languages, where D results from the
union of L monolingual sub-collections D1; : : : ; DL.
Let f be a query in a given source language,
eventually different from any of the L languages. One
would like to rank documents d within the
multilingual collection D, according to the posterior
probability:</p>
        <p>Pr(d j f ) / Pr(f ; d)
where the right term of formula (1) follows from the
constancy of Pr(f ), with respect to the ranking of
documents.</p>
        <p>A hidden variable l is introduced, which represents
the language of either a sub-collection or a document.</p>
        <p>Pr(f ; d) ==</p>
        <p>X Pr(l; f ; d)
l
l
=</p>
        <p>X Pr(l) Pr(f ; d j l)
where Pr(l) is an a-priori distribution over languages,
which can be estimated from the multilingual
collection or taken uniform. Formula (2) shows a weighted
mixture of bilingual IR models depending on the
subcollection. However, given that we know the
language each document is written in, we can assume
(1)
(2)
that the probability Pr(f ; d j l) is larger than zero
only if d belongs to the sub-collection Dl.</p>
        <p>Next, a hidden variable e is introduced, which
represents a (term-by-term) translation of f into one of the
L languages. Hence, we derive the following
decomposition:</p>
        <p>Pr(f ; d j l) =</p>
        <p>X Pr(f ; e; d j l)</p>
        <p>e
¼</p>
        <p>X Pr(f ; e j l) Pr(d j e; l) (3)</p>
        <p>e
In deriving formula (3), we make the
assumption (or approximation) that the probability of
document d given query f , translation e and
language l, does not depend on f . Formula (3) puts
in evidence a language-dependent query-translation
model, Pr(f ; e j l), and a collection-dependent
query-document model, Pr(d j e; l).</p>
        <p>The language-dependent query-translation model is
defined as follows:
Pr(f ; e j l) = Pr(f j l)Prl(e j f )
8 Prl(f ; e)
&gt;&gt;&gt;&gt; X
&lt;</p>
        <p>Prl(f ; e0)
/</p>
        <p>e02Tl(f )
&gt;
&gt;
&gt;
&gt;
:0
if e 2 Tl(f )
otherwise
where Tl(f ) is the set of all translations of f into
language l. For practical reasons, this set is
approximated with the set of the N most probable
translations computed by the basic query-translation model
Prl(f ; e). The term Pr(f j l) can be considered
independent from l and hence be discarded. The
normalization introduced in formula (4) is needed in order to
obtain ranking scores, which are comparable among
different languages.</p>
        <p>The collection-dependent query-document model is
derived from a basic query-document model Prl(d j
e) as follows:
8 Prl(d; e)
&gt;&gt;&gt;&gt; X
&lt;
Pr(d j e; l) = d02I(e;l)</p>
        <p>Prl(d0; e)
&gt;
&gt;
&gt;
&gt;
:0
if d 2 I(e; l)
otherwise
where I(e; l) is the set of documents in Dl containing
at least a word of e.</p>
        <p>
          The basic query document and query translation
models are now briefly described; more details can
be found in
          <xref ref-type="bibr" rid="ref2 ref4">(Bertoldi and Federico, 2002)</xref>
          . The
subscript l, which refers to the specific language or
collection the models are estimated on, will be omitted
without loss of generality.
The query-document model computes the joint
probability of a query e and a document d, written in the
same language. The query-document model
considered in the experiments results from the combination
of two different models: a language model and an
Okapi based scoring function.
        </p>
        <p>Language Model The joint probability can be
factored out as follows:</p>
        <p>Pr(e; d) = Pr(e j d) Pr(d)
where the a-priori probability of d, Pr(d), is assumed
to be uniform, and the probability of e given d to be
an order-free multinomial (bag-of-word) model:
n
Pr(e = e1; : : : ; en j d) = Y p(ek j d)
k=1
Okapi The joint probability can be obtained
through the normalization over queries and
documents of a generic scoring function s(e; d):
Pr(e; d) = Pe0;d0 s(e0; d0)
s(e; d)
The denominator is considered only for the sake of
normalization, but can be disregarded in the
computation of equation (3).</p>
        <p>
          A scoring function derived from the standard Okapi
formula, is used
s(e = e1; : : : ; en; d) =
n
Y idf (ek)Wd(ek)
k=1
(4)
(5)
(6)
(7)
(8)
Combination Previous work
          <xref ref-type="bibr" rid="ref1 ref2">(Bertoldi and
Federico, 2001)</xref>
          showed that the two models rank
documents almost independently. Hence, information
about the relevant documents can be gained by
integrating the scores of both methods. Combination
of the two models is implemented by just taking the
sum of scores, after a suitable normalization.
2.3. Basic Query-Translation Model
The query-translation model computes the
probability of any query-translation pair. This probability is
modeled by an HMM
          <xref ref-type="bibr" rid="ref7">(Rabiner, 1990)</xref>
          in which the
observable variable is the query f in the source
language, and the hidden variable is its translation e in
the target language. According to the HMM, the joint
probability of a pair (f ; e) is decomposed as follows:
P r(f = f1; : : : ; fn; e = e1; : : : ; en)
        </p>
        <p>
          n n
= p(e1) Y p(ek j ek¡1) Y p(fk j ek)
k=2 k=1
The term translation probabilities p(f j e) are
estimated from a bilingual dictionary as follows:
Pr(f j e) = Pf0 ±(f 0; e)
±(f; e)
(9)
where ±(f; e) = 1 if the term e is one of the
translations of term f and ±(f; e) = 0 otherwise. This flat
distribution can be refined through the EM algorithm
          <xref ref-type="bibr" rid="ref3">(Dempster et al., 1977)</xref>
          by exploiting a large corpus
in the source language.
        </p>
        <p>The target LM probabilities p(e j e0), are estimated
on the target document collection, through an
orderfree bigram LM, which tries to compensate for
different word positions induced by the source and target
languages. Let
p(e j e0) = Pe00 p(e00; e0)
p(e; e0)
(10)
where p(e; e0) is the probability of e co-occurring
with e0, regardless of the order, within a text
window of fixed size. Smoothing of this probability is
performed through absolute discounting and
interpolation.</p>
        <p>3.</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>System architecture</title>
      <p>As shown in Section 2, the ITC-irst multilingual
IR system features several independent bilingual
retrieval systems, which return collection-dependent
rankings, and a module for merging these results
into a global ranking with respect to the whole
multilingual collection. Moreover, language-dependent
text preprocessing modules have been implemented
to process documents and queries. Figure 3. shows
the architecture of the system.</p>
      <p>Two merging criteria were developed. The first, we
call stat method, implements the statistical model
introduced in Section 2: for each language,
languagedependent relevance scores of documents, computed
by the bilingual IR systems are normalized in order
to have language independent scores, and, hence, a
global ranking is created.</p>
      <p>The second criterion, we call rank method, exploits
the document rank positions only, i.e. all the
collection dependent rank lists are joined and documents
are globally sorted according to the inverse of their
original rank position.</p>
      <p>Monolingual and bilingual versions of the system
trivially follows by omitting the query-translation
model and by limiting the collection to one language,
respectively.</p>
      <sec id="sec-2-1">
        <title>3.1. Preprocessing</title>
        <p>In order to homogenize the preparation of data, and,
hence, to reduce workload, a standard procedure was
defined. More specifically, the following
preprocessing steps were applied both to documents and queries
in every language:
Documents
Bilingual
Dictionary</p>
        <p>Bilingual IR</p>
        <p>Bilingual IR
Documents
Bilingual</p>
        <p>Dictionary
Query (source)
Preprocessing</p>
        <p>Merging</p>
        <p>
          Ranked Documents
² Tokenization was performed to separate words
from punctuation marks, to recognize
abbreviations and acronyms, correct possible word splits
across lines, and discriminate between accents
and quotation marks.
² Stemming was performed by using a
languagedependent Porter-like algorithm
          <xref ref-type="bibr" rid="ref5">(Frakes and
Baeza-Yates, 1992)</xref>
          , freely available at
snowball.tartarus.org.
² Stop-terms removal was
documents by removing
in a language-dependent
(www.unine.ch/info/clef).
applied on the
terms included
public list
² Proper names and numbers in queries were
recognized in order to improve coverage of the
dictionary.
² Out-of-dictionary terms which have not been
recognized as proper names or numbers were
removed.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>3.2. Blind Relevance Feedback</title>
        <p>
          After document ranking, the following Blind
Relevance Feedback (BRF) technique was applied. First,
the documents matching the source query e are
ranked, then the B best ranked documents are taken
and the R most relevant terms in them are added to
the query, and the retrieval phase is repeated. In the
CLIR framework, R terms are added to each single
translation of the N -best list and the retrieval
algorithms is repeated once again. In this work, 15 new
search terms are selected from the top 5 documents
according to the Offer Weight proposed in
          <xref ref-type="bibr" rid="ref6">(Johnson
et al., 1999)</xref>
          .
        </p>
        <p>4.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Experimental Evaluation</title>
      <p>ITC-irst submitted 4 monolingual runs in French,
German, Italian, and Spanish, 4 Italian-Spanish
bilingual runs, 2 German-Italian bilingual runs, and 4
small multilingual runs using queries in English to
search documents in English, French, German, and
Spanish. Moreover, some unofficial experiments
were performed for the sake of comparison.
4.1.</p>
      <sec id="sec-3-1">
        <title>Data</title>
        <p>In Table 1, statistics about the target collections for
the five considered languages are reported.</p>
        <sec id="sec-3-1-1">
          <title>Language</title>
          <p>English
French
German
Italian
Spanish
Multi-4</p>
          <p>Bilingual dictionaries from English to the other
languages were gathered from public available
resources. Unfortunately, German-Italian and
ItalianSpanish dictionaries were not available. Hence,
the missing dictionaries were built from other
available dictionaries using English as a pivot language.
For example, an Italian-Spanish dictionary was
derived by exploiting the Spanish-English and
ItalianEnglish dictionaries as follows: the translation
alternatives of an Italian term are all Spanish translations
of all English translations of that term. Table 2
reports some statistics of the bilingual dictionaries. It is
worth noticing that for the generated dictionaries the
average number of translation alternatives is about
twice larger than that of original dictionaries. This
would suggest that they contain two wrong
translations per entry, on the average.</p>
          <p>Moreover, all term translation probabilities, but the
German-Italian ones, were estimated through the EM
algorithm by using the corresponding document
collections.
4.2.</p>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>Results</title>
        <p>Monolingual results As shown in Table 4, our
monolingual retrieval system achieves good results
for all languages. More than 70% of queries have
mAvPr greater than or equal to the median values. It
is worth noticing that mAvPrs are pretty the same for
all languages.</p>
        <p>Bilingual results Italian-Spanish results show that
the estimation of translation probabilities through the
EM algorithm is quite effective, especially in
combination with the 10-best translations.</p>
        <sec id="sec-3-2-1">
          <title>Language French German Italian</title>
          <p>Spanish</p>
          <p>Multilingual results As shown in Table 4, about
60% of the queries have mAvPr greater than or equal
to the median values. The merging method based on
the rank is a little more effective, but differences are
very low. Again, the EM estimation of term
probabilities slightly improves performance.</p>
          <p>The merging criteria were also applied to the
monolingual runs, in order to obtain an upper bound for our
multilingual retrieval system. The achieved mAvPrs
for this virtual experiment were .3754 and .3667 for
the “rank” and “stat” criteria, respectively. The
relative degradation is very similar to that observer for
bilingual experiments.</p>
          <p>Cross-Language Spoken Document</p>
          <p>Retrieval
ITC-irst participated also in the Cross-Language
Spoken Document Retrieval (CLSDR) track, which
consists in searching for relevant stories within a
collection of automatically transcribed English broadcast
news. Topics correspond in 50 short queries
manually translated from English into French, German,
Italian, and Spanish. For the CLSDR track, the
bilingual version of the ITC-irst IR system was applied,
with little changes in the BRF expansion of queries.
Moreover, German text were also processed for
splitting compound words, by using a DP based
algorithm.
5.1.</p>
          <p>Query expansion on parallel corpora
As the number of stories in the SDR target collection
was quite small, a double query expansion policy was
chosen. New terms are added which are extracted not
only from the target collection, but also from a large
corpus of written texts, consisting of newspapers and
news wires.</p>
          <p>As a parallel corpus for query expansion,
newspaper articles of the North American News Text corpus
were used (www.nist.gov/speech/tests/sdr). In
particular, 313K documents are extracted from Los Angeles
Times, Washington Post, New York Times, and
Associated Press Worldstream, issued between
September 1997 and April 1998. Unfortunately, the
available texts do not entirely cover the test period. The
following strategy was chosen: first query expansion
was performed on parallel texts, and then on target
collection.</p>
        </sec>
      </sec>
      <sec id="sec-3-3">
        <title>5.2. Results</title>
        <p>Table 6 reports the official submitted runs, and some
unofficial runs (in italics), used for comparison.</p>
        <p>Official run
mono-brf
mono-brf-brf
fr-en-1bst-brf-bfr
fr-en-sys-brf-bfr
de-en-dec-1bst-brf-bfr
de-en-1bst-brf-bfr
de-en-sys-brf-bfr
it-en-1bst-brf-bfr
it-en-sys-brf-bfr
es-en-1bst-brf-bfr
es-en-sys-brf-bfr</p>
        <sec id="sec-3-3-1">
          <title>Query mAvPr</title>
          <p>EN .3944
EN .4244
FR .2281
FR .3064
DE .2676
DE .2523
DE .2880
IT .2347
IT .3218
ES .2746
ES .3555
The official English monolingual run was performed
in order to evaluate the quality of the retrieval
system. ITC-irst performance is about 10% above the
other participants. For this experiment the query
expansion on the parallel corpus was not applied. If not
so, a relative improvement of 7% is observed. As the
double query expansion policy is quite effective, was
applied in all the other experiments.</p>
          <p>In the bilingual experiments, query were
translated either through our 1-best translation approach
or by the Babelfish translation service, powered
by Systran, which is available on the Internet
(world.altavista.com). Run names are indicating with
1bst and sys, respectively. Commercial
translations outperforms our approach.</p>
          <p>German word decompounding seems to be slightly
effective, as shown by comparing the run without
decompounding ( de-en-1bst-brf-bfr) and the with
(de-en-dec-1bst-brf-bfr).</p>
          <p>6.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusion</title>
      <p>This paper presented a multilingual IR system
developed at ITC-irst. A complete statistical model was
defined which combines several bilingual retrieval
model. The system was evaluated in the CLEF2003
campaign in the monolingual, bilingual, and
multilingual tracks. The basic monolingual IR model resulted
very competitive on every languages. The
multilingual IR systems also achieves higher performance
than the median. Experiments in the Cross-Language
Spoken Document Retrieval task, which uses very
short queries, showed that significantly better results
are still achieved by using translations produced by a
commercial system.</p>
      <p>7.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <surname>Bertoldi</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Federico</surname>
          </string-name>
          ,
          <year>2001</year>
          . ITC-irst
          <source>at CLEF</source>
          <year>2000</year>
          :
          <article-title>Italian monolingual track</article-title>
          . In Carol Peters (ed.),
          <source>Cross-Language Information Retrieval and Evaluation</source>
          , volume
          <volume>2069</volume>
          <source>of Lecture Notes in Computer Science</source>
          . Heidelberg, Germany: Springer Verlag.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <surname>Bertoldi</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Federico</surname>
          </string-name>
          ,
          <year>2002</year>
          . ITC-irst
          <source>at CLEF</source>
          <year>2001</year>
          :
          <article-title>Monolingual and bilingual tracks</article-title>
          . In Carol Peters, Martin Braschler, Julio Gonzales, and Michael Kluck (eds.),
          <source>Cross-Language Information Retrieval and Evaluation</source>
          , volume
          <volume>2406</volume>
          of Lecture Notes in Computer Science. Heidelberg, Germany: Springer Verlag.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <surname>Dempster</surname>
            ,
            <given-names>A. P.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>N. M.</given-names>
            <surname>Laird</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and D. B.</given-names>
            <surname>Rubin</surname>
          </string-name>
          ,
          <year>1977</year>
          .
          <article-title>Maximum-likelihood from incomplete data via the EM algorithm</article-title>
          .
          <source>Journal of the Royal Statistical Society, B</source>
          ,
          <volume>39</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>38</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>Federico</surname>
            , Marcello and
            <given-names>Nicola</given-names>
          </string-name>
          <string-name>
            <surname>Bertoldi</surname>
          </string-name>
          ,
          <year>2002</year>
          .
          <article-title>Statistical cross-language information retrieval using n-best query translations</article-title>
          .
          <source>In Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Tampere</source>
          , Finland.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>Frakes</surname>
          </string-name>
          , William B. and
          <string-name>
            <surname>Ricardo</surname>
          </string-name>
          Baeza-Yates (eds.),
          <year>1992</year>
          . Information Retrieval:
          <article-title>Data Structures and Algorithms</article-title>
          . Englewood Cliffs, NJ: Prentice Hall.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>Johnson</surname>
            ,
            <given-names>S.E.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Jourlin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. Spark</given-names>
            <surname>Jones</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.C.</given-names>
            <surname>Woodland</surname>
          </string-name>
          ,
          <year>1999</year>
          .
          <article-title>Spoken document retrieval for TREC-</article-title>
          8 at Cambridge University.
          <source>In Proceedings of the 8th Text REtrieval Conference</source>
          . Gaithersburg, MD.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>Rabiner</surname>
          </string-name>
          , Lawrence R.,
          <year>1990</year>
          .
          <article-title>A tutorial on hidden Markov models and selected applications in speech recognition</article-title>
          .
          <source>In Alex Weibel and Kay-Fu Lee (eds.)</source>
          ,
          <article-title>Readings in Speech Recognition</article-title>
          . Los Altos, CA: Morgan Kaufmann, pages
          <fpage>267</fpage>
          -
          <lpage>296</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>