<!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>The University of Amsterdam at QA@CLEF 2003</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Valentin Jijkoun</string-name>
          <email>jijkoun@science.uva.nl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Language &amp; Inference Technology Group, University of Amsterdam Nieuwe Achtergracht 166</institution>
          ,
          <addr-line>1018 WV Amsterdam</addr-line>
          ,
          <country country="NL">The Netherlands</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper describes the official runs of our team for QA@CLEF 2003. We took part in the monolingual Dutch Question Answering task. In this year's CLEF evaluation exercise we participated in the Dutch Question Answering task, new on the CLEF agenda, building on and extending our earlier work on question answering at TREC [6]. We experimented with a multi-stream architecture for question answering, in which the different independent streams, each a complete QA system in its own right, compete with each other to provide the system's final answer. The paper is organized as follows. In Section 2 we describe the architecture of our system. Section 3 describes our official runs. In Section 4 we discuss the results we have obtained. Finally, in Section 5 we offer some preliminary conclusions regarding our Dutch question answering efforts.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        The general architecture of a question answering (QA) system, shared by many systems, can be summed up as
follows. A question is first associated with a question type, out of a predefined set such as DATE-OF-BIRTH
or CURRENCY. Then a query is formulated based on the question, and an information retrieval engine is used
to identify a list of documents that are likely to contain the answer. Those documents are sent to an answer
extraction module, which identifies candidate answers, ranks them, and selects the final answer. On top of this
basic architecture, numerous add-ons have been devised, ranging from logic-based methods [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] to ones that rely
heavily on the redundancy of information available on the World Wide Web [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>question
question
classifier</p>
      <p>look up
pattern match
web answer</p>
      <p>Dutch
Tequesta
English
Tequesta
extract
candidate
answers
extract
candidate
answers
extract
candidate
answers
extract
candidate
answers
extract
candidate
answers
answer selection
answer</p>
      <p>Question Answering Streams. We now provide a brief description of the five streams of our QA system: Table
Lookup, Pattern Match, English Tequesta, Dutch Tequesta, and Web Answer.</p>
      <p>The Table Lookup stream uses specialized knowledge bases constructed by preprocessing the collection,
exploiting the fact that certain information types (such as country capitals, abbreviations, and names of political
leaders) tend to occur in the document collection in a small number of fixed patterns. When a question type
indicates that the question might potentially have an answer in these tables, a lookup is performed in the
appropriate knowledge base and answers which are found there are assigned high confidence. For example, to collect
abbreviation-expansion pairs we searched the document collection for strings of capitals in brackets; upon finding
one, we extracted sequences of capitalized non-stopwords preceding it, and stored it in the “abbreviation
knowledge base.” This approach answered question such as:</p>
      <sec id="sec-1-1">
        <title>Question Knowledge Base Table Entry Extracted Answer</title>
        <p>84. Waar staat GATT voor?
Abbreviations
GATT: Overeenkomst over Tarieven en Handel</p>
        <sec id="sec-1-1-1">
          <title>GATT</title>
        </sec>
      </sec>
      <sec id="sec-1-2">
        <title>For a detailed overview of this stream, see [3]. In the Pattern Match stream, zero or more Perl regular patterns are generated for each question according to its type and structure. These patterns indicate strings which contain the answer with high probability, and are then matched against the entire document collection. Here’s a brief example:</title>
      </sec>
      <sec id="sec-1-3">
        <title>Question Generated pattern Match Extracted Answer</title>
        <p>2. In welke stad is het Europese Parlement?
Europese Parlement\s+in\s+(\S+)
. . . voor het Europese Parlement in Straatsburg, dat . . .</p>
        <sec id="sec-1-3-1">
          <title>Straatsburg</title>
          <p>
            The English Tequesta stream translates the questions to English using Worldlingo’s free translation service at
http://www.worldlingo.com/. The auto-translated questions are then fed to Tequesta, an existing QA system
for English developed at the University of Amsterdam [
            <xref ref-type="bibr" rid="ref6">6</xref>
            ]. The system uses the English CLEF corpus, and is
extended with an Answer Justification module to anchor the answer in the Dutch collection.
          </p>
          <p>
            The Dutch Tequesta is an adaptation of English Tequesta to Dutch and used as an independent stream, provided
with the original Dutch newspaper corpus. The modifications to the original system included replacing (English)
language specific components by Dutch counterparts; for instance, we trained TNT [
            <xref ref-type="bibr" rid="ref1">1</xref>
            ] to provide us with
Part-ofSpeech tags using the Corpus Gesproken Nederlands [
            <xref ref-type="bibr" rid="ref7">7</xref>
            ]; a named entity tagger for Dutch was also developed.
          </p>
          <p>The Web Answer stream looks for an answer to a question on the World Wide Web, and then attempts to find
justification for this answer in the collection. First, the question is converted to a web query, by leaving only
meaningful keywords and (optionally) using lexical information from EuroWordNet. The query is sent to a web
search engine (for the experiments reported here we used Google); if no relevant Web documents are found, the
query is translated to English and sent again. Next, if the query yields some results, words and phrases appearing in
the snippets of the top results are considered as possible answers, and ranked according to their relative frequency
over all snippets. The Dutch named entity tagger and some heuristics were used to enhance the simple counts for
the terms (e.g., terms that matched a TIME named entity were given a higher score if the expected answer type
was a date). Finally, justifications for the answer candidates are found in the local Dutch corpus.</p>
          <p>
            While each of the above streams is a “small” QA system in itself, many components are shared between the
streams, including, for instance, an Answer Justification module that tries to ground externally found facts in the
Dutch CLEF corpus, and a Web Ranking module that uses search engine hit counts to rank the candidate answers
from our streams in a uniform way, similar to [
            <xref ref-type="bibr" rid="ref4">4</xref>
            ].
3
          </p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>Runs</title>
      <p>We submitted two runs for the Dutch question answering task: uamsex031md and uamsex032md. Both runs
returned exact answers, and both combined answers from all streams, but differed slightly in the method of using the
search engine hit counts for ranking the answers. The score of an answer was the product of the confidence
measure produced by the stream generating the answer and the “Web Hit Count” measure, which equals the number
of hit counts produced by Google for a query made up of the answer and keywords from the question. To prefer
queries with words that do not occur frequently, we also calculated a “Query Value” measure: in uamsex031md,
the query value was calculated using the word frequencies of the query words in the CLEF English and Dutch
corpora, and in uamsex032md it was calculated using the Web hit count of the answer alone. Query values were
used to normalize the Web Hit Count measure.</p>
      <p>Here is a simplified example, in which the method used for uamsex031md produced better results (stream
confidence level not displayed):</p>
      <sec id="sec-2-1">
        <title>Candidate Answer</title>
        <p>Generated Query
Query Hit Count
Total Word Frequency
Candidate Hit Count
Normalized Query Value (uamsex031md)
Normalized Query Value (uamsex032md)
Final Web Score (uamsex031md)
Final Web Score (uamsex032md)</p>
        <p>Question 115. Waar bevindt zich de Klaagmuur?
Jeruzalem
Klaagmuur Jeruzalem
793
4.48e-05
70700
1.0
0.02
1.0
0.02</p>
      </sec>
      <sec id="sec-2-2">
        <title>Joyce</title>
        <p>Klaagmuur Joyce
26
1.85e-05
3460000
0.413
1.0
0.0135
0.033
Shortly after the submission, we discovered a couple of implementation bugs that caused some of the Table
Lookup stream answers to be incorrect. Below we also discuss two post-submission runs, uamsex031md.fixed
and uamsex032md.fixed, which are identical to the submitted runs but with these implementation bugs fixed.
4</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Results and Discussion</title>
      <p>The following table shows the evaluation results of our CLEF 2002 submissions and the two post-submission
runs described above. Beside the standard Strict and Lenient measures, we also evaluated our runs using more
“generous” Lenient, Non-exact measure that accepts non-exact answers as correct.</p>
      <p>Run
uamsex031md
uamsex032md
uamsex031md.fixed
uamsex032md.fixed</p>
      <p>Strict
# correct answers
78 (39%)
82 (41%)
84 (42%)
88 (44%)</p>
      <p>MRR
0.298
0.305
0.335
0.349</p>
      <sec id="sec-3-1">
        <title>Lenient</title>
        <p># correct answers
82 (41%)
89 (44.5%)
87 (43.5%)
95 (47.5%)
MRR
0.317
0.335
0.352
0.375</p>
      </sec>
      <sec id="sec-3-2">
        <title>Lenient, Non-exact</title>
        <p># correct answers MRR
96 (48%) 0.377
102 (51%) 0.393
100 (50%) 0.407
107 (53.5%) 0.428
The run uamsex032md scored better than uamsex031md: as expected, normalizing web hit counts according to the
distribution of words on the web yielded a more accurate ranking than normalization using corpus word
frequencies. Also, the two runs with the fixed Table Lookup stream outperformed our official runs.</p>
        <p>An error analysis of the questions which had a correct answer with incorrect document ID (i.e. those separating
Strict and Lenient scores) revealed that answers with incorrect justifications did not necessarily come from external
resources (the Web and English Tequesta streams); this suggests a local problem in our justification mechanism,
rather than an inherent inability to justify externally found answers in the local corpus. Taking this into account,
our 53.5% score in the table seems quite realistic.</p>
        <p>It is interesting to see the increase in performance with the Lenient, Non-exact measure. Most of the non-exact
answers that the system produced contained noise around the correct answer strings, e.g. “Jacques Delors. Met”,
“Kim Il Sung. Japan” or “1989, heeft vooral in het oostelijke deel van Berl”, due to named entity extraction errors.</p>
        <p>
          An initial analysis of the contribution of the different answering streams to the system’s overall performance
suggests that every stream has its own strengths, that is, specific question types for which it provides correct
answers with higher probability than other streams. The Web Answer stream, for example, seemed to perform
better than other streams on questions for which the answer was a date; the Pattern and Table Lookup streams had
very good performance on the specific (5-6) question types for which they were used. Every stream contributed
some correct answers, so the total combined output of the system was better than any subsystem alone. E.g., out
of the 200 questions, 54 (27%) were answered by the Table Lookup stream; of these, 26 answers (13% of the total
answers) came solely from this stream. A further analysis of the performance of our streams on different question
types will allow us to give each stream a confidence weight conditioned on question type, and thus to make the
answer selection more informed, in ways similar to the approach adopted by BBN for TREC 2002 [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ].
5
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusions and Future Work</title>
      <p>We presented our multi-stream question answering system and the runs it produced for CLEF 2003. Running in
parallel several subsystems that approach the QA task from different angles proved successful, as some approaches
seem better fit to answer certain types of questions than others.</p>
      <p>Our current ongoing work on the system is focused on extensions of the Table Lookup stream and the Web
Answer stream. Future plans also include improvements of the voting mechanism between the answers provided
by the different streams, and enhancing the system to support definition and list questions.</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgments References</title>
      <p>We want to thank Christine Foeldesi for her work on developing a named entity tagger for Dutch. Valentin Jijkoun
and Gilad Mishne were supported by the Netherlands Organization for Scientific Research (NWO) under project
number 220-80-001. Maarten de Rijke was supported by grants from NWO, under project numbers 612-13-001,
365-20-005, 612.069.006, 612.000.106, 220-80-001, and 612.000.207.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>T.</given-names>
            <surname>Brants. TnT -</surname>
          </string-name>
          <article-title>a statistical part-of-speech tagger</article-title>
          .
          <source>In Proceedings of the 6th Applied NLP Conference, ANLP-2000</source>
          ,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Banko</surname>
          </string-name>
          et al.
          <article-title>AskMSR: Question answering using the Worldwide Web</article-title>
          .
          <source>In Proceedings EMNLP</source>
          <year>2002</year>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>V.</given-names>
            <surname>Jijkoun</surname>
          </string-name>
          , G. Mishne, and M. de Rijke.
          <article-title>Preprocessing Documents to Answer Dutch Questions</article-title>
          .
          <source>In Proceedings of the 15th Belgian-Dutch Conference on Artificial Intelligence (BNAIC'03)</source>
          , To appear.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Bernardo</given-names>
            <surname>Magnini</surname>
          </string-name>
          , Matteo Negri, Roberto Prevete, and
          <string-name>
            <given-names>Hristo</given-names>
            <surname>Tanev</surname>
          </string-name>
          .
          <article-title>Is it the right answer? exploiting web redundancy for answer validation</article-title>
          .
          <source>In Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics (ACL)</source>
          , pages
          <fpage>425</fpage>
          -
          <lpage>432</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>D.</given-names>
            <surname>Moldovan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Harabagiu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Girju</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Morarescu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Lacatusu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Novischi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Badulescu</surname>
          </string-name>
          , and
          <string-name>
            <surname>O. Bolohan.</surname>
          </string-name>
          <article-title>LCC Tools for Question Answering</article-title>
          .
          <source>In Voorhees and Harman [8].</source>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>C.</given-names>
            <surname>Monz and M. de Rijke</surname>
          </string-name>
          .
          <article-title>Tequesta: The University of Amsterdam's textual question answering system</article-title>
          . In E.M. Voorhees and
          <string-name>
            <surname>D.K</surname>
          </string-name>
          . Harman, editors,
          <source>The Tenth Text REtrieval Conference (TREC</source>
          <year>2001</year>
          ), pages
          <fpage>519</fpage>
          -
          <lpage>528</lpage>
          .
          <article-title>National Institute for Standards and Technology</article-title>
          .
          <source>NIST Special Publication 500-250</source>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>N.</given-names>
            <surname>Oostdijk</surname>
          </string-name>
          .
          <article-title>The Spoken Dutch Corpus: Overview and first evaluation</article-title>
          .
          <source>In Proceedings LREC</source>
          <year>2000</year>
          , pages
          <fpage>887</fpage>
          -
          <lpage>894</lpage>
          ,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>E.M.</given-names>
            <surname>Voorhees</surname>
          </string-name>
          and
          <string-name>
            <surname>D.K</surname>
          </string-name>
          . Harman, editors.
          <source>The Tenth Text REtrieval Conference (TREC</source>
          <year>2002</year>
          ).
          <article-title>National Institute for Standards and Technology</article-title>
          .
          <source>NIST Special Publication 500-251</source>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Licuanan</surname>
          </string-name>
          , J. May,
          <string-name>
            <given-names>S.</given-names>
            <surname>Miller</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Weischedel</surname>
          </string-name>
          .
          <article-title>TREC 2002 QA at BBN: Answer selection and confidence estimation</article-title>
          .
          <source>In Voorhees and Harman [8].</source>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>