<!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>Report on CLEF-2003 experiments: two ways of extracting multilingual resources from corpora</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Nicola Cancedda</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Herve´ De´jean</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>E´ric Gaussier</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jean-Michel Renders</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alexei Vinokourov</string-name>
          <email>alexei@cs.rhul.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Xerox Research Centre Europe, Royal Holloway University of London</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>We present in this report two main approaches to cross-language information retrieval based on the exploitation of multilingual corpora to derive cross-lingual term-term correspondences. These two approaches are evaluated in the framework of the multilingual-4 (ML4) task.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>
        Most approaches to Cross-Language Information Retrieval (CLIR) rely on query
translation based on existing machine-readable dictionaries and/or translation systems ([
        <xref ref-type="bibr" rid="ref12 ref15 ref2 ref21 ref6">15,
2, 6, 12, 21</xref>
        ], to name but a few), and face the problem of the adequacy of existing
bilingual resources to the collection that is searched. However, when this collection is
multilingual, one may benefit from automatically extracted bilingual lexicons, which can
display a better coverage and allow for more accurate translations of queries. This
perspective is mentioned in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], even though the authors failed to derive accurate bilingual
lexicons from their collection. It is indirectly exploited in [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] where the authors derive
a probabilistic translation lexicon, based on IBM translation models 1 and 2 ([
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]), from
a corpus of parallel texts different from the searched collection.
      </p>
      <p>We want to experiment here with two methods to exploit parallel corpora for CLIR
purposes. The first one relies on the inference of a bilingual semantic representation
via cross-language canonical correlation analysis, whereas the second one, more
traditional, relies on the extraction of bilingual lexicons from parallel corpora.</p>
      <p>
        However, the CLEF-2003 multilingual collection is not parallel, but comparable,
that is to say that rather than being translations of one another, documents cover the
same topics, in the same domains. Nevertheless, up to now, extraction methods
developed on comparable corpora, unlike methods for parallel corpora, have not provided
results good enough to be directly used in CLIR, as is argued in [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]. This indicates
that a compromise between the use of parallel and comparable corpora has to be found,
so as to derive query translation modules that display both accuracy and coverage
properties. In addition to the above-mentioned methods, we will thus report on experiments
aimed at combining bilingual lexicons extracted from parallel and comparable corpora.
In our case, the parallel corpus retained is the JOC1, whereas the comparable one is the
      </p>
      <sec id="sec-1-1">
        <title>1 Used in the Arcade evaluation task, www.lpl.univ-aix.fr/projects/arcade</title>
        <p>collection itself. The implicit goal behind these experiments is to develop
state-of-theart query translation modules, fully adapted to the collection to be searched.
2</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>Linguistic preprocessing</title>
      <p>As a preprocessing step, we tag and lemmatize corpora, queries and bilingual resources.
Only lexical words (nouns, verbs, adverbs, adjectives) are indexed and only single word
entries in our resources are used. Our (lexicon-based) lemmatizer provides a partial
segmentation for the German compounds. Additionally, we segment German words
which were not decomposed by the lemmatizer using the following patterns:
Pattern Segmentation
A( ˆaeuioy )sB A( ˆaeuioy ) B</p>
      <p>A-B A B</p>
      <sec id="sec-2-1">
        <title>German spelling (umlaut and eszett) is also normalized.</title>
        <p>3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Canonical correlation analysis for cross-lingual retrieval</title>
      <p>
        In this work we automatically model a semantic correspondence between terms of
