<!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>German, French, English and Persian Retrieval Experiments at CLEF 2009</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Stephen Tomlinson</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ottawa</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ontario</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Canada</string-name>
        </contrib>
      </contrib-group>
      <abstract>
        <p>We describe evaluation experiments conducted by submitting retrieval runs for the monolingual German, French, English and Persian (Farsi) information retrieval tasks of the Ad Hoc Track of the Cross-Language Evaluation Forum (CLEF) 2009. In the ad hoc retrieval tasks, the system was given 50 natural language queries, and the goal was to find all of the relevant records or documents (with high precision) in a particular document set. We conducted diagnostic experiments with different techniques for matching word variations, comparing the performance on the robust Generalized Success@10 measure and the non-robust Mean Average Precision measure. The measures generally agreed on the mean benefits of morphological techniques such as decompounding and stemming, but generally disagreed on the blind feedback technique. Also, for each language, we submitted a sample of the first 10000 retrieved items to investigate the frequency of relevant items at deeper ranks than the official judging depth of 60 for German, French and English and 80 for Persian. The results suggest that, on average, the percentage of relevant items assessed was less than 62% for German, 27% for French, 35% for English and 22% for Persian.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>http://www.opentext.com/
Open Text eDOCS SearchServerTM is a toolkit for developing enterprise search and retrieval
applications. The eDOCS SearchServer kernel is also embedded in various components of the
Open Text eDOCS Suite1.</p>
      <p>1Open Text eDOCS SearchServer and Open Text eDOCS Suite are trademarks or registered trademarks of Open
Text Corporation in the United States of America, Canada, the European Union and/or other countries. This list
of trademarks is not exhaustive. Other trademarks, registered trademarks, product names, company names, brands
and service names mentioned herein are property of Open Text Corporation or other respective owners.</p>
      <p>Code
