<!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>Retrieval-based Question Answering for Machine Reading Evaluation</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Information Foraging Lab/Centre for Language and Speech Technology Radboud University Nijmegen</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>The Question Answering for Machine Reading (QA4MRE) task was set up as a reading comprehension test consisting of 120 multiple-choice questions pertaining to twelve target texts (the test documents) grouped in three di erent topics. Since this is the rst year that we participate in the task, we decided to follow a relatively knowledge-poor approach that is mainly based on Information Retrieval (IR) techniques. We participated in the English task only. In its most basic version, our system takes the question as a query and uses a standard word-based ranking model to retrieve the most relevant fragments from the test document. Then it matches each of the multiple-choice answer candidates against the set of retrieved text fragments to select the answer with the highest summed similarity (again measured using a standard ranking model). We investigated two forms of information expansion to improve over this baseline: (1) statistical expansion of the test document with sentences from the topical background corpus, and (2) expansion of the question with automatically gathered facts from the background corpus. Our best-performing experimental setting reaches an overall c@1 score of 0.37. We found that statistical expansion of the test documents gives very di erent results for the three topics but overall it gives an improvement over the document-only baseline. We could not gain any improvements from question-to-facts expansion. More experiments are needed to nd a good implementation of fact expansion. In the near future, we will follow up on the current work with more experiments related to expansion of questions and documents for the purpose of question answering.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>After a long tradition of tracks at CLEF in which Question Answering (QA) was a task in its
own right, in 2010 and 2011 the organization prepared the QA task as an evaluation method for
another task: Machine Reading [3]. According to the track guidelines, \Machine Reading can be
de ned as the automatic understanding of text. One way of evaluating the understanding of a text
is to assess a system's ability to answer a set of questions about it."</p>
      <p>The Question Answering for Machine Reading (QA4MRE) task was set up as a reading
comprehension test. We participated in the English task, which consists of 120 multiple-choice questions
pertaining to twelve target texts (the test documents). The test documents are grouped by four
in three di erent topics: AIDS, Climate change and Music &amp; Society. For each of the three topics,
a separate background corpus of respectively 29,000, 37,000 and 33,000 documents from a diverse
range of sources was provided. In the reading test, ve answer candidates are given per question.
The participating systems have the choice of not answering a question if they are not sure of the
selected answer.</p>
      <p>Answering the reading test questions may require more information than the information that
