<!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>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Yuichi Kojima, Hideo Itoh, Hiroko Mano and Yasushi Ogawa Software R&amp;D Group, RICOH CO., Ltd.</institution>
          <addr-line>1-1-17 Koishikawa, Bunkyo-ku, Tokyo 112-0002</addr-line>
          ,
          <country country="JP">JAPAN</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2003</year>
      </pub-date>
      <abstract>
        <p>This paper describes the participation of RICOH in the Monolingual Information Retrieval tasks of the Cross-Language Evaluation Forum (CLEF) 2003. We used our system with same kind of stemmer, same options and different parameters for 5 European languages to compare each result. Total performance of the system was reasonable. For French, German and Italian, we found some problems. For CLEF 2003 monolingual information retrieval task, RICOH submitted runs for French, German, Italian, Spanish and Dutch. We have worked on English and Japanese text retrieval in past few years [2,3,4,5]. CLEF 2003 experiments were our first trials for European languages. Our main focuses at the experiments were: 1) to test our approach based on the probabilistic model in European languages 2) to find language-specific problems This paper is organized as follows: Section 2 introduces outline of our system, section 3 shows modifications for the experiments, section 4 describes the results, and section 5 reports some conclusions.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
    </sec>
    <sec id="sec-2">
      <title>2.1 Query term extraction</title>
      <p>We used “title” and “description” fields of each topic. Input topic string is transformed into a sequence of stemmed tokens
using the tokenizer and the stemmer. Stop words are eliminated using a stopword dictionary. Two kinds of terms are
extracted from stemmed tokens for initial retrieval. “single term” is each stemmed token and “phrasal term” consists of two
adjacent tokens in the stemmed query string.</p>
      <p>Each query term is assigned a weight wt, and documents are ranked according to the score sq,d as follows:
2.2 Initial retrieval</p>
    </sec>
    <sec id="sec-3">
      <title>2.4 Final retrieval</title>
    </sec>
    <sec id="sec-4">
      <title>3 Experiments</title>
    </sec>
    <sec id="sec-5">
      <title>3.1 Stemming</title>
      <p>K = k1 (1 − b) + b ld 
</p>
      <p>
 lave 
where N is the number of documents in the collection, nt is the document frequency of the term t, ft,d is the in-document
frequency of the term, ld is the document length, lave is the average document length, and k'4, k1 and b are parameters.</p>
      <p>Weights for phrasal terms are set lower than those for single terms.</p>
    </sec>
    <sec id="sec-6">
      <title>2.3 Query expansion</title>
      <p>
        As a result of initial retrieval, top 10 documents are assumed to be relevant (pseudo-relevant) to the query and selected as
a “seed” of query expansion. Candidates of expansion terms are extracted from the seed documents by the same way as in
the query term extraction mentioned above. Phrasal terms are not used for query expansion. The candidates are ranked on
the Robertson's Selection Value [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], or RSVt and top ranked terms are selected as expansion terms. The weight is
recalculated as w2t with the Robertson/Sparck-Jones formula [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]
RSVt = w2t •  rt R − nt N 
where R is the number of relevant documents, rt is the number of relevant documents containing the term t and α is a
parameter.
      </p>
      <p>The weight of initial query term is re-calculated with the same formula as above, but with a different α value and an
additional adjustment to make the weight higher than expansion terms.</p>
      <p>Using the initial query terms and expansion terms, the ranking module performs second retrieval to produce the final
result.</p>
      <p>There are four items in the system that need adjustments depending on the language, 1) tokenizer, 2) stemmer, 3)
stopword dictionary and 4) training data. We used the same tokenizer originally developed for English for all target
languages. The others are as follows.</p>
      <p>
        We used Snowball stemmers [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] for all target languages because 1) we didn’t have stemmers for European languages
