<!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>Common-Knowledge Concept Recognition for SEVA</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Jitin Krishnan</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Patrick Coronado</string-name>
          <email>patrick.l.coronado@nasa.gov</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hemant Purohit</string-name>
          <email>hpurohit@gmu.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Huzefa Rangwala</string-name>
          <email>rangwala@gmu.edu</email>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Information Sciences &amp; Technology Department, George Mason University</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Instrument Development Center, NASA Goddard Space Flight Center</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2020</year>
      </pub-date>
      <fpage>23</fpage>
      <lpage>25</lpage>
      <abstract>
        <p>We build a common-knowledge concept recognition system for a Systems Engineer's Virtual Assistant (SEVA) which can be used for downstream tasks such as relation extraction, knowledge graph construction, and question-answering. The problem is formulated as a token classification task similar to named entity extraction. With the help of a domain expert and text processing methods, we construct a dataset annotated at the word-level by carefully defining a labelling scheme to train a sequence model to recognize systems engineering concepts. We use a pre-trained language model and fine-tune it with the labeled dataset of concepts. In addition, we also create some essential datasets for information such as abbreviations and definitions from the systems engineering domain. Finally, we construct a simple knowledge graph using these extracted concepts along with some hyponym relations.</p>
      </abstract>
      <kwd-group>
        <kwd>Natural Language Processing</kwd>
        <kwd>Named Entity Recognition</kwd>
        <kwd>Concept Recognition</kwd>
        <kwd>Relation Extraction</kwd>
        <kwd>Systems Engineering</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
      <p>
        The Systems Engineer’s Virtual Assistant (SEVA)
        <xref ref-type="bibr" rid="ref13 ref19">(Krishnan, Coronado, and Reed 2019)</xref>
        was introduced with the
goal to assist systems engineers (SE) in their
problemsolving abilities by keeping track of large amounts of
information of a NASA-specific project and using the
information to answer queries from the user. In this work, we address
a system element by constructing a common-knowledge
concept recognition system for improving the performance
of SEVA, using the static knowledge collected from the
Systems Engineering Handbook
        <xref ref-type="bibr" rid="ref14">(NASA 2017)</xref>
        that is widely
used in projects across the organization as domain-specific
commonsense knowledge. At NASA, although there exists
knowledge engines and ontologies for the SE domain such
as MBSE
        <xref ref-type="bibr" rid="ref7">(Hart 2015)</xref>
        , IMCE
        <xref ref-type="bibr" rid="ref12">(JPL 2016)</xref>
        , and OpenCaesar
        <xref ref-type="bibr" rid="ref5">(Elaasar 2019)</xref>
        , generic commonsense acquisition is rarely
discussed; we aim to address this challenge.
      </p>
      <p>SE commonsense comes from years of experience and
learning which involves background knowledge that goes
beyond any handbook. Although constructing an
assistant like SEVA system is the overarching objective, a key
problem to first address is to extract elementary
commonknowledge concepts using the SE handbook and domain
experts. We use the term ‘common-knowledge’ as the
‘commonsense’ knowledge of a specific domain. This knowledge
can be seen as a pivot that can be used later to collect
‘commonsense’ knowledge for the SE domain. We propose a
preliminary research study that can pave a path towards a
comprehensive commonsense knowledge acquisition for an
effective Artificial Intelligence (AI) application for the SE
domain. Overall structure of this work is summarized in
Figure 1. Implementation with demo and dataset is available at:
https://github.com/jitinkrishnan/NASA-SE .</p>
    </sec>
    <sec id="sec-2">
      <title>BACKGROUND AND MOTIVATION</title>
      <p>
        Creating commonsense AI still remains an important and
challenging task in AI research today. Some of the
inspiring works are the CYC project
        <xref ref-type="bibr" rid="ref15">(Panton et al. 2006)</xref>
        that tries
to serve as a foundational knowledge to all systems with
millions of everyday life commonsense assertions, Mosaic
Commonsense Knowledge Graphs and Reasoning
        <xref ref-type="bibr" rid="ref20">(Zellers
et al. 2018)</xref>
        that addresses aspects like social situations,
