<!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>COLE at CLEF 2004: Rapid prototyping of a QA system for Spanish</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Departamento de Computacio ́n Universidade da Corun ̃a Campus de Elvin ̃</institution>
          <addr-line>a s/n 15071 La Corun ̃a</addr-line>
          ,
          <country country="ES">Spain</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This is our third participation in CLEF, this time in the Spanish monolingual Question Answering track. We have continued applying Natural Language Processing techniques for single word conflation. Our approach for Question Answering is based on complex pattern matching either over forms, part-of-speech tags or lemmas of the words involved. In past editions of CLEF, our research group has participated in the Spanish monolingual Information Retrieval (IR) track [23, 22], applying Natural Language Processing (NLP) techniques to conflate the documents to be indexed. In these past participations, our main premise has been the simplicity, motivated by the lack of freely available linguistic resources for Spanish such as large tagged corpora, treebanks or advanced lexicons. This year, in this our first participation in the Spanish monolingual Question Answering (QA) track, our premise keeps being the same in order to get a valid prototype which will be improved by continuous refinements. As usual, in our QA system we have identified three tasks: analysis of the question, retrieval of the passages of the documents related to the question and identification of the exact fragment of the document that constitutes the answer. Thus, this paper should be read as a progress report. Our research in QA is in an early stage and much work has to be done. It should be remarked that another serious drawback is the lack of freely available linguistic resources for Spanish. This article is outlined as follows. Section 2 introduces the NLP techniques we have used in our prototype. After that, section 3 describes the overall design of the prototype and then the different modules of the system are described in subsequent sections: the analysis of questions, the information retrieval module and the answer delimitation process are detailed in subsections 3.1, 3.2 and 3.3 respectively. Finally, our conclusions and future work are presented in section 3.3.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>Retrieval time ago, and it keeps being our working hypothesis now we have started working on Spanish
Query Answering.</p>
      <p>Our proposal in this our first participation in the Spanish QA track, consists on the employment of
lemmatization for solving the inflectional variation of documents instead of classical approaches such as
stemming.</p>
      <p>
        The effectiveness of stemming is dependent on the morphology of the language, this way, when
processing languages with complex morphology and a high number of irregularities the performance of stemmers
becomes irregular [
        <xref ref-type="bibr" rid="ref1">4, 7</xref>
        ]. In the case of Spanish, there exist inflectional modifications at multiple levels
(gender and number for nouns and adjectives, and person, mood, time and tense for verbs) and with many
irregularities [
        <xref ref-type="bibr" rid="ref18">24</xref>
        ]: for nouns and adjectives, more than 20 variation groups for gender inflection and more
than 10 variation groups for number inflection have been identified; for verbs, 3 regular groups and almost
40 irregular groups have been identified, each group containing more than 100 inflected forms. This level
of complexity cannot be managed only through stemming. Moreover, stemming can also cause problems
for NLP systems by causing the loss of information needed in further processing [
        <xref ref-type="bibr" rid="ref10">16</xref>
        ], as in the case of
Query Answering.
      </p>
      <p>
        This way, lemmatization shows itself as an advisable alternative to stemming, since it can manage
properly these complex phenomena of Spanish with no losses of information. The encouraging results
obtained in the Spanish monolingual IR track [
        <xref ref-type="bibr" rid="ref16 ref17">23, 22</xref>
        ] support this choice.
      </p>
      <p>The lemmatization process is performed in two steps: a first phase of preprocessing and a second phase
of part-of-speech tagging and lemmatization, properly speaking.
2.1</p>
      <sec id="sec-1-1">
        <title>Preprocessing</title>
        <p>
          One of the most important prior tasks in NLP is text segmentation, the task of dividing a text into
linguistically meaningful units —words (tokenization) and sentences (sentence segmentation)—, since the words
and sentences identified at this stage are the fundamental units passed to further processing stages, such as
part-of-speech taggers, Information Retrieval systems, Question Answering systems, etc [
          <xref ref-type="bibr" rid="ref12">18</xref>
          ].
