<!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>Machine Reading as Model Construction</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Peter Clark</string-name>
          <email>peterc@allenai.org</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Allen Institute for AI (AI2) Seattle</institution>
          ,
          <addr-line>WA</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2017</year>
      </pub-date>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>WHAT IS MACHINE READING?</title>
      <p>
        With the advent of large datasets of paragraphs + questions, e.g.,
SQuAD [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], TriviaQA [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], there has been renewed interest in
generalpurpose “reading comprehension” (RC) systems, capable of
answering questions against those paragraphs, e.g., [
        <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
        ]. These systems
have become remarkably efective at factoid QA. However, they
require extensive training data, and can still struggle with queries
requiring complex inference [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. The extent to which these systems
have truely read and understood the paragraph remains unclear
[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>At the other end of the spectrum, AI has also developed
sophisticated formalisms for modeling the world, e.g., situation calculus,
event calculus, qualitative modeling. These frameworks allow
systems to represent facts which are known, and infer facts which
are unknown. Models built with these frameworks constitute an
understanding of the world, in that sense that they are predictive:
If the model’s computational clockwork moves in a way similar to
the world, then the model can predict how the world will behave,
constituting a degree of understanding of the world. In this context,
machine reading can be viewed as the task of constructing such
models from text, given a particular modeling framework in which
to express those models.</p>
      <p>While it is possible that a neural system might eventually be
able to infer a predictive, neural model of the world solely from
large numbers of examples, we do not believe this is likely in the
near future. Rather, we see the way forward as combining the
pattern-learning techniques of neural systems with the modeling
capabilities of structured representations. AI modeling frameworks
provide a set of primitives for constructing predictive models, and
neural systems can help construct models within those frameworks
that best fit data. The grand challenge for machine reading, going
forward, is combining these two technologies together to do this.</p>
    </sec>
    <sec id="sec-2">
      <title>MACHINE READING ABOUT PROCESSES</title>
      <p>At AI2 we have been pursuing a specific genre of machine reading
along these lines, namely reading paragraphs describing processes
(e.g., photosynthesis). Our goal is not to simply answer lookup
questions, but also answer questions that go beyond the text, in
particular about the states that exist during a process. Such
questions are challenging because those world states are often implicit,
making questions hard to answer from surface cues alone.</p>
      <p>For example, consider the following paragraph about
photosynthesis:</p>
      <p>Chloroplasts in the leaf of the plant trap light from the
sun. The roots absorb water and minerals from the soil.</p>
      <p>This combination of water and minerals flows from the
stem into the leaf. Carbon dioxide enters the leaf. Light,
water and minerals, and the carbon dioxide all
combine into a mixture. This mixture forms sugar (glucose)
which is what the plant eats.</p>
      <p>While reading comprehension (RC) systems can reliably answer
lookup questions such as:</p>
      <p>(1) What do the roots absorb? (A:water, minerals)
they struggle when answers are not explicit, e.g.,</p>
      <p>
        (2) Where is sugar produced? (A:in the leaf)
For example, the RC system BiDAF [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] answers “glucose” to this
second question. This question requires knowledge and inference:
If carbon dioxide enters the leaf (stated), then it will be at the leaf
(unstated), and as it is then used to produce sugar, the sugar
production will be at the leaf too. This is the kind of inference that
our system, ProComp (“process comprehension”), is able to model,
using a structured representation of events and states.
      </p>
      <p>Our approach is illustrated in Figure 1, and we briefly summarize
it here. First, ProComp extracts a Process Graph from the paragraph,
representing the event sequence in the process. It then performs
a STRIPS-like simulation of the process, using a set of
precondition/efect rules about events, mined from VerbNet. Finally, a small
set of answer procedures operate over that simulation, allowing
several classes of questions about change to be answered (e.g., “Where
is X at step Y?”, “What entities change size during the process?”).
Although our initial work has used largely traditional techniques,
it is still able to outperform RC systems on questions about change,
and thus illustrates the importance of modeling in machine reading.
3</p>
    </sec>
    <sec id="sec-3">
      <title>INTEGRATING NEURAL METHODS</title>
      <p>Our initial system uses three basic operations:
• (Event extraction) Given a sentence describing an event,
identify the event and the participants within it.
• (State prediction) Given a sentence describing an event, and
an entity mentioned in the sentence, predict the state of the
entity before/after the event (where the state of the entity is a
set of properties associated with it, selected from a predefined
set).
• (State inference) Given a partial description of the entities
and their states during the process (i.e., a partially filled
Participant Grid), fill in the remaining states.</p>
      <p>To date, we have collected a large number of hand-annotated
examples of these predictions to evaluate our system ProComp. However,
clearly this data can also be used for learning, to train a system
to make these inferences. Note that this does not obviate the need
for ontology design - the appropriate dimensions of modeling still
need to be selected. However, it does ofer an example-based means
for connecting that ontology and the reasoning to data. This is an
exciting direction we are pursuing.</p>
    </sec>
    <sec id="sec-4">
      <title>4 SUMMARY</title>
      <p>Unlike much recent work, we view machine reading as the task of
constructing a model from text using a particular modeling
framework. The framework provides the building blocks for modeling a
certain class of phenomena, and the task of reading is to construct a
model within that framework. We have illustrated this for reading
text about processes, using a state-based modeling framework.</p>
      <p>There is a symbiotic relationship between text and modeling
frameworks:
• Text suggests which modeling framework is appropriate
(e.g., the text appears to be describing a process, so use a
framework suitable for processes)
• The modeling framework provides expectations about what
to look for in the text (e.g., given it’s a process, expect to see
events and their participants)
This approach does not remove the need for learning, rather it
provides a scafolding within which learning can take place, and a
mechanism for then supporting inference and prediction - activities
that truly demonstrate that the machine has understood what it
has read.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Karl</given-names>
            <surname>Moritz</surname>
          </string-name>
          <string-name>
            <surname>Hermann</surname>
          </string-name>
          , Tomas Kocisky, Edward Grefenstette, Lasse Espeholt, Will Kay, Mustafa Suleyman, and
          <string-name>
            <given-names>Phil</given-names>
            <surname>Blunsom</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Teaching machines to read and comprehend</article-title>
          .
          <source>In Advances in Neural Information Processing Systems</source>
          .
          <volume>1693</volume>
          -
          <fpage>1701</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Robin</given-names>
            <surname>Jia</surname>
          </string-name>
          and
          <string-name>
            <given-names>Percy</given-names>
            <surname>Liang</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Adversarial Examples for Evaluating Reading Comprehension Systems</article-title>
          .
          <source>In Proc. EMNLP'17.</source>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Mandar</given-names>
            <surname>Joshi</surname>
          </string-name>
          , Eunsol Choi, Daniel S. Weld, and
          <string-name>
            <given-names>Luke</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehension</article-title>
          .
          <source>In Proc. ACL'17.</source>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Pranav</given-names>
            <surname>Rajpurkar</surname>
          </string-name>
          , Jian Zhang, Konstantin Lopyrev, and
          <string-name>
            <given-names>Percy</given-names>
            <surname>Liang</surname>
          </string-name>
          .
          <year>2016</year>
          . Squad:
          <volume>100</volume>
          ,000+
          <article-title>questions for machine comprehension of text</article-title>
          .
          <source>In Proc. EMNLP'16.</source>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Min</given-names>
            <surname>Joon</surname>
          </string-name>
          <string-name>
            <surname>Seo</surname>
          </string-name>
          , Aniruddha Kembhavi, Ali Farhadi, and
          <string-name>
            <given-names>Hannaneh</given-names>
            <surname>Hajishirzi</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Bidirectional Attention Flow for Machine Comprehension</article-title>
          .
          <source>In Proc. ICLR'17.</source>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Junbei</given-names>
            <surname>Zhang</surname>
          </string-name>
          , Xiaodan Zhu, Qian Chen, Lirong Dai, and
          <string-name>
            <given-names>Hui</given-names>
            <surname>Jiang</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Exploring Question Understanding and Adaptation in Neural-Network-Based Question Answering</article-title>
          .
          <source>arXiv preprint arXiv:1703.04617</source>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>