mental states, and causal relationships, and Aristo System (AI2
Allen Institute for AI ) that focuses on basic science
knowledge. In NASA’s context, systems engineering combines
several engineering disciplines requiring extreme
coordination and is prone to human errors. This, in combination with
the lack of efficient knowledge transfer of generic
lessonslearned makes most technology-based missions risk-averse.
Thus, a comprehensive commonsense engine can
significantly enhance the productivity of any mission by letting the
experts focus on what they do best.
      </p>
      <p>
        Concept Recognition (CR) is a task identical to the
traditional Named Entity Recognition (NER) problem. A
typical NER task seeks to identify entities like name of a
person such as ‘Shakespeare’, a geographical location such
as ‘London’, or name of an organisation such as ‘NASA’
from unstructured text. A supervised NER dataset consists
of the above mentioned entities annotated at the word-token
level using labelling schemes such as BIO which provides
beginning (B), continuation or inside (I), and outside (O)
representation for each word of an entity.
        <xref ref-type="bibr" rid="ref2">(Baevski et al.
2019)</xref>
        is the current top-performing NER model for
CoNLL2003 shared task
        <xref ref-type="bibr" rid="ref17">(Sang and De Meulder 2003)</xref>
        . Off-the-shelf
named entity extractors do not suffice in the SE
commonknowledge scenario because the entities we want to extract
are domain-specific concepts such as ‘system architecture’
or ‘functional requirements’ rather than physical entities
such as ‘Shakespeare’ or ‘London’. This requires defining
new labels and fine-tuning.
      </p>
      <p>
        Relation extraction tasks extract semantic relationships
from text. These extractors aim to connect named entities
such as ‘Shakespeare’ and ‘England’ using relations such
as ‘born-in’. Relations can be as simple as using
handbuilt patterns or as challenging as using unsupervised
methods like Open IE
        <xref ref-type="bibr" rid="ref6">(Etzioni et al. 2011)</xref>
        ; with bootstrapping,
supervised, and semi-supervised methods in between.
        <xref ref-type="bibr" rid="ref19">(Xu
and Barbosa 2019)</xref>
        and
        <xref ref-type="bibr" rid="ref18">(Soares et al. 2019)</xref>
        are some of
the high performing models that extract relations from New
York Times Corpus
        <xref ref-type="bibr" rid="ref16">(Riedel, Yao, and McCallum 2010)</xref>
        and
TACRED challenges
        <xref ref-type="bibr" rid="ref21">(Zhang et al. 2017)</xref>
        respectively.
Hyponyms represent hierarchical connection between entities
of a domain and represent important relationships. For
instance, a well-known work by
        <xref ref-type="bibr" rid="ref9">(Hearst 1992)</xref>
        uses syntactic
patterns such as [Y such as A, B, C], [Y including X], or [Y,
including X] to extract hyponyms. Our goal is to extract
preliminary hyponym relations from the concepts extracted by
the CR and to connect the entities through verb phrases.
      </p>
    </sec>
    <sec id="sec-3">
      <title>CONCEPT RECOGNITION</title>
      <p>
        SE concepts are less ambiguous as compared to generic
natural language text. A word usually means one concept.
For example, the word ‘system’ usually means the same
when referring to a ‘complex system’, ‘system structure’, or
‘management system’ in the SE domain. In generic text, the
meaning of terms like ‘evaluation’, ‘requirement’, or
‘analysis’ may contextually differ. We would like domain specific
phrases such as ‘system evaluation’, ‘performance
requirement’, or ‘system analysis’ to be single entities. Based on
the operational and system concepts described in
        <xref ref-type="bibr" rid="ref13 ref19">(Krishnan,
Coronado, and Reed 2019)</xref>
        , we carefully construct a set of
concept-labels for the SE handbook which is shown in the
next section.
1. abb: represents abbreviations such as TRL representing
      </p>
      <p>Technology Readiness Level.
2. grp: represents a group of people or an individual such
as Electrical Engineers, Systems Engineers or a Project
Manager.
3. syscon: represents any system concepts such as
engineering unit, product, hardware, software, etc. They mostly
represent physical concepts.
4. opcon: represents operational concepts such as decision
analysis process, technology maturity assessment, system
requirements review, etc.
5. seterm: represents generic terms that are frequently used
in SE text and those that do not fall under syscon or
opcon such as project, mission, key performance parameter,
audit etc.
6. event: represents event-like information in SE text such as</p>
      <p>Pre-Phase A, Phase A, Phase B, etc.
