<!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>Sampling Precision to Depth 10000: Evaluation Experiments at CLEF 2007</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 Bulgarian, Czech and Hungarian information retrieval tasks of the AdHoc Track of the Cross-Language Evaluation Forum (CLEF) 2007. In the ad hoc retrieval tasks, the system was given 50 natural language queries, and the goal was to find all of the relevant documents (with high precision) in a particular document set. We conducted diagnostic experiments with different techniques for matching word variations and handling stopwords, 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 stemming, but generally disagreed on the blind feedback technique, though not all of the mean differences were statistically significant. 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 Czech and 80 for Bulgarian and Hungarian). The results suggest that, on average, the percentage of relevant items assessed was less than 60% for Czech, 70% for Bulgarian and 85% for Hungarian.</p>
      </abstract>
      <kwd-group>
        <kwd>Bulgarian Retrieval</kwd>
        <kwd>Czech Retrieval</kwd>
        <kwd>Hungarian Retrieval</kwd>
        <kwd>Robust Retrieval</kwd>
        <kwd>Sampling</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>http://www.opentext.com/
Livelink ECM - eDOCS SearchServerTM (formerly known as Hummingbird SearchServerTM) is a
toolkit for developing enterprise search and retrieval applications. The SearchServer kernel is also
embedded in other components of the Livelink ECM - eDOCS Suite1.</p>
      <p>1Livelink, Open TextTM and SearchServerTM 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>Language</p>
    </sec>
    <sec id="sec-2">
      <title>Bulgarian</title>
      <p>Czech
Hungarian</p>
      <p>
        SearchServer works in Unicode internally [
        <xref ref-type="bibr" rid="ref3">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="ref2">3</xref>
        ],
NTCIR [
        <xref ref-type="bibr" rid="ref4">5</xref>
        ] and TREC [
        <xref ref-type="bibr" rid="ref7">8</xref>
        ]) have provided judged test collections for objective experimentation
with SearchServer in more than a dozen languages.
      </p>
      <p>This paper describes experimental work with SearchServer for the task of finding relevant
documents for natural language queries in various European languages using the CLEF 2007
AdHoc 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 2007 Ad-Hoc Track document sets consisted of tagged (SGML-formatted) news articles
in 3 different languages: Bulgarian, Czech and Hungarian. Table 1 gives the sizes.</p>
          <p>The CLEF organizers created 50 natural language “topics” (numbered 401-450) and translated
them into many languages. Sometimes topics are discarded for some languages because of a lack of
relevant documents. 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, see the track overview paper.
2.2</p>
        </sec>
        <sec id="sec-2-1-2">
          <title>Indexing</title>
          <p>
            Our indexing approach was mostly the same as last year [
            <xref ref-type="bibr" rid="ref8">9</xref>
            ]. Accents were not indexed except
for the combining breve in Bulgarian. The apostrophe was treated as a word separator for the
investigated languages. The custom text reader, cTREC, was updated to maintain support for
the CLEF guidelines of only indexing specifically tagged fields.
          </p>
          <p>
            For some experiments, some stop words were excluded from indexing (e.g. words like “the”,
“by” and “of” in English). For these experiments, the stop word lists for Bulgarian, Czech and
Hungarian were based on Savoy’s lists [
            <xref ref-type="bibr" rid="ref6">7</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 Czech topic 405 whose
Title was “Astma u dˇetstv´ı” (Childhood Asthma), a corresponding SearchSQL query would be:
SELECT RELEVANCE(’2:4’) AS REL, DOCNO
FROM CLEF07CS
WHERE FT_TEXT CONTAINS ’Astma’|’u’|’dˇetstvı´’
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="ref8">9</xref>
            ]. Briefly, SearchServer dampens the term frequency and adjusts for document length in a
manner similar to Okapi [
            <xref ref-type="bibr" rid="ref5">6</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’
was previously specified). The SearchServer RELEVANCE_METHOD setting was set to ‘2:4’
and RELEVANCE_DLEN_IMP was set to 750 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 Tables 2, the run names consist of a language code (“BG” for
Bulgarian, “CS” for Czech and “HU” for Hungarian) 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).
² “stem”: Same as “none” except that linguistic variations from stemming were matched. We
thank Jacques Savoy for providing experimental algorithmic stemmers [
            <xref ref-type="bibr" rid="ref6">7</xref>
            ] for all 3 languages.
          </p>
          <p>
            For Czech, our port of the stemmer was accent-insensitive.
² “all”: Same as “stem” except that a separate index was used which did not stop any words
from being indexed.
² “4gram”: Same as “all” except that 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 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. For Bulgarian, we did not index the breve accent for the 4-gram runs (unlike
2 years ago [
            <xref ref-type="bibr" rid="ref11">12</xref>
            ]).
² “fuse”: Fusion run based on adding together the rsv scores of the “stem” and “4gram” runs.
          </p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Note that all diagnostic runs just used the Title field of the topic.</title>
      <p>2.5</p>
      <sec id="sec-3-1">
        <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