except for English 2) we aren’t familiar these languages to develop stemmers and 3) unlike the earlier result [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], Snowball
stemmers showed their reasonable efficiencies for preparatory experiments. Table 1 shows the results using CLEF 2002 data
with and without stemming.
with stemming
without stemming
      </p>
      <p>We trained the system by selecting the best parameter-set from 500 candidate parameter-sets for each language to get the
highest average precision score.</p>
      <p>There was a bug in our training scripts. The system was trained using CLEF 2002 queries and CLEF 2003 data
collections, instead of CLEF 2002 data collections. This mismatch resulted in extra noise documents in retrieved documents
and made tuning performance rather worse.</p>
      <p>Table 2 shows the results with and without training.
without training
with training using 2002 data
with training using 2003 data</p>
    </sec>
    <sec id="sec-7">
      <title>5 Conclusions</title>
      <p>we expect that the main causes are that we have no German compound splitter. For the French result, we need time to
analyze it.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <article-title>[1] Snowball web site</article-title>
          . At http://snowball.tartarus.
          <source>org/ visited 7th November</source>
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ogawa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Mano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Narita</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Honma</surname>
          </string-name>
          .
          <article-title>Structuring and expanding queries in the probabilistic model</article-title>
          .
          <source>In The Eighth Text REtrieval Conference (TREC-8)</source>
          , pages
          <fpage>541</fpage>
          -
          <lpage>548</lpage>
          ,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Toyoda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kitsuregawa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Mano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Itoh</surname>
          </string-name>
          and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ogawa</surname>
          </string-name>
          . University of Tokyo/RICOH at NTCIR-3
          <string-name>
            <surname>Web</surname>
            <given-names>Retrieval</given-names>
          </string-name>
          <string-name>
            <surname>Task</surname>
          </string-name>
          . At http://research.nii.ac.jp/ntcir/workshop/OnlineProceedings3/NTCIR3-WEB-ToyodaM.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ogawa</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Mano</surname>
          </string-name>
          .
          <article-title>RICOH at NTCIR-2</article-title>
          .
          <source>In Proceedings of the Second NTCIR Workshop Meeting</source>
          , pages
          <fpage>121</fpage>
          -
          <lpage>123</lpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>H.</given-names>
            <surname>Itoh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Mano</surname>
          </string-name>
          and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ogawa</surname>
          </string-name>
          .
          <source>RICOH at TREC-10. In The Tenth Text REtrieval Conference (TREC-2001)</source>
          , pages
          <fpage>457</fpage>
          -
          <lpage>464</lpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S. E.</given-names>
            <surname>Robertson</surname>
          </string-name>
          .
          <article-title>On term selection for query expansion</article-title>
          .
          <source>Journal of Documentation</source>
          ,
          <volume>46</volume>
          (
          <issue>4</issue>
          ):
          <fpage>359</fpage>
          -
          <lpage>364</lpage>
          ,
          <year>1990</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>S. E.</given-names>
            <surname>Robertson</surname>
          </string-name>
          and
          <string-name>
            <given-names>K.</given-names>
            <surname>Spark-Jones</surname>
          </string-name>
          .
          <article-title>Relevance weighting of search terms</article-title>
          .
          <source>Journal of ASIS</source>
          ,
          <volume>27</volume>
          :
          <fpage>129</fpage>
          -
          <lpage>146</lpage>
          ,
          <year>1976</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S. E.</given-names>
            <surname>Robertson</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Walker</surname>
          </string-name>
          .
          <article-title>On relevance weights with little relevance information</article-title>
          .
          <source>In Proceedings of the 20th Annual International ACM SIGIR Conference (SIGIR '97)</source>
          , pages
          <fpage>16</fpage>
          -
          <lpage>24</lpage>
          ,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>A.</given-names>
            <surname>MacFarlane</surname>
          </string-name>
          .
          <article-title>Pliers and snowball at CLEF 2002</article-title>
          .
          <source>In Working Notes for the CLEF 2002 Workshop</source>
          , Rome, Italy,
          <year>September 2002</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>