<!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>Frame Instance Extraction and Clustering for Default Knowledge Building</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Avijit Shah</string-name>
          <email>avijit.shah09@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Valerio Basile</string-name>
          <email>valerio.basile@inria.fr</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Elena Cabrio</string-name>
          <email>elena.cabrio@unice.fr</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sowmya Kamath S.</string-name>
          <email>sowmyakamath@nitk.edu.in</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Information Technology, National Institute of Technology Karnataka (NITK)</institution>
          ,
          <addr-line>Surathkal</addr-line>
          ,
          <country country="IN">India</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Universite Co</institution>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>te d'Azur</institution>
          ,
          <addr-line>Inria, CNRS, I3S</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Obtaining and representing common-sense knowledge, useful in a robotics scenario for planning and making inference about the robots' surroundings, is a challenging problem, because such knowledge is typically found in unstructured repositories such as text corpora or small handmade resources. The work described in this paper presents a methodology for automatically creating a default knowledge base about real-world objects for the robotics domain. The proposed method relies on clustering frame instances extracted from natural language text as a way of distilling default knowledge. We collect and parse a natural language corpus using the Web as a source, then perform an agglomerative clustering of frame instances according to an appropriately de ned similarity measure, and nally extract prototypical frame instances from each cluster and publish them in LOD-complaint format to promote reuse and interoperability.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Smart machines like robots are becoming ubiquitous in industrial and urban
scenarios, assisting humans in their day to day activities. A critical requirement for
such intelligent machines is the ability to learn from their environment as humans
do, speci cally in handling certain common sense tasks that can signi cantly
improve productivity. For instance, when a household robot is instructed to fetch a
knife, the fundamental requirement would be an understanding of what a knife
is, what it is used for, its location in the house, and so on. Considering the task
of instructing the robot to bring something to eat, the robot must rst discern
that available items like apple, rice, bread and egg are food, then, associate them
with the act of eating, and nally infer other relevant information (such as other
objects involved in the situation, e.g., cutlery and bowls). We call this type of
information as default knowledge, a kind of task-oriented background knowledge
that allows the robot to perform its tasks when more local/speci c knowledge is
not available. We call such kind of knowledge \default knowledge" rather than,
e.g., background knowledge or simply common sense, to put the emphasis on
the robot actions rather than reasoning and inference.</p>
      <p>Since the process of manual creation of such common-sense knowledge
repositories is highly labor- and cost-intensive, alternative methods for capturing it
automatically are critical. In this respect, the Web can be a good candidate as a
source of default knowledge as it enables access to a large volume of information
about any topic. However, most large-scale resources of structured knowledge on
the Web are concerned with named entities like persons and places, while objects
and other generic concepts are less represented. A great amount of information
about generic concepts is found on the Web in the form of natural language
meant for humans to consume. The challenge then is to deal with verbose and
ambiguous natural language content in order to gather default knowledge and in
designing systems that extract facts and represent them in a concise and machine
understandable format.</p>
      <p>Our ongoing work is an e ort to address some of the shortcomings of the
existing general knowledge resources (see Section 2) with the aim of enabling
robots with the ability for autonomous default knowledge learning about
previously unseen objects. The work described in this paper presents one of the
methodologies we are currently developing to create a default knowledge base
about real-world objects for the robotics domain. In particular, this
methodology relies on clustering frame instances extracted from natural language text as
a way of distilling default knowledge and encode it in LOD-complaint format to
promote reuse and interoperability.</p>
      <p>The paper is organized as follows: in Section 3 we discuss the detail of the
proposed methodology for knowledge extraction from natural language text;
in Section 4, we report on our ndings after examining the collected default
knowledge; and in Section 5, we draw conclusions and lay out a path for future
directions of research.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        Several researchers have tried to address this challenge in contexts related to the
Semantic Web, knowledge management and machine learning. In the linked data
ecosystem, DBpedia3 is perhaps the most well-known resource and one of the
most connected to other resources. This large-scale dataset is automatically
extracted from Wikipedia and often acts as a hub between di erent LOD (Linked
Open Data) resources. YAGO [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] provides a mapping between DBpedia the
lexical resource WordNet [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], which provides additional semantic information,
notably a hierarchical structure of concepts based on the hypernym relation.
ConceptNet [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] contains approximately 28 million tuples automatically derived
from Wiktionary4 and a number of other resources. It is structured as a
multigraph (i.e., a graph with multiple edges connecting the same pairs of nodes),
thus it cannot be represented using RDF. The overlap of ConceptNet with
DBpedia is low, especially with respect to general objects, preventing its use as
a linked data resource for general knowledge. Another noteworthy project in
      </p>
      <sec id="sec-2-1">
        <title>3 http://dbpedia.org 4 http://www.wiktionary.org/</title>
        <p>
          this context is NELL (Never-Ending Language Learning), an ongoing e ort to
