<!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>Question Answering on Romanian, English and French Languages</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Adrian Iftene</string-name>
          <email>adiftene@info.uaic.ro</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Diana Trandabăţ</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Maria Husarciuc</string-name>
          <email>mhusarciuc@info.uaic.ro</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alex Moruz</string-name>
          <email>amoruz@info.uaic.ro</email>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Center of Biblical-Philological Studies Monumenta linguae Dacoromanorum, ―Alexandru Ioan Cuza‖ University</institution>
          ,
          <country country="RO">Romania</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Institute of Computer Science, Romanian Academy Iasi Branch</institution>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>UAIC: Faculty of Computer Science, ―Alexandru Ioan Cuza‖ University</institution>
          ,
          <country country="RO">Romania</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper describes UAIC1's Question Answering systems participating in the ResPubliQA 2010 competition, designed to answer questions on a juridical corpora in Romanian, English and French monolingual tasks. Our systems adhere to the classical architecture of a Question Answering system, with an emphasis on simplicity and real time answers: only shallow parsing was used for question processing, the indexes for the retrieval module were built at coarse-grained paragraph level, and the answer extraction component used simple pattern-based rules and lexical similarity metrics for candidate answer ranking.</p>
      </abstract>
      <kwd-group>
        <kwd>Question Answering</kwd>
        <kwd>Information Retrieval</kwd>
        <kwd>ResPubliQA</kwd>
        <kwd>Legal Documents</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>
        Preparing the 2010 competition, our main goal was to improve the system built for