7. org: represents an organization such as ‘NASA’,
‘aerospace industry’, etc.
8. art: represents names of artifacts or instruments such as
‘AS1300’
9. cardinal: represents numerical values such as ‘1’, ‘100’,
’one’ etc.
10. loc: represents location-like entities such as component
facilities or centralized facility.
11. mea: represents measures, features, or behaviors such as
cost, risk, or feasibility.</p>
      <sec id="sec-3-1">
        <title>Abbreviations</title>
        <p>Abbreviations are used frequently in SE text. We
automatically extract abbreviations using simple pattern-matching
around parentheses. Given below is a sample regex that
matches most abbreviations in the SE handbook.
r"\([ ]*[A-Z][A-Za-z]*[ ]*\)"
An iterative regex matching procedure using this pattern
over the preceding words will produce the full phrase of the
abbreviation. ‘A process to determine a system’s
technological maturity based on Technology Readiness Levels (TRLs)’
produces the abbreviation TRL which stands for Technology
Readiness Levels. ‘Define one or more initial Concept of
Operations (ConOps) scenarios’ produces the abbreviation
ConOps which stands for Concept of Operations. We
prelabel these abbreviations as concept entities. Many of these
abbreviations are also provided in the Appendix section of
the handbook which is also extracted and used as concepts.</p>
      </sec>
      <sec id="sec-3-2">
        <title>Common-Knowledge Definitions</title>
        <p>Various locations of the handbook and the glossary
provide definitions of several SE concepts. We collect these and
compile a comprehensive definitions document which is also
used for the concept recognition task. An example definition
and its description is shown below:</p>
        <p>Definition: Acceptable Risk</p>
        <p>Description: The risk that is understood and agreed to
by the program/project, governing authority, mission
directorate, and other customer(s) such that no further specific
mitigating action is required.
Using python tools such as PyPDF2, NLTK, and RegEx we
build a pipeline to convert PDF to raw text along with
extensive pre-processing which includes joining sentences that
are split, removing URLs, shortening duplicate non-alpha
characters, and replacing full forms of abbreviations with
their shortened forms. We assume that the SE text is free
of spelling errors. For the CR dataset, we select coherent
paragraphs and full sentences by avoiding headers and short
blurbs. Using domain keywords and a domain expert, we
annotate roughly 3700 sentences at the word-token level. An
example is shown in Figure 2 and the unique tag count is
shown in Table 1.</p>
      </sec>
      <sec id="sec-3-3">
        <title>Fine tuning with BERT</title>
        <p>
          Any language model can be used for the purpose of
customizing an NER problem to CR. We choose to go with
BERT
          <xref ref-type="bibr" rid="ref3">(Devlin et al. 2018)</xref>
          because of its general-purpose
nature and usage of contextualized word embeddings.
        </p>
        <p>
          In the hand-labelled dataset, each word gets a label. The
idea is to perform multi-class classification using BERT’s
pre-trained cased language model. We use pytorch
transformers and hugging face as per the tutorial by
          <xref ref-type="bibr" rid="ref11">(Huang
2019)</xref>
          which uses BertF orT okenClassif ication. The
text is embedded as tokens and masks with a maximum
token length. This embedded tokens are provided as the input
to the pre-trained BERT model for a full fine-tuning. The
model gives an F1-score of 0:89 for the concept recognition
task. An 80-20 data split is used for training and evaluation.
Detailed performance of the CR is shown in Table 2 and 3.
Additionally, we also implemented CR using spaCy
          <xref ref-type="bibr" rid="ref10">(Honnibal and Johnson 2015)</xref>
          which also produced similar results.
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>RELATION EXTRACTION</title>
      <p>In this work, for relation extraction, we focus on hyponyms
and verb phrase chunking. Hyponyms are more specific
concepts such as earth to planet or rose to flower. Verb phrase
syscon
opcon
seterm
mea
grp
org
cardinal
event
abb
art
loc
micro/macro-avg
The definition document consists of 241 SE definitions
and their descriptions. We iteratively construct entities in
increasing order of number of words in the definitions
with the help of their parts-of-speech tags. This helps in
creating subset-of relation between a lower-word entity and
a higher-word entity. Each root entity is lemmatized such
that entities like processes and process appear only once.</p>
      <sec id="sec-4-1">
        <title>Hyponyms from POS tags</title>
        <p>Using the words (especially nouns) that surround an already