is explicitly contained in the test documents. Some examples are:
{ A seemingly simple question such as \Who is the founder of the SING campaign? " (topic
AIDS, document 1, question 2) can be answered by the sentence \And this is the name of my
campaign, SING Campaign." but only in combination with the knowledge that `my' refers to
Annie Lennox, the author of the text.
{ The answer to the more complex question \What event caused Annie Lennox to commit herself
to the ght against AIDS? " (topic AIDS, document 1, question 1) has to be distilled from the
rst 250 words of the text. The answer \Nelson Mandela's conference to the world press" is a
summarization of Annie Lennox' motivation.
{ The question \In which European cities has Annie Lennox performed? " (topic AIDS, document
1, question 7) has as answer alternatives several cities where Annie Lennox performed but
which are not located in Europe. Thus, this question can only be answered with knowledge of
which cities are in Europe.
{ The answer to the question \In Frankie's jail, how was diamorphine taken? " is in the fragment
\Frankie, at that time, was a heroin addict, and he was in jail. So his choice was either to
accept that dirty needle or not to get high." but it is di cult to recognize because the synonym
diamorphine is used instead of heroin in the question, and the correct answer \by intravenous
injection" does not contain the word needle.</p>
      <p>Considering these di culties, the QA4MRE task asks for a number of natural language
processing techniques including question analysis (answer type determination), named entity recognition,
coreference resolution, synonym/hypernym mapping, etc. Since this is the rst year that we
participate in the task, we decided to follow a relatively knowledge-poor approach that is mainly
based on Information Retrieval (IR) techniques.</p>
      <p>
        In its most basic version, our system takes the question as a query and uses a standard
wordbased ranking model to retrieve the most relevant fragments from the test document. Then it
matches each of the multiple-choice answer candidates against the set of retrieved text fragments
to select the answer with the highest summed similarity (again measured using a standard ranking
model). We investigated two forms of information expansion to improve over this baseline: (
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
statistical expansion of the test document with sentences from the topical background corpus, and
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) expansion of the question with automatically gathered facts from the background corpus.
      </p>
      <p>In Section 2, we will explain our approach and the experiments that we carried out. In Section 3
we describe the results that we obtained. Our conclusions are in Section 4.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Our approach</title>
      <p>
        We implemented the QA4MRE task as a pipeline process with ve modules: (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) data preparation,
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) test document expansion, (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) question-to-facts expansion, (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) text fragment retrieval and (
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
answer selection. Of these, modules 2 and 3 are optional. We implemented all modules in Perl.
Then we ran four di erent experiments:
1. no expansion;
2. test document expansion;
3. question-to-facts expansion;
4. test document expansion and question-to-facts expansion.
      </p>
      <p>In all these experiments, modules 1, 4 and 5 are used. Module 2 is active in experiment 2 and 4;
module 3 in experiment 3 and 4.
2.1</p>
      <sec id="sec-2-1">
        <title>Data preparation</title>
        <p>We prepared the test documents and the background corpus as follows: In the test documents,
we replaced the words `I', `me', and `my' by the name of the author, which we simply assumed
to be the rst name of the document. We split the test documents in target fragments of three
sentences each, and the background corpora in single-sentence units. Then we lowercased all texts
and removed punctuation. We created an inverted index of each topic's background corpus and
we removed all words from the index that occur in fewer than three sentences.1
2.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Test document expansion</title>
        <p>In Section 1, we showed that some of the questions of the reading comprehension task cannot
be answered with only the information contained in the corresponding test document; additional
information from the background corpus is required to answer these questions. Our document
expansion step in experiment 2 and 4 is based on the idea that the required additional
information is in some way related to the information that is already present in the test document. We
implemented a statistical expansion module that searches the most similar sentences in the topic's
background corpus index for each of the three-sentence fragments (the `target fragments') from
the test document.</p>
        <p>The similarity between the target fragments and the background sentences is measured using
the BM25 ranking function [1]: For each target fragment T , containing keywords t1; :::; tn, the
BM25 score of a background sentence S is:</p>
        <p>n
score(S; T ) = X ISF (ti)
i=1</p>
        <p>f (ti; S) (k1 + 1)
f (ti; S) + k1 (1
b + b avjSgjsl )
in which f (ti; S) is ti's term frequency in S, jSj is the length of S in words, and avgsl is
the average sentence length in the background collection. For the parameters k1 and b, we used
k1 = 2:0 and b = 0:75. ISF (ti) is the Inverse Sentence Frequency of the target term ti:
ISF (ti) = log</p>
        <p>N</p>
        <p>n(ti) + 0:5
n(ti) + 0:5
where N is the total number of sentences in the collection, and n(ti) is the number of sentences
containing ti.</p>
        <p>Our document expansion module expands each target fragment with the ten highest-scoring
sentences from the background collection that are at least four words long.2 Table 1 shows an
example target fragment with the ten most related sentences that are retrieved from the background
corpus. The result is a set of expanded target fragments ET for each test document.
2.3</p>
      </sec>
      <sec id="sec-2-3">
        <title>Question-to-facts expansion</title>
        <p>In the previous subsection we described a statistical method for expanding the test document
with information from the background corpus. A second type of expansion that we investigated,
is expanding the question itself with structured information from the corpus. The rationale
behind this is that each question contains names and domain-related terms about which the
background corpus contains factual information. This factual information might help for answering the
question. For example, the corpus contains facts about needle exchange programs, e.g. \needle
exchange programs, which have proved to reduce the spread of blood-borne viruses" (document
AIDS EN 10645.txt). This informtion can help answering the question \Why did a former UK
Prime Minister start a needle exchange program?' (answer: \in order to prevent the spread of
HIV")</p>
        <p>In the remainder of the current subsection, we explain how we extracted facts from the corpus;
in the next subsection we explain how we used the question-to-facts expansion in the QA process.</p>
        <p>
          We implemented a fact extractor for English that is based on dependency relations, similar to
the method proposed in [6]. Each fact has the general form subjectjverbjobjectjcomplements or
1 Removing words from the index that have a sentence frequency below three also had a practical reason:
Perl's data structures are not memory-e cient enough to store an inverted index including all hapaxes
and near-hapaxes.
2 Without the length requirement, BM25 gives us too many `sentences' of only one or two words long.
(
          <xref ref-type="bibr" rid="ref1">1</xref>
          )
(
          <xref ref-type="bibr" rid="ref2">2</xref>
          )
subjectjverbjpredicatejcomplements, in which verbs and nouns are lemmatized. Here are three
examples of facts automatically extracted from the background collection on AIDS:
\needle exchange program j reduce j the spread j "
\Queen II Elizabeth j honor j Annie Lennox j "
\the future prime minister j write j romance novel j possibly
        </p>
        <p>We used the AEGIR parser [5] to generate the dependency relations needed for the fact
extractor. AEGIR was developed for applications in Information Retrieval rather than in Linguistics. For
that reason, its dependency model expresses the aboutness [4] of a sentence rather than describing
its complete syntactic structure. AEGIR's output representation is comparable to the Stanford
typed dependencies representation [2], in the sense that it generates a set of binary relations
between words for an input sentence, thereby converting some function words (such as prepositions)
to relations. In addition to that, AEGIR performs a number of normalizing transformations, such
as passive-to-active transformation. For example, the clause \an in ammatory reaction, caused by
the bowel tissue" leads to the same analysis as \the bowel tissue causes an in ammatory reaction":
\the bowel tissue j cause j an in ammatory reaction j "</p>
        <p>We parsed the background corpora with AEGIR (version 1.8.2) and extracted the facts using
a Perl script. We performed some automatic postprocessing to lter out `empty' facts of which the
subject or the object is a pronoun3 and facts that come from metadata instead of actual document
content (e.g. containing the word `Wikipedia').</p>
        <p>We considered several options for expanding the input questions with facts from the background
corpus, and we decided on a rather basic approach: We indexed the facts twice, by subject ( rst
eld) and by object (third eld). Then, while processing the question Q, if any substring of the
question acts as subject or object in an indexed fact Fi, this fact is added to the question expansion
3 Of course, better would be to replace these anaphors by their antecedent but we did not add an anaphora
resolution step in this version of our method.
set EFQ. We set a threshold on the frequency of the fact in the background corpus that has to be
exceeded for the fact to be included in EFQ.</p>
        <p>For example, the question \Why did a former UK Prime Minister start a needle exchange
program?" (topic AIDS, document 3, question 6) contains three substrings that act as subject
or object in facts from the background corpus: `prime minister', `needle exchange' and `needle
exchange program'. Example background facts containing these terms are:
the country j have j prime minister j now
an order j permit j needle exchange j in three city
needle exchange program j decrease j the spread j</p>
        <p>EFQ, the set of facts generated for a question, can be very large if frequent substrings (e.g.
`problem', `people') from the question act as subject or object in facts. Therefore, we set a
maximum sentence frequency of 2,000 and a minimum length of 7 characters on each substring. If a
substring is more frequent or shorter, then no facts are generated for this substring.
2.4</p>
      </sec>
      <sec id="sec-2-4">
        <title>Text fragment retrieval</title>
        <p>The retrieval module retrieves the most relevant target fragments for each question. If set to
active, the document expansion module has before expanded each three-sentence fragment in the
test document with ten sentences from the background corpus.</p>
        <p>For measuring the similarity between the question and an (expanded) target score(Q; ETi)
we again use the BM25 ranking function. For each question, up to ten expanded fragments are
retrieved for which the BM25 score is higher than a xed threshold. The result is a set of (expanded)
target fragments that are relevant to the question Q: ETQ.</p>
        <p>If the question-to-facts expansion module is active (in experiment 3 and 4), then we add the
selected facts EFQ to ETQ. For example, in experiment 2, two (non-expanded) fragments from the
test document are retrieved for the question \Why did a former UK Prime Minister start a needle
exchange program?" (topic AIDS, document 3, question 6). In addition to this, the
question-tofacts expansion module selected 12 facts related to the question terms `prime minister', `needle
exchange' and `needle exchange program'. The two fragments and the twelve facts together form
the question expansion set EQ.
2.5</p>
      </sec>
      <sec id="sec-2-5">
        <title>Answer selection</title>
        <p>
          The last step of our pipeline is to select one of the multiple-choice answer options from the reading
test. We implemented a simple voting system, again based on BM25, for selecting the most likely
answer given EQ 4: We treat each answer candidate as a query, and calculate its BM25 score for
each of the elements in EQ;i. Then we sum this score over all elements to get a score for each
answer:
score(Aj ; EQ) =
n
X score(A; EQ;i)
i=1
(
          <xref ref-type="bibr" rid="ref3">3</xref>
          )
where n is the number of (expanded) target fragments and facts for Q.
        </p>
        <p>We set a threshold on the answer selection score: If the score(Aj ; Q) for none of the answer
candidates Aj exceeds this threshold, then the question is not answered.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Results</title>
      <p>As introduced in the previous section, we submitted four experiments:
4 Recall that EQ contains text fragments from the test document; depending on which experiment we
run these are statistically expanded to ETQ, and/or extended with the set of facts EFQ.
1. no expansion;
2. test document expansion;
3. question-to-facts expansion;
4. test document expansion and question-to-facts expansion.
In Section 2, we mentioned that we used thresholds at several points in our method.</p>
      <p>In the question-to-facts expansion module, we applied a threshold to the frequency of a
fact in the corpus for it to be selected for a question's expansion set. We noticed that there is
quite some noise among the facts that only occur once in the corpus. Therefore, we require that
the absolute fact frequency be 2. Table 2 shows the number of questions that are expanded
with at least one fact from the background corpus, and the average number of facts per expanded
question per topic.</p>
      <p>Considering these statistics, it is clear that more work is needed on sensible expansion of
questions with facts. The low numbers of questions that get expanded with facts, especially for
the AIDS and Music &amp; Society topics, suggests that our method for selecting substrings for
expansion is too rigid. We will look into this in more detail before following up with additional
experiments. Moreover, the Climate Change topic has an extremely high number of facts per
expanded question. This is because the question substrings `carbon dioxide' and `climate change'
are both very frequent in the Climate Change corpus, and generate large amounts of facts, e.g.
fossil fuel j generate j carbon dioxide
the requirement j reduce j carbon dioxide
the causal j link j carbon dioxide</p>
      <p>The rst of these facts may be relevant for the question \How could the reduction of carbon
dioxide emissions be promoted?", but the second fact is not informative, and the third has
incorrectly been generated due to parsing errors. An interesting challenge for future work is to estimate
the informativeness of facts for question expansion.</p>
      <p>Secondly, we applied a threshold on the BM25 score in the text fragment retrieval module.
Up to ten fragments were retrieved per question, but if fewer than ten exceed the threshold then
only those are retrieved that do. We used a threshold of score(Q; ETi) = 2. On average, 2.0
fragments were retrieved per question in experiment 1 and 3 (without document expansion); 4.9
fragments were retrieved per question in experiments 2 and 4 (when the fragments have been
expanded with information from the corpus).</p>
      <p>Finally, we applied a threshold on the BM25 score in the answer selection module, which
we use to decide whether or not our system answers the question: if it is not certain enough of
the highest-scoring answer, then it decides not to answer the question. We used a threshold of
score(Aj; EQ) = 1. Table 3 shows the number of unanswered questions per experimental setting
per topic.
3.2</p>
      <sec id="sec-3-1">
        <title>Evaluation of the runs</title>
        <p>
          The main evaluation measure used for the QA4MRE runs is c@1 [7]. This measure not only counts
the number of correctly answered questions, but also takes into account the number of questions
that are not answered by a system:
(
          <xref ref-type="bibr" rid="ref4">4</xref>
          )
where nr is the number of correctly answered questions, nu is the number of unanswered
questions and n is the total number of questions.
        </p>
        <p>Table 4 shows the results for our runs in terms of c@1.</p>
        <p>We make several observations from these results. First, experimental setting 2 gives the best
results over all topics. Music &amp; Society is an exception to this trend; here the settings without
expansion of the test documents outperform the settings with document expansion. We had a
look at the expanded fragments from the source documents and we suspect that the speci city
of the test documents (e.g. one speci c music video) turns the most similar sentences from the
background corpus (which are about other music videos) irrelevant for answering the questions.
For the other two topics, expansion of the test document with sentences from the background
corpus gives an improvement. This improvement is very large for the Climate Change topic (from
c@1 = 0:29 to c@1 = 0:45).</p>
        <p>Our second observation is that question-to-facts expansion does not improve the performance
of our system on the reading tests. As we explained in Section 3.1, we expect that there is a lot
to gain from sensible expansion of questions with facts: First, in the quality of the facts generated
from the background corpus (which depends on the quality of the dependency parser), second in
the selection of informative facts to be included in the expandion set, and third in the selection of
the substrings (terms) that are expanded to facts.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusions</title>
      <p>The QA4MRE task is a reading comprehension task: the goal is to answer a number of
multiplechoice questions pertaining to a test document, possibly with use of a background corpus on the
topic of the document.</p>
      <p>We implemented a relatively knowledge-poor approach to the reading comprehension task. Our
approach is based on retrieval techniques in two steps: retrieval of relevant fragments from the test
document for the input question, and matching of the multiple-choice answer candidates against
the retrieved fragments in order to select the most likely answer.</p>
      <p>
        In a series of experiments, we investigated two forms of information expansion: (
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
statistical expansion of the test document with sentences from the topical background corpus, and (
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
expansion of the question with automatically gathered facts from the background corpus.
      </p>
      <p>We found that statistical expansion of the test documents gives very di erent results for the
three topics but overall it gives an improvement over the document-only baseline. We could not
gain any improvements from question-to-facts expansion. More experiments are needed to nd a
good implementation of fact expansion.</p>
      <p>In the near future, we will follow up on the current work with more experiments related to
expansion of questions and documents for the purpose of question answering.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1. S. Buttcher,
          <string-name>
            <given-names>C.L.A.</given-names>
            <surname>Clarke</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Lushman</surname>
          </string-name>
          .
          <article-title>Term Proximity Scoring for Ad-hoc Retrieval on Very Large Text Collections</article-title>
          .
          <source>In Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval</source>
          , pages
          <volume>621</volume>
          {
          <fpage>622</fpage>
          . ACM,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>M.C. De Marne</surname>
            e and
            <given-names>C.D.</given-names>
          </string-name>
          <string-name>
            <surname>Manning</surname>
          </string-name>
          .
          <article-title>The Stanford typed dependencies representation</article-title>
          .
          <source>In Coling 2008: Proceedings of the workshop on Cross-Framework and Cross-Domain Parser Evaluation</source>
          , pages
          <fpage>1</fpage>
          <lpage>{</lpage>
          8. Association for Computational Linguistics,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>O.</given-names>
            <surname>Etzioni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Banko</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.J.</given-names>
            <surname>Cafarella</surname>
          </string-name>
          .
          <article-title>Machine reading</article-title>
          .
          <source>In Proceedings of the National Conference on Arti cial Intelligence</source>
          , volume
          <volume>21</volume>
          , pages
          <fpage>1517</fpage>
          {
          <fpage>1519</fpage>
          . Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press;
          <year>1999</year>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>C.H.A.</given-names>
            <surname>Koster</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.G.</given-names>
            <surname>Beney</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Verberne</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Vogel</surname>
          </string-name>
          .
          <article-title>Phrase-Based Document Categorization</article-title>
          .
          <source>Current Challenges in Patent Information Retrieval</source>
          , pages
          <volume>263</volume>
          {
          <fpage>286</fpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>Nelleke</given-names>
            <surname>Oostdijk</surname>
          </string-name>
          , Suzan Verberne, and
          <string-name>
            <surname>Cornelis</surname>
            <given-names>H.A.</given-names>
          </string-name>
          <string-name>
            <surname>Koster</surname>
          </string-name>
          .
          <article-title>Constructing a broad coverage lexicon for text mining in the patent domain</article-title>
          .
          <source>In Proceedings of the Seventh conference on International Language Resources and Evaluation (LREC</source>
          <year>2010</year>
          ).
          <source>European Language Resources Association (ELRA)</source>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>A.</given-names>
            <surname>Pen</surname>
          </string-name>
          <article-title>~as and</article-title>
          <string-name>
            <given-names>E.</given-names>
            <surname>Hovy</surname>
          </string-name>
          .
          <article-title>Semantic enrichment of text with background knowledge</article-title>
          .
          <source>In Proceedings of the NAACL HLT 2010 First International Workshop on Formalisms and Methodology for Learning by Reading</source>
          , pages
          <fpage>15</fpage>
          {
          <fpage>23</fpage>
          . Association for Computational Linguistics,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>A.</given-names>
            <surname>Penas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rodrigo</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J. del</given-names>
            <surname>Rosal</surname>
          </string-name>
          .
          <article-title>A Simple Measure to Assess Non-response</article-title>
          .
          <source>In Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language TechnologiesVolume 1</source>
          , pages
          <fpage>1415</fpage>
          {
          <fpage>1424</fpage>
          . Association for Computational Linguistics,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>