the 2009 QA@CLEF edition [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], focusing on reducing the running time, while
increasing the performances. The best system for the Romanian language
participating in RespubliQA 2009 challenge [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] used a sophisticated similarity based
model for paragraph ranking, classification and regeneration of the question,
considering the EUROVOC terms associated to each document. For English, the best
runs produced paragraph rankings considering matching n-grams between question
and paragraphs [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. This retrieval approach seems to be promising, since combined
with paragraph validation filters it achieved the best score [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] for English.
      </p>
      <p>
        One of our main concerns was the improvement of the answer extraction module.
Although there are some deep approaches of answer extraction performing well on
monolingual QA [
        <xref ref-type="bibr" rid="ref11 ref4">4, 11</xref>
        ], they are quite demanding in terms of linguistic resources and
computational complexity. Since we intended to develop a question answering system
for Romanian, easily adaptable to English and French, we adopted a shallow answer
extraction method, requiring limited knowledge resources or tools for the three
languages. Template-based methods have been used for answer extraction modules,
form surface patterns [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], used to match questions with correct answers, to the
similarity-based methods that compute the likelihood between a passage and the
question, by counting the ratio of question terms occurring in the answer passage [
        <xref ref-type="bibr" rid="ref13 ref8">8,
13</xref>
        ] or by adopting the IR score of the answer passage as a measure of similarity [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
Our shallow method for answer extraction, combining the last two approaches, is
presented in the next section.
      </p>
      <p>The general architecture of our Question Answering, similar for the three
considered languages, is described in Section 2. Section 3 is concerned with the
presentation of the results, while the last Section discusses the conclusions and further
work envisaged.</p>
    </sec>
    <sec id="sec-2">
      <title>2 System components</title>
      <p>
        Similarly to last year’s system, we eliminated many pre-processing modules in order
to obtain a real-time system. The shallow parsing approaches were considered due to
our intention to have a system that does not compromise with the response time,
transforming the QA system for online usage (similar to the ENLIGHT system [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] or
the SHAPAQA system [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]). After the indexing of the two corpora used as answer
extraction collection, which takes about 5 minutes, the time needed for our system to
process all the 200 test questions is about 5 seconds: less than 3 seconds for questions
pre-processing, about 1 second for snippets extraction, and another second for answer
extraction. The main differences from our last year’s participation are detailed in the
following sections.
      </p>
      <sec id="sec-2-1">
        <title>2.1 Corpus Pre-processing</title>
        <p>The JRC-Acquis corpus is a collection of juridical documents in XML format, with
each paragraph numbered. The Europarl4 corpus represents a collection of the
Proceedings of the European Parliament, also in XML format. A subset of the
Europarl, containing parallel documents in all the 9 languages involved in the
ResPubliQA track (Bulgarian, Dutch, English, French, German, Italian, Portuguese,
Romanian and Spanish), was created by crawling the web to get the data from the
European Parliament's website. The official nature of the documents forced them to
be in a very well organized structure, thus no corpus cleaning was necessary. The
only pre-processing performed over the document corpus was its indexing to facilitate
the information retrieval module.</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2 Question Analysis</title>
        <p>In this step we identify the semantic type of the answer (expected answer type). A
specialized module identifies the question focus, the question type and a set of
relevant keywords. The question analyzer performs the following steps:
i. NP-chunking and Named Entity extraction;
ii. Question focus identification (where the focus is the most important word in
the question, the clue for determining the answer type);
iii. Question type inferring;
iv. Answer type identification;
v. Identification of the keywords of the sentence. Together with the NPs and
named entities, the keywords are to be used by the query generator.</p>
        <p>Using GATE Gazetteer, the first step is to identify the named entities in the
question. Secondly, the focus of the question is selected from the questions NPs,
based on a simple heuristic (the first noun after the wh-word or after the first verb in
the sentence, which comes first). For the question analysis, the module developed for
the 2009 competition distinguished between factoid, definition, purpose, reason and
procedure question types. In order to address the new requirements regarding the
question type identification (the introduction of the opinion question type and the
merge of the purpose and reason types), we developed patterns for the new types
through empirical analysis of the training question set. Our system currently uses a set
of 40 patterns, mainly focusing on the introducing wh-word, in order to classify the
questions into their type.</p>
        <p>In case of factoid questions, for answer type identification we have 8 answer types:
person, number, measure, location, time, organization, animal and object. For each
type, we have created 4-5 derived rules, containing a base and several variables. For
instance, for the location answer type, we have the following regular expression:
qr/(?&gt;regiun.|sectoare|judeţ|staţiun.|loc.|raio.n.|localit..|oraş|capita
l.|insul.|vârf|ţ..?r..?|teritor.|provinci.|continent|locuri|monarhii)/
The variable part of the rule was build using WordNet hypernyms of the answer type.
Due to its generality, the object type is only used if no other rule matched.
4 Europarl: http://www.europarl.europa.eu/</p>
        <p>All the modules used in the question analysis step are pattern-based. Thus, in order
to obtain the corresponding question analysis modules for English and French, we
adapted the patterns from Romanian, using Google Translate5 for lexical translations.</p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3 Index Creation and Information Retrieval</title>
        <p>The purpose of this module is to retrieve the relevant snippets of text for every
question. For this task, similar to our approach for 2009, we used the Lucene6
indexing and search tools.</p>
        <p>i) Query creation</p>
        <p>Queries are formed based on the question analysis and it was very similar to the
solution we offered last year. They consist mainly of the sequences of keywords
previously identified, which are modified using some of the Lucene operators, such as
score boosting (the \^" operator, followed by a positive integer), fuzzy matching (the
\_" operator, followed by a number greater than 0 but less than 1) and the \or"
operator (symbolized by words between parentheses).</p>
        <p>ii) Index creation</p>
        <p>Because of the addition of the EuroParl document collection for this year’s
competition, we had do devise a way of indexing the corpus in such a way as to
include both types of documents. Upon analyzing the corpus, we have determined that
a number of properties are common across corpora (all documents have a name, a
paragraph number and some text), which allows us to create a single index. We have
indexed the corpora at the paragraph level, as our tests have shown that it performs
better in terms of relevant text than a document index. Each paragraph in the index is
characterized by a filed containing the information described above, and, according to
the corpus from which the paragraph was extracted, some extra fields: for the Aquis
paragraphs, the extra field is the document name, and for the EuroParl paragraphs, the
date of the document’s emission and the name of the speaker, in case it is specified.
These extra fields are necessary for extracting specific information regarding the
answer extraction (for example, in the case of OPINION type questions, the name of
the person giving their opinion can be found in the speaker field).</p>
        <p>iii) Relevant snippet extraction</p>
        <p>Querying over the created indexes, we used the Lucene search engine to extract a
ranked list of snippets for every question as possible answer candidates.</p>
      </sec>
      <sec id="sec-2-4">
        <title>2.4 Answer Extraction</title>
        <p>
          In the 2010 year’s track, we started from the answer extraction module built in
