<!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>INAOE at QA@CLEF 2008: Evaluating Answer Validation in Spanish Question Answering</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Alberto T</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>ellez-Valero</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Antonio Ju</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>arez-Gonz</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Manuel Montes-y-G</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Luis Villasen~or-Pineda</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Laboratorio de Tecnolog</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Luis Enrrique Erro no. 1</institution>
          ,
          <addr-line>Sta. Mar</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper introduces the new INAOE's answer validation method. This method is based on supervised learning approach that uses a set of attributes that capture some lexical-syntactic relations among the question, the answer and the given support text. In addition, the paper describes the evaluation of the proposed method at both the Spanish Answer validation Exercise (AVE 2008) and the Spanish Question Answering Main Task (QA 2008). The evaluation objectives were twofold. One the one hand, evaluate the ability of our answer validation method to discriminate correct from incorrect answers, and on the other hand, measure the impact of including an answer validation module in our QA system. The evaluation results were encouraging; the proposed method achieved a 0.39 F-measure in the detection of correct answers, outperforming the baseline result of the AVE 2008 task by more than 100%. It also enhanced the performance of our QA system, showing a gain in accuracy of 22% for answering factoid questions. Furthermore, when there were evaluated three candidate answers per question, the answer validation method increased the MRR of our QA system by 40%, reaching a MRR of 0.28.</p>
      </abstract>
      <kwd-group>
        <kwd>Question Answering</kwd>
        <kwd>Answer Validation</kwd>
        <kwd>Textual Entailment</kwd>
        <kwd>Machine Learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Latest evaluations of question answering (QA) systems evidenced two important facts about the