identified named entity, more specific entities can be
identified. This is performed on a few selected entity tags such
as opcon and syscon. For example, consider the sentence
‘SE functions should be performed’. ‘SE’ has tag NNP
and ‘functions’ has tag NNS. We create a relation called
subset-of between ‘SE functions’ and ‘SE’.</p>
      </sec>
      <sec id="sec-4-2">
        <title>Relations from Abbreviations</title>
        <p>Relations from abbreviations are simple direct connections
between the abbreviation and its full form described in
the abbreviations dataset. Figure 3 shows a snippet of
knowledge graph constructed using stands-for and subset-of
relationships. Larger graphs are shown in the demo.</p>
      </sec>
      <sec id="sec-4-3">
        <title>Relation Extraction using Verb Phrase Chunking</title>
        <p>Finally, we explore creating contextual triples from
sentences using all the entities extracted using the CR model
and entities from definitions. Only those phrases that
connect two entities are selected for verb phrase extraction.
Using NLTK’s regex parser and chunker, a grammar such as
VP: {(&lt;MD&gt;|&lt;R.*&gt;|&lt;I.*&gt;|&lt;VB.*&gt;|&lt;JJ.*&gt;|
&lt;TO&gt;)*&lt;VB.*&gt;+(&lt;MD&gt;|&lt;R.*&gt;|&lt;I.*&gt;|&lt;VB.*&gt;|
&lt;JJ.*&gt;|&lt;TO&gt;)*}
with at least one verb, can extract relation-like phrases from
the phrase that links two concepts. An example is shown in
Figure 4. Further investigation of relation extraction from
SE handbook is left as future work.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>CONCLUSION AND FUTURE WORK</title>
      <p>We presented a common-knowledge concept extractor for
