<!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>Institut interfacultaire d'informatique, Université de Neuchâtel, Switzerland Jacques Savoy Jacques.Savoy@unine.ch Web site: www.unine.ch/info/</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Jacques Savoy</string-name>
          <email>Jacques.Savoy@unine.ch</email>
        </contrib>
      </contrib-group>
      <pub-date>
        <year>1995</year>
      </pub-date>
      <abstract>
        <p>For our first participation in CLEF retrieval tasks, our first objective was to define a general stopword list for various European languages (namely, French, Italian, German and Spanish) and also to suggest simple and efficient stemming procedures for them. Our second aim was to suggest a combined approach that might be implemented in order to facilitate effective access to multilingual collections. 1. Monolingual indexing and search Most European languages (including French, Italian, Spanish, German) share many of the same characteristics as does the language of Shakespeare (e.g., word boundaries marked in a conventional manner, variant word forms generated by adding suffixes to the end of a root, etc.). Any adaptation of indexing or search strategies thus means the elaboration of general stopword lists and fast stemming procedures. Stopword lists contain nonsignificant words that are removed from a document or a request before the indexing process is begun. Stemming procedures try to remove inflectional and derivational suffixes in order to conflate word variants into the same stem or root. This first chapter will deal with these issues and is organized as follows: Section 1.1 contains an overview of our five test collections while Section 1.2 describes our general approach to building stopword lists and stemmers for use with languages other than English. Section 1.3 depicts the Okapi probabilistic model together with the description of the runs submitted by us in the monolingual track.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>English</title>
      <p>425 MB
113,005</p>
      <p>French