relevants, 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. Two years ago, we began
investigating a new measure, Generalized Success@10 (GS10) (introduced as “First Relevant Score”
(FRS) in [
          <xref ref-type="bibr" rid="ref11">12</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="ref9">10</xref>
          ] and for the Neuchaˆtel system using French
data from CLEF [1]. [
          <xref ref-type="bibr" rid="ref1">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 (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 (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 relevants found) to 1.0 (all relevants 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="ref13">14</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="ref9">10</xref>
          ] that primary recall
measures better reflect robustness than GMAP.)
² “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 id="sec-3-1-1">
          <title>Results of Morphological Experiments</title>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>Impact of Stemming</title>
        <p>For each language, we submitted 4 experimental runs in May 2007 for official assessment. In the
identifiers (e.g. “otBG07tde”), ‘t’, ‘d’ and ‘n’ indicate that the Title, Description and Narrative 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 and Narrative fields for most languages, instruction words such as “find”, “relevant”
² “tdnz”: Depth-10000 sampling run based on the “tdn” run as described below.</p>
        <p>Table 6 lists the mean scores for the submitted runs.
BG-tde-td
CS-tde-td
HU-tde-td
BG-tde-td
CS-tde-td
HU-tde-td
¡0:010
¡0:011
0.001
The submitted tdnz run for each language was actually a depth probe run from sampling the tdn
run for the language (the tdn run was not itself submitted).</p>
        <p>The base tdn run was retrieved to depth 10000 for each topic. The first 100 rows of the
submitted tdnz run contained the following rows of the base tdn run in the following order:
² “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 Czech and 80 for Bulgarian
and Hungarian.
² “Precision”: Estimated precision of the depth range (R/(R+N+U)).
² “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. The weights are higher in some
cases for Czech than for Bulgarian and Hungarian because we have fewer sample points for
Czech (60 instead of 80).
² “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 3 languages).</p>
        <p>Table 11 shows the sums of the estimated number of relevant items per topic over all depth
ranges in its first row. 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 Bulgarian, 20.2/29.3=69%). 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 Czech, 1 relevant item out
of 300 samples in the 3001-6000 range led to an estimate of 10 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 20 relevant items per topic in this range, leading to a substantially different sum
(17.4 or 37.4 instead of 27.4). 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 2007 collections (55% for Czech,
69% for Bulgarian, 83% for Hungarian) are much higher than the estimates we produced for the
TREC 2006 Legal and Terabyte collections using a similar approach (18% for TREC Legal and
36% for TREC Terabyte) [
          <xref ref-type="bibr" rid="ref10">11</xref>
          ]. They are similar to the estimates we produced for the NTCIR-6
collections (58% for Chinese, 78% for Japanese, 100% for Korean) [
          <xref ref-type="bibr" rid="ref12">13</xref>
          ].
        </p>
        <p>
          These incompleteness results are similar to what [
          <xref ref-type="bibr" rid="ref14">15</xref>
          ] found for depth-100 pooling on the old
TREC collections of approximately 500,000 documents: “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.”
        </p>
        <p>
          Fortunately, [
          <xref ref-type="bibr" rid="ref14">15</xref>
          ] also found for such test collections that “overall they do indeed lead to reliable
results.” (We can also confirm that we have gained a lot of insights from the CLEF test collections
over the years, such as from the topic analyses in [
          <xref ref-type="bibr" rid="ref11">12</xref>
          ].)
[1] Samir Abdou and Jacques Savoy. Consid´erations sur l’´evaluation de la robustesse en recherche
d’information. CORIA 2007.
for
        </p>
        <p>IR</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Systems)</title>
    </sec>
    <sec id="sec-5">
      <title>Home</title>
    </sec>
    <sec id="sec-6">
      <title>Page. [6] S. E. Robertson, S. Walker, S. Jones, M. M. Hancock-Beaulieu and M. Gatford. Okapi at</title>
      <p>Multilingual
information
retrieval
resource</p>
    </sec>
    <sec id="sec-7">
      <title>Hummingbird [13] Stephen Tomlinson. Sampling Precision to Depth 9000: Evaluation Experiments at NTCIR-6.</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <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="ref2">
        <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="ref3">
        <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="ref4">
        <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="ref5">
        <mixed-citation>
          [6]
          <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="ref6">
        <mixed-citation>
          [7]
          <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="ref7">
        <mixed-citation>
          [8]
          <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="ref8">
        <mixed-citation>
          [9]
          <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="ref9">
        <mixed-citation>
          [10]
          <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="ref10">
        <mixed-citation>
          [11]
          <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="ref11">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>Stephen</given-names>
            <surname>Tomlinson</surname>
          </string-name>
          .
          <article-title>European Ad Hoc Retrieval Experiments with SearchServerTM at CLEF 2005</article-title>
          .
          <article-title>Working Notes for the CLEF 2005 Workshop</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [13]
          <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="ref13">
        <mixed-citation>
          [14]
          <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="ref14">
        <mixed-citation>
          [15]
          <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>