the Systems Engineer’s Virtual Assistant (SEVA) system
and showed how it can be beneficial for downstream tasks
such as relation extraction and knowledge graph
construction. We construct a word-level annotated dataset with the
help of a domain expert by carefully defining a labelling
scheme to train a sequence labelling task to recognize SE
concepts. Further, we also construct some essential datasets
from the SE domain which can be used for future
research. Future directions include constructing a
comprehensive common-knowledge relation extractor from SE
handbook and incorporating such human knowledge into a more
comprehensive machine-processable commonsense
knowledge base for the SE domain.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <article-title>AI2 Allen Institute for AI. Aristo: An intelligent system that reads, learns, and reasons about science</article-title>
          . https:// allenai.org/aristo/. Accessed:
          <fpage>2019</fpage>
          -08-12.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <surname>Baevski</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Edunov</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ; Liu,
          <string-name>
            <given-names>Y.</given-names>
            ;
            <surname>Zettlemoyer</surname>
          </string-name>
          ,
          <string-name>
            <surname>L.</surname>
          </string-name>
          ; and Auli,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <year>2019</year>
          .
          <article-title>Cloze-driven pretraining of self-attention networks</article-title>
          .
          <source>arXiv preprint arXiv:1903</source>
          .07785.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <surname>Devlin</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ; Chang, M.-W.;
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ; and
          <string-name>
            <surname>Toutanova</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <article-title>Bert: Pre-training of deep bidirectional transformers for language understanding</article-title>
          . arXiv preprint arXiv:
          <year>1810</year>
          .04805.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>Elaasar</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <year>2019</year>
          .
          <article-title>Open casesar; the case for integrated model centric engineering</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>Etzioni</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Fader</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Christensen</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ; Soderland,
          <string-name>
            <surname>S.</surname>
          </string-name>
          ; and Mausam.
          <year>2011</year>
          .
          <article-title>Open information extraction: the second generation</article-title>
          .
          <source>IJCAI 3-10.</source>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>Hart</surname>
            ,
            <given-names>L. E.</given-names>
          </string-name>
          <year>2015</year>
          .
          <article-title>Introduction to model-based system engineering (mbse) and sysml</article-title>
          . http://www.incose.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <article-title>org/docs/default-source/delaware-valley/ mbse-overview-</article-title>
          <string-name>
            <surname>incose-</surname>
          </string-name>
          30
          <string-name>
            <surname>-</surname>
          </string-name>
          july
          <article-title>-2015.pdf</article-title>
          . Accessed:
          <fpage>11</fpage>
          -
          <lpage>09</lpage>
          -
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <surname>Hearst</surname>
            ,
            <given-names>M. A.</given-names>
          </string-name>
          <year>1992</year>
          .
          <article-title>Automatic acquisition of hyponyms from large text corpora</article-title>
          .
          <source>In Proceedings of the 14th conference on Computational linguistics-</source>
          Vol.
          <volume>2</volume>
          ,
          <fpage>539</fpage>
          -
          <lpage>545</lpage>
          . ACL.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <surname>Honnibal</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , and Johnson,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <year>2015</year>
          .
          <article-title>An improved nonmonotonic transition system for dependency parsing</article-title>
          .
          <source>In Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing</source>
          ,
          <fpage>1373</fpage>
          -
          <lpage>1378</lpage>
          . ACL.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <year>2019</year>
          .
          <article-title>Ner with bert in action.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <surname>JPL.</surname>
          </string-name>
          <year>2016</year>
          .
          <article-title>Imce ontological modeling framework</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <surname>Krishnan</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ; Coronado,
          <string-name>
            <surname>P.</surname>
          </string-name>
          ; and Reed,
          <string-name>
            <surname>T.</surname>
          </string-name>
          <year>2019</year>
          .
          <article-title>Seva: A systems engineer's virtual assistant</article-title>
          .
          <source>In AAAI-MAKE Spring Symposium.</source>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <surname>NASA.</surname>
          </string-name>
          <year>2017</year>
          .
          <article-title>Nasa systems engineering handbook</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <surname>Panton</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Matuszek</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Lenat</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Schneider</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ; Witbrock,
          <string-name>
            <given-names>M.</given-names>
            ;
            <surname>Siegel</surname>
          </string-name>
          , N.; and
          <string-name>
            <surname>Shepard</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <year>2006</year>
          .
          <article-title>Common Sense Reasoning - From Cyc to Intelligent Assistant</article-title>
          . Berlin, Heidelberg: Springer Berlin Heidelberg. 1-
          <fpage>31</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <string-name>
            <surname>Riedel</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Yao</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ; and
          <string-name>
            <surname>McCallum</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <year>2010</year>
          .
          <article-title>Modeling relations and their mentions without labeled text</article-title>
          .
          <source>In Joint European Conference on Machine Learning and Knowledge Discovery in Databases</source>
          ,
          <volume>148</volume>
          -
          <fpage>163</fpage>
          . Springer.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <string-name>
            <surname>Sang</surname>
            ,
            <given-names>E. F.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>De Meulder</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <year>2003</year>
          .
          <article-title>Introduction to the conll-2003 shared task: Language-independent named entity recognition</article-title>
          .
          <source>arXiv preprint cs/0306050.</source>
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          <string-name>
            <surname>Soares</surname>
            ,
            <given-names>L. B.</given-names>
          </string-name>
          ; FitzGerald, N.;
          <string-name>
            <surname>Ling</surname>
            , J.; and Kwiatkowski,
            <given-names>T.</given-names>
          </string-name>
          <year>2019</year>
          .
          <article-title>Matching the blanks: Distributional similarity for relation learning</article-title>
          .
          <source>arXiv preprint arXiv:1906</source>
          .03158.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Barbosa</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <year>2019</year>
          .
          <article-title>Connecting language and knowledge with heterogeneous representations for neural relation extraction</article-title>
          . arXiv preprint arXiv:
          <year>1903</year>
          .10126.
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          <string-name>
            <surname>Zellers</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ; Bisk,
          <string-name>
            <given-names>Y.</given-names>
            ;
            <surname>Schwartz</surname>
          </string-name>
          ,
          <string-name>
            <surname>R.</surname>
          </string-name>
          ; and Choi,
          <string-name>
            <surname>Y.</surname>
          </string-name>
          <year>2018</year>
          .
          <article-title>Swag: A large-scale adversarial dataset for grounded commonsense inference</article-title>
          .
          <source>CoRR abs/1808</source>
          .05326.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          <string-name>
            <surname>Zhang</surname>
          </string-name>
          , Y.;
          <string-name>
            <surname>Zhong</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ; Angeli, G.; and
          <string-name>
            <surname>Manning</surname>
            ,
            <given-names>C. D.</given-names>
          </string-name>
          <year>2017</year>
          .
          <article-title>Position-aware attention and supervised data improve slot filling</article-title>
          .
          <source>In EMNLP</source>
          ,
          <fpage>35</fpage>
          -
          <lpage>45</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>