<!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>Initial approaches on Cross-Lingual Information Retrieval using Statistical Machine Translation on User Queries</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Marta R. Costa-juss a`</string-name>
          <email>martarcj@ime.usp.br</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Christian Paz-Trillo</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Renata Wassermann</string-name>
          <email>renata@ime.usp.br</email>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Computer Science Department Institute of Mathematics and Statistics University of Sa ̃o Paulo</institution>
          ,
          <addr-line>Brazil Rua do Mata ̃o 1010, Sa ̃o Paulo, SP 05508-090</addr-line>
        </aff>
      </contrib-group>
      <fpage>25</fpage>
      <lpage>35</lpage>
      <abstract>
        <p>In this paper we propose a multilingual extension for OnAIR which is an ontology-aided information retrieval system applied to retrieve clips from a video collection. The multilingual extension basically involves allowing the user to search in several languages in a multilingual video collection. Particularly, the pair of languages we work in this paper are English and Portuguese. In order to perform query translation we use a statistical machine translation approach. Our experiments show that the multilingual system is capable of achieving almost the same quality of that obtained by the monolingual system. Resumo. Neste trabalho, propomos uma extens a˜o multilingue para OnAir que e´ um sistema de recuperac¸ a˜o de informac¸ a˜o auxiliado por uma ontologia. O sistema e´ usado para recuperar clips de uma colec¸ a˜o de v´ıdeos. A extens a˜o multilingue permite ao usu a´rio fazer buscas em duas l´ınguas em uma colec¸ a˜o de v´ıdeo multilingue. Particularmente, o par de l ´ınguas que trabalhamos neste artigo s a˜o Ingleˆs e Portugueˆs. Para realizar a convers a˜o de consulta, usamos uma abordagem estat´ıstica de traduc¸ a˜o. As nossas experieˆncias mostraram que o sistema multilingue e´ capaz de atingir quase a mesma qualidade do obtido pelo sistema monolingue.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>The information society is generating a vast quantity of multilingual information.
Recently, there is a growing interest in looking for information in digital videos. Generally,
the user can save time, by avoiding to browse through hours of video in order to find the
information he is looking for. Additionally, these videos may be in a foreign language.
Although he may be able to understand the foreign language, he may not be able to
formulate a query. This is the application we are focusing on in this paper in the context
of the OnAIR (Ontology-Aided Information Retrieval) system. OnAIR, started in 2003,
intended to allow users to look for information in video fragments through queries in
natural language. The idea is save the user from the time consuming experience of having to
browse through hours of video in order to find an answer for his questions.</p>
      <p>The main contribution of this paper is the experimentation of concatenating a
state-of-the-art SMT system together with an IR retrieval system that uses ontologies.
This concatenation has been done for the Brazilian-Portuguese/English language pair and
it can be easily be extended to other pair of languages.</p>
      <p>The remaining of this paper is organized as follows. Next section briefly explains
the related work in the area of Cross-language Information Retrieval. Section 3 describes
the OnAIR structure and architecture. Then, section 4 is dedicated to the OnAIR
crosslanguage extension. Finally, experiments and conclusions are reported in sections 5 and
6, respectively.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        The multilingual extension of OnAIR is basically a challenge of cross-language
information retrieval (CLIR). Given a query in a source language, the aim of CLIR is retrieving
related documents in a target language.
        <xref ref-type="bibr" rid="ref19">(Oard and Diekema 1998)</xref>
        identified four types of
strategies for matching a query with a set of documents in the context of CLIR by:
cognate matching, document translation, query translation or interlingua techniques. From
these techniques the most used are the query translation and the interlingua techniques.
      </p>
      <p>
        Query translation methods translate user queries to the language that the
documents are written. It is the most popular approach in CLIR experimental systems due
to its tractability and convenience. CLIR through query translation methods has been
mainly faced by using dictionary-based (i.e. using machine-readable dictionaries, MRD),
machine translation (MT) and/or parallel texts techniques
        <xref ref-type="bibr" rid="ref6">(Chen and Bao 2009)</xref>
        . Among
the different machine translation techniques, we have the corpus-based techniques such
as statistical or example-based (Way and Gough 2005) and the rule-based techniques
        <xref ref-type="bibr" rid="ref11">(Forcada 2006)</xref>
        . In this paper we are using one of the most popular approaches
nowadays which is the standard phrase-based statistical machine translation (SMT) approach
        <xref ref-type="bibr" rid="ref16 ref17">(Koehn et al. 2007a)</xref>
        .
      </p>
      <p>
        Interlingua methods translate both documents and queries into a third
representation. The approach aims at associating related textual contents among different
languages by means of language-independent semantic representations. The
conventional interlingua-based CLIR approach uses latent semantic indexing (LSI) for
constructing a multilingual vector-space representation of a given parallel document
collection
        <xref ref-type="bibr" rid="ref10 ref3 ref7 ref8">(Deerwester et al. 1990; Dumais et al. 1996; Chew and Abdelali 2007)</xref>
        . Such a
representation is known to be noisy and sparse. That is why in order to obtain more efficient
vector-space representations, space reduction techniques such as latent semantic
indexing and probabilistic latent semantic indexing
        <xref ref-type="bibr" rid="ref13">(Hofmann 1999)</xref>
        are applied. The new
reduced-space dimensions are supposed to capture semantic relations among the words
and the documents in the collection. Recent approaches have achieved interesting results
by using regression canonical correlation analysis (an extension of canonical correlation
analysis) where one of the dimensions is fixed and demonstrate how it can be solved
efficiently (Rupnik and Shawe-Taylor 2008).
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. The OnAir system</title>
      <p>
        OnAIR is in essence an information retrieval system which has been described in detail
in previous studies such as
        <xref ref-type="bibr" rid="ref15 ref24">(Paz-Trillo et al. 2005)</xref>
        . In this section we briefly describe the
most relevant characteristics of the system. First, we show how the information retrieval
is done and, second, we show how a monolingual ontology is used for query expansion.
      </p>
    </sec>
    <sec id="sec-4">
      <title>3.1. Information Retrieval</title>
      <p>
        OnAIR relies on the vector space model
        <xref ref-type="bibr" rid="ref2">(Baeza-Yates and Ribeiro-Neto 1999)</xref>
        for
information retrieval. It was built to receive videos and keywords or their transcriptions, with
timeline markers, as input, and to allow the users to query for video excerpts using natural
language. When a user query is presented, OnAIR returns a list of video excerpts that best
answer the user query.
      </p>
      <p>The video transcriptions are pre-processed, using traditional IR techniques:
stemming and stopword removal, then the vector space model is used for indexing and
retrieving. As usual in traditional IR systems, some additional techniques are needed to avoid
natural language difficulties like Polysemy and Synonymy.</p>
    </sec>
    <sec id="sec-5">
      <title>3.2. Ontology description</title>
      <p>
        Ontologies are defined in general as an explicit specification for a conceptualization
        <xref ref-type="bibr" rid="ref12">(Gruber 1993)</xref>
        . As mainly used for Information Retrieval it can be seen as a set of
concepts related by hierarchies and other kind of properties in a specific domain
        <xref ref-type="bibr" rid="ref9">(Ding 2001)</xref>
        .
Ontologies have been commonly used in IR through query expansion and conceptual
distance measures
        <xref ref-type="bibr" rid="ref15 ref24">(Paz-Trillo et al. 2005)</xref>
        .
      </p>
      <p>A domain ontology related to the topics from the videos is needed to be able to do
the query expansion. By definition, query expansion is the process of reformulating a seed
query to improve retrieval performance in information retrieval operations. In particular,
the domain ontology is used to measure the conceptual distance among seed query terms
and new ones.</p>
    </sec>
    <sec id="sec-6">
      <title>4. Cross-lingual extension</title>
      <p>In general, a statistical machine translation system relies on the translation of a source
language sentence s into a target language sentence tˆ. Among all possible target language
sentences t we choose the one with the highest probability, as show in equation (1):
tˆ = arg max [P (t|s)]</p>
      <p>t
= arg max [P (t) P (s|t)]
t
(1)
(2)</p>
      <p>
        The probability decomposition shown in equation (2) is based on Bayes’
theorem and it is known as the noisy channel approach to statistical machine translation
        <xref ref-type="bibr" rid="ref3 ref8">(Brown et al. 1990)</xref>
        . It allows to model independently the target language model P (t)
and the source translation model P (s|t). The basic idea of this approach is to segment
the given source sentence s into segments of one or more words, then each source
segment is translated and the target sentence is composed from these segment translations.
On the one hand, the translation model weights how likely words in the foreign language
are translation of words in the source language; the language model, on the other hand,
measures the fluency of hypothesis t. The search process is represented as the arg max
operation.
      </p>
      <p>
        The translation model in the phrase-based approach
        <xref ref-type="bibr" rid="ref18">(Koehn et al. 2003)</xref>
        is
composed of phrases. A phrase is a pair of m source words and n target words extracted from
a parallel sentence that belongs to a bilingual corpus. The parallel sentences have
previously been aligned at the word level
        <xref ref-type="bibr" rid="ref4">(Brown et al. 1993)</xref>
        . Then, given a parallel sentence
aligned at the word level, phrases are extracted following the next criteria: we consider
the words that are consecutive in both source and target sides and which are consistent
with the word alignment. We consider a phrase is consistent with the word alignment if
no word inside the phrase is aligned with one word outside the phrase. Finally, phrase
translation probabilities are estimated as relative frequencies (Zens et al. 2002).
      </p>
      <p>
        A language model assigns a probability to each target sentence. Standard
language models are computed following the n-gram strategy, which considers sequences of
n words. In order to compute the probability of an n-gram, it is assumed that the
probability of observing the ith word in the context history of the preceding i-1 words can be
approximated by the probability of observing it in the shortened context history of the
preceding n-1 words. The main problem with this modeling is that it assigns probability
zero to strings that have never seen before. One way to solve this problem is assigning
non-zero probabilities to sentences they have never seen before by means of smoothing
techniques
        <xref ref-type="bibr" rid="ref14">(Kneser and Ney 1995)</xref>
        .
      </p>
      <p>
        A variation of the so-called noisy channel approach is the log-linear model
        <xref ref-type="bibr" rid="ref21">(Och and Ney 2002)</xref>
        . It allows using several models or so-called features and to weight
them independently as can be seen in equation (3):
tˆ = arg max
t
" M
      </p>
      <p>X λmhm(s, t)</p>
      <p>#
m=1
(3)</p>
      <p>This equation should be interpreted as a maximum-entropy framework and as a
generalization of equation (2) (Zens et al. 2002).</p>
      <p>
        Most common additional features that are used in the maximum-entropy
frameword (in addition to the standard translation and language model) are the lexical models,
the word bonus and the reordering model. The lexical models are particularly useful in
cases where the translation model may be sparse. For example, for phrases which may
have appeared few times the translation model probability may not be well estimated.
Then, the lexical models provide a probability among words
        <xref ref-type="bibr" rid="ref4">(Brown et al. 1993)</xref>
        and they
can be computed in both directions source-to-target and target-to-source. The word bonus
is used to compensate the language model which benefits shorter outputs. The
reordering model is used to provide reordering between phrases. For example, the lexicalized
reordering model (Tillman 2004) classifies phrases by the movement they made relative
to the previous used phrase, i.e., for each phrase the model learns how likely it is
followed by the previous phrase (monotonous), swapped with it (swap) or not connected at
all (discontinuous).
      </p>
      <p>
        The different features or models are optimized in the decoder following the
minimum error rate procedure
        <xref ref-type="bibr" rid="ref20 ref22">(Och 2003)</xref>
        . This algorithm searches for weights minimizing
a given error measure, or, equivalently, maximizing a given translation metric. This
algorithm enables the weights to be optimized so that the decoder produces the best
translations (according to some automatic metric and one or more references) on a development
set of parallel sentences.
      </p>
    </sec>
    <sec id="sec-7">
      <title>5. Evaluation Framework</title>
      <p>This section introduces the details of the evaluation framework. We report the translation
and the information retrieval system details including corpus statistics, a description of
how we built the systems and the evaluation details.</p>
    </sec>
    <sec id="sec-8">
      <title>5.1. SMT data</title>
      <p>
        The parallel corpus used to train the SMT system is taken from the
Brazilian-PortugueseEnglish bilingual collections of the online issue of the scientific news Brazilian magazine
REVISTA PESQUISA FAPESP
        <xref ref-type="bibr" rid="ref1">(Aziz and Specia 2011)</xref>
        . See statistics in Table 1.
      </p>
      <sec id="sec-8-1">
        <title>Train</title>
      </sec>
      <sec id="sec-8-2">
        <title>Test</title>
      </sec>
      <sec id="sec-8-3">
        <title>Development</title>
      </sec>
      <sec id="sec-8-4">
        <title>Sentences</title>
        <p>Words
Vocabulary
Sentences</p>
        <p>Words
Vocabulary
Sentences</p>
        <p>
          Words
Vocabulary
5.2. IR data
For testing the information retrieval system in Portuguese-Brazilian we used a video
collection compiled from interviews with Ana Teixeira, a Brazilian artist. The interviews
were made by Paula P. Braga, the domain expert and there have been used in previous
studies as
          <xref ref-type="bibr" rid="ref15 ref24">(Paz-Trillo et al. 2005)</xref>
          . The interview was developed in the domain of
contemporary art and the system uses a domain ontology to expand queries with related terms.
To test the system, a battery of queries was synthesized both for English and
BrazilianPortuguese. Statistics of these queries and the corresponding documents for retrieving are
shown in Table 2.
        </p>
      </sec>
    </sec>
    <sec id="sec-9">
      <title>5.3. Translation system</title>
      <p>In this paper, we use a system that combines the translation and the language model
together with the following additional feature functions: the word and the phrase bonus
and the source-to-target and target-to-source lexicon model and the reordering model. All
these features have been described in section 4.</p>
      <p>
        Our translation system was built using MOSES
        <xref ref-type="bibr" rid="ref16 ref17">(Koehn et al. 2007b)</xref>
        . We used the
default MOSES parameters. Word alignment (built with the standard software GIZA++
        <xref ref-type="bibr" rid="ref20 ref22">(Och and Ney 2003)</xref>
        ) was performed in both direction source-to-target and
target-tosource. These word alignments were merged by using the so-called symmetrization of
the grow-diagonal-final-andwhich is a sophisticated extension of the standard union
operation
        <xref ref-type="bibr" rid="ref15 ref24">(Koehn et al. 2005)</xref>
        . For the translation model, we used phrases up to length 10.
Phrase probability is estimated including relative frequencies in both directions
(sourceto-target and target-to-source), lexical weights and phrase bonus. The lexicalized
reordering (Tillman 2004) is used to provide reordering accross sentences. The language model
used a 5-gram with Kneser-Ney smoothing. Finally, the word bonus was used to
compensate the preference of the language model for shorter outputs. All these different features
were combined in equation (3) and the optimization was done using MERT software
        <xref ref-type="bibr" rid="ref20 ref22">(Och 2003)</xref>
        .
      </p>
      <p>
        In order to evaluate the translation quality, we used BLEU (Bilingual Evaluation
Understudy)
        <xref ref-type="bibr" rid="ref23">(Papineni et al. 2001)</xref>
        which is one of the most popular SMT automatic
evaluation metrics. BLEU uses a modified form of precision to compare a candidate
translation against multiple reference translations. BLEU’s output is a number between 0 and
1. This value indicates how similar the candidate translation and reference texts are, with
values closer to 1 representing more similar texts.
      </p>
      <p>We evaluated the SMT quality using in-domain and out-domain tests. The former
is the one corresponding to the REVISTA PESQUISA FAPESP as shown in Table 1.
The out-domain test corresponds to the queries used to test the complete CLIR system as
shown in Table 2. Table 3 shows the results in terms of BLEU of the translation system
when evaluated in-domain and out-domain.</p>
      <sec id="sec-9-1">
        <title>Test In-domain Out-domain</title>
        <p>EN-&gt;PT-BR
0.3649
0.1506</p>
        <p>
          Coherently with international evaluations such as WMT
          <xref ref-type="bibr" rid="ref5">(Callison-Burch et al. 2011)</xref>
          , the out-domain test set has a lower performance than
the in-domain test set.
        </p>
      </sec>
    </sec>
    <sec id="sec-10">
      <title>5.4. Comparing IR and CLIR system’s performance</title>
      <p>
        We performed the following experiments: two experiments using a monolingual
information retrieval, recovered from previous publications
        <xref ref-type="bibr" rid="ref15 ref24">(Paz-Trillo et al. 2005)</xref>
        , and one using
a cross-lingual information system. We describe the corresponding systems as follows:
1. IR system: the original system analyzed was the system described in section
3, with two configurations: mono-keywords, which uses only the keywords
for retrieval and; mono-kw-fulltext-05 which uses the results of retrieval using
keywords and transcriptions, the best configuration for OnAIR as described in
        <xref ref-type="bibr" rid="ref15 ref24">(Paz-Trillo et al. 2005)</xref>
        2. CLIR system (smt-kw-fulltext-05): this system is the concatenation of the
statistical machine translation system described in the previous section and the
information retrieval system from the point above in this list.
      </p>
      <p>Figure 1 shows the results of the f-measure run over the 50 queries analyzed in
our experiments in the three configurations presented above and the BLEU measure for
the translation of each query.</p>
      <p>Surprisingly, experiments show that the CLIR system, for specific queries, is
capable of outperforming the IR system. For these queries, the translation system uses a
more adequate word, which means that it would be possible to use machine translation to
perform query expansion. It would be interesting to built the CLIR system with the n-best
translations.</p>
      <p>Figure 2 shows the f-measure in average for all systems that we experimented.
Here, we observe that the f-measure of with respect to the CLIR system
(smt-kw-fulltext05) is slightly worst than its comparable IR system (mono-kw-fulltext-05). However, in
average, the f-measure using SMT is not highly affected when compared to the best
monolingual result.</p>
      <p>Finally, Figure 3 shows some translation examples. It shows the input to the CLIR
system (smt-kw-fulltext-05), the corresponding translation and the corresponding
reference (i.e. the input of the IR system). The two first examples report cases where the CLIR
system performs worse than the IR system (mono-kw-fulltext-05) in terms of f-measure.
The second two examples report cases where the CLIR system performs better than the
IR system in terms of f-measure. Coherently, in the first case, the translation shows a
poorer quality than in the second case.</p>
    </sec>
    <sec id="sec-11">
      <title>6. Conclusions and future work</title>
      <p>This paper has shown an ongoing work that generates a cross-lingual extension for the
OnAIR system, which is in essence an information retrieval system using ontologies to
expand queries. The cross-lingual extension has been done using a state-of-the-art
statistical machine translation system. Experiments show that the best configuration for the IR
system uses the results of retrieval using keywords and transcriptions. For the CLIR
system, we can get competitive results using a state-of-the-art statistical machine translation
system.</p>
      <p>As further work, we want to explore different linguistic and statistical techniques
(focusing on morphology and semantics) to be introduced in the state-of-the-art statistical
MT system in order to correctly translate queries which are out-of-domain of the training
corpus. Also it would be interesting to use MT as a query expansion method.
INPUT: How did you become an artist?
TRANSLATION: Como o senhor se um artista?
REFERENCE: Como voceˆ virou artista
INPUT: Do you make only interventions or also paintings, sculpture, etc?
TRANSLATION: O senhor faz apenas intervenc¸ o˜es ou tambe´m pinturas, escultura etc?
REFERENCE: Voceˆ s o´ faz intervenc¸ o˜es ou faz tambe´m pintura, escultura, etc?
INPUT: I loved his work.</p>
      <p>TRANSLATION: Adorei seu trabalho.</p>
      <p>REFERENCE: Adorei seu trabalho.</p>
      <p>INPUT: Have you ever exposed abroad?
TRANSLATION: O senhor ja´ exposta no exterior?
REFERENCE: Voceˆ ja´ exp oˆs no exterior?</p>
    </sec>
    <sec id="sec-12">
      <title>7. Acknowledgements</title>
      <p>This work has been supported by FAPESP through the OnAir project (2010/19111-9) and
the visiting researcher program (2012/02131-2), and by the Spanish Ministry of Economy
and Competitiveness through the BUCEADOR project (TEC2009-14094-C04-01) and
the Juan de la Cierva fellowship program.
[Rupnik and Shawe-Taylor 2008] Rupnik, J. and Shawe-Taylor, J. (2008).
Multiview canonical correlation analysis and cross-lingual information retrieval. In
http://videolectures.net/lms08 rupnik rcca/.
[Tillman 2004] Tillman, C. (2004). A Block Orientation Model for Statistical Machine</p>
      <p>Translation. In HLT-NAACL.
[Way and Gough 2005] Way, A. and Gough, N. (2005). Comparing example-based and
statistical machine translation. Natural Language Engineering, 11(3):295–309.
[Zens et al. 2002] Zens, R., Och, F., and Ney, H. (2002). Phrase-based statistical machine
translation. In Verlag, S., editor, Proc. German Conference on Artificial Intelligence
(KI).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <source>[Aziz and Specia</source>
          <year>2011</year>
          ]
          <string-name>
            <surname>Aziz</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Specia</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          (
          <year>2011</year>
          ).
          <article-title>Fully automatic compilation of a Portuguese-English parallel corpus for statistical machine translation</article-title>
          .
          <source>In STIL</source>
          <year>2011</year>
          ,
          <article-title>Cuiaba´</article-title>
          , MT.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [
          <string-name>
            <surname>Baeza-Yates and</surname>
          </string-name>
          Ribeiro-Neto 1999]
          <article-title>Baeza-</article-title>
          <string-name>
            <surname>Yates</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Ribeiro-Neto</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          (
          <year>1999</year>
          ).
          <article-title>Modern Information Retrieval</article-title>
          . Addison Wesley Longman.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [Brown et al. 1990] Brown,
          <string-name>
            <given-names>P. F.</given-names>
            ,
            <surname>Cocke</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Della</given-names>
            <surname>Pietra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. A.</given-names>
            ,
            <surname>Della Pietra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. J.</given-names>
            ,
            <surname>Jelinek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>Lafferty</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. D.</given-names>
            ,
            <surname>Mercer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. L.</given-names>
            , and
            <surname>Roossin</surname>
          </string-name>
          ,
          <string-name>
            <surname>P. S.</surname>
          </string-name>
          (
          <year>1990</year>
          ).
          <article-title>A Statistical Approach to Machine Translation</article-title>
          .
          <source>Computational Linguistics</source>
          ,
          <volume>16</volume>
          (
          <issue>2</issue>
          ):
          <fpage>79</fpage>
          -
          <lpage>85</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [Brown et al. 1993] Brown,
          <string-name>
            <given-names>P. F.</given-names>
            ,
            <surname>Della Pietra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. A.</given-names>
            ,
            <surname>Della Pietra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. J.</given-names>
            , and
            <surname>Mercer</surname>
          </string-name>
          ,
          <string-name>
            <surname>R. L.</surname>
          </string-name>
          (
          <year>1993</year>
          ).
          <article-title>The mathematics of statistical machine translation: Parameter estimation</article-title>
          .
          <source>Computational Linguistics</source>
          ,
          <volume>19</volume>
          (
          <issue>2</issue>
          ):
          <fpage>263</fpage>
          -
          <lpage>311</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [
          <string-name>
            <surname>Callison-Burch</surname>
          </string-name>
          et al. 2011]
          <article-title>Callison-</article-title>
          <string-name>
            <surname>Burch</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koehn</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Monz</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Zaidan</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          (
          <year>2011</year>
          ).
          <article-title>Findings of the 2011 workshop on statistical machine translation</article-title>
          .
          <source>In Proceedings of the Sixth Workshop on Statistical Machine Translation</source>
          , pages
          <fpage>22</fpage>
          -
          <lpage>64</lpage>
          , Edinburgh, Scotland.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <source>[Chen and Bao</source>
          <year>2009</year>
          ]
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Bao</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          (
          <year>2009</year>
          ).
          <article-title>Cross-language search: The case of google language tools</article-title>
          .
          <source>First Monday</source>
          ,
          <volume>14</volume>
          (
          <issue>3</issue>
          -
          <fpage>2</fpage>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <source>[Chew and Abdelali</source>
          <year>2007</year>
          ] Chew,
          <string-name>
            <given-names>P.</given-names>
            and
            <surname>Abdelali</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          (
          <year>2007</year>
          ).
          <article-title>Benefits of the passively parallel rosetta stone? Cross-Language information retrieval with over 30 languages</article-title>
          .
          <source>In Proc of the 45th Annual Meeting of the Association for Computational Linguistics</source>
          , volume
          <volume>45</volume>
          , page 872.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [Deerwester et al. 1990]
          <string-name>
            <surname>Deerwester</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dumais</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Furnas</surname>
            ,
            <given-names>G. W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Landauer</surname>
            ,
            <given-names>T. K.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Harshman</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          (
          <year>1990</year>
          ).
          <article-title>Indexing by latent semantic analysis</article-title>
          .
          <source>Journal of the American Society for Information Science</source>
          ,
          <volume>41</volume>
          (
          <issue>6</issue>
          ):
          <fpage>391</fpage>
          -
          <lpage>407</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [Ding 2001] Ding,
          <string-name>
            <surname>Y.</surname>
          </string-name>
          (
          <year>2001</year>
          ).
          <article-title>Ir and ai: The role of ontology</article-title>
          . In International Conference of Asian Digital Libraries.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [Dumais et al. 1996]
          <string-name>
            <surname>Dumais</surname>
            ,
            <given-names>S. T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Landauer</surname>
            ,
            <given-names>T. K.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Littman</surname>
            ,
            <given-names>M. L.</given-names>
          </string-name>
          (
          <year>1996</year>
          ).
          <article-title>Automatic cross-linguistic information retrieval using latent semantic indexing</article-title>
          .
          <source>In SIGIR96 Workshop on Cross-Linguistic Information Retrieval.</source>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [Forcada 2006] Forcada,
          <string-name>
            <surname>M. L.</surname>
          </string-name>
          (
          <year>2006</year>
          ).
          <article-title>Open-source machine translation: an opportunity for minor languages</article-title>
          .
          <source>In Strategies for developing machine translation for minority languages (5th SALTMIL workshop on Minority Languages).</source>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <source>[Gruber</source>
          <year>1993</year>
          ] Gruber,
          <string-name>
            <surname>T. R.</surname>
          </string-name>
          (
          <year>1993</year>
          ).
          <article-title>A translation approach to portable ontologies</article-title>
          .
          <source>Knowledge Acquisition</source>
          ,
          <volume>5</volume>
          (
          <issue>2</issue>
          ):
          <fpage>199</fpage>
          -
          <lpage>220</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [Hofmann 1999] Hofmann,
          <string-name>
            <surname>T.</surname>
          </string-name>
          (
          <year>1999</year>
          ).
          <article-title>Probabilistic latent semantic analysis</article-title>
          .
          <source>In Proceedings of Uncertainty in Artificial Intelligence, UAI99</source>
          , pages
          <fpage>289</fpage>
          -
          <lpage>296</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <source>[Kneser and Ney</source>
          <year>1995</year>
          ] Kneser,
          <string-name>
            <given-names>R.</given-names>
            and
            <surname>Ney</surname>
          </string-name>
          ,
          <string-name>
            <surname>H.</surname>
          </string-name>
          (
          <year>1995</year>
          ).
          <article-title>Improved backing-off for n-gram language modeling</article-title>
          .
          <source>In IEEE Inte. Conf. on Acoustics, Speech and Signal Processing</source>
          , pages
          <fpage>49</fpage>
          -
          <lpage>52</lpage>
          , Detroit, MI.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [Koehn et al. 2005] Koehn,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Axelrod</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Mayne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. B.</given-names>
            ,
            <surname>Callison-Burch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Osborne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            , and
            <surname>Talbot</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.</surname>
          </string-name>
          (
          <year>2005</year>
          ).
          <article-title>Edinburgh system description for the 2005 IWSLT speech translation evaluation</article-title>
          .
          <source>In Proceedings of the Int. Workshop on Spoken Language Translation (IWSLT'05)</source>
          , Pittsburg, USA.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [Koehn et al. 2007a]
          <string-name>
            <surname>Koehn</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hoang</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Birch</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Callison-Burch</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Federico</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bertoldi</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cowan</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shen</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moran</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zens</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dyer</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bojar</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Constantin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Herbst</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          (
          <year>2007a</year>
          ).
          <article-title>Moses: Open source toolkit for statistical machine translation</article-title>
          .
          <source>In Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics (ACL'07)</source>
          , pages
          <fpage>177</fpage>
          -
          <lpage>180</lpage>
          , Prague, Czech Republic.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [Koehn et al. 2007b]
          <string-name>
            <surname>Koehn</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hoang</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Birch</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Callison-Burch</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Federico</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bertoldi</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cowan</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shen</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moran</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zens</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dyer</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bojar</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Constantin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Herbst</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          (
          <year>2007b</year>
          ).
          <article-title>Moses: Open source toolkit for statistical machine translation</article-title>
          .
          <source>In Proc. of the ACL</source>
          , pages
          <fpage>177</fpage>
          -
          <lpage>180</lpage>
          , Prague, Czech Republic.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [Koehn et al. 2003] Koehn,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Och</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            , and
            <surname>Marcu</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.</surname>
          </string-name>
          (
          <year>2003</year>
          ).
          <article-title>Statistical Phrase-Based Translation</article-title>
          .
          <source>In Proc. of the 41th Annual Meeting of the Association for Computational Linguistics.</source>
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          <source>[Oard and Diekema</source>
          <year>1998</year>
          ]
          <string-name>
            <surname>Oard</surname>
            ,
            <given-names>D. W.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Diekema</surname>
            ,
            <given-names>A. R.</given-names>
          </string-name>
          (
          <year>1998</year>
          ).
          <article-title>Cross-Language information retrieval</article-title>
          .
          <source>Annual Review of Information Science and Technology (ARIST)</source>
          ,
          <volume>33</volume>
          :
          <fpage>223</fpage>
          -
          <lpage>256</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [Och 2003]
          <string-name>
            <surname>Och</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          (
          <year>2003</year>
          ).
          <article-title>Minimum Error Rate Training In Statistical Machine Translation</article-title>
          .
          <source>In Proc. of the 41th Annual Meeting of the Association for Computational Linguistics</source>
          , pages
          <fpage>160</fpage>
          -
          <lpage>167</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          <source>[Och and Ney</source>
          <year>2002</year>
          ]
          <string-name>
            <surname>Och</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Ney</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          (
          <year>2002</year>
          ).
          <article-title>Dicriminative training and maximum entropy models for statistical machine translation</article-title>
          .
          <source>In Proc. of the 40th Annual Meeting of the Association for Computational Linguistics</source>
          , pages
          <fpage>295</fpage>
          -
          <lpage>302</lpage>
          , Philadelphia, PA.
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          <source>[Och and Ney</source>
          <year>2003</year>
          ]
          <string-name>
            <surname>Och</surname>
            ,
            <given-names>F. J.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Ney</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          (
          <year>2003</year>
          ).
          <article-title>A systematic comparison of various statistical alignment models</article-title>
          .
          <source>Computational Linguistics</source>
          ,
          <volume>29</volume>
          (
          <issue>1</issue>
          ):
          <fpage>19</fpage>
          -
          <lpage>51</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [Papineni et al. 2001]
          <string-name>
            <surname>Papineni</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roukos</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ward</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Zhu</surname>
          </string-name>
          , W.-J. (
          <year>2001</year>
          ).
          <article-title>BLEU: A Method for Automatic Evaluation of Machine Translation</article-title>
          .
          <source>IBM Research Report, RC22176.</source>
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [
          <string-name>
            <surname>Paz-Trillo</surname>
          </string-name>
          et al. 2005]
          <article-title>Paz-</article-title>
          <string-name>
            <surname>Trillo</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wassermann</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Braga</surname>
            ,
            <given-names>P. P.</given-names>
          </string-name>
          (
          <year>2005</year>
          ).
          <article-title>An information retrieval application using ontologies</article-title>
          .
          <source>J. Braz. Comp. Soc.</source>
          ,
          <volume>11</volume>
          (
          <issue>2</issue>
          ):
          <fpage>17</fpage>
          -
          <lpage>31</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>