state of the art of this ¯eld. First, they indicated that it already does not exist any system
capable of answering all types of questions with similar precision rates, and second, they revealed
that most current QA systems are complementary (see for instance the Spanish QA evaluation
overview at CLEF 2005 [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]). These two facts have triggered the development of answer validation
(AV) methods, which allow determining if a speci¯ed answer is correct and supported [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>
        In line with these recent e®orts, in this paper we describe a new AV method. This method,
similar to our previous year work [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], is based on a supervised learning approach for recognizing the
textual entailment. It mainly uses a set of attributes that capture some simple relations among
the question, the answer and the given supported text. In particular, it considers some novel
attributes that characterize: (i) the compatibility between question and answer types; (ii) the
redundancy of answers across streams; and (iii) the overlap (as well as the non-overlap) between
the question-answer pair and the core fragment of the support text.
      </p>
      <p>
        In order to evaluate the proposed method we considered two di®erent scenarios: the Answer
Validation Exercise (AVE 2008) and the Question Answering Main Task (QA 2008). The objective
of the ¯rst scenario was to evaluate the ability of our AV method to discriminate correct from
incorrect answers as well as its capacity to combine the answers from several QA systems. In
contrast, the goal of the second evaluation scenario was to measure the impact of including an
answer validation module in our QA system [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
      </p>
      <p>The evaluation results were encouraging; the proposed method achieved a 0.39 F-measure in
the detection of correct answers, outperforming the baseline result of the AVE 2008 task by more
than 100%. It also enhanced the performance of our QA system, producing a gain in accuracy
of 22% for answering factoid questions. Furthermore, when there were evaluated three candidate
answers per question, the answer validation method increased the MRR of our QA system by 40%,
reaching a MRR of 0.28.</p>
      <p>The rest of the paper is organized as follows. Section 2 describes our answer validation method.
Section 3 presents the evaluation results of the proposed method in both the Answer Validation
Exercise and Spanish QA Main Task. Finally, Section 4 exposes our conclusions and outlines some
future work directions.
2</p>
    </sec>
    <sec id="sec-2">
      <title>The Answer Validation Method</title>
      <p>Given a question (Q ), a candidate answer (A) and a support text (S ), this method returns a
con¯dence value (¯) that allows deciding whether to accept or reject a candidate answer. In other
words, it helps to determine if the speci¯ed answer is correct and if it can be deduced from the
given support text.</p>
      <p>
        Like other previous answer validation methods evaluated in the last AVE [
        <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
        ], and following
the original idea proposed in the ¯rst RTE challenge at PASCAL [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], our method is mainly based
on recognizing the textual entailment (RTE) between the support text (T ) and an a±rmative
sentence (H ) called hypothesis, created from the combination of the question and the answer1.
      </p>
      <p>The returned con¯dence value ¯ is generated by means of a supervised learning approach that
considers three main processes: preprocessing, attribute extraction and answer classi¯cation. The
following sections describe each of these processes.
2.1</p>
      <sec id="sec-2-1">
        <title>Preprocessing</title>
        <p>The objective of this process is to extract the main content elements from the question, answer and
support text, which will be subsequently used for deciding about the correctness of the answer.
This process considers two basic tasks: on the one hand, the identi¯cation of the main constituents
from the question-answer pair, and on the other hand, the detection of the core fragment of the
support text as well as the consequent elimination of the unnecessary information.</p>
        <p>1The entailment between the pair (T, H ) occurs when the meaning of H can be inferred from the meaning of T.
2.1.1</p>
        <sec id="sec-2-1-1">
          <title>Constituent Identi¯cation</title>
          <p>We detect three basic constituents from the questions: its main action, the action actors, and if
exist, the action restriction. As an example, consider the question in Table 1. In this case, the
action is represented by the verb invade, its actors are the syntagms Which country and Iraq,
and the action restriction is described by the propositional syntagma in 1990.</p>
          <p>In order to detect the question constituents we ¯rstly apply a shallow parsing to the given
question2. Then, from the resulting syntactic tree (Qparsed), we construct a new representation of
the question (called Q' ) by detecting and tagging the following elements:
1. The action constituent. It corresponds to the syntagm in Qparsed that includes the main verb.
2. The restriction constituent. It is represented by the prepositional syntagm in Qparsed having
at least one explicit time expression (e.g., in 1990), or including a preposition such as after
or before.
3. The actors constituents. These constituents are formed by the rest of the elements in Qparsed.</p>
          <p>It is commonly divided in two parts. The ¯rst one, henceforth called hidden actor constituent,
corresponds to the syntagm that includes the interrogative word and it is generally located at
the left of the action constituent. The second part, which we call the visible actor constituent,
is formed by the rest of the syntagms, generally located at the right of the action constituent.</p>
          <p>Finally, we also consider an answer constituent, which is simply the lemmatized candidate
answer (denoted by A' ).
2.1.2</p>
        </sec>
        <sec id="sec-2-1-2">
          <title>Support Text's Core Fragment Detection</title>
          <p>Commonly, the support text is a short paragraph |of maximum 700 bytes according to CLEF
evaluations| which provides the context necessary to support the correctness of a given answer.
However, in many cases, it contains more information than required, damaging the performance
of RTE methods based on lexical-syntactic overlaps. For instance, the example of Table 1 shows
that only a part of the last sentence in the support text (i.e., Iraqi invasion of Kuwait) is
useful for validating the given answer, whereas the rest of the text only contribute to produce an
irrelevant overlap (e.g., Kuwait was a close ally of Iraq).</p>
          <p>In order to reduce the support text to the minimum useful text fragment according to the
candidate answer validation, we proceed as follows:
² First, we apply a shallow parsing to the support text, obtaining the syntactic tree (Sparsed).
2In all the text processing used in our method (i.e., lemmatization, part of speech tag, named
entities recognition and classi¯cation, and shallow parsing), we employed the open source tool called Freeling
(http://garraf.epsevg.upc.es/freeling/).</p>
          <p>² Second, we match the content terms (nouns, verbs, adjectives and adverbs) from the question
constituents against the terms from Sparsed. In order to avoid some minimal writing di®erences
of the same concept not solved by the morphological analysis (e.g., Iraq against Irak or
Iraqi), we compare the terms using the Levenshtein edition distance3. Mainly, we consider
that two di®erent words are equal if their distance value is less than 0.4.
² Third, based on the number of matched terms, we align the question constituents with the
syntagms from the support text.
² Forth, we match the answer constituent against the syntactic tree (Sparsed). The idea is to
¯nd all occurrences of the answer in the given support text.
² Fifth, we determine the minimum context of the answer in the support text that contains
all matched syntagms. This minimum context (represented by a sequence of words around
the answer) is what we call the core fragment (denoted by T' ). In the case that the support
text includes several occurrences of the answer, we select the one with the smallest context.</p>
          <p>Applying the procedure described above we determine that the core fragment of the support
text showed at Table 1 is in an Iraqi invasion of Kuwait.
2.2</p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>Attribute Extraction</title>
        <p>This stage gathers a set of processes that allow extracting several attributes from the question,
the answer and the support text. These attributes can be categorized in two di®erent groups: the
attributes that indicate the relation between the question and the answer, and the attributes that
measure the entailment relation between the question-answer pair and the support text.</p>
        <p>The following sections describe both kinds of attributes and explain the way they are calculated
from Q', A' and T'.
2.2.1</p>
        <sec id="sec-2-2-1">
          <title>Attributes about the Question-Answer Relation</title>
        </sec>
        <sec id="sec-2-2-2">
          <title>Question Characteristics</title>
          <p>We consider four di®erent attributes from the question: the question word (what, how, where,
etc.), the question category (factoid or de¯nition), the expected answer type (date, quantity, name
or other), and the type of question restriction (date, period, event, or none).</p>
          <p>The question word, question category, and the expected answer type are determined using a
set of simple lexical patterns. Some of these patterns are showed below. It can be observed that
each of them includes information about the question category and the expected answer type.
(WHAT OR WHO) is [whatever ]</p>
          <p>HOW many [whatever ]</p>
          <p>WHEN [whatever ]
!
!
!</p>
          <p>DEFINITION { OTHER
FACTOID { QUANTITY
FACTOID { DATE</p>
          <p>On the other hand, the value of the question restriction (date, period, event or none) depends on
the form of the restriction constituent. If this constituent contains only one time expression, then
this value is set to \date". In the case the restriction constituent includes two time expressions,
it is set to \period". If the restriction constituent does not include any time expression, then the
question restriction is de¯ned as \event". Finally, when the question does not have any restriction
constituent, the value of the question restriction is set to \none".</p>
          <p>
            3The Levenshtein edition distance has been previously used in other works related to answer validation in Spanish
language, see for instance [
            <xref ref-type="bibr" rid="ref8">8</xref>
            ].
          </p>
        </sec>
        <sec id="sec-2-2-3">
          <title>Question-Answer Compatibility</title>
          <p>This attribute indicates if the question and answer types are compatible. The idea of this attribute
is to capture the situation where the semantic class of the evaluated answer does not correspond
to the expected answer type. For instance, having the answer yesterday for the question How
many inhabitants are there in Longyearbyen?.</p>
          <p>This is a binary attribute: it is equal to 1 when the answer corresponds to the expected answer
type, and it is equal to 0 if this correspondence does not exist.</p>
        </sec>
        <sec id="sec-2-2-4">
          <title>Answer Redundancy</title>
          <p>
            Taking into account the idea of \considering candidates as allies rather than competitors" [
            <xref ref-type="bibr" rid="ref9">9</xref>
            ],
we decided to include an attribute related to the occurrence of the answers across the pool of
candidate answers.
          </p>
          <p>
            Di®erent from other redundancy methods (like the one present in [
            <xref ref-type="bibr" rid="ref10">10</xref>
            ]) that directly uses the
frequency of occurrence of the answers, the proposed attribute indicates the sum of the edition
distances between the actual evaluated answer to each one of the rest of the candidate answers.
          </p>
          <p>The edition distance strategy allows dealing with the great language variability and also with
the presence of some typing errors. In this way, an answer X contributes to the redundancy rate
of another answer Y and vice versa, even though X and Y are not exactly the same (e.g. spacial
telescope and Hubble telescope).
2.2.2</p>
        </sec>
        <sec id="sec-2-2-5">
          <title>Attributes related to the Textual Entailment Recognition</title>
          <p>The attributes of this category are of two main types: (i) attributes that measure the overlap
between the support text and the hypothesis (an a±rmative sentence formed by combining the
question and the answer); and (ii) attributes that denote the di®erences (non-overlap) between
these two components.</p>
          <p>It is important to explain that, di®erent from other RTE methods, we do not use the complete
support text, instead we only use its core fragment T'. In addition, we neither need to construct
an hypothesis text, instead we use as hypothesis the set of question-answer constituents (the union
of Q' and A', which we call H' ).</p>
        </sec>
        <sec id="sec-2-2-6">
          <title>Overlap Characteristics</title>
          <p>These attributes express the degree of overlap |in number of words| between T' and H'. In
particular, we compute an overlap attribute for each one of the fourth types of content terms
(nouns, verbs, adjectives and adverbs) as well as for each one of the six types of named entities
(names of persons, places, organizations, and other things, as well as dates and quantities). We
generate these ten di®erent overlap attributes for each one of the ¯ve constituents in H' (the action
constituent, the restriction constituent, the hidden actor constituent, the visible actor constituent,
and the answer constituent). In this way, we get a total of ¯fty attributes that represent the
overlap characteristics.</p>
          <p>Similar to the calculation of the answer redundancy attribute, in this case we also apply the
edition distance to evaluate the overlap between the terms of H' and T'.</p>
        </sec>
        <sec id="sec-2-2-7">
          <title>Non-Overlap Characteristics</title>
          <p>These attributes indicate the number of non-overlapped terms from the core fragment of the
support text, that is, they indicate the number of terms from T' that are not present in any of the
detected constituents. Mainly, we measure the non-overlap between the answer constituent and
each one of the other constituents, and compute this non-overlap for each type of content term as
well as for each type of named entity. In total we generate forty di®erent non-overlap attributes.
This ¯nal process generates the answer validation decision by means of a supervised learning
approach. In particular, it applies a boosting ensemble formed by ten decision tree classi¯ers4.</p>
          <p>The constructed classi¯er decides whether to accept or reject the candidate answer based on the
ninety-six attributes described in the previous section. In addition, it also generates a validation
con¯dence (¯) that indicates how reliable is the given answer in accordance to the support text.
3</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Experimental Evaluation</title>
      <p>
        As we previously mentioned, we evaluated the proposed AV method in two di®erent scenarios: the
Answer Validation Exercise (AVE 2008) and the Question Answering Main Task (QA 2008). The
objective of the ¯rst scenario was to evaluate the ability of the AV method to discriminate correct
from incorrect answers as well as its capacity to combine the answers from several QA systems.
In contrast, the goal of the second evaluation scenario was to measure the impact of including an
answer validation module in our QA system [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. The following sections present the results from
both scenarios.
3.1
      </p>
      <sec id="sec-3-1">
        <title>Training and Test Sets</title>
        <p>This evaluation exercise focuses on analyzing two di®erent aspects of the AV methods: on the one
hand, their ability to discriminate correct from incorrect answers (answer validation evaluation ),
and on the other hand, their capacity to select the correct answer from a pool of candidate answers
returned by diverse QA systems (stream fusion evaluation ).</p>
        <p>
          From previous experiments [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], we noticed that the best method for AV (for discriminating
correct from incorrect answers) is not necessarily the best option for a QA stream fusion, it taking
into account that the actual AV methods are far away of the perfect validation. Based on this
evidence, we decided to evaluate two di®erent runs obtained by applying two di®erent acceptance
thresholds over the con¯dence value (¯). The ¯rst run (RUN 1) aimed to increase the recall by
4We used the Weka implementations for the boosting (AdaBoostM1) and C4.5 (J48) algorithms
(http://www.cs.waikato.ac.nz/ml/weka/).
reducing in 10% the default acceptance threshold, whereas the second run (RUN 2) maintained
the default threshold (¯ = 0.5).
        </p>
        <p>Table 3 shows the answer validation results corresponding to our two submitted runs. It also
shows (in the last row) the results for a 100% VALIDATED baseline (i.e., an answer validation
system that accepted all given answers). The results indicate that reducing the acceptance
threshold (RUN 1) our method achieved a high recall but a low precision, which means that it correctly
accepts must correct answers (there are a few false negatives), but it also incorrectly accepts many
wrong responses (there are several false positives). In contrast, the second run (RUN 2) got a
worst recall, but achieved a major precision and F-measure, outperforming the baseline result in
more than 100%.</p>
        <p>Complementary to the previous data, Table 4 shows the evaluation results for the QA stream
fusion. These results indicate that the QA-accuracy of RUN 1 is 19% better than the accuracy of
RUN 2. Given that RUN 2 clearly outperformed the answer validation result of RUN 1 (see
Table 3), these results con¯rm our observation that the best answer validation method not necessary
produces the best QA stream fusion performance.</p>
        <p>Besides the traditional QA-accuracy measure, this year the AVE organizers included a new
evaluation measure called QA-performance. This measure allows evaluating the in°uence into the
question answering task of not only correctly accept those right answers but also to correctly reject
those wrong ones. The results in Table 4 indicate that, because of the better capacity of RUN 2
to reject wrong answers, the QA-performance of both runs were very similar.</p>
        <p>
          Finally, it is important to comment that, in order to understand the behavior of the proposed
method, we carried out a deep analysis of the usefulness of each one of the used characteristics.
Table 5 resumes the information gain values of the main kinds of attributes used by our supervised
AV method. Surprisingly, these values show that the proposed non-overlap characteristics are more
discriminative than the traditional overlap features.
In order to evaluate the e®ect of including an AV module in a QA system, this year we submitted
two di®erent runs at the Main QA task. The ¯rst run (inao081eses) was the original output of our
QA system (refer to [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] for details), whereas the second run (inao082eses) was the result of applied
the AV method over the set of candidate answers generated by the ¯rst run. Table 6 shows the
evaluation results of both runs as well as a baseline result corresponding to a perfect validation of
the output of our QA system.
        </p>
        <p>Results from Table 6 indicate that the AV module helped increasing the number of right
answers for factoid questions, improving the accuracy of our QA system by 22%. In contrast, the
AV module damaged the treatment of de¯nition question since it incorrectly rejected three right
answers. In this case, taking into account that our QA system is very accurate for answering
de¯nition questions, our conclusion is that it is better not to include the AV module.</p>
        <p>Given that this year was allowed to deliver three candidate answers per question, we not only
evaluated the e®ect of the AV module in the answer accuracy but also in rank of the correct
answers. For achieving this objective, we included more that one answer for some questions; the
¯rst run (inaoe081eses) consisted of 422 answers, whereas the second run (inaoe082eses) included
a total of 343 answers. The di®erence in the number of answers between both runs was caused
because many candidate answers were rejected in the second run during the validation process. It
is important to mention that the AV module not only eliminated some tentative incorrect answers,
but also modi¯ed their ¯nal order. In particular, the rank of the answers in the second run was
determined by means of their con¯dence values. The evaluation results indicated that the second
run outperformed by 40% (with a Mean Reciprocal Rank of 0.28) the output of the ¯rst run (with
a Mean Reciprocal Rank of 0.20).
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusions</title>
      <p>This paper presented a new AV method based on a supervised textual entailment approach. This
method mainly di®ers from previous ones in the kind of used attributes. In particular, it considers
some novel attributes that characterize: (i) the compatibility between question and answer types;
(ii) the redundancy of answers across streams; and (iii) the overlap as well as the non-overlap
between the question-answer pair and the core fragment of the support text. Regarding these
attributes, it is important to mention that an analysis about their usefulness showed that the
proposed non-overlap characteristics are more discriminative than the traditional overlap features.</p>
      <p>The proposed method was evaluated in two di®erent scenarios: the Spanish Answer Validation
Exercise (AVE 2008) and the Spanish QA Main Task (QA 2008). The objective of the ¯rst scenario
was to evaluate the ability of our AV method to discriminate correct from incorrect answers as
well as its capacity to combine the answers from several QA systems. In contrast, the goal of the
second evaluation scenario was to measure the impact of including an answer validation module
in a QA system. The evaluation results were encouraging; the proposed method achieved a 0.39
F-measure in the detection of correct answers, outperforming the baseline result of the AVE 2008
task by more than 100%. It also enhanced the performance of our Spanish QA system, producing
a gain in accuracy of 22% for factoid questions. Furthermore, when there were evaluated three
candidate answers per question, the AV method allowed increasing the MRR of our QA system
by 40%, reaching a MRR of 0.28.</p>
      <p>Finally, it is important to comment that this year our best results in the AVE (a F-measure of
0.39 and a qa-accuracy of 0.32) were very distant from those corresponding to a perfect validation.
Ac
We presume that this situation was caused by the decreasing number of right answers together with
the increasing number of relevant support passages related to the wrong answers. In order to tackle
these problems, and based on the fact that non-overlap attributes were the most discriminative, we
plan to include more elements (such as prepositions, conjunctions, and some punctuation marks)
for their computation.</p>
      <sec id="sec-4-1">
        <title>Acknowledgments</title>
        <p>This work was done under partial support of CONACYT (project grants 43990 and 61335, and
scholarships 171610 and 165499). We also want to thank CLEF organizers for the provided
resources.
[12] Peters, C., Clough, P., Gey, F.C., Karlgren, J., Magnini, B., Oard, D.W., de Rijke, M.,
Stempfhuber, M., eds.: Evaluation of Multilingual and Multi-modal Information Retrieval,
7th Workshop of the Cross-Language Evaluation Forum, CLEF 2006, Alicante, Spain,
September 20-22, 2006, Revised Selected Papers. In Peters, C., Clough, P., Gey, F.C.,
Karlgren, J., Magnini, B., Oard, D.W., de Rijke, M., Stempfhuber, M., eds.: CLEF. Volume 4730
of Lecture Notes in Computer Science., Springer (2007)</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Vallin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Magnini</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Giampiccolo</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aunimo</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ayache</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Osenova</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , Pen~as, A.,
          <string-name>
            <surname>de Rijke</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sacaleanu</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Santos</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , Sutcli®e,
          <string-name>
            <surname>R.F.E.</surname>
          </string-name>
          :
          <article-title>Overview of the clef 2005 multilingual question answering track</article-title>
          . In Peters,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Gey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.C.</given-names>
            ,
            <surname>Gonzalo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            , MuÄller, H.,
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.J.F.</given-names>
            ,
            <surname>Kluck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Magnini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>de Rijke</surname>
          </string-name>
          , M., eds.
          <source>: CLEF</source>
          . Volume
          <volume>4022</volume>
          of Lecture Notes in Computer Science., Springer (
          <year>2005</year>
          )
          <volume>307</volume>
          {
          <fpage>331</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2] Pen~as,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Rodrigo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A</given-names>
            ¶.,
            <surname>Sama</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            ,
            <surname>Verdejo</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.</surname>
          </string-name>
          :
          <article-title>Testing the reasoning for question answering validation</article-title>
          .
          <source>Journal of Logic and Computation (3) (December</source>
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>T</given-names>
            <surname>¶</surname>
          </string-name>
          ellez
          <article-title>-</article-title>
          <string-name>
            <surname>Valero</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Montes-</surname>
            y-G¶omez,
            <given-names>M.</given-names>
          </string-name>
          ,
          <article-title>Villasen~or-</article-title>
          <string-name>
            <surname>Pineda</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          : INAOE at AVE 2007:
          <article-title>Experiments in spanish answer validation</article-title>
          .
          <source>In: Working Notes for the CLEF 2007 Workshop</source>
          , Budapest, Hungary (
          <year>September 2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>T¶ellez</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          , Ju¶arez,
          <string-name>
            <given-names>A.</given-names>
            , Hern¶andez, G.,
            <surname>Denicia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Villatoro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Montes</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          , Villasen~or, L.:
          <article-title>INAOE's participation at QA@CLEF 2007</article-title>
          .
          <source>In: Working Notes for the CLEF</source>
          <year>2007</year>
          , Budapest, Hungary (
          <year>September 2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5] Pen~as,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Rodrigo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A</given-names>
            ¶ .,
            <surname>Sama</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            ,
            <surname>Verdejo</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.</surname>
          </string-name>
          :
          <article-title>Overview of the answer validation exercise</article-title>
          <year>2006</year>
          . [
          <volume>12</volume>
          ]
          <fpage>257</fpage>
          {
          <fpage>264</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6] Pen~as,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Rodrigo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A</given-names>
            ¶.,
            <surname>Verdejo</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.</surname>
          </string-name>
          :
          <article-title>Overview of the answer validation exercise 2007</article-title>
          .
          <source>In: Working Notes for the CLEF 2007 Workshop</source>
          , Budapest, Hungary (
          <year>September 2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Dagan</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Magnini</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Glickman</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <article-title>The PASCAL recognising textual entailment challenge</article-title>
          .
          <source>In: Proceedings of Pascal Challenge Workshop on Recognizing Textual Entailment</source>
          , Southampton,
          <string-name>
            <surname>UK</surname>
          </string-name>
          (April
          <year>2005</year>
          )
          <volume>1</volume>
          {
          <fpage>8</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Rodrigo</surname>
            ,
            <given-names>A</given-names>
          </string-name>
          ¶., Pen~as,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Herrera</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Verdejo</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.</surname>
          </string-name>
          :
          <article-title>The e®ect of entity recognition on answer validation</article-title>
          . [
          <volume>12</volume>
          ]
          <fpage>483</fpage>
          {
          <fpage>489</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Dalmas</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Webber</surname>
            ,
            <given-names>B.L.</given-names>
          </string-name>
          :
          <article-title>Answer comparison in automated question answering</article-title>
          .
          <source>J. Applied Logic</source>
          <volume>5</volume>
          (
          <issue>1</issue>
          ) (
          <year>2007</year>
          )
          <volume>104</volume>
          {
          <fpage>120</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Roussinov</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chau</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Filatova</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Robles-Flores</surname>
            ,
            <given-names>J.A.:</given-names>
          </string-name>
          <article-title>Building on redundancy: Factoid question answering, robust retrieval and the \other"</article-title>
          .
          <source>In: Proceedings of the Thirteenth Text REtreival Conference (TREC</source>
          <year>2005</year>
          ).
          <article-title>(</article-title>
          <year>2005</year>
          )
          <volume>15</volume>
          {
          <fpage>18</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>T</given-names>
            <surname>¶</surname>
          </string-name>
          ellez
          <article-title>-</article-title>
          <string-name>
            <surname>Valero</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Montes-</surname>
            y-G¶omez,
            <given-names>M.</given-names>
          </string-name>
          ,
          <article-title>Villasen~or-</article-title>
          <string-name>
            <surname>Pineda</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          , Pen~as, A.:
          <article-title>Improving question answering by combining multiple systems via answer validation</article-title>
          . In Gelbukh, A.F., ed.:
          <source>CICLing</source>
          . Volume
          <volume>4919</volume>
          of Lecture Notes in Computer Science., Springer (
          <year>2008</year>
          )
          <volume>544</volume>
          {
          <fpage>554</fpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>