\read the Web" [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], using a continuously-re ned process of knowledge extraction
from text. NELL contains more than 50 million \candidate beliefs", i.e., facts
with varying degrees of con dence, more than 3 millions of which held with high
con dence. However, from the LOD perspective, approaches like NELL and
ConceptNet have some limitations in terms of linking towards Web resources, that
is, in both cases, terms are generic and potentially ambiguous strings rather
than URIs. Moreover, some predicates found in NELL are di cult to use for
the purpose of a general knowledge base. This is the case for predicates such as
\found in X" where `X' is a location, that could be better expressed as a relation
between a concept and its location. We also found that most predicates are not
de ned on general entities (classes, ontologically speaking).
        </p>
        <p>
          An unsupervised approach for natural language understanding called
machine reading was developed by Etzioni et al [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. It subsumes techniques like
Information Extraction and Question Answering and similar multiple Textual
Entailment steps that form a set of beliefs based on the text, resulting in a tool
called KnowItAll [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. TextRunner [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] works on the concepts of machine reading
for collecting all extracted triples into an extraction graph. In [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] a technique for
building a knowledge base of object-location pairs was proposed. Such knowledge
is stored in the form of triples containing the object type, its typical location
and common semantic frames associated with it.
        </p>
        <p>
          Ontologies have also played a major role in collecting and organizing
commonsense knowledge, whether open domain or domain speci c. Among these,
DOLCE [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] and OpenCyC [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] are two popular upper level ontologies that de ne
taxonomic relations between concepts and relations, rules and constraints. Both
DOLCE and OpenCyC are linked data. In the AI/robotics domain, KnowRob
[
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] is a gold-standard reference ontology and reasoning framework for knowledge
about domestic environments, including sensors, actuators and other speci c
aspects of robotic applications. Ontologies can be relatively small compared to
large-scale e orts where the modus operandi is to extract knowledge
automatically, but the quality of ontological data is often severely a ected due to their
handcrafted design and building process.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Default Knowledge Extraction from Natural Language</title>
      <p>The methodology proposed for building the repository of default knowledge is
based on the analysis of natural language and the use of statistical methods to
extract relevant knowledge while ltering out noise and less informative items.
The process comprises a number of sub-phases, as listed below:
1. collecting a corpus of natural language text;
2. parsing the text and extracting frame instances expressed in the natural
language;
3. clustering frame instances using an appropriately de ned similarity measure;
4. extracting prototypical frame instances from the clusters.
Here, a frame instance is a structure composed of a frame type, i.e., the type
of the situation described in the text, and a set of frame elements, i.e., the
entities involved in the frame instance. After the last step, the resulting frame
instances can be either prototypical members of their original cluster or totally
new instances, which represent the default knowledge extracted from the natural
language corpus. We describe each of these steps in detail in the following section.
3.1</p>
      <sec id="sec-3-1">
        <title>Source Corpus</title>
        <p>
          To collect information relevant to the task of default knowledge building, it
is important that the source text contains a good amount of default
knowledge in the rst place. Despite the availability of large-scale corpora of written
English, this prerequisite is not trivial, given that most existing resources are
centered around encyclopedic text (e.g., Wikipedia) or newswire material (e.g.,
Wall Street Journal corpus [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]). In other words, most of the text available on
the Web or otherwise is about entities like people, events, and places, rather
than common objects. Following this observation, we created a new corpus by
crawling websites containing basic content, speci cally meant for learners of the
English language, for this study. The intuition behind this was that, such text is
more likely to contain explicit mentions to common objects and their properties.
        </p>
        <p>For this purpose, we manually analyzed various websites that carry di
erent stories. We identi ed ESL YES5 and the University of Victoria's UVCS6
as the best t to our requirement. To crawl the stories from these websites, we
implemented a web crawler using the Goose Python package7 for scraping the
Web content and the Lxml library8 for extracting the text from the pages. The
text of these stories is stored in JSON structures along with its associated
metadata, namely, story title, author, domain, paragraph count, line count, and word
count. In Table 1, we summarize some statistics of the corpus generated after
crawling these two sources on the Web.
5 ESL Yes 1,600 Free ESL Short Stories, Exercises, Audio, http://www.eslyes.com/
6 English Language Centre Study Zone, http://web2.uvcs.uvic.ca/elc/studyzone/
7 HTML Content/Article Extractor, https://github.com/grangier/python-goose
8 XML Processing Lib in Python, http://lxml.de/
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Frame Instance Extraction</title>
        <p>
          The objective of this phase is to parse the corpus and extract a set of frame
instances, which are in RDF format. Towards this aim, we employed and adapted
KNEWS [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ], a tool that relies on logical and lexical semantics to extract
knowledge from natural language. KNEWS is an NLP pipeline comprising of modules
for semantic parsing, word sense disambiguation and entity linking that run
separately on target text. The output of the modules is aligned and mapped
to several resources to generate RDF triples describing the instances of frames,
according to the framework of frame semantics [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], and speci cally its
implementation in FrameNet [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. The frame instances are represented in RDF using
the FrameBase schema [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ].
        </p>
        <p>An example of output generated by KNEWS from the sentence \The robot is
driving a car." is shown in Figure 1. The frame evoked by the natural language is
recognized to be of type Operate vehicle, the Driver and the Vehicle roles are
lled by the concepts identi ed respectively by the Wordnet synsets 02764397-n
(automaton, golem, robot, \a mechanism that can move automatically") and
02961779-n (auto, automobile, car, machine, motorcar ,\a motor vehicle with
four wheels; usually propelled by an internal combustion engine").
&lt;http : / / framebase . org / ns / f i O p e r a t e v e h i c l e 0 3 1 f a 5 a d &gt;
&lt;http : / /www. w3 . org /1999/02/22 rdf syntax ns#type&gt;
&lt;http : / / framebase . org / ns / frame O p e r a t e v e h i c l e d r i v e . v&gt; .
&lt;http : / / framebase . org / ns / f i O p e r a t e v e h i c l e 0 3 1 f a 5 a d &gt;
&lt;http : / / framebase . org / ns / fe Driver&gt;
&lt;http : / / wordnet r d f . p r i n c e t o n . edu/wn31/02764397 n&gt; .
&lt;http : / / framebase . org / ns / f i O p e r a t e v e h i c l e 0 3 1 f a 5 a d &gt;
&lt;http : / / framebase . org / ns / fe Vehicle &gt;
&lt;http : / / wordnet r d f . p r i n c e t o n . edu/wn31/02961779 n&gt; .
We parsed the corpus (as described in Section 3.1) and extracted 114,536 frame
instances comprising of 154,422 frame elements. We counted 686 distinct frame
types, 222 roles lled by 3,398 distinct types of concepts. Table 2 shows the most
frequently extracted frame types and roles and their relative frequency. KNEWS
was unable to select a WordNet-FrameNet mapping for 39,622 frame instances
(29.9% of the total number), thus we marked such frame types as Unmapped
and retained only the original WordNet synsets associated with the event that
triggered the frame extraction (typically the main verb of a sentence). Similarly,
vn- (from VerbNet) indicates that KNEWS could not map a thematic role to
the corresponding FrameNet role.
3.3</p>
      </sec>
      <sec id="sec-3-3">
        <title>Measuring Frame Instance Similarity</title>
        <p>
          Once a large collection of frame instances was generated, a study of how
structured the set was, was undertaken, starting with an analysis of the relationships
between the frame instances. With this objective, we de ned and implemented a
method to measure the similarity between two frame instances. Note that
methods exist in literature to compute similarity between frames, surveyed in [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ].
However, here we need to measure the similarity between frame instances, that
is, frames equipped with actual llers for their roles.
        </p>
        <p>A frame instance f ii, as extracted by KNEWS, has two components: a frame
type f ti and a list of frame elements f ei = ff ei1; :::; f eikg. Accordingly, the
similarity between two frame instances f i1 and f i2 is a linear combination of
the similarity between the two frame types and the distance between the frame
elements contained in the frame instance:
sim(f i1; f i2) =
simft(f i1; f i2) + (1
)simfe(f i1; f i2)
(1)
The similarity sim(f i1; f i2) is de ned to be a number in the range [0; 1], while
the parameter controls the extent to which the similarity is weighted towards
the frame types or the frame elements.</p>
        <p>
          The frame type and frame elements given by KNEWS are generated after
the word sense disambiguation step, thus they are always linked to WordNet
synsets, although, they are mapped to FrameNet during later processing. This
means that, we can directly apply a WordNet-based similarity metric such as
Wu-Palmer [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] to asses the similarity between the frame types. The Wu-Palmer
similarity between synsets is de ned as the length of the shortest path between
the two synsets in the WordNet taxonomy, weighted by the depth of the synsets
in the tree. According to such a measure when applied to frame instances, for
instance, the frame type Eating is more similar to Drinking than to Driving,
because of the similarity between their underlying WordNet synsets. Thus, to
calculate this rst half of the equation, we take the similarity between two frame
types as the Wu-Palmer similarity between their corresponding synsets:
simft(f i1; f i2) = wup(f ti; f tj )
(2)
        </p>
        <p>The second half of equation 1 deals with the similarity computation between
two sets of frame elements. We employ again the WordNet-based synset
similarity measure, but this time an extra step of aggregation is needed. For each
synset corresponding to the frame elements f ei 2 f i1, we compute all the
similarity scores of synsets corresponding to the frame elements f ej 2 f i2, and select
the best match. The aggregation by maximum is an approximation of the best
match algorithm on bipartite graphs. The resulting similarities are averaged over
all the frame elements. Since this process is asymmetrical, we compute it in both
directions and take the average of the results:
simfe(f i1; f i2) =</p>
        <p>X</p>
        <p>X
1
+
1
1</p>
        <p>max wup(f ei; f ej )+
2 jf i1j fei2fi1 fej2fi2</p>
        <p>max wup(f ei; f ej )
jf i2j fei2fi2 fej2fi1
(3)
Note that at this stage, the speci c roles of the elements are ignored during
the process of calculation of similarity between frame elements. Such additional
factors could be taken into account by setting the similarity between two frame
elements to 0 if their roles are di erent.
3.4</p>
      </sec>
      <sec id="sec-3-4">
        <title>Clustering Frame Instances</title>
        <p>With a collection of frame instances in place, and a way of measuring the
pairwise similarity between frame instances, we can now proceed to the next step in
our process of extracting default knowledge from natural language, namely,
clustering the frame instances. For this, we perform hierarchical clustering to group
the generated frame instances into hard clusters, that is, each frame instance is
initially assigned to exactly one cluster. The underlying hypothesis is that
clustering frame instances will allow us to extract a number of instances that can
be considered default knowledge. For instance, if we observe several instances
of a Drinking frame involving Water but only one case of Drinking linked to
Gasoline, we can con dently say that water is something that can be drunk
while gasoline is unlikely to be. We expect these phenomena to surface when
clustering all the collected frame instances, for instance, nding that a
Gasolineinvolving frame instance is further away from the centroid of a Drinking cluster
than a Water-involving frame instance.</p>
        <p>We produced a hierarchical hard clustering of the frame instances using the
complete-linkage agglomerative method implemented in the SciPy9 Python
library. The input to the clustering algorithm is a distance matrix where distance =
(1 similarity) and similarity is calculated as described in Section 3.3. The
output of the clustering is a dendrogram, a tree-like structure where each cluster is
a node and links between nodes are based on the similarity between clusters.</p>
        <p>We experimented with di erent clustering con gurations, and empirically
determined thresholds to cut the dendrograms and produce clusters, favoring
values that induced a small number of clusters. With respect to the parameter,
we decided to study the behavior of the clustering process for the two sides of
equation 1 separately. That is, we performed the clustering with = 0 and
= 1, leaving the evaluation of intermediate values for future work. Finally,
for this study, we choose to ignore the semantic roles, e ectively considering the</p>
        <sec id="sec-3-4-1">
          <title>9 Available online: https://www.scipy.org/</title>
          <p>frame elements as bags of concepts. Table 3 shows two examples of clusters of
frame instances, one for each value of under consideration.
As a nal step, we perform a straightforward aggregation to extract RDF triples
from the clusters. From each cluster, we select the most frequent frame type
and the most frequent frame element along with its role. Such information is
represented by an RDF triple (not rei ed) of the form frame type, role,
frame element, such as, for instance, the following:
&lt;h t t p : / / f r a m e b a s e . o r g / ns / frame R i d e v e h i c l e &gt;
&lt;h t t p : / / f r a m e b a s e . o r g / ns / f e V e h i c l e &gt;
&lt;h t t p : / / wordnet r d f . p r i n c e t o n . edu /wn31/02837983 n&gt;
We perform this step for the two clustering methods determined by the
parameter, obtaining about 300 triples each. The datasets are published on the
Web at the page http://project.inria.fr/aloof/data/.
4</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Discussion</title>
      <p>From a qualitative viewpoint, we observed that the clustering based on
similarity between frame types produces clusters with one or few similar frame types
with many di erent frame elements. This is in line with the intuition behind
the similarity measure de ned in Section 3.3. In other words, such clusters
answer the question \what kind of entities typically occur in similar situations?".
For instance, one of the clusters we produced contains frame instances of type
Bringing and Operate vehicle and frame elements like machine-n#6-n
(Vehicle), tractor-n#1-n (Vehicle), individual-n#1-n (Driver) and location-n#1-n
(Goal). However, the limited size of the corpus results in a high degree of
sparseness with respect to the topics, therefore it becomes challenging to separate
informative items from what we could consider noise { in the example above, the
cluster also contains elements such as thing-n#8-n (for Vehicle). This shows
that our strategy of ltering out any low frequency elements is not powerful
enough, and needs to be further improved.</p>
      <p>Conversely, from a clustering based on the similarity between frame elements,
relations emerge between frame types that typically involve the same type of
entities. These kind of clusters can help answering questions of the type \in what
situations (and with what role) are certain entities usually found?". Following up
from the previous example, one of the clusters extracted with this method
contains entities such as machine-n#6-n and bike-n#1-n, and the frame types
include Bringing, Operate vehicle, Commerce buy, Setting out, Ride vehicle,
and Carry goods. Unfortunately, the same caveat about noise applies here too,
that is, a certain level of noise is always present (in this example, the
cluster also contains frame types Cause change, Body movement, Causation, and
Becoming aware).</p>
      <p>Filtering out frame types and elements from the clusters based on their
frequency, as we do to produce the nal collection of default knowledge in RDF
triples, helps to reduce the noise and cut down uninformative items. However,
frequency-based ltering may be too blunt an edge, potentially resulting in
discarding important items, unless the amount of source material to parse is enough
to ensure that relevant knowledge stands out.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion and Future Work</title>
      <p>In this paper, we presented a method to automatically extract default knowledge
from natural language text in the form of prototypical frame instances and
represent it using RDF triples. Such knowledge can be used by a robot for planning
and making inferences about its surroundings. Our method is based on parsing
natural language with a knowledge extraction software to extract a large set of
frame instances. Then, these instances are clustered together according to the
type of their frames and the type of their frame elements. Finally, we extract
new default knowledge from the clusters and publish the resulting RDF dataset.</p>
      <p>From here, this study can follow a number of possible directions. Firstly, the
corpus we collected from ESL material is somewhat limited both in size and
in terms of the covered topics. This is re ected in the entities found as frame
elements in the clusters, and could be alleviated by building a larger corpus,
perhaps focusing on speci c types of entities, e.g., domestic objects. Secondly,
while we experimented with some of the parameters, the literature on clustering
is very vast and we just scratched the surface of the many methods available.
In future work, we intend to try alternative approaches for clustering frame
instances and extract new triples from the clusters, and also to evaluate the
output extensively using standard cluster-purity metrics.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Baker</surname>
            ,
            <given-names>C.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fillmore</surname>
            ,
            <given-names>C.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lowe</surname>
            ,
            <given-names>J.B.</given-names>
          </string-name>
          :
          <article-title>The berkeley framenet project</article-title>
          .
          <source>In: 17th International Conference on Computational Linguistics</source>
          . pp.
          <volume>86</volume>
          {
          <fpage>90</fpage>
          . ACL '
          <volume>98</volume>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Basile</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cabrio</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gandon</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Building a General Knowledge Base of Physical Objects for Robots</article-title>
          .
          <source>In: 13th International Conference, ESWC 2016 (May</source>
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Basile</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cabrio</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schon</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>KNEWS: Using Logical and Lexical Semantics to Extract Knowledge from Natural Language</article-title>
          .
          <source>In: European Conference on Arti cial Intelligence (ECAI</source>
          )
          <year>2016</year>
          conference (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Bechhofer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horrocks</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          , et al.:
          <article-title>Wonderweb: Ontology infrastructure for the semantic web (</article-title>
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Carlson</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Betteridge</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kisiel</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Settles</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hruschka</surname>
            <given-names>Jr</given-names>
          </string-name>
          , E.R., Mitchell, T.M.:
          <article-title>Toward an architecture for never-ending language learning</article-title>
          .
          <source>In: AAAI</source>
          . vol.
          <volume>5</volume>
          , p.
          <volume>3</volume>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Charniak</surname>
            ,
            <given-names>E.: BLLIP</given-names>
          </string-name>
          <year>1987</year>
          -89
          <source>WSJ Corpus Release</source>
          <volume>1</volume>
          (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Etzioni</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Banko</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cafarella</surname>
            ,
            <given-names>M.J.:</given-names>
          </string-name>
          <article-title>Machine reading</article-title>
          .
          <source>In: 21st National Conference on Arti cial Intelligence</source>
          . pp.
          <volume>1517</volume>
          {
          <fpage>1519</fpage>
          . AAAI'
          <volume>06</volume>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Etzioni</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cafarella</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Downey</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kok</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Popescu</surname>
            ,
            <given-names>A.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shaked</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Soderland</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weld</surname>
            ,
            <given-names>D.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yates</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Web-scale information extraction in knowitall: (preliminary results)</article-title>
          .
          <source>In: 13th International Conference on World Wide Web</source>
          . pp.
          <volume>100</volume>
          {
          <issue>110</issue>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Fillmore</surname>
            ,
            <given-names>C.J.</given-names>
          </string-name>
          : Frame semantics, pp.
          <volume>111</volume>
          {
          <fpage>137</fpage>
          . Hanshin Publishing Co., Seoul, South Korea (
          <year>1982</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Lenat</surname>
          </string-name>
          , D.B.:
          <article-title>Cyc: A large-scale investment in knowledge infrastructure</article-title>
          .
          <source>Commun. ACM</source>
          <volume>38</volume>
          (
          <issue>11</issue>
          ),
          <volume>33</volume>
          {
          <fpage>38</fpage>
          (
          <year>1995</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Miller</surname>
            ,
            <given-names>G.A.</given-names>
          </string-name>
          :
          <article-title>Wordnet: A lexical database for english</article-title>
          .
          <source>Commun. ACM</source>
          <volume>38</volume>
          (
          <issue>11</issue>
          ),
          <volume>39</volume>
          {
          <fpage>41</fpage>
          (
          <year>1995</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Pennacchiotti</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wirth</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Measuring frame relatedness</article-title>
          . In: Lascarides,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Gardent</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Nivre</surname>
          </string-name>
          ,
          <string-name>
            <surname>J</surname>
          </string-name>
          . (eds.) EACL. pp.
          <volume>657</volume>
          {
          <fpage>665</fpage>
          .
          <article-title>The Association for Computer Linguistics (</article-title>
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Rouces</surname>
          </string-name>
          , J., de Melo, G.,
          <string-name>
            <surname>Hose</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>FrameBase: Representing n-ary relations using semantic frames</article-title>
          .
          <source>In: Proceedings of ESWC 2015</source>
          . pp.
          <volume>505</volume>
          {
          <issue>521</issue>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Speer</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Havasi</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Representing general relational knowledge in conceptnet 5</article-title>
          . In: LREC. pp.
          <volume>3679</volume>
          {
          <issue>3686</issue>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Suchanek</surname>
            ,
            <given-names>F.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kasneci</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weikum</surname>
          </string-name>
          , G.:
          <article-title>Yago: A core of semantic knowledge</article-title>
          .
          <source>In: Proceedings of the 16th International Conference on World Wide Web</source>
          . pp.
          <volume>697</volume>
          {
          <fpage>706</fpage>
          . WWW '07,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA (
          <year>2007</year>
          ), http://doi.acm.
          <source>org/ 10</source>
          .1145/1242572.1242667
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Tenorth</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Beetz</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Knowrobknowledge processing for autonomous personal robots</article-title>
          .
          <source>In: Intelligent Robots and Systems</source>
          ,
          <year>2009</year>
          .
          <article-title>IROS 2009</article-title>
          . IEEE/RSJ International Conference on. pp.
          <volume>4261</volume>
          {
          <fpage>4266</fpage>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Palmer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Verbs semantics and lexical selection</article-title>
          .
          <source>In: Proceedings of the 32Nd Annual Meeting on Association for Computational Linguistics</source>
          . pp.
          <volume>133</volume>
          {
          <fpage>138</fpage>
          . ACL '
          <volume>94</volume>
          ,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computational Linguistics, Stroudsburg, PA, USA (
          <year>1994</year>
          ), http://dx.doi.org/10.3115/981732.981751
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Yates</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cafarella</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Banko</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Etzioni</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Broadhead</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Soderland</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          : Textrunner:
          <article-title>Open information extraction on the web</article-title>
          . pp.
          <volume>25</volume>
          {
          <fpage>26</fpage>
          . NAACLDemonstrations '
          <volume>07</volume>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>