different languages, in the spirit of cross-lingual latent semantic indexing (CL-LSI) [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ].
In CL-LSI, using a parallel corpus, after merging each pair into a single ’document’,
one can interpret frequent co-occurrence of two terms in the same document as an
indication of cross-language correlation. In this framework, a common vector-space,
including words from both languages, is created and then the training set is analysed in
this space using SVD. This problem can be regarded either as an unsupervised problem
with paired documents, or as a supervised monolingual problem with very complex
labels (i.e. the label of an English document could be its French counterpart). In either
way, the data can be readily obtained without an explicit labeling effort, and furthermore
there is no loss of information in compressing the meaning of a document into a discrete
label. As an alternative to CL-LSI, we employ Canonical Correlation Analysis (CCA)
[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] to learn a representation of text that captures aspects of its meaning. Given a
paired bilingual corpus, this method defines two embedding spaces for the documents of
the corpus, one for each language, and an obvious one-to-one correspondence between
points in the two spaces. CCA then finds projections in the two embedding spaces for
which the resulting projected values are highly correlated. In other words, it looks for
particular combinations of words that appear to have the same co-occurrence patterns
in the two languages. Our hypothesis is that finding such correlations across a paired
bilingual corpus will locate the underlying semantics, since we assume that the two
languages are ’conditionally independent’, or that the only thing they have in common
is their meaning. The directions would carry information about the concepts that stood
behind the process of generation of the text and, although expressed differently in
different languages, are, nevertheless, semantically equivalent. This representation is then
used for the retrieval task, providing a better performance than LSI on some tested
corpora [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ]. Such directions are then used to calculate the coordinates of the documents
in a ’language independent’ way. Of course, particular statistical care is needed for
excluding ’spurious’ correlations. We have shown that the correlations we find are not
the effect of chance, and that the resulting representation significantly improves
performance of retrieval systems [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ]. Indeed, the correlation between English and French
documents can be explained by means of relations between the generative processes
of the two versions of the documents, that we assume to be conditionally independent
given the topic or content. Under such assumptions, hence, such correlations detect
similarities in content between the two documents, and can be exploited to derive a
semantic representation of the text. The CCA machinery is briefly given below.
3.1
      </p>
      <sec id="sec-3-1">
        <title>Canonical Correlation Analysis</title>
        <p>For us, the multivariate random variables to which CCA is applied correspond to
documentvectors (in the bag of words representation) in English and French, and there is a
oneto-one relation between them corresponding to documents that are translations of each
other. We will now consider sets of words that are correlated between the two languages
(sets of words in the two languages that have a correlated pattern of appearance in the
corpus). We will assume that such sets approximate the notion of ’concepts’ in each
language, and that such concepts are the translation of each other. Rather than
considering plain sets, we will consider terms to have a degree of membership to a given set. In
other words, the term will be assigned a weight for each concept we consider, and
every concept will correspond to a vector in English, and a vector
in French. We will use that weight to form linear combinations of terms, so that they
can define a direction in the term space.</p>
        <p>Suppose as for CL-LSI we are given aligned texts in, for simplicity, two languages,
i.e. every text in one language is a translation of text in another
language. In practice, each text can correspond to a complete document, a paragraph,
or a sentence. The finer the textual units, the more accurate the correlation statistics. Our
hypothesis is that having aligned texts and</p>
        <p>we can learn (semantic) directions and where we use the notation
so that the projections and of input data images from the different languages
would be maximally correlated. These new random variables are univariate, and linear
combinations of the previous ones. We consider optimizing this quantity with respect
to the choice of and . This leads to the following objective functions
and optimization problems:</p>
        <p>corr
This optimization problem can be transformed into a generalized eigenvalue problem
as follows. One is looking for the maximum correlation directions:
maximize
subject to
where we are using the covariance matrix:
The solutions of this problem can be obtained by solving a related generalized
eigenproblem
(1)
and the solution
directly provides the directions
and
of maximum correlation:</p>
        <sec id="sec-3-1-1">
          <title>Note that if is an eigenvalue, so is thus the spectrum is .</title>
          <p>3.2</p>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>Application of CCA to cross-lingual retrieval task</title>
        <p>The kernel CCA procedure identifies a set of projections from both languages into
a common semantic space. This provides a natural framework for performing
crosslanguage information retrieval. We first select a number of semantic dimensions,
, with largest correlation values . To process an incoming query we
expand into the vector representation for its language and project it onto the
canonical -correlation components: using the appropriate vector for
that language, where is a matrix whose columns are the first solutions of (1)
for the given language sorted by eigenvalue in descending order. Notice that in this case
we use the standard dot product to perform the projection, but non-linear projections
can also be obtained by replacing the dot product with a non-linear kernel ([]).
3.3</p>
      </sec>
      <sec id="sec-3-3">
        <title>Learning on paired data</title>
        <p>
          The whole training collection consists of 1.3 million pairs of aligned text chunks
(sentences or smaller fragments) from the 36 Canadian Parliament proceedings. We used
only first 1000 documents. The raw text was split into sentences with Adwait
Ratnaparkhi’s MXTERMINATOR and the sentences were aligned with I. Dan Melamed’s GSA
tool (for details on the collection and also for the source see [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]).
        </p>
        <p>The text was split into ’paragraphs’ based on ’***’ delimiters and these ’paragraphs’
