<!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>CLEF-2006 CL-SR at Maryland: English and Czech</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="editor">
          <string-name>Speech Retrieval, Cross-Language Information Retrieval, Statistical Translation</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Douglas W. Oard College of Information Studies and Institute for Advanced Computer Studies University of Maryland</institution>
          ,
          <addr-line>College Park, MD 20740</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Jianqiang Wang Department of Library and Information Studies State University of New York at Bu®alo</institution>
          ,
          <addr-line>Bu®alo, NY 14260</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The University of Maryland participated in the English and Czech tasks. For English, one monolingual run using only ¯elds based on fully automatic transcription (the required condition) and one (otherwise identical) cross-language run using French queries were o±cially scored. Three contrastive runs in which manually generated metadata ¯elds in the English collection were indexed were also o±cially scored to explore the applicability of recently developed \meaning matching" approaches to cross-language retrieval of manually indexed interviews. Statistical translation models trained on European Parliament proceedings were found to be poorly matched to this task, yielding 38% and 44% of monolingual mean average precision for indexing based on automatic transcription and manually generated metadata, respectively. Weighted use of alternative translations yielded an apparent (but not statistically signi¯cant) 7% improvement over one-best translation when bi-directional meaning matching techniques were employed. Results for Czech were not informative in this ¯rst year of that task, perhaps because no accommodations were made for the unique characteristics of Czech morphology.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        speech [
        <xref ref-type="bibr" rid="ref2 ref4">2, 4</xref>
        ]. In this year's CLEF CL-SR track, ASR text with lower word error rate (hence,
better recognition accuracy) was provided for the same set of segmented English interviews used
in last year's CL-SR track. Therefore, one of our goals was to determine the degree to which
improved ASR accuracy could measurably improve retrieval e®ectiveness.
      </p>
      <p>This year's track also introduced a new task, searching unsegmented Czech interviews. Unlike
more traditional retrieval tasks, the objective in this case was to ¯nd points in the interviews that
mark the beginning of relevant segments (i.e., points at which a searcher might wish to begin
replay). A new evaluation metric, Generalized Average Precision (GAP), was de¯ned to evaluate
system performance on this task. The GAP measure takes into account the distance between each
system-suggested start time in a ranked list and the closest start time found by an assessor|the
greater the time between the two points, the lower the contribution of that match to a system
score. A more detailed description of GAP and details of how it is computed can be found in the
track overview paper. In this study, we were interested in evaluating retrieval based on overlapping
passages, a retrieval techniques that has proven to be useful in more traditional document retrieval
settings, while hopefully also gaining some insight into the suitability of the new evaluation metric.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Techniques</title>
      <p>In this section, we brie°y describe the techniques that we used in our study.
2.1</p>
      <sec id="sec-2-1">
        <title>Combining Evidence</title>
        <p>Both test collections provide several types of data that are associated with the information to
be retrieved, so we tried di®erent pre-indexing combinations of that data. For the English test
collection, we combined the ASR text generated with the 2004 system and the ASR text generated
with the 2006 system, and we compared the result with that obtained by indexing each alone.
Our expectation was that the two ASR engines could produce di®erent errors, and that combining
their results might therefore yield better retrieval e®ectiveness. Thesaurus terms generated
automatically using a kNN classi¯er o®er some measure of vocabulary expansion, so we added them
to the ASR text combination as well.</p>
        <p>The English test collection also contains a rich set of metadata that was produced by human
indexers. Speci¯cally, a set of (on average, ¯ve) thesaurus terms were manually assigned, and a
three-sentence summary was written for each segment. In addition, the ¯rst names of persons that
were mentioned in each segment are available, even if the name itself was not stated. We combined
all three types of human-generated metadata to create an index for a contrastive condition.</p>
        <p>The Czech document collection contains, in addition to ASR text, manually assigned English
thesaurus terms, automatic translations of those terms into Czech, English thesaurus terms that
were generated automatically using a kNN classi¯er that was trained on English segments, and
automatic translations of those thesaurus terms into Czech. We tried two ways of combining
this data. Czech translations of the automatically generated thesaurus terms were combined with
Czech ASR text to produce the required automatic run. We also combined all available keywords
(automatic and manual, English and Czech) with the ASR text, hoping that some proper names
in English might match proper names in Czech.
2.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Pruning Bidirectional Translations for Cross-language Retrieval</title>
        <p>
          In our previous study, we found that using several translation alternatives generated from