Nevertheless, this stage is often obviated in many current applications, which assume that input texts are already
segmented correctly in tokens or high level information units. This working hypothesis is not realistic due
to the heterogeneous nature of the application texts and their sources, and it results in erroneous behaviors
during further processing.
        </p>
        <p>
          This way, preprocessing is an indispensable task in practice, and it can involve processes which are
much more complex than the simple identification of the different sentences in the text and each of their
individual components. For this reason, we have developed a linguistically-motivated preprocessor module
for Spanish [
          <xref ref-type="bibr" rid="ref4">10, 5</xref>
          ] in order to perform tasks such as format conversion, tokenization, sentence
segmentation, morphological pretagging, contraction splitting, separation of enclitic pronouns from verbal stems,
expression identification, numeral identification and proper noun recognition.
2.2
        </p>
      </sec>
      <sec id="sec-1-2">
        <title>Tagging and lemmatization</title>
        <p>
          Once the text has been preprocessed, the output generated by our preprocessor —the words and sentences
which form the text— is then taken as input by our tagger-lemmatizer, MrTagoo [
          <xref ref-type="bibr" rid="ref2">8</xref>
          ], although any
similar high-performance tool could be used instead. MrTagoo is based on a second order Hidden Markov
Model (HMM), whose elements and procedures of estimation of parameters are based on Brant’s work [6],
and also incorporates certain capabilities which led to its use in our system. Such capabilities include a
very efficient structure for storage and search —based on finite-state automata [
          <xref ref-type="bibr" rid="ref3">9</xref>
          ]—, management of
unknown words, the possibility of integrating external dictionaries in the probabilistic frame defined by the
HMM [
          <xref ref-type="bibr" rid="ref5">11</xref>
          ], and the possibility of managing ambiguous segmentations [
          <xref ref-type="bibr" rid="ref6">12</xref>
          ]
        </p>
        <p>
          Nevertheless, these kind of tools are very sensitive to spelling errors, as, for example, in the case
of sentences written completely in uppercase —e.g., news headlines and subsection headings—, which
cannot be correctly managed by the preprocessor and tagger modules. For this reason, when documents
are processed in order to be indexed, the initial output of the tagger is processed by an
uppercase-tolowercase module [
          <xref ref-type="bibr" rid="ref17">23</xref>
          ] in order to process uppercase sentences, converting them to lowercase and restoring
the diacritical marks when necessary.
        </p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>Architecture</title>
      <p>The overall architecture of our prototype is composed of three main modules: question processing, realted
passage retrieval and answer extraction. The first module analyzes the query obtaining a list of keywords,
then the next module takes that list and performs a mostly conventional information retrieval process
obtaining a list of paragraphs expected to contain the answer. Finally, the last module takes such paragraphs
and extracts the answer from them. At the first stages of the prototype we are focusing on question
processing and information retrieval for serveral reasons:
• Simplicity is a premise.
• Once the system is capable of returning to the user a paragraph contaning the right answer, the
average user will find the system satisfactory.</p>
      <p>• If you cannot find the paragraph containing the answer, you cannot extract it.
3.1</p>
      <sec id="sec-2-1">
        <title>Question Processing</title>
        <p>For question processing we are usign some kind of simplified shallow parsing [3]. This parsing is made
at two levels: lemmatization and pattern matching. The result of the pattern matching phase is a list of
keywords to be used in order to search relevant documents.</p>
        <p>This way, the first step of the process consists on tagging and lemmatazing the question usign our
preprocessor and out tagger-lemmatizer, Mr Taggo, as it has been previously described in section 2. Once
the question has been tagged and lemmatized, the keyword selection process is performed by means of
pattern matching. In a previous study we have identified different categories of questions, such as:
&gt; Quie´n ser ... ? / Who be ... ?
&gt; Quie´n ... ? / Who ... ?
&gt; Do´nde ... ? / Where ... ?</p>
        <p>Each category has associated a list of patterns composed of tags and/or words. For each taggged