were treated as separate documents. After removing stop-words in both French and
English parts and rare words (i.e. appearing less than three times) we obtained
term-by-document ’English’ matrix and ’French’ matrix (we also
removed a few documents that appeared to be problematic when split into paragraphs).
The test corpus and queries were processed by Xerox Research Centre Europe as
explained in Section 2. The results were unimpressive due to the fact that we restricted
ourselves only to the French part - Le Monde - due to the lack of time. Possibly there
were also bugs in software and we are working to reveal them, renewed results may
appear in the final version.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Query translation</title>
      <p>We want to assess in this section the usefulness of bilingual lexicons extracted from
collections. In order to illustrate the potential gain this approach could yield, we
conducted the following simple experiment. We first collected all the English terms from
the queries associated to the ML4 task, from years 2000 to 2003. We then tried to
evaluate whether or not we were able to translate those terms with manually built, existing
dictionaries, and whether or not we were able to translate them with bilingual lexicons
automatically derived from multilingual collections. To this end, we retained two
multilingual dictionaries, the ELRA dictionary2, and the Oxford-Hachette3. For corpora,
we retained a part of the Hansard4, the JOC corpus (already mentioned in footnote 1,
comprising ca. 3.5 millions English tokens), and the ML4 collection itself. For each
term present in the set of English queries, we checked whether it was present in the
lexicons associated with the above resources. The percentage of English terms found in
the lexicons is summarized in table 1.</p>
      <p>As one may have noticed, the figures we obtained are only upper bounds on the
actual coverage of each resource, since the presence of a term in a dictionary does
not imply that the proposed translation(s) are appropriate for the collection at hand.
Furthermore, there is an important qualitative difference between manually built and
automatically extracted lexicons, a difference that may well balance the advantage for
corpus-based methods displayed in table 1. However, were we able to accurately
extract bilingual lexicons from corpora, table 1 shows that we would have an important
gain over using existing, general purpose dictionaries. Table 2 supports this latter fact
and shows how the average precision evolves, on a sub-part of ML4, according to the
lexicon used to translate queries.</p>
      <p>The column (JOC+ML4) combines the lexicons extracted from the JOC and ML4
corpora, as detailed in section 4.3. The bilingual runs correspond to English queries
2 Multilingual dictionary, available from ELRA, www.elra.info, comprising ca. 45000 English
entries
3 Bilingual English-French dictionary, comprising ca. 45000 English entries.
4 In fact a sub-part of it, comprising ca. 20 millions English tokens
translated in the corresponding target language (all these experiments, as well as the
following ones, are based on the vector-space model). As one can note, the use of
automatically derived bilingual lexicons significantly outperforms the use of existing
dictionaries on this collection.</p>
      <p>We are now going to review the methods we used for extracting bilingual lexicons
from parallel and comparable corpora.
4.1</p>
      <sec id="sec-4-1">
        <title>Bilingual lexicon extraction from parallel corpora</title>
        <p>
          Recent research has demonstrated that statistical alignment models can be highly
successful at extracting word correspondences from parallel corpora ([
          <xref ref-type="bibr" rid="ref13 ref14 ref4 ref5 ref8 ref9">4, 5, 8, 9, 13, 14</xref>
          ])
among others. All these works are based on the assumption that, once documents have
been aligned at the sentence level, the more two words from different languages
cooccur in aligned sentences, the more likely they are translations of each other. In the
present paper, we rely on the word-to-word translation lexicon obtained from parallel
corpora, following the method described in [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ], which can be summarized as follows.
        </p>
        <p>We first represent co-occurrences between words across translations by a matrix,
the rows of which represent the source language words, the columns the target language
words, and the elements of the matrix the expected alignment frequencies (EAFs) for
the words appearing in the corresponding row and column. Empty words are added in
both languages in order to deal with words with no equivalent in the other language.</p>
        <p>
          The estimation of the expected alignment frequency is based on the Iterative
Proportional Fitting Procedure (IPFP) presented in [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]. This iterative procedure updates
the current estimate of the EAF of source word with target word , using the
following two-stage equations:
        </p>
        <p>where and are the current estimates of the row and column marginals, is