bidirectional statistical translation could signi¯cantly outperform techniques that utilize only the most
probable translation, but that using all possible translation alternatives was harmful because
statistical techniques generate a large number of very unlikely translations [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. The usual process
for statistically deriving translation models is asymmetric, so we produce an initial bidirectional
model by multiplying the translation probabilities between source words and target words from
models trained separately in both directions and then renormalizing. This has the e®ect of driving
CL-SR?
doc ¯elds
the modeled probabilities for translation mappings that are not well supported in both directions
to relatively low values. Synonymy knowledge (in this case, from round trip translation using
cascaded unidirectional mappings) is then used to aggregate probability mass that would otherwise
be somewhat eclectically divided across translation pairings that actually share similar meanings.
To prune the resulting translations, document-language synonym sets that share the meaning of
a query word are then arranged in decreasing order of modeled translation probability and a
cumulative probability threshold is used to truncate that list. In our earlier study, we found that
a cumulative probability threshold of 0.9 typically results in near-peak cross-language retrieval
e®ectiveness. Therefore, in this study, we tried two conditions: one-best translation (a threshold
of zero) and multiple alternatives with a threshold of 0.9.
        </p>
        <p>
          We used the same bilingual corpus that we used in last year's experiment. Speci¯cally, to
produce a statistical translation table from French to English, we used the freely available GIZA++
toolkit [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]1 to train translation models with the Europarl parallel corpus [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. Europarl contains
677,913 automatically aligned sentence pairs in English and French from the European Parliament.
We stripped accents from every character and ¯ltered out implausible sentence alignments by
eliminating sentence pairs that had a token ratio either smaller than 0.2 or larger than 5; that
resulted in 672,247 sentence pairs that were actually used. We started with 10 IBM Model 1
iterations, followed by 5 Hidden Markov Model (HMM) iterations, and ending with 5 IBM Model
4 iterations. The result is a a three-column table that speci¯es, for each French-English word pair,
the normalized translation probability of the English word given the French word. Starting from
the same aligned sentence pairs we used the same process to produce a second translation table
from French to English.
        </p>
        <p>Due to the time and resource constraints, we were not able to try a similar technique for Czech
this year. All of our processing for Czech was, therefore, monolingual.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>English Experiment Results</title>
      <p>The required run for the CLEF-2006 CL-SR track called for use of the title and description ¯elds
as a basis for formulating queries. We therefore used all words from those ¯elds as the query (a
condition we call \TD") for our ¯ve o±cial submissions. Stopwords in each query (as well as in
each segment) were automatically removed (after translation) by InQuery, which is the retrieval
engine that we used for all of our experiments. Stemming of the queries (after translation) and
segments was performed automatically by InQuery using kstem. Statistical signi¯cance is reported
for p &lt; 0:05 by a Wilcoxon signed rank test for paired samples.
3.1</p>
      <sec id="sec-3-1">
        <title>O±cially Scored Runs</title>
        <p>1http://www-i6.informatik.rwth-aachen.de/Colleagues/och/software/GIZA++.html
umd.auto
umd.asr04a
umd.asr06a
umd.asr06b
MAP</p>
        <p>As Table 1 shows, our one o±cially scored automatic CLIR run, umd.auto.fr0.9 (with a
threshold of 0.9) achieved only 38% of the MAP of the corresponding monolingual MAP, a statistically
signi¯cant di®erence. We suspect that domain mismatch between the corpus used for training
statistical translation model and the document collection might be a contributing factor, but further
investigation of this hypothesis is clearly needed. A locally scored one-best contrastive condition
(not shown) yielded about the same results.</p>
        <p>Not surprisingly, combining ¯rst names, segment summaries, and manually assigned thesaurus
terms produced the best retrieval e®ectiveness as measured by MAP. Among the three runs with
manually created metadata, umd.manu.fr0.9 and umd.manu.fr0 are a pair of comparative
crosslanguage runs: umd.manu.fr0.9 had a threshold of 0.9 (which usually led to the selection of
multiple translations), while umd.manu.fr0 used only the most probable French translation for
each English query word. These settings yielded 44% and 41% of the corresponding monolingual
MAP, respectively. The 7% apparent relative increase in MAP with a threshold of 0.9 (compared
with one-best translation) was not found to be statistically signi¯cant.
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Additional Locally Scored Runs</title>
        <p>In additional to the o±cially scored monolingual run umd.auto that used four automatically
generated ¯elds (ASRTEXT2004A, ASRTEXT2006A, AUTOKEYWORD2004A1, and
AUTOKEYWORD2004A2), we scored three additional runs based on automatically generated data locally:
umd.asr04a, umd.asr06a, and umd.asr06b. These runs used only the ASRTEXT2004A,
ASRTEXT2006A, or ASRTEXT2006B ¯elds, respectively (ASRTEXT2006A is empty for some
segments; in ASRTEXT2004B those segments are ¯lled in with reportedly less accurate data from
ASRTEXT2004A). Table 2 shows the MAP for each of these runs and (again) for umd.auto.
Combining the four automatically generated ¯elds yielded a slight apparent improvement in MAP
over any run that used only one of those four ¯elds, although the di®erences are not statistically
signi¯cant. Interestingly, there is no noticeable di®erence among umd.asr04a, umd.asr06a and
umd.asr06b even when average precision is compared on a topic-by-topic basis, despite the fact
that the ASR text produced by the 2006 system is reported to have a markedly lower word error
rate than that produced by the 2004 system.
3.3</p>
      </sec>
      <sec id="sec-3-3">
        <title>Detailed Failure Analysis</title>
        <p>To investigate the factors that could have had a major in°uence on the e®ectiveness of runs with
automatic data, we conducted a topic-by-topic comparison of average precision. To facilitate that
analysis, we produced two additional runs with queries that were formed using words from the
title ¯eld only, with one run searching the ASRTEXT2006B ¯eld only (AUTO) and the other
the three metadata ¯elds (MANU). We focused our analysis on those topics that have a MAP of
0.2 or larger in the MANU run for consistency with the failure analysis framework that we have
applied previously. With this constraint applied, 15 topics remain for analysis. Figure 1 shows
the topic-by-topic comparison of average precision. As we saw in 2006, the di®erence in average
precision between the two conditions is quite large for most topics.</p>
        <p>Using title-only queries allowed us to look at the contribution of each query word in more detail.
Speci¯cally, we looked at the number of segments in which query word appears (a statistic normally
referred to as \document frequency"). As Table 3 shows, there are some marked di®erences in the
prevalence of query term occurrences between automatically and manually generated ¯elds. In
last year's study, poor relative retrieval e®ectiveness with automatically-generated data was most
often associated with a failure to recognizing at least one important query word (often a person
or location name). This year, by contrast, we see only two obvious cases that ¯t that pattern
(\varian" and \dp"). This may be because proper names are less common in this year's topic
titles. Instead, the pattern that we see is that query words actually appears quite often in ASR
segments, and in some cases perhaps too often. Said another way, our problem last year was recall;
this year our problem seems to be precision. We'll need to actually read some of the ASR text to
see if this supposition is supported, of course. But it is intriguing to note that the failure pattern
this year seems to be very di®erent from last year's.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Czech Experiment Results</title>
      <p>The University of Maryland was also one of three teams to participate in the ¯rst year of the Czech
evaluation. Limited time prevented us from implementing any language processing techniques that
were speci¯c to Czech, so all of our runs were based on string matching without any morphological
normalization. Automatic segmentation into overlapping passages was provided by the organizers
, and we used that segmentation unchanged. Our sole research question for Czech was, therefore,
whether the new start-time evaluation metric yielded results that could be used to compare variant
systems.</p>
      <p>We submitted three o±cially scored runs for Czech: umd.all used all available ¯elds (both
automatically and manually generated, in both English and Czech), umd.asr used only the Czech
ASR text, and umd.akey.asr used both ASR text and the automatic Czech translations of the
automatically generated thesaurus terms. Table 4 shows the resulting mean Generalized
Average Precision (mGAP) values. About all that we can conclude form these results is that they
do not serve as a result for making meaningful comparisons. We have identi¯ed four possible
causes that merit investigation: (1) our retrieval system may indeed be performing poorly, (2) the
evaluation metric may have unanticipated weaknesses, (3) the scripts for computing the metric
may be producing erroneous values, or (4) the relevance assessments may contain errors. There
is some reason to suspect that the problem may lie with our system design, which contains two
known weaknesses. Most obviously, Czech is a highly in°ected language in which some degree of
morphological normalization is more important than it would be, for example, for English. Good
morphological analysis tools are available for Czech, so this problem should be easily overcome.
The second known problem is more subtle: overlapping segmentation can yield redundant highly
ranked segments, but the mGAP scoring process penalized redundancy. Failing to prune
redundant segments prior to submission likely resulted in a systematic reduction in our scores. It is
not clear whether these two explanations together su±ce to explain the very low reported scores
this year, but the test collection that is now available from this year's Czech task is exactly the
resource that we need to answer that question.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion</title>
      <p>Earlier experiments with searching broadcast news yielded excellent results, leading to a plausible
conclusion that searching speech was a solved problem. As with all such claims, that is both true
and false. Techniques for searching broadcast news are now largely well understood, but searching
spontaneous conversational speech based solely on automatically generated transcripts remains a
very challenging task. We continue to be surprised by some aspects of our English results, and
we are only beginning to understand what happens when we look beyond manually segmented
English to unsegmented Czech. Among the things that we don't yet understand are the degree
to which the di®erences we observed this year in English are due to di®erences in the topics or
di®erences in the ASR, how best to a®ordable analyze retrieval failures when the blame points
more to precision than to recall, whether our unexpectedly poor CLIR results were caused solely
by a domain mismatch or principally by some other factor, and whether our Czech test collection
and retrieval evaluation metric are properly constructed. In each case, we have so far looked at
only one small part of the opportunity space, and much more remains to be done. We look forward
to this year's CLEF workshop, where we will have much to discuss!</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Philipp</given-names>
            <surname>Koehn</surname>
          </string-name>
          .
          <article-title>Europarl: A multilingual corpus for evaluation of machine translation</article-title>
          .
          <source>unpublished draft</source>
          .
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Douglas</surname>
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Oard</surname>
            , Dagobert Soergel, David Doermann,
            <given-names>Xiaoli</given-names>
          </string-name>
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Craig</surname>
            <given-names>Murray</given-names>
          </string-name>
          , Jianqiang Wang, Bhuvana Ramabhadran, Martin Franz, Samuel Gustman, James May¯eld, Liliya Kharevych, and
          <string-name>
            <given-names>Stephanie</given-names>
            <surname>Strassel</surname>
          </string-name>
          .
          <article-title>Building an information retrieval test collection for spontaneous conversational speech</article-title>
          .
          <source>In Proceedings of the 20th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          , pages
          <volume>41</volume>
          {
          <fpage>38</fpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>F. J.</given-names>
            <surname>Och</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Ney</surname>
          </string-name>
          .
          <article-title>Improved statistical alignment models</article-title>
          .
          <source>In ACL'00</source>
          , pages
          <fpage>440</fpage>
          {
          <fpage>447</fpage>
          ,
          <string-name>
            <surname>Hongkong</surname>
          </string-name>
          , China,
          <year>October 2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Jianqiang</given-names>
            <surname>Wang</surname>
          </string-name>
          and
          <string-name>
            <given-names>Douglas W.</given-names>
            <surname>Oard</surname>
          </string-name>
          . Clef
          <article-title>-2005 cl-sr at maryland: Document and query expansion using side collections and thesauri</article-title>
          .
          <source>In Proceedings of the CLEF 2005 Workshop</source>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Jianqiang</given-names>
            <surname>Wang</surname>
          </string-name>
          and
          <string-name>
            <given-names>Douglas W.</given-names>
            <surname>Oard</surname>
          </string-name>
          .
          <article-title>Combining bidirectional translation and synonymy for cross-language information retrieval</article-title>
          .
          <source>In Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          , pages
          <volume>202</volume>
          {
          <fpage>29</fpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>