<!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>JHU/APL Experiments in Tokenization and Non-Word Translation</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Paul McNamee and James Mayfield Johns Hopkins University Applied Physics Laboratory 11100</institution>
          <addr-line>Johns Hopkins Road Laurel, MD 20723-6099</addr-line>
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In the past we have conducted experiments that investigate the benefits and peculiarities attendant to alternative methods for tokenization, particularly overlapping character n-grams. This year we continued this line of work and report new findings reaffirming that the judicious use of n-grams can lead to performance surpassing that of word-based tokenization. In particular we examined: the relative performance of n-grams and a popular suffix stemmer; a novel form of n-gram indexing that approximates stemming and achieves fast run-time performance; various lengths of n-grams; and the use of n-grams for robust translation of queries using an aligned parallel text. For the CLEF 2003 evaluation we submitted monolingual and bilingual runs for all languages and language pairs, multilingual runs using English as a source language, and a first attempt and cross-language spoken document retrieval. Our key findings are that shorter n-grams (n=4 and n=5) outperform a popular stemmer in non-Romance languages, that direct translation of n-grams is feasible using an aligned corpus, that translated 5-grams yield superior performance to words, stems, or 4grams, and that a combination of indexing methods is best of all.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        In the past we have examined a number of issues pertaining to how documents and queries are represented.
This has been a particular interest in our work with the HAIRCUT retrieval system due to the consistent
success we have observed with the use of overlapping character n-grams. Simple measures that can be
uniformly applied to text processing, regardless of language, reduce developer effort and appear to be at least
as effective as approaches that rely on language-specific processing, and perhaps more so. They are
increasingly used when linguistic resources are unavailable[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ][
        <xref ref-type="bibr" rid="ref14">14</xref>
        ][
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], but in general have not been widely
adopted. We believe that this may be due in part to a belief that n-grams are not as effective as competing
approaches (an idea that we attempt to refute here), and also due to a fear of increased index-time and
runtime costs. We do not focus on the second concern here; few studies addressing the performance implications
of n-gram processing have been undertaken (but see [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]), and we hope this gap is soon filled.
We submitted official runs for the monolingual, bilingual, multilingual tracks and participated in the first
cross-language spoken document benchmark. For all of our runs we used the HAIRCUT system and a
statistical language model similarity calculation. Many of our official runs were based on n-gram processing
though we found that by using a combination of n-grams and stemmed words better performance can be
obtained. For our bilingual runs we relied on pre-translation query expansion. We also developed a new
method of translating queries, using n-grams rather than words as the elements to be translated. This method
does not suffer from several key obstacles in dictionary-based translation, such as word lemmatization,
matching of multiple word expressions, and out-of-vocabulary words such as common surnames [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ].
HAIRCUT supports a variety of indexing terms and represents documents using a bag-of-terms model. Our
general method is to process the text for each document, reducing all terms to lower-case. Generally words
were deemed to be white-space delimited tokens in the text; however, we preserve only the first 4 digits of a
number and we truncate any particularly long tokens (those greater than 35 characters in length). Once
words are identified we optionally perform transformations on the words to create indexing terms (e.g.,
stemming). So-called stopwords are retained in our index and the dictionary is created from all words present
in the corpus.
      </p>
      <p>
        We have wondered whether diacritical marks have much effect upon retrieval performance - for a long time