a pair of aligned sentences containing words and , and and are the observed
frequencies of words and in . The initial estimates are the observed
frequencies of co-occurrences, obtained by considering each pair of aligned sentences and
by incrementing the alignment frequencies accordingly. The sequence of updates will
eventually converge and the EAFs are then normalized (by dividing each element
by the row marginal ), so as to yield probabilistic translation lexicons, in which each
source word is associated with a target word through a score. In the remainder of the
paper, we will use to denote the probability of selecting target word as translation
for source word , as given by this method.
4.2</p>
      </sec>
      <sec id="sec-4-2">
        <title>Bilingual lexicon extraction from comparable corpora</title>
        <p>
          Bilingual lexicon extraction from non-parallel but comparable corpora has been
studied by a number of researchers, [
          <xref ref-type="bibr" rid="ref19 ref20 ref22 ref23 ref7">19, 23, 22, 20, 7</xref>
          ] among others. Their work relies on
the assumption that if two words are mutual translations, then their more frequent
collocates (taken here in a very broad sense) are likely to be mutual translations as well.
Based on this assumption, a standard approach consists in building context vectors, for
each source and target word, which aim at capturing the most significant collocates.
The target context vectors are then translated using a general bilingual dictionary, and
compared with the source context vectors.
        </p>
        <p>Our implementation of this strategy relies on the following steps:
1. For each word , build a context vector by considering all the words occurring in
a window centered on , run through the corpus. Each word in the context vector
of is then weighted with a measure of its association with . However, in order
to ensure we make adequate use of the prior knowledge provided by the general
dictionary, we include in its context vector. Lastly, we have used here a window
of 5 words before and after , and retained the mutual information as the measure
of association.
2. The context vectors of the target words are then translated with our general
bilingual dictionary, leaving the weights unchanged (when several translations are
proposed by the dictionary, we consider all of them with the same weight)
3. The similarity of each source word , for each target word , is computed on the
basis of the cosine measure
4. The similarities are then normalized to yield a probabilistic translation lexicon,
.
4.3</p>
      </sec>
      <sec id="sec-4-3">
        <title>Model combination</title>
        <p>Because they contain different information, the comparable and parallel corpora yield
different translations that need be combined in order to obtain a complete translated
query. Such a combination should account for the fact that for some source words the
information provided by the comparable corpus is more reliable than the one provided
by the parallel one (as is the case when the source word is not present in the parallel
corpus), whereas for some other source words the situation is reversed. However,
because of time constraints, we were not able to adopt this strategy, and had to resort to
a simpler linear combination, in which the final vector representing the query in target
language is given by:
(2)
is a scalar representing the weight associated with the translation provided by the
parallel corpus. We optimized the value of on the queries corresponding to years
2000 to 2002.
4.4</p>
      </sec>
      <sec id="sec-4-4">
        <title>Multilingual merging</title>
        <p>Our strategy to merge results from different languages relies on the fact that if we use
“similar” translation matrices, and if the scoring method is identical for each language,
then one can directly merge the results from different languages. Using similar
translation matrices means that the length (as measured by the norm) of target queries should
be identical (since they all issue from the same English query). In order to ensure this,
we normalise each target query by its length ( ). Furthermore, to get an
equivalent, on the English collection, of the translation step used in the other languages, we
consider the English sub-collection to constitue a comparable corpus on its own, from
which we build a term-term co-occurrence matrix in exactly the same way as we built a
translation matrix in section 4.2 (the source and target languages being identical here).
This matrix is then used to expand English queries with most similar terms.
4.5</p>
      </sec>
      <sec id="sec-4-5">
        <title>Weighting schemes</title>
        <p>
          The results display in table 3 are obtained by translating queries with the
combination of the lexicons derived from JOC and ML4 as explained above. Despite the
important difference the two weighting schemes have on the monolingual collections (cf.
e.g. [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ]), we see here that the bilingual retrieval, followed by the multilingual merge,
flattens the difference to only ca. 2.5 points.
5
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Conclusion</title>
      <p>We have tested two main approaches to cross-language information retrieval based on
the exploitation of multilingual corpora to derive cross-lingual term-term
correspondences. The first approach makes use of parallel corpora to derive an interlingual
semantic representation of documents, using canonical correlation analysis. The second
approach aims at directly extracting bilingual lexicons, both from parallel and
comparable corpora, to be used for query translation. Our experiments show that the second
approach outperforms a standard approach using existing bilingual dictionaries for query
translation. We plan in the future to pursue the promising road of bilingual lexicon
extraction from comparable corpora.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgements</title>
      <p>This research was partially supported by the European Commission under the KerMIT