question, the system goes through this list of patterns till one of them matches and the keywords matched
are extracted.</p>
        <p>Our first prototype uses all the keywords extracted from the query. This approach showed a poor
performance, since only in 25% of the cases leaded to the retrieval of paragraphs containing the answer.
To overcome this problem, our next prototype will reduce the specificity of the querys by removing useless
elements from the list of keywords.
3.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Passage retrieval</title>
        <p>At this stage of the process, the system performs a mostly conventional IR task on the set of available
documents in order to retrive the portions of documents supposed to contain the answer. As usual this
requires that the documents were indexed before the system becomes operative.</p>
        <p>
          In order to identify the candidate documents which are relevant to a given question in which we will
look for the answer, a Passage Retrieval (PR) approach has been used [
          <xref ref-type="bibr" rid="ref11 ref8">14, 17</xref>
          ] in order to delimit not only
the relevant document but also the relevant portion of text. This way, documents are splitted into passages
made up by three sentences, with an overlap factor of two sentences1.We found that using passage retrieval
instead of document retrieval overcomes two main disadvantages:
• The search engine would find as relevants documents that containts most of the keywords of our
query, even when those keywords are sparse in the document. That situation probably means that
the document does not contain the answer. On the other hand, when keywords are close enough the
answer will be eventually in the same part of the document.
• It is more difficult to extract the answer from a document than from a small part of it.
1That is, first passage contains sentence 1 to 3, second passage contains from sentence 2 to 4, and so on.
        </p>
        <p>
          As in our previous contributions to CLEF IR Spanish Monolingual Track [
          <xref ref-type="bibr" rid="ref16 ref17">23, 22</xref>
          ], text is conflated
through lemmatization in order to solve the problems derived from inflection in Spanish. This way, once
text has been tagged and lemmatized, the lemmas of the content words [
          <xref ref-type="bibr" rid="ref7">13</xref>
          ] —nouns, verbs and adjectives—
are extracted to be indexed, since they contain the main semantics of the text [
          <xref ref-type="bibr" rid="ref7 ref9">13, 15</xref>
          ]. Before indexing,
the terms obtained are converted to lowercase and their spelling signs are eliminated in order to reduce
typographical errors.
        </p>
        <p>
          The resulting conflated text is indexed using the probabilistic engine ZPrise [1], employing the Okapi
BM25 weight scheme [
          <xref ref-type="bibr" rid="ref13">19</xref>
          ] with the constants defined in [
          <xref ref-type="bibr" rid="ref14">20</xref>
          ] for Spanish (b = 0.5, k1 = 2). The stopword
list used was obtained by lemmatizing the content words of the Spanish stopword list provided with the
well-known indexing engine SMART [2].
3.3
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>Answer extraction</title>
        <p>
          The answer extraction module takes the list of paragrahs retrived by the previuos module and tries to extract
the answer to the question formulated by the user. Currently, this module is quite naive and simply tries
to find a coherent answer near the keywords extracted from the question. Work is in progress in order to
improve this module. We achive this goal we intend to develop several methods to extract the answer. Each
method will select some answer candidates and a vote system will be used to choose the best one. The
methods currently scheduled are:
• At first module determine the answer type and use that information to select the probable answer.
• Use word distances. A suitable implemtation [
          <xref ref-type="bibr" rid="ref15">21</xref>
          ] is in progress.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Conclusions and future directions</title>
      <p>
        We have built a small prototype using the tools created for IR tasks and new ones specifically developed
for QA tasks. As expected for an early prototype, it is far from optimal, showing an irregular performance.
However we find the desgin architecture good enough. Regarding to the modules, futher experimentation
with the question processign module has showed that our approach works fine, but new improvements are
desirable. Regarding to the passage retrieval module, NLP techniques proved quite usefull once again.
Finally, the answer extraction module needs futher research and new approaches in order to get satisfactory
results. Also a new approach, based on the employment of a locality-based retriebal model [
        <xref ref-type="bibr" rid="ref15">21</xref>
        ] is being