we have been retaining diacritical marks as part of our ordinary lexical processing, in keeping with a
keep-itsimple approach. One principled argument for retaining inflectional marks is that they possess a
deconflationary effect when content words that differ only in diacritics have different meaning. For example,
the English words resume (to continue) and résumé (a summary of one’s professional life) can be
distinguished by differences in diacritics. On the other hand, such marks are not always uniformly applied,
and furthermore, if retained, might distinguish two semantically related words. Stephen Tomlinson
investigated preservation of diacritics using the CLEF 2002 collection and reported that it was helpful in
some cases (Finnish) and harmful in others (Italian and French) [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. We found similar results (see Table 1),
though the effect is seen only for words, not n-grams. As there is practically no effect, we opted to remove
such accents routinely. Intuitively we thought that removing the distinction might improve corpus statistics
when n-grams are used. Whenever stemming was used, words were first stemmed, and then any remaining
marks were removed; this enabled the stemmer to take advantage of marks when present. N-grams were
produced from the same sequence of words; however, we attempt to detect sentence boundaries to prevent
generating n-grams across sentence boundaries.
HAIRCUT uses gamma compression to reduce the size of the inverted file. Within-document positional
information is not retained, but both document-id and term frequencies are compressed. We also produce a
‘dual file’ that is a document-indexed collection of term-ids and counts. Construction of this data structure
doubles our on-disk space requirements, but confers advantages such as being able to quickly examine
individual document representations. This is particularly useful for automated (local) query expansion. Our
lexicon is stored as a B-tree but nodes are compressed in memory to maximize the number of in-memory
terms subject to physical memory limitations. For the indexes created for CLEF 2003 memory was not an
issue as only O(106) distinct terms were found in each collection.
      </p>
      <p>
        We use a statistical language model for retrieval akin to those presented by Miller et al. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] and Hiemstra [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]