Project No. IST-2001-25431.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>F. R.</given-names>
            <surname>Bach</surname>
          </string-name>
          and
          <string-name>
            <given-names>M. I.</given-names>
            <surname>Jordan</surname>
          </string-name>
          .
          <article-title>Kernel indepedendent component analysis</article-title>
          .
          <source>Journal of Machine Learning Research</source>
          ,
          <volume>3</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>48</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>L.</given-names>
            <surname>Ballesteros</surname>
          </string-name>
          and
          <string-name>
            <given-names>B.W</given-names>
            <surname>Croft</surname>
          </string-name>
          .
          <article-title>Phrasal translation and query expansion techniques for crosslanguage information retrieval</article-title>
          .
          <source>In Proceedings of the 20th 20th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bishop</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Fienberg</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Holland. Discrete Multivariate</surname>
          </string-name>
          <article-title>Analysis</article-title>
          . MIT Press,
          <year>1975</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>P.</given-names>
            <surname>Brown</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. Della</given-names>
            <surname>Pietra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Della Pietra</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.L.</given-names>
            <surname>Mercer</surname>
          </string-name>
          .
          <article-title>The mathematics of statistical machine learning translation: Parameter estimation</article-title>
          .
          <source>Computational Linguistics</source>
          ,
          <volume>19</volume>
          (
          <issue>2</issue>
          ):
          <fpage>263</fpage>
          -
          <lpage>311</lpage>
          ,
          <year>1993</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>I.</given-names>
            <surname>Dagan</surname>
          </string-name>
          and
          <string-name>
            <surname>I. Itai.</surname>
          </string-name>
          <article-title>Word sense disambiguation using a second language monolingual corpus</article-title>
          .
          <source>Computational Linguistics</source>
          ,
          <volume>20</volume>
          (
          <issue>4</issue>
          ),
          <year>1994</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>M.W.</given-names>
            <surname>Davis</surname>
          </string-name>
          and
          <string-name>
            <given-names>W.C.</given-names>
            <surname>Ogden</surname>
          </string-name>
          . Quilt:
          <article-title>Implementing a large-scale cross-language text retrieval system</article-title>
          .
          <source>In Proceedings of the 20th 20th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>Pascale</given-names>
            <surname>Fung</surname>
          </string-name>
          .
          <article-title>A statistical view on bilingual lexicon extraction: From parallel corpora to non-parallel corpora</article-title>
          . In Jean Ve´ronis, editor,
          <source>Parallel Text Processing</source>
          ,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>W. A.</given-names>
            <surname>Gale</surname>
          </string-name>
          and
          <string-name>
            <given-names>K. W.</given-names>
            <surname>Church</surname>
          </string-name>
          .
          <article-title>A program for aligning sentences in bilingual corpora</article-title>
          .
          <source>In Meeting of the Association for Computational Linguistics</source>
          , pages
          <fpage>177</fpage>
          -
          <lpage>184</lpage>
          ,
          <year>1991</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>E.</given-names>
            <surname>Gaussier</surname>
          </string-name>
          .
          <article-title>Flow network models for word alignment and terminology extraction from bilingual corpora</article-title>
          .
          <source>In Proceedings of the joint 17th International Conference on Computational Linguistics and 26th Annual Meeting of the Association for Computational Linguistics</source>
          , pages
          <fpage>444</fpage>
          -
          <lpage>450</lpage>
          ,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10. E´ Gaussier,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hull</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Ait-Mokhtar</surname>
          </string-name>
          .
          <source>Parallel Text Processing Alignment</source>
          and
          <article-title>Use of Translation Corpora, chapter Term Alignment in Use: Machine-Aided Human Translation</article-title>
          . Kluwer Academic Publishers,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>Ulrich</given-names>
            <surname>Germann</surname>
          </string-name>
          .
          <article-title>Aligned Hansards of the 36th Parliament of Canada</article-title>
          . http://www.isi.edu/natural-language/download/hansard/,
          <year>2001</year>
          .
          <article-title>Release 2001-1a.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>F.C.</given-names>
            <surname>Gey</surname>
          </string-name>
          ,
          <string-name>
            <surname>V. Jiang H.</surname>
          </string-name>
          and
          <article-title>Petras, and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Chen</surname>
          </string-name>
          .
          <article-title>Cross-language retrieval for the clef collections - comparing multiple methods of retrieval</article-title>
          .
          <source>In Proceedings of the Cross-Lingual Evaluation Forum</source>
          ,
          <string-name>
            <surname>CLEF</surname>
          </string-name>
          <year>2000</year>
          .,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>D.</given-names>
            <surname>Hiemstra</surname>
          </string-name>
          .
          <article-title>Using statistical methods to create a bilingual dictionary</article-title>
          .
          <source>Master's thesis</source>
          , Universiteit Twente,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <given-names>David</given-names>
            <surname>Hull</surname>
          </string-name>
          .
          <article-title>Automating the construction of bilingual terminology lexicons</article-title>
          .
          <source>Terminology</source>
          ,
          <volume>4</volume>
          (
          <issue>2</issue>
          ),
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15. David Hull and
          <string-name>
            <given-names>Gregory</given-names>
            <surname>Grefenstette</surname>
          </string-name>
          .
          <article-title>Querying across languages: a dictionary-based apporach to multilingual information retrieval</article-title>
          .
          <source>In Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16. Pei Ling Lai and
          <string-name>
            <given-names>Colin</given-names>
            <surname>Fyfe</surname>
          </string-name>
          .
          <article-title>Kernel and nonlinear canonical correlation analysis</article-title>
          .
          <source>International Journal of Neural Systems</source>
          ,
          <volume>10</volume>
          (
          <issue>5</issue>
          ):
          <fpage>365</fpage>
          -
          <lpage>377</lpage>
          ,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <given-names>M.</given-names>
            <surname>Littman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dumais</surname>
          </string-name>
          , and
          <string-name>
            <given-names>K.</given-names>
            <surname>Landauer</surname>
          </string-name>
          .
          <article-title>Cross-Language Information Retrieval, chapter Automatic Cross-Language Information Retrieval Using Latent Semantic Indexing</article-title>
          .
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>J.-Y. Nie</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Simard</surname>
            ,
            <given-names>Isabelle P.</given-names>
          </string-name>
          , and Durand R.
          <article-title>Cross-language information retrieval based on parallel texts and automatic mining of parallel texts from the web</article-title>
          .
          <source>In Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval.</source>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <given-names>C.</given-names>
            <surname>Peters</surname>
          </string-name>
          and
          <string-name>
            <given-names>E.</given-names>
            <surname>Picchi</surname>
          </string-name>
          .
          <article-title>Capturing the comparable: A system for querying comparable text corpora</article-title>
          .
          <source>In JADT'95 - 3rd International Conference on Statistical Analysis of Textual Data</source>
          , pages
          <fpage>255</fpage>
          -
          <lpage>262</lpage>
          ,
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <given-names>R.</given-names>
            <surname>Rapp</surname>
          </string-name>
          .
          <article-title>Automatic identification of word translations from unrelated english and german corpora</article-title>
          .
          <source>In Proceedings of the European Association for Computational Linguistics</source>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <given-names>Jacques</given-names>
            <surname>Savoy</surname>
          </string-name>
          . Report on clef-2002
          <string-name>
            <surname>experiments:</surname>
          </string-name>
          <article-title>Combining multiple sources of evidence</article-title>
          .
          <source>In Proceedings of CLEF</source>
          <year>2002</year>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <given-names>I</given-names>
            <surname>Shahzad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Ohtake</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Masuyama</surname>
          </string-name>
          , and
          <string-name>
            <given-names>K.</given-names>
            <surname>Yamamoto</surname>
          </string-name>
          .
          <article-title>Identifying translations of compound nouns using non-aligned corpora</article-title>
          .
          <source>In Proceedings of the Workshop MAL'99</source>
          , pages pp.
          <fpage>108</fpage>
          -
          <lpage>113</lpage>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <given-names>K.</given-names>
            <surname>Tanaka</surname>
          </string-name>
          and
          <string-name>
            <given-names>Hideya</given-names>
            <surname>Iwasaki</surname>
          </string-name>
          .
          <article-title>Extraction of lexical translations from non-aligned corpora</article-title>
          .
          <source>In International Conference on Computational Linguistics, COLING'96</source>
          ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Alexei</surname>
            <given-names>Vinokourov</given-names>
          </string-name>
          , John Shawe-Taylor, and Nello Cristianini.
          <article-title>Inferring a semantic representation of text via cross-language correlation analysis</article-title>
          .
          <source>In Advances of Neural Information Processing Systems</source>
          <volume>15</volume>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>