DE
EN
FA
FR</p>
    </sec>
    <sec id="sec-2">
      <title>German English Persian French</title>
      <p>
        The eDOCS SearchServer kernel works in Unicode internally [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and supports most of the
world’s major character sets and languages. The major conferences in text retrieval
experimentation (CLEF [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], NTCIR [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] and TREC [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]) have provided judged test collections for objective
experimentation with the SearchServer kernel in more than a dozen languages.
      </p>
      <p>This paper describes experimental work with SearchServer (experimental post-6.0 versions) for
the task of finding relevant documents for natural language queries in various European languages
using the CLEF 2009 Ad Hoc Track test collections.
2
2.1</p>
      <sec id="sec-2-1">
        <title>Methodology</title>
        <sec id="sec-2-1-1">
          <title>Data</title>
          <p>The CLEF 2009 Ad Hoc Track document sets were the same as used in 2008. They consisted of
XML-tagged records or documents in 4 different languages: German, French, English and Persian
(also known as Farsi). For German, French and English, the records were library catalog cards
(bibliographic records describing publications archived by The European Library (TEL)). For
Persian, the documents were newspaper articles (Hamshahri corpus of 1996-2002). Table 1 gives
the collection sizes.</p>
          <p>The CLEF organizers created 50 natural language “topics” (numbered 701-750 for German,
French and English and 601-650 for Persian) and translated them into many languages. Sometimes
topics are discarded for some languages because of a lack of relevant documents (though that did
not happen this year). Table 1 gives the final number of topics for each language and their average
number of relevant documents (along with the lowest and highest number of relevant documents
of any topic). For more information on the CLEF test collections, please see the track overview
paper.
2.2</p>
        </sec>
        <sec id="sec-2-1-2">
          <title>Indexing</title>
          <p>
            Our indexing approach was the same as last year [
            <xref ref-type="bibr" rid="ref18">18</xref>
            ]. Accents were not indexed. The apostrophe
was treated as a word separator (except in English). The custom text reader, cTREC, enforced
the CLEF guidelines by only marking specifically tagged fields for indexing.
          </p>
          <p>
            For some experiments, some stop words were excluded from indexing (e.g. words like “the”,
“by” and “of” in English). For our Persian experiments, our stop word list was based on Savoy’s
list [
            <xref ref-type="bibr" rid="ref8">8</xref>
            ].
          </p>
          <p>By default, the SearchServer index supports both exact matching (after some Unicode-based
normalizations, such as decompositions and conversion to upper-case) and morphological matching
(e.g. inflections, derivations and compounds, depending on the linguistic component used).
2.3</p>
        </sec>
        <sec id="sec-2-1-3">
          <title>Searching</title>
          <p>We experimented with the SearchServer CONTAINS predicate. Our test application specified
SearchSQL to perform a Boolean-OR of the query words. For example, for German topic 701
whose Title was “Tiere in der Arktis” (Arctic Animals) a corresponding SearchSQL query would
be:
SELECT RELEVANCE(’2:3’) AS REL, DOCNO
FROM CLEF09DE
WHERE FT_TEXT CONTAINS ’Tiere’|’in’|’der’|’Arktis’
ORDER BY REL DESC;</p>
          <p>
            Most aspects of the SearchServer relevance value calculation are the same as described last year
[
            <xref ref-type="bibr" rid="ref18">18</xref>
            ]. Briefly, SearchServer dampens the term frequency and adjusts for document length in a
manner similar to Okapi [
            <xref ref-type="bibr" rid="ref7">7</xref>
            ] and dampens the inverse document frequency using an approximation of the
logarithm. These calculations are based on the stems of the terms (roughly speaking) when doing
morphological searching (i.e. when SET TERM_GENERATOR ‘word!ftelp/inflect/decompound’
was previously specified). The SearchServer RELEVANCE_METHOD setting was set to ‘2:3’
and RELEVANCE_DLEN_IMP was set to 500 for all experiments in this paper.
2.4
          </p>
        </sec>
        <sec id="sec-2-1-4">
          <title>Diagnostic Runs</title>
          <p>
            For the diagnostic runs listed in Table 2, the run names consist of a language code (“DE” for
German, “EN” for English, “FA” for Persian, and “FR” for French) followed by one of the following
labels:
² “none”: No linguistic variations from stemming were matched. Just the surface forms were
searched on (after case-normalization).
² “lexstem” (German, French and English only): Same as “none” except that linguistic
variations from stemming were matched. The lexicon-based inflectional stemmer in SearchServer
was used. For German, this stemmer includes decompounding.
² “algstem”: Same as “lexstem” except that an algorithmic stemmer was used. For Persian, our
stemmer was ported from Savoy’s [
            <xref ref-type="bibr" rid="ref8">8</xref>
            ]. For German, French and English, Porter’s algorithmic
“Snowball” stemmers [
            <xref ref-type="bibr" rid="ref6">6</xref>
            ] were used (for English, the Porter2 version was used).
² “lexall” (German, French and English only): Same as “lexstem” except that a separate index
was used which did not stop any words from being indexed.
² “algall” (Persian only): Same as “algstem” except that a separate index was used which did
not stop any words from being indexed.
² “4gram”: The run used a different index which primarily consisted of the 4-grams of terms,
e.g. the word ‘search’ would produce index terms of ‘sear’, ‘earc’ and ‘arch’. No stemming
or word stopping was done; searching used the IS_ABOUT predicate (instead of the
CONTAINS predicate) with morphological options disabled to search for the 4-grams of the query
terms.
          </p>
          <p>Note that all diagnostic runs just used the Title field of the topic.
2.5</p>
        </sec>
        <sec id="sec-2-1-5">
          <title>Retrieval Measures</title>
          <p>Traditionally, different retrieval measures have been used for “ad hoc” tasks, which seek relevant
items for a topic, than for “known-item” tasks, which seek a particular known document. However,
we argue that the known-item measures are not only applicable to ad hoc tasks, but that they
are often preferable. For many ad hoc tasks, e.g. finding answer documents for questions, just one
relevant item is needed. Also, the traditional ad hoc measures encourage retrieval of duplicate
relevant documents, which does not correspond to user benefit.</p>
          <p>
            The traditional known-item measures are very coarse, e.g. Success@10 is 1 or 0 for each topic,
while reciprocal rank cannot produce a value between 1.0 and 0.5. In 2005, we began investigating a
new measure, Generalized Success@10 (GenS@10 or GS10) (introduced as “First Relevant Score”
(FRS) in [
            <xref ref-type="bibr" rid="ref13">13</xref>
            ]), which is defined below. This investigation led to the discovery that the blind
feedback technique (a commonly used technique at CLEF, NTCIR and TREC, but not known
to be popular in real systems) had the downside of pushing down the first relevant item (on
average), as has now been verified not just for our own blind feedback approach, but for the 7
blind feedback systems of the 2003 RIA Workshop [
            <xref ref-type="bibr" rid="ref11">11</xref>
            ] and for the Neuchaˆtel system using French
data from CLEF [
            <xref ref-type="bibr" rid="ref1">1</xref>
            ]. [
            <xref ref-type="bibr" rid="ref2">2</xref>
            ] provides a theoretical explanation for why positive feedback approaches
are detrimental to the rank of the first relevant item.
2.5.1
          </p>
          <p>Primary Recall Measures
“Primary recall” is retrieval of the first relevant item for a topic. Primary recall measures include
the following:
² Generalized Success@30 (GenS@30 or GS30): For a topic, GS30 is 1:0241¡r where r is the
rank of the first row for which a desired page is found, or zero if a desired page was not
found.
² Generalized Success@10 (GenS@10 or GS10): For a topic, GS10 is 1:081¡r where r is the
rank of the first row for which a desired page is found, or zero if a desired page was not
found.
² Success@n (S@n): For a topic, Success@n is 1 if a desired page is found in the first n rows,
0 otherwise. This paper lists Success@1 (S1) and Success@10 (S10) for all runs.
² Reciprocal Rank (RR): For a topic, RR is 1r where r is the rank of the first row for which
a desired page is found, or zero if a desired page was not found. “Mean Reciprocal Rank”
(MRR) is the mean of the reciprocal ranks over all the topics.</p>
          <p>Interpretation of Generalized Success@n: GS30 and GS10 are estimates of the percentage of
potential result list reading the system saved the user to get to the first relevant item, assuming that
users are less and less likely to continue reading as they get deeper into the result list.
Comparison of GS10 and Reciprocal Rank : Both GS10 and RR are 1.0 if a desired page is found
at rank 1. At rank 2, GS10 is just 7 points lower (0.93), whereas RR is 50 points lower (0.50). At
rank 3, GS10 is another 7 points lower (0.86), whereas RR is 17 points lower (0.33). At rank 10,
GS10 is 0.50, whereas RR is 0.10. GS10 is greater than RR for ranks 2 to 52 and lower for ranks
53 and beyond.</p>
          <p>Connection of GS10 to Success@10 : GS10 is considered a generalization of Success@10 because
it rounds to 1 for r·10 and to 0 for r&gt;10. (Similarly, GS30 is considered a generalization of
Success@30 because it rounds to 1 for r·30 and to 0 for r&gt;30.)
2.5.2</p>
          <p>
            Secondary Recall Measures
“Secondary recall” is retrieval of the additional relevant items for a topic (after the first one).
Secondary recall measures place most of their weight on these additional relevant items.
² Precision@n: For a topic, “precision” is the percentage of retrieved documents which are
relevant. “Precision@n” is the precision after n documents have been retrieved. This paper
lists Precision@10 (P10) for all runs.
² Average Precision (AP): For a topic, AP is the average of the precision after each relevant
document is retrieved (using zero as the precision for relevant documents which are not
retrieved). By convention, AP is based on the first 1000 retrieved documents for the topic.
The score ranges from 0.0 (no relevant documents found) to 1.0 (all relevant documents
found at the top of the list). “Mean Average Precision” (MAP) is the mean of the average
precision scores over all of the topics (i.e. all topics are weighted equally).
² Geometric MAP (GMAP): GMAP (introduced in [
            <xref ref-type="bibr" rid="ref19">19</xref>
            ]) is based on “Log Average Precision”
which for a topic is the natural log of the max of 0.00001 and the average precision. GMAP
is the exponential of the mean log average precision. (We argue in [
            <xref ref-type="bibr" rid="ref11">11</xref>
            ] that primary recall
measures better reflect robustness than GMAP.)
2.6
          </p>
        </sec>
        <sec id="sec-2-1-6">
          <title>Statistical Significance Tables</title>
          <p>For tables comparing 2 diagnostic runs (such as Table 3), the columns are as follows:
² “Expt” specifies the experiment. The language code is given, followed by the labels of the
2 runs being compared. (We abbreviate “lexstem” to “lex”, “algstem” to “alg”, “4gram” to
“4gr” and “lexall” and “algall” to “all”.) The difference is the first run minus the second run.
For example, “DE-lex-none” specifies the difference of subtracting the scores of the German
‘none’ run from the German ‘lexstem’ run (of Table 2).
² “¢GS10” is the difference of the mean GS10 scores of the two runs being compared (and
“¢MAP” is the difference of the mean average precision scores).
² “95% Conf” is an approximate 95% confidence interval for the difference (calculated from
plus/minus twice the standard error of the mean difference). If zero is not in the interval,
the result is “statistically significant” (at the 5% level), i.e. the feature is unlikely to be of
neutral impact (on average), though if the average difference is small (e.g. &lt;0.020) it may
still be too minor to be considered “significant” in the magnitude sense.
² “vs.” is the number of topics on which the first run scored higher, lower and tied (respectively)
compared to the second run. These numbers should always add to the number of topics.
² “3 Extreme Diffs (Topic)” lists 3 of the individual topic differences, each followed by the
topic number in brackets. The first difference is the largest one of any topic (based on the
absolute value). The third difference is the largest difference in the other direction (so the
first and third differences give the range of differences observed in this experiment). The
middle difference is the largest of the remaining differences (based on the absolute value).
3
3.1</p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>Results of Morphological Experiments</title>
        <sec id="sec-2-2-1">
          <title>Impact of Stemming</title>
          <p>Table 3 shows the impact of stemming for the 4 languages. For instance, it shows that the mean
increase in GenS@10 was statistically significant for German, and the mean increases in MAP
were statistically significant for all 4 languages.</p>
          <p>Table 3 also shows that there were large impacts from stemming on particular topics for
German, French and English in both the GenS@10 and MAP measures (we look at some examples
in the later sections).</p>
          <p>Like last year, for Persian, even on individual topics there was relatively little impact from
stemming. We notice in Table 2 that the Success@10 rate was relatively high for Persian (50 out
of 50) even without stemming, and that relevant documents were plentiful (89 per topic on average
as per Table 1), but we have not done sufficient analysis to understand why the stemming impact
was so minor across Persian topics.
Expt</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>DE-lex-none FR-lex-none EN-lex-none FA-alg-none</title>
    </sec>
    <sec id="sec-4">
      <title>DE-lex-none</title>
      <p>FR-lex-none
EN-lex-none
FA-alg-none
¢GS10
weight from three 4-grams (‘nabb’, ‘abba’, ‘bbau’) and it did not retrieve a relevant record until
rank 509.
4</p>
      <sec id="sec-4-1">
        <title>Submitted Runs</title>
        <p>For each language, we submitted 4 experimental runs in June 2009 for official assessment. In the
identifiers (e.g. “otFA09tdz”), ‘t’ and ‘d’ indicate that the Title and Description field of the topic
were used (respectively), and ‘e’ indicates that query expansion from blind feedback on the first
3 rows was used (weight of one-half on the original query, and one-sixth each on the 3 expanded
rows). The ‘z’ code indicates that special sampling was done, as described below. From the
Description field for German, French and English, instruction words such as “find”, “relevant” and
“document” were automatically removed (based on looking at some older topic lists, not this year’s
topics; this step was skipped for Persian as we didn’t have time to update our lists this year).</p>
        <p>Details of the submitted approaches:
² “t”: Just the Title field of the topic was used. Same as the “lexstem” run of Section 2.4 for</p>
        <p>German, French and English, and same as the “algstem” run of Section 2.4 for Persian.
² “td”: Same as “t” except that the Description field of the topic was additionally used.
² “tde”: Same as “td” except that blind feedback (based on the first 3 rows of the “td” query)
was used to expand the query.
² “tdz”: Depth-10000 sampling run based on the “td” run as described below.
EN-tde-td
FA-tde-td
FR-tde-td
DE-tde-td
EN-tde-td
FA-tde-td
FR-tde-td
DE-tde-td
¡0:007
¡0:015
¡0:023
¡0:039
The submitted tdz run for each language was actually a depth probe run from sampling the td
run for the language.</p>
        <p>The base td run was retrieved to depth 10000 for each topic. The first 100 rows of the submitted
tdz run contained the following rows of the base run in the following order:</p>
        <p>The remainder of the sample run was padded with the top-ranked remaining rows from the
base run until 1000 rows had been retrieved (i.e. rows 11, 12, 13, 14, 16, ..., 962 of the base run).</p>
        <p>This ordering (e.g. the placement of the sample from depth 10000 before the sample from depth
15) was chosen because of uncertainty of how deep the judging would be. As long as the top-37
were judged for each topic, we would have sampling to depth 10000 (because in the above list,
you can count that after 37 samples that depth 10000 is reached). The extra sample points, if
judged, would just improve the accuracy (because they are just additional sample points from the
top 10000, not deeper sample points).</p>
        <p>Our sample run (i.e. the tdz run) for each language was submitted to the CLEF organizers for
assessing in June 2009. We assigned it highest judging precedence of all our submitted runs.</p>
        <p>When we received the relevance judgments and analyzed them in August 2009, we checked the
judging depth of our sample runs. We found that the top-60 rows were judged for each topic for
each German, French and English, and the top-80 rows were judged for each topic for Persian.</p>
        <p>Tables 10, 11, 12 and 13 show the results of the sampling for each language. The columns are
as follows:
² “Depth Range”: The range of depths being sampled. The 11 depth ranges cover from 1 to
10000.
² “Samples”: The depths of the sample points from the depth range. The samples are always
uniformly spaced. They always end at the last point of the depth range. The total number
of sample points (over the 11 rows of the table) adds to 60 for German, French and English
and adds to 80 for Persian.
² “Precision”: Estimated precision of the depth range (R/(R+N+U+X)).
² “Wgt”: The weight of each sample point. The weight is equal to the difference in ranks
between sample points, i.e. each sample point can be thought of as representing this number
of rows, which is itself plus the preceding unsampled rows.
² “EstRel/Topic”: Estimated number of relevant items retrieved per topic for this depth range.</p>
        <p>This is the Precision multiplied by the size of the depth range. Or equivalently, it is (R *
Wgt) / 50.</p>
        <p>Because each sample point is at the deep end of the range of rows it represents, the sampling
should tend to underestimate precision for each depth range (assuming that precision tends to fall
with depth, which appears to be the case for all 4 languages).</p>
        <p>Table 14 shows the sums of the estimated number of relevant items per topic over all depth
ranges in its first row (i.e. it is the sum of the EstRel/Topic entries in the last column of the
corresponding table from Tables 10-13). The official number of relevant items per topic for each
language is listed in the second row. The final row of the table just divides the official
number of relevant items by the estimated number in the first 10000 retrieved (e.g. for German,
31.2/50.2=62%). This number should tend to be an overestimate of the percentage of all relevant
items that are judged (on average per topic) because there may be relevant items that were not
matched by the query in the first 10000 rows.</p>
        <p>However, the sampling was very coarse at the deeper ranks, e.g. for French, 1 relevant item
out of 200 samples in the 6001-10000 range led to an estimate of 20 relevant items per topic in
this range. If the sampling had turned up 0 or 2 relevant items, a minor difference, the estimate
would have been 0 or 40 relevant items per topic in this range, leading to a substantially different
sum (118.5 or 158.5 instead of 138.5). We should compute confidence intervals for these estimates,
but have not yet done so. Also, there is a lot of variance across topics, which we have not yet
analyzed.</p>
        <p>
          These preliminary estimates of judging coverage for the CLEF 2009 collections are similar to
last year’s estimates [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] for two of the four languages (62% for German this year, 55% last year;
22% for Persian this year, 25% last year). For the other two languages this year’s estimates are
substantially lower than last year’s (27% for French this year, 52% last year; 35% for English
this year, 53% last year). We’ve used similar methodology (though sometimes using different
sampling depths) for other past collections, such as the CLEF 2007 Ad Hoc collections (55% for
Czech, 69% for Bulgarian, 83% for Hungarian) [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ], the NTCIR-7 ACLIA IR4QA collections (65%
for Simplified Chinese, 32% for Traditional Chinese, 41% for Japanese) [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ], the NTCIR-6 CLIR
collections (58% for Chinese, 78% for Japanese, 100% for Korean) [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ], and the TREC 2006 Legal
and Terabyte collections (18% for TREC Legal and 36% for TREC Terabyte) [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ].
        </p>
        <p>
          On older TREC collections of approximately 500,000 documents which used depth-100 pooling,
[
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] reported that “it is likely that at best 50%-70% of the relevant documents have been found;
most of these unjudged relevant documents are for the 10 or so queries that already have the most
known answers.” Fortunately, [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] also found for such test collections that “overall they do indeed
lead to reliable results.”
5
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>Conclusions</title>
        <p>We described evaluation experiments conducted by submitting retrieval runs for the monolingual
German, French, English and Persian (Farsi) information retrieval tasks of the Ad Hoc Track of
the Cross-Language Evaluation Forum (CLEF) 2009. We conducted diagnostic experiments with
different techniques for matching word variations, comparing the performance on the robust
Generalized Success@10 measure and the non-robust Mean Average Precision measure. The measures
generally agreed on the mean benefits of morphological techniques such as decompounding and
stemming, but generally disagreed on the blind feedback technique. Also, for each language, we
submitted a sample of the first 10000 retrieved items to investigate the frequency of relevant items
at deeper ranks than the official judging depth of 60 for German, French and English and 80
for Persian. The results suggest that, on average, the percentage of relevant items assessed was
less than 62% for German, 27% for French, 35% for English and 22% for Persian. We analyzed
a few individual topics for which the different retrieval techniques produced large differences in
the scores and found that the judgments were sufficient to gain insight into the reasons for the
for</p>
        <p>IR</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Systems)</title>
    </sec>
    <sec id="sec-6">
      <title>Home</title>
    </sec>
    <sec id="sec-7">
      <title>Page. [6] M. F. Porter. Snowball: A language for stemming algorithms. October 2001. http://snowball.tartarus.org/texts/introduction.html [7] S. E. Robertson, S. Walker, S. Jones, M. M. Hancock-Beaulieu and M. Gatford. Okapi at</title>
      <p>retrieval resource</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Samir</given-names>
            <surname>Abdou</surname>
          </string-name>
          and
          <string-name>
            <given-names>Jacques</given-names>
            <surname>Savoy</surname>
          </string-name>
          .
          <article-title>Consid´erations sur l'´evaluation de la robustesse en recherche d'information</article-title>
          .
          <source>CORIA</source>
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Harr</given-names>
            <surname>Chen</surname>
          </string-name>
          and
          <string-name>
            <given-names>David R.</given-names>
            <surname>Karger</surname>
          </string-name>
          . Less is More:
          <article-title>Probabilistic Models for Retrieving Fewer Relevant Documents</article-title>
          .
          <source>SIGIR</source>
          <year>2006</year>
          , pp.
          <fpage>429</fpage>
          -
          <lpage>436</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Cross-Language Evaluation</surname>
          </string-name>
          <article-title>Forum web site</article-title>
          . http://www.clef-campaign.org/
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Andrew</given-names>
            <surname>Hodgson</surname>
          </string-name>
          .
          <article-title>Converting the Fulcrum Search Engine to Unicode</article-title>
          . Sixteenth International Unicode Conference,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>NTCIR (NII-NACSIS Test</surname>
          </string-name>
          Collection http://research.nii.ac.jp/»ntcadm/index-en.html
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M. F.</given-names>
            <surname>Porter</surname>
          </string-name>
          .
          <article-title>Snowball: A language for stemming algorithms</article-title>
          .
          <source>October</source>
          <year>2001</year>
          . http://snowball.tartarus.org/texts/introduction.html
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>S. E.</given-names>
            <surname>Robertson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Walker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. M.</given-names>
            <surname>Hancock-Beaulieu</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Gatford</surname>
          </string-name>
          .
          <source>Okapi at TREC-3. Proceedings of TREC-3</source>
          ,
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Jacques</given-names>
            <surname>Savoy</surname>
          </string-name>
          . CLEF and http://www.unine.ch/info/clef/
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Text</given-names>
            <surname>REtrieval Conference (TREC) Home</surname>
          </string-name>
          <article-title>Page</article-title>
          . http://trec.nist.gov/
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Stephen</given-names>
            <surname>Tomlinson</surname>
          </string-name>
          .
          <article-title>Comparing the Robustness of Expansion Techniques and Retrieval Measures</article-title>
          .
          <source>Working Notes for the CLEF 2006 Workshop.</source>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>Stephen</given-names>
            <surname>Tomlinson. Early Precision</surname>
          </string-name>
          <article-title>Measures: Implications from the Downside of Blind Feedback</article-title>
          .
          <source>SIGIR</source>
          <year>2006</year>
          , pp.
          <fpage>705</fpage>
          -
          <lpage>706</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>Stephen</given-names>
            <surname>Tomlinson</surname>
          </string-name>
          .
          <article-title>Experiments with the Negotiated Boolean Queries of the TREC 2006 Legal Discovery Track</article-title>
          .
          <source>Proceedings of TREC</source>
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Stephen</given-names>
            <surname>Tomlinson</surname>
          </string-name>
          .
          <article-title>European Ad Hoc Retrieval Experiments with Hummingbird SearchServerTM at CLEF 2005</article-title>
          .
          <article-title>Working Notes for the CLEF 2005 Workshop</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <article-title>Experiments in Finding Chinese and Japanese Answer Documents at NTCIR-7</article-title>
          .
          <source>Proceedings of NTCIR-7</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>Stephen</given-names>
            <surname>Tomlinson</surname>
          </string-name>
          .
          <article-title>Lexical and Algorithmic Stemming Compared for 9 European Languages with Hummingbird SearchServerTM at CLEF 2003</article-title>
          .
          <article-title>Working Notes for the CLEF 2003 Workshop</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>Stephen</given-names>
            <surname>Tomlinson</surname>
          </string-name>
          . Sampling Precision to Depth 9000:
          <article-title>Evaluation Experiments at NTCIR-6</article-title>
          .
          <source>Proceedings of NTCIR-6</source>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>Stephen</given-names>
            <surname>Tomlinson</surname>
          </string-name>
          . Sampling Precision to Depth 10000:
          <string-name>
            <surname>Evaluation</surname>
            <given-names>Experiments at CLEF</given-names>
          </string-name>
          <year>2007</year>
          .
          <article-title>Working Notes for the CLEF 2007 Workshop</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>Stephen</given-names>
            <surname>Tomlinson</surname>
          </string-name>
          . German, French,
          <source>English and Persian Retrieval Experiments at CLEF 2008. Working Notes for the CLEF 2008 Workshop.</source>
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Ellen</surname>
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Voorhees</surname>
          </string-name>
          .
          <article-title>Overview of the TREC 2004 Robust Retrieval Track</article-title>
          .
          <source>Proceedings of TREC</source>
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>Justin</given-names>
            <surname>Zobel</surname>
          </string-name>
          .
          <source>How Reliable are the Results of Large-Scale Information Retrieval Experiments? SIGIR'98</source>
          , pp.
          <fpage>307</fpage>
          -
          <lpage>314</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>