with Jelinek-Mercer smoothing[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. In this model, relevance is defined as
      </p>
      <p>P(D | Q) = ∏[αP(q | D) + (1 −α )P(q | C)],</p>
      <p>q ∈Q
where Q is a query, D is a document, C is the collection as a whole, and α is a smoothing parameter. The
probabilities on the right side of the equation are replaced by their maximum likelihood estimates when
scoring a document. The language model has the advantage that term weights are mediated by the corpus.
Our experience has been that this type of probabilistic model outperforms a vector-based cosine model or a
binary independence model with Okapi BM25 weighting.</p>
      <p>For the monolingual, bilingual, and multilingual tasks, all of our submitted runs were based on a combination
of several base runs. Our method for combination was to normalize scores by probability mass and to then
merge documents by score. All of our runs were automatic runs and used only the title and description topic
fields.</p>
    </sec>
    <sec id="sec-2">
      <title>Monolingual Experiments</title>
      <p>For our monolingual work we created several indexes for each language using the permissible document
fields appropriate to each collection. Our four basic methods for tokenization were unnormalized words,
stemmed words obtained through the use of the Snowball stemmer, 4-grams, and 5-grams. Information about
each index is shown in Table 2.</p>
      <p>language #docs %docs
From the table above it can be seen that the percentage of relevant documents for each subcollection is
closely related to its contribution to the overall number of documents. This would suggest that collection size
might be a useful factor for multilingual merging. We also note that n-gram indexing results in increased disk
storage costs. This cost is driven by the increased number of postings in the inverted file when n-gram
indexing is performed.</p>
      <p>
        Our use of 4-grams and 5-grams as indexing terms represents a departure from previous work using 6-grams
[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. We conducted tests using various lengths of n-grams for all eight CLEF 2002 languages and found that
choices of n=4 or n=5 performed best. Figure 1 charts performance using six different term indexing
strategies; a value of α=0.5 was used throughout and no relevance feedback was attempted.
      </p>
      <sec id="sec-2-1">
        <title>Effect of Differing Tokenization</title>
        <p>DE</p>
        <p>EN</p>
        <p>ES</p>
        <p>FI</p>
        <p>FR</p>
        <p>IT</p>
        <p>NL</p>
        <p>
          SV
We determined that use of n=4 or n=5 is best in all eight languages though it is hard to distinguish between
the two. 6-grams are clearly not as effective in these languages. There are differences in performance
depending on the value of smoothing constant, α, that is used, though we have yet to test whether these
differences are significant or merely represent overtraining on the 2002 test set. The effect of smoothing
parameter selection in language model-based retrieval was investigated by Zhai and Lafferty [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]. We report
on our results investigating the effect of n-gram length, with additional detail and further experiments in a
forthcoming manuscript [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ].
        </p>
        <p>
          In additional to determining good values for n, we also wanted to see if n-grams remained an attractive
technique in comparison to stemmed words. Having no substantive experience with stemming, we were
pleased to discover that the Snowball stemmer [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ], a derivative of the Porter stemmer extended to many
languages by Porter, provides a set of rules for all of the CLEF 2003 languages. Furthermore, the software
contains Java bindings so it fit seamlessly with the HAIRCUT system. We decided to make a comparison
between raw words, stems, 4-grams, 5-grams, and a surrogate technique based on n-grams that might
approximate stems. Our n-gram approximation to stemming was based on picking the word-internal n-gram
for each word with lowest document frequency (i.e., we picked the least common n-gram for each word). As
an example, consider the words ‘juggle’, ‘juggles’, and ‘juggler’. The least common 5-gram for the first two
is ‘juggl’, however the least common 5-gram for ‘juggler’ is ‘ggler’1. The least common 4-gram for all three
words is ‘jugg’. We hypothesize that high IDF n-gram affixes will span portions of words that exhibit little
morphological variation.
        </p>
        <p>
          This method has the advantage of providing some morphological normalization, but it does not increase the
number of postings in an inverted file. This can be viewed either as a way to approximate stems or a way of
lowering the computational cost of using n-grams. We found that n-grams did outperform stems, and that our
pseudo stems based on n-grams were better than raw words, but not as effective as a rule-based stemmer (see
Figure 2). Details about this work can be found in Mayfield and McNamee [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
        </p>
        <p>sv
nl
it
fr
fi
es
en
de
0.00
0.10</p>
        <p>0.20 0.30
Mean Average Precision
0.40</p>
        <p>
          0.50
Words
1 The Snowball stemmer also fails to transform juggler to a canonical form.
To produce our official monolingual runs we decided to combine runs based on the Snowball stemmer with
runs using n-grams as indexing terms. Runs named aplmoxxa used 4-grams and stems while runs named
aplmoxxb used 5-grams and stems. However, due to a mistake while creating the scripts used to produce all
of our runs, we inadvertently failed to perform blind relevance feedback for our monolingual submissions.
Routinely we expand queries to 60 terms using additional terms ranked after examining the top 20 and
bottom 75 (of 1000) documents. Failing to use blind relevance feedback had a detrimental effect on our
official runs. Our official monolingual runs are described in Table 4 and corrected scores are presented on
the far right.
It appears that several of our runs would have increased substantially if we had correctly used blind relevance
feedback. Relative improvements of more than 5% were seen in German, Russian, and Spanish although
performance would have dropped slightly in Swedish. The German and Spanish document collections are the
two largest in the entire test suite. We wonder if relevance feedback may be more beneficial when larger
collections are available, a conjecture partially explored by Kwok and Chan [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ].
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Bilingual Experiments</title>
      <p>This year the Bilingual task focused on retrieval involving four language pairs, which notably did not contain
English as a source or target language. This is only significant because of the difficulty in locating direct
translation resources for some language pairs and the fact that many translation resources are available when
English is one of the languages involved. The four language pairs are German to Italian, Finnish to German,
French to Dutch, and Italian to Spanish.</p>
      <p>
        For the 2002 campaign we relied on a single translation resource: bilingual wordlists extracted from parallel
corpora. We built a large alignable collection from a single source, the Official Journal of the EU [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], and
we again used this resource as our only source of translations for 2003. The parallel corpus grew by about
50% this year, so a somewhat larger resource was available. First we describe the construction of the parallel
corpus and the extraction of our bilingual wordlists, then we discuss our overall strategy for bilingual
retrieval, and finally we report on our official results.
      </p>
      <p>
        Our collection was obtained through a nightly crawl of the Europa web site where we targeted the Official
Journal of the European Union [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. The Journal is available in each of the E.U. languages and consists
mainly of governmental topics, for example, trade and foreign relations. We had data available from
December 2000 through May 2003. Though focused on European topics, the time span is 5 to 8 years after
the CLEF-2002 document collection. The Journal is published electronically in PDF format and we wanted
to create an aligned collection. We started with 33.4 GB of PDF documents and converted them to plain text
using the publicly available pdftotext software (version 1.0). Once converted to text, documents were split
into pieces using conservative rules for page breaks and paragraph breaks. Many of the documents are
written in outline form, or contain large tables, so this pre-alignment processing is not easy. We ended up
with about 300MB of text, per language, that could be aligned. Alignment was carried out using the
char_align program [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. In this way we created an aligned collection of approximately 1.2 million passages;
these ‘documents’ were each about 2 or 3 sentences in length.
      </p>
      <p>We performed pairwise alignments between languages pairs, for example, between German and Italian. Once
aligned, we indexed each pairwise-aligned collection using the technique described for the CLEF-2003
document collections. Again, we created four indexes per sub-collection, per language – one each of words,
stems, 4-grams and 5-grams. Our goal was to support query term translation, so for each source language
term occurring in at least 4 documents, we attempted to determine a translation of the same token type in the
target language. At this point we should mention that the ‘proper’ translation of an n-gram is decidedly
slippery – clearly there can be no single correct answer. Nonetheless, we simply relied on the large volume
of n-grams to smooth topic translation. For example, the central 5-grams of the English phrase ‘prime
minister’ include ‘ime_m’, ‘me_mi’, and ‘e_min’. The derived ‘translations’ of these English 5-grams into
French are ‘er_mi’, ‘_mini’, and ‘er_mi’, respectively. This seems to work as expected for the French phrase
‘premier ministre’, although the method is not foolproof. Consider n-gram translations from the phrase
‘communist party’ (parti communiste): ‘_commu’ (mmuna), ‘commu’ (munau), ‘ommun’ (munau), ‘mmuni’
(munau), ‘munis’ (munis), ‘unist’ (unist), ‘nist_’ (unist), ‘ist_p’ (ist_p), ‘st_pa’ (1_re_), ‘t_par’ (rtie_),
‘_part’ (_part), ‘party’ (rtie_), and ‘arty_’ (rtie_). The lexical coverage of translation resources is a critical
factor for good CLIR performance, so the fact that almost any n-gram has a ‘translation’ should improve
performance. The direct translation of n-grams may offer a solution to several key obstacles in
dictionarybased translation. Word normalization is not essential since sub-word strings will be compared. Translation
of multiword expressions can be approximated by translation of word-spanning n-grams. Out-of-vocabulary
words, particularly proper nouns, can be be partially translated by common n-gram fragments or left
untranslated in close languages.</p>
      <p>We extracted candidate translations as follows. First, we would take a candidate term as input and identify
documents containing this term in the source language subset of the aligned collection. Up to 5000
documents were considered; we bounded the number for reasons of efficiency and because we felt that
performance was not enhanced appreciably when a greater number of documents was used. If no document
contained this term, then it was left untranslated. Second, we would identify the corresponding documents in
the target language. Third, using a statistic that is similar to mutual information, we would extract a single
potential translation. Our statistic is a function of the frequency of occurrence in the whole collection and the
frequency in the subset of aligned documents. In this way we extracted the single-best target language term
for each source language term in our lexicon (not just the query terms in the CLEF topics). When 5-grams
were used this process took several days.</p>
      <p>Table 5 lists examples of translating within the designated language pairs using each type of tokenization.
Mistakes are evident; however, especially when pre-translation expansion is used the overall effectiveness is
quite high. We believe the redundancy afforded by translating multiple n-grams for each query word also
reduces loss due to erroneous translations. Finally, incorrect translations may still prove helpful if they are a
collocation rather than an actual translation.
5grams
words
stems
4grams
We remain convinced that pre-translation query expansion is a tremendously effective method to improve
bilingual performance. Therefore we used each CLEF 2003 document collection as an expansion collection
for the source language queries. Queries were expanded to a list of 60 terms, and then we attempted to
translate each using our corpus-derived resource. In the past we have been interested in using n-grams as
terms, however, we have worked with bilingual wordlists for translation. This year we decided to create
translingual mappings using the same tokenization in both the source and target languages. Thus for each of
the four language pairs, we created four different lists (for a total of 16): one list per type of indexing term
(i.e., word, stem, 4-gram, or 5-gram). Again using experiments on the CLEF 2002 collection, we determined
that mappings between n-grams were more efficacious than use of word-to-word or stem-to-stem mappings.
Thus different tokenization can be used for initial search, pre-translation expansion, query translation, and
target language retrieval. In testing we found the best results using both n-grams and stems for an initial
source-language search, then we extracted ordinary words as ‘expansion’ terms, and finally we translated
each n-gram contained in the expanded source language word list into n-grams in the target language (or
stems into stems, as appropriate). The process is depicted in Figure 3:</p>
      <sec id="sec-3-1">
        <title>Ribellioni in Sierra Leone e i</title>
        <p>IT query</p>
        <p>ES docs
combattimenti
ribelli
guerriglieri
diamanti sierra
diamantifero
militare
rivoluzionario
leone
…</p>
      </sec>
      <sec id="sec-3-2">
        <title>Tokenization &amp;</title>
        <p>Translation
combates militares
ribeldes rivolucionario
guerriglieri leona
diamantes sierra
diamantes …</p>
      </sec>
      <sec id="sec-3-3">
        <title>Words</title>
      </sec>
      <sec id="sec-3-4">
        <title>N-grams</title>
        <p>_comb, comba, ebate, …
_sier, sierra, erra_, erril, …
milit, itari, …
_diam, diama, …
…
Our runs named aplbixxyya are bilingual runs that were translated directly from the source language to the
target language; each run was a combination of four base runs that either used words, stems, 4-grams, or
5grams, with (post-translation) relevance feedback. The runs named aplbixxyyb were combined in the same
way, however the four constituent base runs did not make use of post-translation feedback. When words or
stems were used a value of 0.3 was used for alpha; when n-grams were used the value was 0.5. The base runs
are compared in Figure 4.</p>
        <sec id="sec-3-4-1">
          <title>Tokenization and Translation</title>
          <p>DEIT</p>
          <p>FIDE</p>
          <p>FRNL</p>
          <p>ITES</p>
          <p>From observing the data in Table 6 and Figure 4, it would appear that the use of post-translation feedback did
not enhance performance when multiple runs were combined. The two types of runs seemed to perform
similarly in two language pairs (Finnish to German and Italian to Spanish); however, the merged runs
without relevance feedback did better for the German to Italian and French to Dutch runs.
Combination of methods resulted in between a 3 and 10% gain depending on language pair. We have not yet
had the opportunity to retrospectively analyze the contribution to our overall performance of pre-translation
expansion.</p>
          <p>0.50
0.45
n
io0.40
s
i
c
e
r
P
eg0.35
a
r
e
v
A
n
ea0.30
M
0.25
0.20
words
stems
4-grams
5-grams
words noRF
stems noRF
4-grams noRF
5-grams noRF
Best APL Run</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Multilingual Experiments</title>
      <p>We initially thought to create runs for the multilingual task in the exact same way as for the bilingual task.
However, we decided to use English as our source language and we had to create translation lists for seven
languages using four tokenization types (a total of 28 mappings). Construction of the 5-gram lists took
longer than expected and so we had to modify our plans for our official submission. We decided to submit a
hybrid run based on words, stems, and 4-grams; merging was again accomplished using normalized scores.
As with the bilingual task, runs ending in ‘a’ denote the use of post-translation relevance feedback, while
runs ending in ‘b’ did not use feedback (see Table 7).</p>
    </sec>
    <sec id="sec-5">
      <title>Spoken Document Evaluation</title>
      <p>This was our first time using the TREC-8 and TREC-9 spoken document dataset. Our submissions were
created in very short order – in one day. We pre-processed the data so it had similar SGML markup as the ad
hoc TREC collections and then indexed the English text using only 5-grams. The index took 33 minutes to
build. We did not make use of any collection expansion for these runs. Our processing was similar to the
work we did for the bilingual track, except that we used only 5-grams as translation terms and did not use
pre-translation expansion (which was not permitted for ‘primary’ submissions).</p>
    </sec>
    <sec id="sec-6">
      <title>Conclusions</title>
      <p>For the first time we were able to directly compare words, various lengths of character n-grams, a suffix
stemmer, and an n-gram alternative to stemming, all using the same retrieval engine. We found that n-grams
of shorter lengths (n=4 or n=5) were preferable across the CLEF 2003 languages and that n-grams generally
outperformed use of the Snowball stemmer: 4-grams had a 8% mean relative advantage across the 9
languages compared to stems; however stemming was better in Italian and Spanish (by 17% and 5%
respectively). We found best performance can be obtained using a combination of methods. If emphasis is
placed on accuracy over storage requirements or response time, this approach is reasonable. For bilingual
retrieval we identified a method for direct translation of n-grams instead of word-based translation. Without
the use of relevance feedback, 5-grams outperformed stems by an average of 17% over the four bilingual
pairs though 4-grams appeared to lose much of their monolingual superiority. When feedback was used, the
gap narrowed substantially.</p>
      <p>This work should not be taken as an argument against language resources, but rather as further evidence that
knowledge-light methods can be quite effective, when optimized. We are particularly excited about the use
of non-word translation (i.e., using direct n-gram translation) as this appears to have the potential to avoid
several pitfalls that plague dictionary-based translation of words.</p>
      <p>We are still analyzing our results from the multilingual and spoken-document tracks and hope to report on
them more fully in our revised paper.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>K.W.</given-names>
            <surname>Church</surname>
          </string-name>
          ,'
          <article-title>Char_align: A program for aligning parallel texts at the character level</article-title>
          .
          <source>' Proceedings of the 31st Annual Meeting of the Association for Computational Linguistics</source>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          ,
          <year>1993</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>D.</given-names>
            <surname>Hiemstra</surname>
          </string-name>
          ,
          <article-title>Using Language Models for Information Retrieval</article-title>
          .
          <source>Ph. D. Thesis</source>
          , Center for Telematics and Information Technology,
          <source>The Netherlands</source>
          ,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>F.</given-names>
            <surname>Jelinek</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Mercer</surname>
          </string-name>
          , '
          <article-title>Interpolated Estimation of Markov Source Parameters from Sparse Data'</article-title>
          .
          <source>In Gelsema ES and Kanal LN eds., Pattern Recognition in Practice</source>
          , North Holland, pp.
          <fpage>381</fpage>
          -
          <lpage>402</lpage>
          ,
          <year>1980</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>K. L.</given-names>
            <surname>Kwok</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Chan</surname>
          </string-name>
          , '
          <article-title>Improving Two-Stage Ad-Hoc Retrieval for Short Queries</article-title>
          .'
          <source>In the Proceedings of the 21st International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR-98)</source>
          , pp.
          <fpage>250</fpage>
          -
          <lpage>256</lpage>
          ,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>J.</given-names>
            <surname>Mayfield</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>McNamee</surname>
          </string-name>
          , '
          <string-name>
            <surname>Single N-gram</surname>
            <given-names>Stemming</given-names>
          </string-name>
          ', To appear
          <source>in the Proceedings of the Twenty-Sixth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>P.</given-names>
            <surname>McNamee</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Mayfield</surname>
          </string-name>
          , '
          <article-title>Scalable Multilingual Information Access'</article-title>
          . To appear
          <source>in the Proceedings of the CLEF 2002 Workshop.</source>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>P.</given-names>
            <surname>McNamee</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Mayfield</surname>
          </string-name>
          , '
          <article-title>Comparing Cross-Language Query Expansion Techniques by Degrading Translation Resources'</article-title>
          .
          <source>In the Proceedings of the 25th Annual International Conference on Research and Development in Information Retrieval</source>
          , Tampere, Finland, pp.
          <fpage>159</fpage>
          -
          <lpage>166</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>P.</given-names>
            <surname>McNamee</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Mayfield</surname>
          </string-name>
          , '
          <article-title>Character N-gram Tokenization for European Language Text Retrieval'</article-title>
          . To appear in Information Retrieval.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>D.</given-names>
            <surname>Miller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Leek</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Schwartz</surname>
          </string-name>
          , '
          <article-title>A hidden Markov model information retrieval system'</article-title>
          .
          <source>In Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          , Berkeley, California, pp.
          <fpage>214</fpage>
          -
          <lpage>221</lpage>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>E.</given-names>
            <surname>Miller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Liu</surname>
          </string-name>
          , and C. Nicholas, '
          <article-title>Performance and Scalability of a Large-Scale N-gram Based Information Retrieval System</article-title>
          .'
          <source>In the Journal of Digital Information</source>
          ,
          <volume>1</volume>
          (
          <issue>5</issue>
          ),
          <year>January 2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>C.</given-names>
            <surname>Monz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kamps</surname>
          </string-name>
          , and M. de Rijke, 'The University of Amsterdam at CLEF 2002',
          <source>Working Notes of the CLEF 2002 Workshop</source>
          , pp.
          <fpage>73</fpage>
          -
          <lpage>84</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A.</given-names>
            <surname>Pirkola</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Hedlund</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Keskusalo</surname>
          </string-name>
          , and
          <string-name>
            <given-names>K.</given-names>
            <surname>Järvelin</surname>
          </string-name>
          , '
          <string-name>
            <surname>Dictionary-Based Cross-Language Information</surname>
          </string-name>
          Retrieval: Problems, Methods, and Research Findings',
          <source>Information Retrieval</source>
          ,
          <volume>4</volume>
          :
          <fpage>209</fpage>
          -
          <lpage>230</lpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>M.</given-names>
            <surname>Porter</surname>
          </string-name>
          , '
          <article-title>Snowball: A Language for Stemming Algorithms'</article-title>
          , http://snowball.tartarus.org/texts/introduction.html,
          <source>(visited 13 March</source>
          <year>2003</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>D.</given-names>
            <surname>Reidsma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hiemstra</surname>
          </string-name>
          , F. de Jong, and W. Kraaij, '
          <article-title>Cross-language Retrieval at Twente</article-title>
          and TNO',
          <source>Working Notes of the CLEF 2002 Workshop</source>
          , pp.
          <fpage>111</fpage>
          -
          <lpage>114</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>J.</given-names>
            <surname>Savoy</surname>
          </string-name>
          <article-title>Cross-language information retrieval: experiments based on CLEF 2000 corpora</article-title>
          .
          <source>Information Processing and Management</source>
          ,
          <volume>39</volume>
          (
          <issue>1</issue>
          ):
          <fpage>75</fpage>
          -
          <lpage>115</lpage>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>S.</given-names>
            <surname>Tomlinson</surname>
          </string-name>
          , '
          <article-title>Experiments in 8 European Languages with Hummingbird SearchServer at CLEF</article-title>
          <year>2002</year>
          ',
          <source>Working Notes of the CLEF 2002 Workshop</source>
          , pp.
          <volume>203</volume>
          ,
          <issue>214</issue>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhai</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Lafferty</surname>
          </string-name>
          , '
          <article-title>A Study of Smoothing Methods for Language Models Applied to Ad Hoc Information Retrieval'</article-title>
          <source>Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          , pp.
          <fpage>334</fpage>
          -
          <lpage>342</lpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>[18] http://europa.eu.int/</mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>