243 MB
87,191
number of distinct indexing terms / document
mean 167.33 140.476
standard error 126.315 118.605
median 138 102
maximum 1,812 1,723
minimum 2 3
max df 69,082 42,983
number of indexing terms / document
mean 273.846
standard error 246.878
median 212
maximum 6,087
minimum 2
number of queries 47 48 47
no rel. for queries #q:54 #q:57 #q:60 #q:64, #q:87 #q:43 #q:52 #q:64
number rel. items 856 1,193 1,246
mean rel. / request 18.21 24.85 26.51
standard error 22.56 24.57 24.37
median 10 17 18
maximum 107 (#q:50) 90 (#q:60) 95 (#q:50)
minimum 1 (#q:59) 1 (#q:43) 2 (#q:44)</p>
      <sec id="sec-1-1">
        <title>1.2. Stopword lists and stemming procedures</title>
        <p>In order to define general stopword lists, we knew that such lists were already available for the English and
French languages [Fox 1990], [Savoy 1999]. For the three other languages, we established a general stopword
list by following the guidelines described in [Fox 1990]. Firstly, we sorted all word forms appearing in our
corpora according to their frequency of occurrence and we extracted the 200 most frequently occurring words.
Secondly, we inspected this list to remove all numbers (e.g., "1994", "1"), plus all nouns and adjectives more or
less directly related to the main subjects of the underlying collections. For example, the German word "Prozent"
(ranking 69), the Italian noun "Italia" (ranking 87) or the term "política" (ranking 131) from the Spanish corpora
were removed from the final list. From our point of view, such words can be useful as indexing terms in other
circumstances. Thirdly, we included some non-information-bearing words, even if they did not appear in the first
200 most frequent words. For example, we added various personal or possessive pronouns (such as "meine",
"my" in German), prepositions ("nello", "in the" in Italian), conjunctions ("où", "where" in French) or verbs
("estar", "to be" in Spanish). The presence of homographs represents another debatable issue, and to some
extent, we had to make arbitrary decisions concerning their inclusion in stopword lists. For example, the French
word "son" can be translated as "sound" or "his".</p>
        <p>The resulting stopword lists thus contained a large number of pronouns, articles, prepositions and conjunctions.
As in various English stopword lists, there were also some verbal forms ("sein", "to be" in German; "essere", "to
be" in Italian; "sono", "I am" in Italian). In our experiments we used the stoplist provided by the SMART system
(571 English words), and our 217 French words, 431 Italian words, 294 German words and 272 Spanish terms
(these stopword lists are available at http://www.unine.ch/info/clef/).</p>
        <p>After removing high frequency words, an indexing procedure tries to conflate word variants into the same stem or
root using a stemming algorithm. In developing this procedure for the French, Italian, German and Spanish
languages, it is important to remember that these languages have more complex morphologies than does the
English language [Sproat 1992]. As a first approach, we intended to remove only inflectional suffixes such that
singular and plural word forms or feminine and masculine forms conflate to the same root. More sophisticated
schemes have already been proposed for the removal of derivational suffixes (e.g., «-ize», «-ably», «-ship» in the
English language), such as the stemmer developed by Lovins [1968], which is based on a list of over 260
suffixes, while that of Porter [1980] looks for about 60 suffixes.</p>
        <p>A "quick and dirty" stemming procedure has already been developed for the French language [Savoy 1999]. Based
on the same concept, we have implemented a stemming algorithm for the Italian, Spanish and German languages
(the C code for these stemmers can be found at http://www.unine.ch/info/clef/). In Italian, the main inflectional
rule is to modify the final character (e.g., «-o», «-a» or «-e») into another (e.g., «-i», «-e»). As a second rule,
Italian morphology may also alter the final two letters (e.g., «-io» in «-o», «-co» in «-chi», «-ga» in «-ghe»). In
Spanish, the main inflectional rule is to add one or two characters to denote the plural form of nouns or
adjectives (e.g., «-s», «-es» like in "amigo" and "amigos" (friend) or "rey" and "reyes" (king)) or to modify the
final character (e.g., «-z» in «-ces» in "voz" and "voces" (voice)). In German, a few rules may be applied to
obtain the plural form of words (e.g., "Sängerin" into "Sängerinnen" (singer), "Boot" into "Boote" (boat), "Gott"
into "Götter" (god)). However, the suggested algorithms do not account for person and tense variations used by
verbs or other derivational constructions.</p>
        <p>Finally, the morphology of most European languages manifests other aspects that are not taken into account by
our approach, with compound word constructions being just one example (e.g., handgun, worldwide). In German
compound words are widely used and this causes more difficulties than does English. For example, a life
insurance company employee would be "Lebensversicherungsgesellschaftsangeteller" (Leben + S + versicherung
+ S + gesellschaft +S + angeteller for life + insurance + company + employee). Also the morphological marker
(«S») is not always present (e.g., "Bankangetellenlohn" built as Bank + angetellen + lohn (salary)). Finally,
diacritic characters are usually not present in an English collection (with some exceptions, such as "à la carte" or
"résumé"); such characters are replaced by their corresponding non-accentuate letter.</p>
        <p>Given that French, Italian and Spanish morphology is comparable to that of English, we decided to index French,
Italian and Spanish documents based on word stems. For the German language and its more complex
compounding morphology, we decided to use a 5-gram approach [McNamee 2000], [Mayfield 2001]. This value
of 5 was chosen for two reasons; it returns a better performance on CLEF-2000 corpora [Savoy 2001a], and, on
the other hand, it is closed to the mean word length of our German corpora (mean word length: 5.87; standard
error: 3.7).</p>
      </sec>
      <sec id="sec-1-2">
        <title>1.3. Indexing and searching strategy</title>
        <p>For the CLEF-2001 experiments, we conducted different experiments using the OKAPI probabilistic model
[Robertson 2000] in which the weight wij assigned to a given term tj in a document Di was computed according
to the following formula:
wij =
(k1 + 1 ) . tfij</p>
        <p>K + tfij
with K = k1 . ⎡( 1 - b ) + b .</p>
        <p>⎣
li ⎤
avdl⎦
where tfij indicates the within-document term frequency, and b, k1 are constants (fixed at b = 0.75 and
k1 = 1.2). K represents the ratio between the length of Di measured by li (sum of tfij ) and the collection mean
denoted by advl (fixed at 900).</p>
        <p>To index a keyword contained in a request Q, the following formula was used:</p>
        <p>wqj = tfqj . ln[(n - dfj ) / dfj]
where tfqj indicates the search term frequency, dfj the collection-wide term frequency, n the number of documents
in the collection.</p>
        <p>It has been observed that pseudo-relevance feedback (blind expansion) seems to be a useful technique for
enhancing retrieval effectiveness. In this study, we adopted Rocchio's approach [Buckley 1996] with α = 0.75,
β = 0.75 where the system was allowed to add to the original query generally 10 search keywords, extracted from
the 5-best ranked documents.</p>
        <p>In the monolingual track, we submitted six runs along with their corresponding descriptions as listed in Table 2.
Four of them were fully automatic using the request's Title and Descriptive logical sections while the last two
used more logical sections from the documents and were based on the request's Title, Descriptive and Narrative
sections. These last two runs were labeled "manual" because we used logical sections containing manually
assigned index terms. For all runs, we did not use any manual interventions during the indexing and retrieval
procedures.</p>
        <p>As a retrieval effectiveness indicator, we adopted the non-interpolated average precision (computed on the basis of
1,000 retrieved items per request by the TREC-EVAL program) allow for both precision and recall using a single
number. These values (unofficial) are depicted in the last column of Table 2</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>UniNEmofr</title>
      <p>UniNEmoit
UniNEmoge
UniNEmoes</p>
    </sec>
    <sec id="sec-3">
      <title>UniNEmofrM UniNEmoitM Language</title>
    </sec>
    <sec id="sec-4">
      <title>Query</title>
    </sec>
    <sec id="sec-5">
      <title>French</title>
      <p>Italian
German
Spanish</p>
    </sec>
    <sec id="sec-6">
      <title>French Italian T-D T-D</title>
      <p>T-D
T-D
T-D-N
T-D-N</p>
      <p>Form
automatic
automatic
automatic
automatic
manual
manual</p>
      <p>Query expansion
10 terms from 5 best docs
10 terms from 5 best docs
30 terms from 5 best docs
10 terms from 5 best docs
no expansion
10 terms from 5 best docs
( 50.00 )
( 48.65 )
( 42.32 )
( 58.00 )
( 51.84 )
( 54.18 )</p>
      <sec id="sec-6-1">
        <title>2. Multilingual information retrieval</title>
        <p>In order to overcome language barriers [Oard 1996], [Grefenstette 1998], we based our approach on free and
readily available translation resources that automatically provide translations to queries submitted in the desired
target language. More precisely, the original queries were written in English and we did not use any parallel or
aligned corpora to derive statistically or semantically related words in the target language. The first section of
this chapter describes our combined strategy for cross-lingual retrieval while Section 2.2 provides some examples
of translation errors. Finally, Section 2.3 presents our merging strategy and a description of our runs submitted
in the multilingual track.</p>
        <sec id="sec-6-1-1">
          <title>2.1. Query automatic translation</title>
          <p>In order to develop a fully automatically approach, we chose to translate the requests using the SYSTRAN®
system [Gachot 1998] (available for free at http://www.systran.com) and to translate query terms word-by-word
using the BABYLON bilingual dictionary (available at http://www.babylon.com) [Hull 1996]. In the latter case,
the bilingual dictionary may suggest not only one, but several terms for the translation of each word. In our
experiments, we decide to pick the first translation available (under the heading "babylon1") or the first two terms
(indicated under the label "babylon2").
In order to obtain a quantitative picture of a term's ambiguity, we analyze the number of translation alternatives
generated by BABYLON's bilingual dictionaries. For this study, we do not take into account for determinants
(e.g., "the"), conjunctions and prepositions (e.g., "and", "in", "of") or words appearing in our English stopword
list (e.g., "new", "use"), terms generally having a larger number of translations. Based on the Title section of
the English requests, we found 137 search keywords to be translated.</p>
          <p>From the data depicted in Table 3, we can see that the mean number of translations provided by BABYLON
dictionaries varies according to language, from 2.94 for German to 5.64 for Spanish. We found the maximum
number of translation alternatives for the word "fall" in French and German (the word "fall" can be viewed as a
noun or a verb), for the term "court" in Italian and for the word "attacks" in Spanish. The median values of these
distributions is rather small, varying from 2 for German to 4 for Spanish. Thus when considering the first two
translation alternatives, we covered around 54% of the keywords to be translated in German, 40.9% in French,
42.3% in Italian and 36.5% for the Spanish language. Figure 1 shows more clearly how the number of
translation alternatives is relatively concentrated around one.</p>
          <p>In order to improve search performance, we tried combining the machine translation given by the SYSTRAN
system with the bilingual dictionary approaches. In this case for the translated query using the SYSTRAN system
and for each English search term, we would add the first or the first two translated words obtained from a
bilingual dictionary look-up.</p>
          <p>Query (Title only)
mean number of translations
standard deviation
median
maximum</p>
          <p>with word
no translation
only one alternative
two alternatives
three alternatives
Thus, in order to obtain a preliminary picture of the relative merit of each query translation-based strategy, we
analyzed some queries by comparing the translations produced by our two machine-based tools with the request
formulation written by an human being (examples are given in Table 4). As a first example, the title of query
#70 is "Death of Kim Il Sung" (in which the number "II" is written as the letter "i" followed by the letter "l").
This couple of letters "IL" is analyzed as the chemical symbol of illinium (chemical element #61 "found" by two
at the University of Illinois in 1926; however this discovery was not confirmed and the chemical element #61
was finally found in 1947 and was named promethium). Moreover, the proper name "Sung" was analyzed as the
past participle of the verb "to sing".</p>
          <p>As another example, we analyzed query #54 "Final four results" translated as "demi-finales" in French or
"Halbfinale" in German. This request resulted in the incorrect identification of a multi-word concept (namely
"final four") both by our two automatic translation tools and by the manual translation given in Italian and
Spanish (where a more appropriate translation might be "mezzi finali" in Italian or "semifinales" in Spanish).
In query #48 "Peace-keeping forces in Bosnia" or in the request #57 "Tainted-blood trial", our automatic system
was unable to decipher compound word constructions using the "-" symbol and failed to translate the term
"peacekeeping" or "tainted-blood".</p>
          <p>In query #74 "Inauguration of Channel Tunnel", the term "Channel Tunnel" was translated into French as
"Eurotunnel". In the Spanish news test there were various translations for this proper name, including
"Eurotúnel" (which appears in the manually translated request), as well as the term "Eurotunel" or "Eurotunnel".</p>
        </sec>
        <sec id="sec-6-1-2">
          <title>2.3. Merging strategies</title>
          <p>Using our combined approach to automatically translate a query, we were able to search a document collection for
a request written in English. However, this stage represents only the first step in proposing cross-language
information retrieval systems. We also need to investigate situations where users write a request in English in
order to retrieve pertinent documents in English, French, Italian, German and Spanish. To deal with this
multilanguage barrier, we divided our document sources according to language and thus formed five different
collections. After searching in these corpora and obtaining five results lists, we needed to merge them in order to
provide users with a single list of retrieved articles.</p>
          <p>Recent works have suggested various solutions to merge separate results list obtained from separate collections
or distributed information services. As a first approach, we will assume that each collection contains
approximately the same number of pertinent items and that the distribution of the relevant documents is similar
across the result lists. Based solely on the rank of the retrieved records, we can interleave the results in a
roundrobin fashion. According to previous studies [Voorhees 1995], [Callan 1995], the retrieval effectiveness of such
interleaving scheme is around 40% below that achieved from a single retrieval scheme working with a single
huge collection that represents the entire set of documents. However, this decrease may diminish (around -20%)
when using other collections [Savoy 2001b].</p>
          <p>&lt;num&gt; C070 (both query translations failed in French, Italian, German and Spanish)
&lt;EN-title&gt; Death of Kim Il Sung
&lt;FR-title manually translated&gt; Mort de Kim Il Sung
&lt;FR-title SYSTRAN&gt; La mort de Kim Il chantée
&lt;FR-title BYBYLON&gt; mort de Kim Il chanter
&lt;IT-title manually translated&gt; Morte di Kim Il Sung
&lt;IT-title SYSTRAN&gt; Morte di Kim Il cantata
&lt;IT-title BYBYLON&gt; morte di Kim ilinio cantare
&lt;DE-title manually translated&gt; Tod von Kim Il Sung
&lt;GE-title SYSTRAN&gt; Tod von Kim Il gesungen
&lt;GE-title BYBYLON&gt; Tod von Kim Ilinium singen
&lt;ES-title manually translated&gt; Muerte de Kim Il Sung
&lt;ES-title SYSTRAN&gt; Muerte de Kim Il cantada
&lt;ES-title BYBYLON&gt; muerte de Kim ilinio cantar
&lt;num&gt; C047 (both query translations failed in French)
&lt;EN-title&gt; Russian Intervention in Chechnya
&lt;FR-title manually translated&gt; L'intervention russe en Tchéchénie
&lt;FR-title SYSTRAN&gt; Interposition russe dans Chechnya
&lt;FR-title BYBYLON&gt; Russe intervention dans Chechnya
&lt;num&gt; C054 (both query translations failed in French, Italian, German and Spanish)
&lt;EN-title&gt; Final Four Results
&lt;FR-title manually translated&gt; Résultats des demi-finales
&lt;FR-title SYSTRAN&gt; Résultats De la Finale Quatre
&lt;FR-title BYBYLON&gt; final quatre résultat
&lt;IT-title manually translated&gt; Risultati della "Final Four"
&lt;IT-title SYSTRAN&gt; Risultati Di Finale Quattro
&lt;IT-title BYBYLON&gt; ultimo quattro risultato
&lt;DE-title manually translated&gt; Ergebnisse im Halbfinale
&lt;GE-title SYSTRAN&gt; Resultate Der Endrunde Vier
&lt;GE-title BYBYLON&gt; abschliessend Vier Ergebnis
&lt;ES-title manually translated&gt; Resultados de la Final Four
&lt;ES-title SYSTRAN&gt; Resultados Del Final Cuatro
&lt;ES-title BYBYLON&gt; final cuatro resultado
To take account of the document score computed for each retrieved item (or the similarity value between the
retrieved record and the request denoted score rsvj), we might formulate the hypothesis that each collection is
searched by the same or a very similar search engine and that the similarity values are therefore directly
comparable [Kwok 1995], [Moffat 1995]. Such a strategy, called raw-score merging, produces a final list sorted
by the document score computed by each collection. However, as demonstrated by Dumais [1994],
collectiondependent statistics in document or query weights may vary widely among collections, and therefore this
phenomenon may invalidate the raw-score merging hypothesis.</p>
          <p>To account for this fact, we might normalize the document score within each collection by dividing them by the
maximum score (e.i. the document score of the retrieved record in the first position). As a variant of this
normalized score merging scheme, Powell et al. [2000] suggest normalizing the document score rsvj according to
the following formula:
rsv′ j = (rsvj - rsv min )</p>
          <p>(rsvmax - rsv min )
in which rsvj is the original retrieval status value (or document score), and rsvmax and rsvmin are the maximum and
minimum document score values that a collection could achieve for the current request. In this study, the rsvmax
is given by the document score achieved by the first retrieved item and the retrieval status value obtained by the
1000th retrieved record gives the value of rsvmin.</p>
          <p>This merging strategy was used for our four runs that formed a part of the multilingual track. As a baseline for
comparison, we used the manually translated requests in the "UniNEmum" and "UniNEmuLm" runs. In order to
retrieve more relevant items from the various corpora, the "UniNEmuL" and "UniNEmuLm" runs were based on
long request (using the Title, Descriptive and Narrative sections) while the "UniNEmu" and "UniNEmum" runs
were based on queries built with the Title and Descriptive logical sections.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>Run name</title>
    </sec>
    <sec id="sec-8">
      <title>UniNEmum expand</title>
    </sec>
    <sec id="sec-9">
      <title>UniNEmu</title>
      <p>expand</p>
      <p>English
original
5 docs | 10 terms
As indicated in Table 5, our automatic "UniNEmu" and "UniNEmuL" runs used both the query translation
furnished by the SYSTRAN system and one or two translation alternatives given by the BABYLON bilingual
dictionary. The average precision (unofficial) achieved by these runs are depicted in Table 6.
In this our first participation in CLEF retrieval tasks, we are suggesting a general stopword list for the Italian,
German and Spanish languages. Based on our experiments with the French language [Savoy 1999], we would
suggest simple and efficient stemming procedures for these three languages. Although we are convinced that
these stopword lists and stemming procedures are not perfect, based on the relevance assessments of the
CLEF2001 corpora we should be able to improve upon these two retrieval tools.</p>
      <p>For the German language and its high frequency of compound word constructions, it could still be worthwhile to
find out whether n-gram indexing approaches might produce higher levels of retrieval performance relative to an
enhanced word segmentation heuristic, without requiring a German dictionary.</p>
      <p>Moreover, we could consider additional sources of evidence when translating a request (e.g., based on the
EuroWordNet [Vossen 1998]) or logical approaches that would appropriately weight translation alternatives.
Finally, when searching in multiple collections containing documents written in various languages, it might be
worthwhile to look into better results merging strategies or include intelligent selection procedures in order to
avoid searching in a collection or in a language that does not contain any relevant documents.
Acknowledgments
The author would like to thank C. Buckley from SabIR for giving us the opportunity to use the SMART
system, without which this study could not have been conducted. This research was supported by the SNSF
(Swiss National Science Foundation) under grant 21-58 813.99.</p>
      <sec id="sec-9-1">
        <title>Appendix 1. Queries</title>
      </sec>
    </sec>
    <sec id="sec-10">
      <title>C041 &lt;EN-title&gt; Pesticides in Baby Food</title>
      <p>C043 &lt;EN-title&gt; El Niño and the Weather
C045 &lt;EN-title&gt; Israel/Jordan Peace Treaty
C047 &lt;EN-title&gt; Russian Intervention in Chechnya
C049 &lt;EN-title&gt; Fall in Japanese Car Exports
C051 &lt;EN-title&gt; World Soccer Championship
C053 &lt;EN-title&gt; Genes and Diseases
C055 &lt;EN-title&gt; Swiss Initiative for the Alps
C057 &lt;EN-title&gt; Tainted-Blood Trial
C059 &lt;EN-title&gt; Computer Viruses
C061 &lt;EN-title&gt; Siberian Oil Catastrophe
C063 &lt;EN-title&gt; Whale Reserve
C065 &lt;EN-title&gt; Treasure Hunting
C067 &lt;EN-title&gt; Ship Collisions
C069 &lt;EN-title&gt; Cloning and Ethics
C071 &lt;EN-title&gt; Vegetables, Fruit and Cancer
C073 &lt;EN-title&gt; Norwegian Referendum on EU
C075 &lt;EN-title&gt; Euskirchen Court Massacre
C077 &lt;EN-title&gt; Teenage Suicides
C079 &lt;EN-title&gt; Ulysses Space Probe
C081 &lt;EN-title&gt; French Airbus Hijacking
C083 &lt;EN-title&gt; Auction of Lennon Memorabilia
C085 &lt;EN-title&gt; Turquoise Program in Rwanda
C087 &lt;EN-title&gt; Inflation and Brazilian Elections
C089 &lt;EN-title&gt; Schneider Bankruptcy</p>
    </sec>
    <sec id="sec-11">
      <title>C042 &lt;EN-title&gt; U.N./US Invasion of Haiti</title>
      <p>C044 &lt;EN-title&gt; Indurain Wins Tour
C046 &lt;EN-title&gt; Embargo on Iraq
C048 &lt;EN-title&gt; Peace-Keeping Forces in Bosnia
C050 &lt;EN-title&gt; Revolt in Chiapas
C052 &lt;EN-title&gt; Chinese Currency Devaluation
C054 &lt;EN-title&gt; Final Four Results
C056 &lt;EN-title&gt; European Campaigns against Racism
C058 &lt;EN-title&gt; Euthanasia
C060 &lt;EN-title&gt; Corruption in French Politics
C062 &lt;EN-title&gt; Northern Japan Earthquake
C064 &lt;EN-title&gt; Computer Mouse RSI
C066 &lt;EN-title&gt; Russian Withdrawal from Latvia
C068 &lt;EN-title&gt; Attacks on European Synagogues
C070 &lt;EN-title&gt; Death of Kim Il Sung
C072 &lt;EN-title&gt; G7 Summit in Naples
C074 &lt;EN-title&gt; Inauguration of Channel Tunnel
C076 &lt;EN-title&gt; Solar Energy
C078 &lt;EN-title&gt; Venice Film Festival
C080 &lt;EN-title&gt; Hunger Strikes
C082 &lt;EN-title&gt; IRA Attacks in Airports
C084 &lt;EN-title&gt; Shark Attacks
C086 &lt;EN-title&gt; Renewable Power
C088 &lt;EN-title&gt; Mad Cow in Europe
C090 &lt;EN-title&gt; Vegetable Exporters
[McNamee 2000]
[Moffat 1995]
[Oard 1996]
[Porter 1980]
[Powell 2000]
[Robertson 2000]
[Savoy 1999]
[Savoy 2001a]
[Savoy 2001b]</p>
      <p>
        Kwok, K. L., Grunfeld L. &amp; Lewis, D. D. (
        <xref ref-type="bibr" rid="ref2">1995</xref>
        ). TREC-3 ad-hoc, routing retrieval and
thresholding experiments using PIRCS. In Proceedings of TREC'3, (pp. 247-255).
Gaithersburg: NIST Publication #500-225.
      </p>
      <p>
        Lovins, J. B. (
        <xref ref-type="bibr" rid="ref8">1968</xref>
        ). Development of a stemming algorithm. Mechanical Translation and
Computational Linguistics, 11(1), 22-31.
      </p>
      <p>Mayfield, J., McNamee, P. &amp; Piatko, J. (2001). The JHU/APL HAIRCUT system at
Trec-8. In Proceedings TREC-8, (pp. 445-452). Gaithersburg: NIST Publication
#500246.</p>
      <p>
        McNamee, P. &amp; Mayfield, J. (2000). A language-independent approach to European text
retrieval. In Proceedings CLEF-2000, http://www.iei.pi.cnr.it/DELOS/CLEF/apl.doc.
Moffat, A. &amp; Zobel, J. (
        <xref ref-type="bibr" rid="ref2">1995</xref>
        ). Information retrieval systems for large document
collections. In Proceedings of TREC'3, (pp. 85-93). Gaithersburg,: NIST Publication
#500-225.
      </p>
      <p>
        Oard, D. &amp; Dorr, B. J. (
        <xref ref-type="bibr" rid="ref1 ref7">1996</xref>
        ). A survey of multilingual text retrieval. Institute for
advanced computer studies and computer science department, University of Maryland,
http://www.clis.umd.edu/dlrg/filter/papers/mlir.ps.
      </p>
      <p>Porter, M. F. (1980). An algorithm for suffix stripping. Program, 14, 130-137.
Powell, A. L., French, J. C., Callan, J., Connell, M. &amp; Viles, C. L. (2000). The impact
of database selection on distributed searching. In Proceedings of the 23rd International
Conference of the ACM-SIGIR'2000, (pp. 232-239). New York: The ACM Press.
Robertson, S. E., Walker, S. &amp; Beaulieu, M. (2000). Experimentation as a way of life:
Okapi at TREC. Information Processing &amp; Management, 36(1), 95-108.
Savoy, J. (1999). A stemming procedure and stopword list for general French corpora.
Journal of the American Society for Information Science, 50(10), 944-952.
Savoy, J. (2001). Bilingual information retrieval: CLEF-2000 experiments. In
Proceedings ECSQARU-2001 Workshop. Toulouse, France: to appear.</p>
      <p>
        Savoy, J. &amp; Rasolofo, Y. (2001). Report on the TREC-9 experiment: Link-based retrieval
and distributed collections. In Proceedings TREC-9. Gaithersburg, MD: to appear.
Sproat, R. (1992). Morphology and computation. Cambridge: The MIT Press.
Voorhees, E. M., Gupta, N. K. &amp; Johnson-Laird, B. (
        <xref ref-type="bibr" rid="ref2">1995</xref>
        ). The collection fusion
problem. In Proceedings of TREC'3, (pp. 95-104). Gaithersburg: NIST Publication
#500225.
      </p>
      <p>
        Vossen, P. (
        <xref ref-type="bibr" rid="ref5">1998</xref>
        ). EuroWordNet: A multilingual database with lexical semantic networks.
Dordrecht: Kluwer.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [Buckley 1996] Buckley,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Singhal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Mitra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            &amp;
            <surname>Salton</surname>
          </string-name>
          ,
          <string-name>
            <surname>G.</surname>
          </string-name>
          (
          <year>1996</year>
          ).
          <article-title>New retrieval approaches using SMART</article-title>
          .
          <source>In Proceedings of TREC'4</source>
          , (pp.
          <fpage>25</fpage>
          -
          <lpage>48</lpage>
          ). Gaithersburg: NIST Publication #
          <fpage>500</fpage>
          -
          <lpage>236</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [Callan 1995]
          <string-name>
            <surname>Callan</surname>
            ,
            <given-names>J. P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Croft</surname>
            ,
            <given-names>W. B.</given-names>
          </string-name>
          (
          <year>1995</year>
          ).
          <article-title>Searching distributed collections with inference networks</article-title>
          .
          <source>In Proceedings of the 18th International Conference of the ACMSIGIR'95</source>
          (pp.
          <fpage>21</fpage>
          -
          <lpage>28</lpage>
          ). New York: The ACM Press.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [Dumais 1994] Dumais,
          <string-name>
            <surname>S. T.</surname>
          </string-name>
          (
          <year>1994</year>
          ).
          <article-title>Latent semantic indexing (LSI) and TREC-2</article-title>
          .
          <source>In Proceedings of TREC'2</source>
          , (pp.
          <fpage>105</fpage>
          -
          <lpage>115</lpage>
          ). Gaithersburg: NIST Publication #
          <fpage>500</fpage>
          -
          <lpage>215</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [Fox 1990]
          <string-name>
            <surname>Fox</surname>
            <given-names>C.</given-names>
          </string-name>
          (
          <year>1990</year>
          ).
          <article-title>A stop list for general text</article-title>
          .
          <source>ACM-SIGIR Forum</source>
          ,
          <volume>24</volume>
          ,
          <fpage>19</fpage>
          -
          <lpage>35</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [Gachot 1998]
          <string-name>
            <surname>Gachot</surname>
            ,
            <given-names>D. A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lange</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          (
          <year>1998</year>
          ).
          <article-title>The SYSTRAN NLP browser: An application of machine translation technology</article-title>
          . In Grefenstette G. (Ed.),
          <article-title>Cross-language information retrieval</article-title>
          , (pp.
          <fpage>105</fpage>
          -
          <lpage>118</lpage>
          ). Boston: Kluwer.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [Grefenstette 1998] Grefenstette,
          <string-name>
            <surname>G</surname>
          </string-name>
          . (Ed.) (
          <year>1998</year>
          ).
          <article-title>Cross-language information retrieval</article-title>
          . Amsterdam: Kluwer.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [Hull 1996]
          <string-name>
            <surname>Hull</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Grefenstette</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          (
          <year>1996</year>
          ).
          <article-title>Querying across languages: A dictionary-based approach to multilingual information retrieval</article-title>
          .
          <source>In Proceedings of the 19th International Conference of the ACM-SIGIR'96</source>
          , (pp.
          <fpage>49</fpage>
          -
          <lpage>57</lpage>
          ). New York: The ACM Press.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <source>[Lovins</source>
          <year>1968</year>
          ]
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>