2009 [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. We combined in the same class the reason-purpose answers and considered
a new component for opinion answers. For this new component, the candidate answer
5 Google Translate: http://translate.google.com/
6 Lucene: http://lucene.apache.org/
ranking prefers answers from the EUROPARL corpus, because it is most likely to
contain personal opinions of different political persons. Intuitively, the closeness of
two terms may indicate a relation; therefore, we used features based on the distance
between the answer and the question terms (keywords, focus, named entities) to
obtain a better similarity measurement. The assumption is that, if the candidate
answer is close to several keywords or question terms, it is more likely to be relevant.
In order to consider the whole set of candidate paragraphs, this similarity score was
weighted with the scores provided by the retrieval module for each paragraph.
        </p>
        <p>
          The most important addition to this module was related to NOA (no answer) cases.
Using the training data, we tried to identify the optimum threshold for NOA, the idea
being that, if all extracted paragraphs by Lucene have the attached score under this
optimal threshold, we consider the final answer to be NOA and the question as not
being answered by the system. Otherwise, we apply the same heuristics as last year in
order to extract the best answer [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
        </p>
        <p>For determining the optimal threshold, we considered two values (reflected in the
two runs):</p>
        <p>A higher one - in this case, the system offers many NOA answers. This value
(in our case, for Romanian it was 0.72), was selected so as to lose only a few
correct answers, but to have very many questions with NOA answers. This
way, the combination between the correct answers and NOA answers offers
the highest score in terms of c1 measure.</p>
        <p>A lower one – in this case we offer only a few NOA answers. This value (in
our case, for Romanian it was 0.67), was selected so we keep the maximum
number of correct answers, although giving penalties for the wrong ones.</p>
        <p>The thresholds for English and French were very close to the Romanian threshold
(for English a little bit higher and for French a little bit lower), differing due to the
resources used for these languages in the language extraction module.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3 Results</title>
      <p>For the 2010 ResPubliQA track, our team submitted runs for three language pairs:
English-English, Romanian-Romanian and French - French. The best runs correspond
to the higher threshold we considered for NOA answers, as shown in Table 1.
answered right
answered wrong
total answered
unanswered right
unanswered wrong
unanswered empty</p>
      <p>Our supposition related to both thresholds was right for Romanian and French, but
not for English, where we lost too many correctly identified answers. For example,
for Romanian we have in Table 1 on the left column the values obtained for the
higher threshold and on the right column values obtained if using the lower threshold.
How we can see for higher threshold we lose only a few questions with answers
correctly identified by the system (102 – 95 = 7), but the number of NOA is much
higher in comparison to its value from right column (31 – 5 = 26). Therefore, the c1
measure is much higher on the left column in comparison with the c1 measure from
right column.</p>
    </sec>
    <sec id="sec-4">
      <title>4 Conclusions</title>
      <p>This paper presents the Romanian Question Answering system which took part in the
QA@CLEF 2010 competition. The evaluation shows an overall accuracy of 55% on
RO-RO (which is our best results from 2006 till now for Romanian), 46% on EN-EN
(which is under result obtained in 2009) and 30 % on FR-FR (which is our first try on
this language).</p>
      <p>One major improvement made this year was the thresholds used in order to offer
NOA answers if the system’s confidence is low. Our suppositions related to two
classes of thresholds proved correct for Romanian and French, but incorrect for
English. Another improvement considered the extraction module, where reason and
purpose question types were combined into one, and a new question class, opinion,
was introduced.</p>
      <p>This year we approached a new language, French, and the main difficulty was the
lack of free resources for it. The patterns developed for Romanian were adapted for
English and French, as they proved to be of great importance.</p>
      <p>Acknowledgements. The research presented in this paper was funded by the Sector
Operational Program for Human Resources Development through the project
―Development of the innovation capacity and increasing of the research impact
through post-doctoral programs‖ POSDRU/89/1.5/S/49944.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Akerkar</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Joshi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Natural Language Interface Using Shallow Parsing</article-title>
          .
          <source>International Journal of Computer Science &amp; Applications</source>
          , Vol.
          <volume>5</volume>
          , Issue 3, pp
          <fpage>70</fpage>
          -
          <lpage>90</lpage>
          ,
          <string-name>
            <surname>Canada</surname>
          </string-name>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Buchholz</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Daelemans</surname>
            ,
            <given-names>W.:</given-names>
          </string-name>
          <article-title>SHAPAQA: Shallow Parsing for Question Answering on the World Wide Web</article-title>
          .
          <source>In Proceedings Euroconference Recent Advances in Natural Language Processing</source>
          . Pp.
          <volume>47</volume>
          -
          <issue>51</issue>
          ,
          <fpage>5</fpage>
          -
          <lpage>7</lpage>
          September, Tsigov Chark,
          <string-name>
            <surname>Bulgaria</surname>
          </string-name>
          (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Correa</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Buscaldi</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Rosso</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>NLEL-MAAT at</surname>
          </string-name>
          CLEF-ResPubliQA.
          <source>Working Notes for the CLEF 2009 Workshop</source>
          , 30 September-2
          <string-name>
            <surname>October</surname>
          </string-name>
          , Corfu, Greece (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Cui</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.Y.</given-names>
            <surname>Kan</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.S.</given-names>
            <surname>Chua</surname>
          </string-name>
          ,
          <article-title>"Question answering passage retrieval using dependency relations,"</article-title>
          <source>in Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval</source>
          ,
          <year>2005</year>
          , pp.
          <fpage>400</fpage>
          -
          <lpage>407</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Iftene</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Trandabăţ</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pistol</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moruz</surname>
            ,
            <given-names>A. M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Husarciuc</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sterpu</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Turliuc</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Question Answering on English and Romanian Languages</article-title>
          .
          <source>In Proceedings of the CLEF 2009 Workshop</source>
          . 30 September - 2
          <string-name>
            <surname>October</surname>
          </string-name>
          . Corfu, Greece. (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Ion</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ştefănescu</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ceauşu</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tufiş</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Irimia</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Barbu-Mititelu</surname>
            ,
            <given-names>V. A.</given-names>
          </string-name>
          <string-name>
            <surname>Trainable</surname>
          </string-name>
          Multi-factored
          <source>QA System. Working Notes for the CLEF 2009 Workshop</source>
          , 30 September-2
          <string-name>
            <surname>October</surname>
          </string-name>
          , Corfu, Greece (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Kwok</surname>
            , K.-L. and
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Deng</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>"Chinese</surname>
          </string-name>
          Question-Answering:
          <article-title>Comparing Monolingual with English-Chinese Cross-Lingual Results,"</article-title>
          <source>in Asia Information Retrieval Symposium</source>
          ,
          <year>2006</year>
          , pp.
          <fpage>244</fpage>
          -
          <lpage>257</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Molla</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Gardiner</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          ,
          <article-title>"AnswerFinder - Question Answering by Combining Lexical, Syntactic and Semantic Information,"</article-title>
          <source>in Australasian Language Technology Workshop (ALTW)</source>
          <year>2004</year>
          , Sydney, Australia, pp.
          <fpage>9</fpage>
          -
          <lpage>16</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Peñas</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Forner</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sutcliffe</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          , Rodrigo, Á.,
          <string-name>
            <surname>Forăscu</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Alegria</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Giampiccolo</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moreau</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Osenova</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Overview of ResPubliQA 2009</article-title>
          .
          <article-title>Question Answering Evaluation over European Legislation (</article-title>
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Rodrigo</surname>
          </string-name>
          , Á.,
          <string-name>
            <surname>Pérez</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Peñas</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Garrido</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Araujo</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <article-title>Approaching Question Answering by means of Paragraph Validation</article-title>
          .
          <source>Working Notes for the CLEF 2009 Workshop</source>
          , 30 September-2
          <string-name>
            <surname>October</surname>
          </string-name>
          , Corfu, Greece (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Shen</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Saarbruecken</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Klakow</surname>
          </string-name>
          ,
          <article-title>"Exploring Correlation of Dependency Relation Paths for Answer Extraction,"</article-title>
          <source>in Proceedings of ACL</source>
          <year>2006</year>
          ,
          <year>2006</year>
          , Sydney, Australia, pp.
          <fpage>889</fpage>
          -
          <lpage>896</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Soubbotin</surname>
            , M.M. and
            <given-names>S.M.</given-names>
          </string-name>
          <string-name>
            <surname>Soubbotin</surname>
          </string-name>
          ,
          <article-title>"Patterns of Potential Answer Expressions as Clues to the Right Answers,"</article-title>
          <source>in Proceedings of the Tenth Text REtrieval Conference (TREC</source>
          <year>2001</year>
          ),
          <year>2001</year>
          , Gaithersburg, MD, pp.
          <fpage>134</fpage>
          -
          <lpage>143</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Z.M.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Guan</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>"Insun05QA on QA track of TREC2005,"</article-title>
          <source>in TREC</source>
          ,
          <year>2005</year>
          , Gaithersburg, MD.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>