considered in order to locate the relevant portion of the docuement with a higher degree of precision.
      </p>
    </sec>
    <sec id="sec-4">
      <title>Acknowledgements</title>
      <p>The research reported in this article has been partially supported by Ministerio de Ciencia y Tecnolog´ıa
(HF2002-81), FPU grants of Secretar´ıa de Estado de Educacio´n y Universidades (AP2001-2545), Xunta
de Galicia (PGIDIT02PXIB30501PR and PGIDIT02SIN01E) and Universidade da Corun˜a.
[1] http://www.itl.nist.gov/iaui/894.02/works/papers/zp2/zp2.html (site
visited August 2004).
[2] ftp://ftp.cs.cornell.edu/pub/smart (site visited August 2004).
[3] Steven Abney. Partial parsing via finite-state cascades. Natural Language Engineering, 2(4):337–344,
1997.
[5] Fco. Mario Barcala, Jesu´s Vilares, Miguel A. Alonso, Jorge Gran˜a, and Manuel Vilares. Tokenization
and proper noun recognition for information retrieval. In 3rd International Workshop on Natural
Language and Information Systems (NLIS 2002), September 2-3, 2002. Aix-en-Provence, France,
Los Alamitos, California, USA, 2002. IEEE Computer Society Press.
[6] Thorsten Brants. TNT - a statistical part-of-speech tagger. In Proceedings of the Sixth Applied Natural</p>
      <p>Language Processing Conference (ANLP’2000), Seattle, WA., 2000.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Carlos</surname>
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Figuerola</surname>
          </string-name>
          , Raquel Go´mez, Angel F. Zazo Rodr´ıguez, and Jose´ Luis Alonso Berrocal.
          <article-title>Stemming in Spanish: A first approach to its impact on information retrieval</article-title>
          . In Carol Peters, editor,
          <source>Results of the CLEF 2001 Cross-Language System Evaluation Campaign, Working Notes for the CLEF 2001 Workshop</source>
          , 3 September, Darmstadt, Germany,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Jorge</given-names>
            <surname>Gran</surname>
          </string-name>
          <article-title>˜a</article-title>
          . Te´cnicas de Ana´
          <article-title>lisis Sinta´ctico Robusto para la Etiquetacio´n del Lenguaje Natural</article-title>
          .
          <source>PhD thesis</source>
          , Departamento de Computacio´
          <article-title>n, Universidade da Corun˜a, A Corun˜a, Spain</article-title>
          ,
          <year>December 2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Jorge</given-names>
            <surname>Gran</surname>
          </string-name>
          <article-title>˜a, Fco</article-title>
          . Mario Barcala, and
          <string-name>
            <surname>Miguel</surname>
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Alonso</surname>
          </string-name>
          .
          <article-title>Compilation methods of minimal acyclic automata for large dictionaries</article-title>
          . In Bruce W. Watson and Derick Wood, editors,
          <source>Proc. of the 6th Conference on Implementations and Applications of Automata (CIAA</source>
          <year>2001</year>
          ), pages
          <fpage>116</fpage>
          -
          <lpage>129</lpage>
          , Pretoria, South Africa,
          <year>July 2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Jorge</surname>
          </string-name>
          <article-title>Gran˜a, Fco. Mario Barcala, and Jesu´s Vilares. Formal methods of tokenization for part-ofspeech tagging</article-title>
          . In Alexander Gelbukh, editor,
          <source>Computational Linguistics and Intelligent Text Processing</source>
          , volume
          <volume>2276</volume>
          of Lecture Notes in Computer Science, pages
          <fpage>240</fpage>
          -
          <lpage>249</lpage>
          . Springer-Verlag,
          <fpage>BerlinHeidelberg</fpage>
          -New York,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Jorge</surname>
          </string-name>
          <article-title>Gran˜a, Jean-Ce´dric Chappelier, and Manuel Vilares. Integrating external dictionaries into stochastic part-of-speech taggers</article-title>
          . In Galia Angelova, Kalina Bontcheva, Ruslan Mitkov, Nicolas Nocolov, and Nokolai Nikolov, editors,
          <source>EuroConference Recent Advances in Natural Language Processing. Proceedings</source>
          , pages
          <fpage>122</fpage>
          -
          <lpage>128</lpage>
          ,
          <string-name>
            <surname>Tzigov</surname>
            <given-names>Chark</given-names>
          </string-name>
          , Bulgaria,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Jorge</surname>
            <given-names>Gran˜</given-names>
          </string-name>
          <article-title>a Gil, Miguel A. Alonso Pardo, and Manuel Vilares Ferro. A common solution for tokenization and part-of-speech tagging: One-pass Viterbi algorithm vs. iterative approaches</article-title>
          . In P. Sojka,
          <string-name>
            <surname>I.</surname>
          </string-name>
          <article-title>Kopecˇek, and</article-title>
          K. Pala, editors,
          <source>Text, Speech and Dialogue</source>
          , volume
          <volume>2448</volume>
          of Lecture Notes in Computer Science, pages
          <fpage>3</fpage>
          -
          <lpage>10</lpage>
          . Springer-Verlag, Berlin-Heidelberg-New York,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Christian</given-names>
            <surname>Jacquemin</surname>
          </string-name>
          and
          <string-name>
            <given-names>Evelyne</given-names>
            <surname>Tzoukermann</surname>
          </string-name>
          .
          <article-title>NLP for term variant extraction: synergy between morphology, lexicon and syntax</article-title>
          . In Tomek Strzalkowski, editor,
          <source>Natural Language Information Retrieval</source>
          , volume
          <volume>7</volume>
          of Text,
          <source>Speech and Language Technology</source>
          , pages
          <fpage>25</fpage>
          -
          <lpage>74</lpage>
          . Kluwer Academic Publishers, Dordrecht/Boston/London,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>M.</given-names>
            <surname>Kaszkiel</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Zobel</surname>
          </string-name>
          .
          <article-title>Effective ranking with arbitrary passages</article-title>
          .
          <source>Journal of the American Society of Information Science</source>
          ,
          <volume>52</volume>
          (
          <issue>4</issue>
          ):
          <fpage>344</fpage>
          -
          <lpage>364</lpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Cornelis</surname>
            <given-names>H. A.</given-names>
          </string-name>
          <string-name>
            <surname>Koster</surname>
          </string-name>
          .
          <article-title>Head/modifier frames for information retrieval</article-title>
          . In Alexander Gelbukh, editor,
          <source>Computational Linguistics and Intelligent Text Processing</source>
          , volume
          <volume>2945</volume>
          of Lecture Notes in Computer Science, pages
          <fpage>420</fpage>
          -
          <lpage>432</lpage>
          . Springer-Verlag, Berlin-Heidelberg-New York,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>Gerald</given-names>
            <surname>Kowalski</surname>
          </string-name>
          .
          <source>Information Retrieval Systems: Theory and Implementation</source>
          . The Kluwer international series on Information Retrieval. Kluwer Academic Publishers, Boston-Dordrecht-London,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Fernando</surname>
            <given-names>Llopis</given-names>
          </string-name>
          , Jose´ L.
          <string-name>
            <surname>Vicedo</surname>
          </string-name>
          , and Antonio Ferra´ndez.
          <article-title>IR-n system at CLEF-2002</article-title>
          . In Carol Peters, Martin Braschler, Julio Gonzalo, and Martin Kluck, editors,
          <source>Advances in Cross-Language Information Retrieval</source>
          , volume
          <volume>2785</volume>
          of Lecture Notes in Computer Science, pages
          <fpage>291</fpage>
          -
          <lpage>300</lpage>
          . SpringerVerlag, Berlin-Heidelberg-New York,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [18]
          <string-name>
            <surname>David</surname>
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Palmer</surname>
          </string-name>
          .
          <source>Handbook of Natural Language Processing</source>
          , chapter Tokenisation and
          <string-name>
            <given-names>Sentence</given-names>
            <surname>Segmentation</surname>
          </string-name>
          . Marcel Dekker, Inc., New York &amp; Basel,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [19]
          <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>
          . Okapi/Keenbow at TREC-8. In E. M. Voorhees and
          <string-name>
            <surname>D. K</surname>
          </string-name>
          . Harman, editors,
          <source>NIST Special Publication</source>
          <volume>500</volume>
          -246: The Eighth Text REtrieval
          <source>Conference (TREC 8)</source>
          , pages
          <fpage>151</fpage>
          -
          <lpage>162</lpage>
          , Gaithersburg,
          <string-name>
            <surname>MD</surname>
          </string-name>
          , USA,
          <year>2000</year>
          . Department of Commerce, National Institute of Standards and Technology.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>Jacques</given-names>
            <surname>Savoy</surname>
          </string-name>
          .
          <source>Report on CLEF-2002 Experiments: Combining Multiple Sources of Evidence</source>
          . In Carol Peters, editor,
          <source>Results of the CLEF 2002 Cross-Language System Evaluation Campaign, Working Notes for the CLEF 2002 Workshop</source>
          ,
          <fpage>19</fpage>
          -
          <lpage>20</lpage>
          September, Rome, Italy, pages
          <fpage>31</fpage>
          -
          <lpage>46</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [21]
          <article-title>Jesu´s Vilares and Miguel A. Alonso. Dealing with syntatic variation through a locality-based approach</article-title>
          . In To be published,
          <source>Lecture Notes in Computer Science</source>
          . Springer-Verlag, Berlin-HeidelbergNew York,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [22]
          <article-title>Jesu´s Vilares, Miguel A</article-title>
          .
          <string-name>
            <surname>Alonso</surname>
          </string-name>
          , and Francisco J. Ribadas.
          <source>COLE experiments at CLEF</source>
          <year>2003</year>
          <article-title>Spanish monolingual track</article-title>
          . In Carol Peters, Martin Braschler, Julio Gonzalo, and Martin Kluck, editors,
          <source>Advances in Cross-Language Information Retrieval, Lecture Notes in Computer Science. SpringerVerlag</source>
          , Berlin-Heidelberg-New York,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [23]
          <article-title>Jesu´s Vilares, Miguel A</article-title>
          .
          <string-name>
            <surname>Alonso</surname>
          </string-name>
          , Francisco J.
          <string-name>
            <surname>Ribadas</surname>
            , and
            <given-names>Manuel</given-names>
          </string-name>
          <string-name>
            <surname>Vilares</surname>
          </string-name>
          .
          <source>COLE experiments at CLEF</source>
          <year>2002</year>
          <article-title>Spanish monolingual track</article-title>
          .
          <source>In Advances in Cross-Language Information Retrieval</source>
          , volume
          <volume>2785</volume>
          of Lecture Notes in Computer Science, pages
          <fpage>265</fpage>
          -
          <lpage>278</lpage>
          . Springer-Verlag, Berlin-HeidelbergNew York,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [24]
          <string-name>
            <surname>Manuel</surname>
            <given-names>Vilares</given-names>
          </string-name>
          ,
          <article-title>Jorge Gran˜a, and Pilar Alvarin˜o. Finite-state morphology and formal verification</article-title>
          .
          <source>Journal of Natural Language Engineering</source>
          , special issue on
          <source>Extended Finite State Models of Language</source>
          ,
          <volume>3</volume>
          (
          <issue>4</issue>
          ):
          <fpage>303</fpage>
          -
          <lpage>304</lpage>
          ,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>