<!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>Extending FrameNet to Machine Learning Domain</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Piotr Jakubowski</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Agnieszka Lawrynowicz</string-name>
          <email>alawrynowiczg@cs.put.poznan.pl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Institute of Computing Science, Poznan University of Technology</institution>
          ,
          <country country="PL">Poland</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In recent years, several ontological resources have been proposed to model machine learning domain. However, they do not provide a direct link to linguistic data. In this paper, we propose a linguistic resource, a set of several semantic frames with associated annotated initial corpus in machine learning domain, we coined MLFrameNet. We have bootstrapped the process of (manual) frame creation by text mining on the set of 1293 articles from the Machine Learning Journal from about 100 volumes of the journal. It allowed us to nd frequent occurences of words and bigrams serving as candidates for lexical units and frame elements. We bridge the gap between linguistics analysis and formal ontologies by typing the frame elements with semantic types from the DMOP domain ontology. The resulting resource is aimed to facilitate tasks such as knowledge extraction, question answering, summarization etc. in machine learning domain.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>For arguably any scienti c domain, there exists big amount of textual content
that includes probably interesting information buried in linguistic structures.
Each of the domains has aspects that are typical only for it. For example in the
eld of machine learning there are sentences dealing with various measures,
numerical data or comparisons. A method for automatic extraction of such speci c
information could facilitate exploration of text corpus, for instance when we are
looking for information about accuracy or popularity of a concrete algorithm
among all articles on machine learning.</p>
      <p>From the other side there are ontological resources that model domain
knowledge using formal, logic-based languages such as OWL1. We aim to leverage
those for facilitating tasks such as knowledge extraction, question answering,
summarization etc. in machine learning domain.</p>
      <p>We propose therefore to ll the gap between linguistic analysis and formal
semantics by combining frame semantics [4] with mapping to a machine learning
speci c ontology. To this end, we extend FrameNet [10] { a lexicon for English
based on frame semantics { to the machine learning domain. In this paper, we</p>
    </sec>
    <sec id="sec-2">
      <title>1 https://www.w3.org/TR/owl-features/</title>
      <p>present an initial version of this extension, we coined MLFrameNet, consisting
of several semantic frames that cover a part of the machine learning domain.</p>
      <p>The rest of the paper is organized like follows. In Section 2 we discuss related
works including a short introduction to FrameNet, other extensions of FrameNet
and machine learning ontologies. in Section 3 we describe the process of
developing the extension which includes collecting a corpus of ML domain-speci c
articles and is based on automatic extraction of lexical units (LU) from the
corpus; the lexical units can help to identify parts of a semantic frame. In Section 5
we provide a discussion, and Section 6 concludes the paper.
2
2.1</p>
      <sec id="sec-2-1">
        <title>FrameNet</title>
        <sec id="sec-2-1-1">
          <title>Preliminaries and Related</title>
        </sec>
        <sec id="sec-2-1-2">
          <title>Works</title>
          <p>Frame semantics developed by Fillmore [5] is a theory of linguistic meaning.
It describes the following elements that characterize events, relations or entities
and the participants in it: frame, frame elements, lexical units. The main
concept is a frame. It is a conceptual structure modeling a prototypical situation.
Frame Elements (FEs) are a part of the frame that represents the roles played
during the situation realization by its participants. The other part of a semantic
frame are Lexical Units (LUs). They are predicates that linguistically express
the situation represented by the frame. We can say that the frame is evoked in
texts through the occurence of its lexical unit(s).</p>
          <p>Each semantic frame usually contains more than one LU and may come into
relationship, such as hyponymy, with other frames.</p>
          <p>The standard approach for creating semantic frames described by Fillmore
[6] is based on ve main steps: i) characterizing situations in particular domain
which could be modeled as a semantic frame, ii) describing Frame Elements, iii)
selecting lexical units that can evoke a frame, iv) annotating sample sentences
from large corpus of texts, and nally v) generating lexical entries for frames,
which are derived for each LU from annotations, and describe how FEs are
realized in syntactic structures.</p>
          <p>The FrameNet project [10] is constructing a lexical database of English based
on frame semantics, containing 1,020 frames (release 1.5).
2.2</p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>Extensions of FrameNet</title>
        <p>There have been several extensions of FrameNet to speci c domains
including biomedical domain (BioFrameNet [2]), legal domain [13] and sport
(Kicktionary [11]). In all of these cases, the authors pointed that each speci c domain
is characterized by speci c challenges related to creating semantic frames. One
major decision concerns whether it is necessary to create a new frame or we can
use one of those existing in FrameNet and extend it.Another design aspect deals
with typing of frame elements with available controlled vocabularies and/or
ontologies. For instance, the structure of Kicktionary, a multi-lingual extension
of FrameNet for football domain, allows to connect it to the concrete football
ontology [1]. Even better developed BioFrameNet extension has its structure
connected to biomedical ontologies [2].
2.3</p>
      </sec>
      <sec id="sec-2-3">
        <title>Machine Learning Ontologies</title>
        <p>There have been proposed a few ML ontologies or vocabularies such as DMOP [7],
OntoDM [9], Expose [12] and MEX vocabulary [3]. A common proposed standard
schema unifying these e orts, ML Schema, is only on the way being developed
by the W3C Machine Learning Schema Community Group2. Despite of the
existence of the ontological resources and vocabularies which formalize the ML
domain, a linguistic resource linking those to textual data is missing. Therefore
we propose to ll this gap by MLFrameNet and to link it to an existing ML
ontology.
3</p>
        <sec id="sec-2-3-1">
          <title>Frame Construction Pipeline { Our Approach</title>
          <p>We propose a pipeline in order to extract information needed for creating
semantic frames on machine learning that consists of ve steps (Figure 1).</p>
          <p>At rst we crawled websites from http://www.springer.com to extract data
for creating a text corpus based on the Machine Learning Journal articles. All
articles were stored in text les without any preprocessing like stemming or
removing stopwords. The reason for this is that whole sentences were later used
for creating semantic frames. In the second step, we applied statistical approach
based on calculating histogram for articles to nd out, which words or phrases
(e.g., bigrams) occur most frequently. This is the major part of our method and
it aims to nd candidates for lexical units or frame elements for new frames
based on text mining. We envisage that those candidates could play a role of
lexical units or instantiations of frame elements. Usage of them should simplify
the process of new semantic frames creation. In the third step, we gather the
sentences that contain the found expressions. In the fourth step, we created the
frames manually, leveraging the candidates for the frame parts and sentences
containing them. In the nal step, after creating frame drafts that could t
existing FrameNet structure, we connected the frame elements to terms from
the DMOP ontology that covers machine learning domain.
3.1</p>
        </sec>
      </sec>
      <sec id="sec-2-4">
        <title>Corpus</title>
        <p>The data for this research comes from Machine Learning Journal and covers
1293 articles from 101 volumes of that journal stored in lesystem as text les
with metadata stored in a database. Importantly: Springer grants text and
datamining rights to subscribed content, provided the purpose is non-commercial
research3. We used an open source framework written in Python for crawling web
2 https://www.w3.org/community/ml-schema/
3 Sentence from the licence http://www.springer.com/gp/rights-permissions/
springer-s-text-and-data-mining-policy/29056
occur most frequently. This is the major part of our method aiming to find
candidates for lexical units for new frames based on text mining. In our idea
they could play a role of lexical unit or instance of frame element. Usage of
them should simplify the process of new semantic frames creation. In the final
step, after creating frame drafts that could fit existing FrameNet structure, we
connected the frame elements to terms from the DMOP ontology that covers
machine learning domain.</p>
        <p>Corpus</p>
        <p>Histogram
Sentences
Frame
Ontology</p>
        <p>Downloading articles (here: from</p>
        <p>Machine Learning Journal)
Calculating frequency of words
and phrases occurences in articles</p>
        <p>Selecting sentences that
contain the found expressions
Creating semantic frames on</p>
        <p>the basis of the sentences
Mapping of frame elements to an
ontology (here: DMOP ontology)
pages and downloading articles. Preliminary preprocessing of stored content was
made by Python library NLTK4.
The Data Mining OPtimization Ontology (DMOP) [7] has been developed with
the primary purpose of the automation of algorithm and model selection via
semantic meta-mining that is an ontology-based approach to meta-learning of
complete data mining processes in view of extracting patterns associated with
performance. DMOP contains detailed descriptions of data mining tasks (e.g.,
learning, feature selection, model application), data, algorithms, hypotheses (models
or patterns), and work ows. In response to many non-trivial modeling problems
that were encountered due to the complexity of the data mining domain details,
the ontology is highly axiomatized and modeled with the use of the OWL 2 DL5
pro le. DMOP was evaluated for semantic meta-mining in several problems and
used in building the Intelligent Discovery Assistant a plugin to the popular data
mining tool RapidMiner. We use DMOP to provide the semantic types for the
frame elements.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>4 http://www.nltk.org 5 https://www.w3.org/TR/owl2-overview/</title>
      <p>In this section we will describe in more detail the execution of the subsequent
steps of our pipeline.</p>
      <p>During searching for candidates for lexical units or frame elements we tried
three di erent histograms. At rst we found simple words which occur most
frequently in our corpus. We restricted the number of results to 521 words that
occur more than 300 times. In the second approach, instead of words we searched
for bigrams (phrases consisting of two words) and restricted the results to those
which occur more than 32 times in the corpus, what resulted in 490 bigrams.
Finally, we checked the quality of the results using tf-idf numerical statistic - for
each of 1294 articles we chosen ten words with the highest tf-idf measure.</p>
      <p>The most interesting results pertain to bigrams that occur most frequently
in the corpus. The most frequent bigrams are presented in Table 1.
We use them as elements of semantic frames, e.g. as lexical units or instances of
a frame element. The clue of our method was to select sentences containing the
found expressions. Those sentences could be very likely occurences of semantic
frames in the domain of machine learning. Additionally, we were looking for
sentences in which our bigrams were parts of a noun expression or a verb expression
(lexical units and frame elements are often such parts of speech).
4</p>
      <sec id="sec-3-1">
        <title>MLFrameNet</title>
        <p>On the basis of sentences extracted during the process described in the previous
section, we manually developed several semantic frames. Each of the sentences
contains at least one of the most common word or bigrams in the corpus. They
are very often the part of a frame element or a lexical unit.</p>
        <p>By now we have developed eight frames that cover the basics of the machine
learning domain. The names of those frames are: Algorithm, Data, Model, Task,
Measure, Error, TaskSolution and Experiment.</p>
        <p>Below, we present the frames in a FrameNet style. The proposed lexical units
are underlined, frame elements are in brackets (with adequate number
superscripted in the de nition of situation) and phrases extracted from the histogram
are in bold.</p>
        <p>
          Task:
{ De nition of situation: This is a frame for representing ML task1, and
optionally an algorithm2 for solving it.
{ Frame Elements: (
          <xref ref-type="bibr" rid="ref1">1</xref>
          ) ML task; (
          <xref ref-type="bibr" rid="ref2">2</xref>
          ) ML algorithm
{ Lexical Units: supervised, unsupervised, reinforcement learning, classi
cation, regression, clustering, density estimation, dimensionality reduction
{ An example of annotated sentence:
[Supervised learning ML task] can be used to build class probability
estimates.
        </p>
        <p>
          Algorithm:
{ De nition of situation: This frame represents classes of ML Algorithms1,
their instances2, tasks3 they address, data4 they specify, the type of hypothesis5
they produce, ML software (environment)6 where they are implemented and
the optimization problem they try to solve7.
{ Frame Elements: (
          <xref ref-type="bibr" rid="ref1">1</xref>
          ) ML algorithm type (
          <xref ref-type="bibr" rid="ref2">2</xref>
          ) instance; (
          <xref ref-type="bibr" rid="ref3">3</xref>
          ) ML task; (
          <xref ref-type="bibr" rid="ref4">4</xref>
          ) data;
(
          <xref ref-type="bibr" rid="ref5">5</xref>
          ) hypothesis; (
          <xref ref-type="bibr" rid="ref6">6</xref>
          ) software; (
          <xref ref-type="bibr" rid="ref7">7</xref>
          ) optimization problem
{ Lexical Units: algorithm, learning algorithm, method, learning method
{ An example of annotated sentence:
[Expectation Maximization instance] is the standard [semi-supervised learning
algorithm ML algorithm type] for [generative models hypothesis].
        </p>
        <p>
          Data:
{ De nition of situation: This frame represents data1, the quantity or dimensions2
associated with given data (e.g, a number of datasets, number of features),
identi es the origin3 of data, its characteristic 4, its name5 (e.g., of a
particular dataset).
{ Frame Elements: (
          <xref ref-type="bibr" rid="ref1">1</xref>
          ) data (
          <xref ref-type="bibr" rid="ref2">2</xref>
          ) quantity; (
          <xref ref-type="bibr" rid="ref3">3</xref>
          ) origin; (
          <xref ref-type="bibr" rid="ref4">4</xref>
          ) characteristic; (
          <xref ref-type="bibr" rid="ref5">5</xref>
          )
name.
{ Lexical Units: data, data set, training set, training data, training examples,
examples, data point, test set, test data, label ranking, preference
information, background knowledge, prior knowledge, missing values, ground truth,
unlabeled data, data stream, positive examples, data streams, class labels,
gene expression, real data, missing data, synthetic data, labeled data, high
dimensional, negative examples, training samples, multi-label data, training
instances, instances, real-world data, data values, labeled examples, feature
vector, feature set, validation set, observed data, relational data, large data,
time points, sample
{ An example of annotated sentence:
        </p>
        <p>We note that the [extreme sparsity characteristic] of this [data set data]
makes the prediction problem extremely di cult.</p>
        <p>
          Model:
{ De nition of situation: This frame represents ML models1, identi es ML
algorithms2 that produce the models, and model's characteristics3.
{ Frame Elements: (
          <xref ref-type="bibr" rid="ref1">1</xref>
          ) model (
          <xref ref-type="bibr" rid="ref2">2</xref>
          ) ML algorithm; (
          <xref ref-type="bibr" rid="ref3">3</xref>
          ) characteristic.
{ Lexical Units: model, models, hypothesis, hypotheses, cluster, clusterings,
rules, patterns, bayes net, decision tree, graphical model, joint distribution,
neural network, generative model, bayesian network
{ An example of annotated sentence: [RIDOR ML algorithm] creates a set of
[rules model], but does not keep track of the number of training instances
covered by a rule.
        </p>
        <sec id="sec-3-1-1">
          <title>Measure:</title>
          <p>
            { De nition of situation: This frame represents information about speci c
measure2 (and its value5) used to estimate the performance of a speci c ML
algorithm1 on some dataset4 in a speci c way6. The ML algorithm solves
ML task3.
{ Frame Elements: (
            <xref ref-type="bibr" rid="ref1">1</xref>
            ) ML algorithm/model; (
            <xref ref-type="bibr" rid="ref2">2</xref>
            ) measure; (
            <xref ref-type="bibr" rid="ref3">3</xref>
            ) ML task (
            <xref ref-type="bibr" rid="ref4">4</xref>
            )
dataset (
            <xref ref-type="bibr" rid="ref5">5</xref>
            ) measure value (
            <xref ref-type="bibr" rid="ref6">6</xref>
            ) measure method
{ Lexical Units: result, measure, estimate, performance, better, worse,
precision, recall, accuracy, lift, ROC, confusion matrix, cost function
{ An example of annotated sentence:
          </p>
          <p>Additional experiments based on ten runs of [10-fold cross validations
measure method] on [40 data sets dataset] further support the e ectiveness
of the [reciprocal-sigmoid model ML Algorithm/model], where its [classi cation
accuracy measure] is seen to be comparable to several top classi ers in the
literature.</p>
          <p>
            Error:
{ De nition of situation: This frame describes type of error1 that coud be used
for speci c ML algorithm2, that solves ML task3. The error value4 can be
calculated for speci c data5.
{ Frame Elements: (
            <xref ref-type="bibr" rid="ref1">1</xref>
            ) error type; (
            <xref ref-type="bibr" rid="ref2">2</xref>
            ) ML task; (
            <xref ref-type="bibr" rid="ref3">3</xref>
            ) error value (
            <xref ref-type="bibr" rid="ref4">4</xref>
            ) ML
algorithm (
            <xref ref-type="bibr" rid="ref5">5</xref>
            ) dataset
{ Lexical Units: error, measure, minimize, maximize, validation set error,
prediction error, expected error, error rate, error loss, generalization error,
training error, approximation error
{ An example of annotated sentence:
          </p>
          <p>We present an e cient [algorithm ML algorithm] for [computing the
optimal two-dimensional region ML task] that minimizes the [mean squared
error error type] of an objective numeric attribute in a given database.</p>
        </sec>
        <sec id="sec-3-1-2">
          <title>Task Solution:</title>
          <p>
            { De nition of situation: This is a frame for representing relations between
ML task1 and method2 that solves it. The solution method could be wider
described3. The method or collateral problems are probably described in
reference article4.
{ Frame Elements: (
            <xref ref-type="bibr" rid="ref1">1</xref>
            ) ML task (
            <xref ref-type="bibr" rid="ref2">2</xref>
            ) solution type; (
            <xref ref-type="bibr" rid="ref3">3</xref>
            ) solution description (
            <xref ref-type="bibr" rid="ref4">4</xref>
            )
authors/references
{ Lexical Units: solve, solving, model, assume, perform
{ An example of annotated sentence:
          </p>
          <p>Indeed, [MCTS solution type] has been recently used by [Gaudel and Sebag
(2010) authors/references] in their [FUSE (Feature Uct SElection) solution type]
system to perform [feature selection ML task].</p>
        </sec>
        <sec id="sec-3-1-3">
          <title>Experiment:</title>
          <p>{ De nition of situation: This is a frame for representing relations between
ML experiment1 and data2 used in the expriment, an ML algorithms/models
applied3, measure4 used to assess the results of an experiment or possibly an
error 5 calculated based on the experiment results, measure or error value6
and indication of possible loss or gain7 in a comparison.
[CB1 ML algorithm/model] to [signi cantly increase loss or gain indication]
[generalization accuracy measure] over [SSE or CE optimization ML algorithm/model],
[from 97.86% and 98.10% measure or error value], respectively,
to [99.11% measure or error value] .</p>
          <p>The Table 2 presents a set of mappings of frame elements to DMOP terms.
DMOP was selected from among the available machine learning domain
ontologies, since it links to the foundational ontology Descriptive Ontology for
Linguistic and Cognitive Engineering (DOLCE) [8]. Due to this alignement, we have
found it more relevant for applications related to computational linguistics than
the other available ontologies. We only presented the exising mappings,
omitting the frame elements for which no precise mapping exists yet. Sometimes it is
due to the ontological ambiguity of the common language (discussed in the next
Section). The other times, the DMOP ontology does not contain an adequate
vocabulary term as for instance the author of an algorithm (such information
as scienti c papers describing particular algorithms are placed in DMOP in the
annotations).</p>
          <p>The 'subframe of' relations between frames are illustrated in Figure 2. They
highlight the nature of the developed frames. Some of the frames, Task,
Algorithm, Data, Model, Measure, Error, represent objects (corresponding to nouns),
while the others, Task Solution and Experiment, represent more complex
situation in the former case or an event in the latter case (which is also re ected by
their LUs that are mostly verbs).</p>
          <p>The MLFrameNet data is being made available at https://semantic.cs.
put.poznan.pl/wiki/aristoteles/.
The creation of the most frequent occurences of words and bigrams was very
helpful in creating semantic frames since it introduced ltering such that there
was no need to analyze the whole corpus of articles.</p>
          <p>After the process of making frames, we investigated some inconvenience in
our approach and things that we could do better.</p>
          <p>First of them is that sometimes it turns out that we want to know the context
of particular sentence to build a valuable frame from it or to extract more frame
elements. For example for the sentence "This problem could be solved by logistic
regression." we can assume that in the previous few sentences there occurs the
information about the name of the problem. Our method does not solve this
issue, as the sentence is not bound to the previous sentence.</p>
          <p>During the process of creating semantic frames for machine learning it occurs
that in such restricted domain the amount of lexical units is much smaller than
for general FrameNet. This situation cause that a number of frames can be
evoked by the same lexical units.</p>
          <p>An interesting modeling problem that we have encountered is an
interchangeable usage of the concepts of an algorithm and a model (the algorithm produces)
in machine learning texts while describing the performance of the algorithms
and models. Ontologically, it is the model that is being used to produce the
performance measurement and not the algorithm that produced the model. In a
common language, however, it often appears that the term algorithm is that
associated with producing the performance. Since those terms played many times
this particular role interchangeably in the sentences, we have modeled such frame
elements as 'Measure.ML algorithm/model'. However, it poses problems for
semantic typing as clearly algorithm and model are disjoint in the DMOP ontology.</p>
          <p>Due to the licence issues we are only able to publish a corpus of annotated
sentences where there is only maximum one sentence per each Machine Learning
Journal non-open access article. There is no such restriction in case of the open
access articles. It is noteworthy, that this restriction does not prevent text mining
of the journal articles for scienti c purposes such as our automatic statistical
analysis of most frequent words which is allowed.
6</p>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>Conclusions and future work</title>
        <p>In this paper, we have proposed an initial extension to the FrameNet resource
for the machine learning domain: MLFrameNet. We have discussed our approach
to the problem of creating semantic frames for this speci c technical domain of
machine learning. So far, our main objective was to create a valuable resource for
machine learning domain in the FrameNet style that could also serve as a seed
resource for further automatic methods. Thus we have been less concentrated
on the pipeline itself that will be a topic of the future work. Nevertheless, our
attempts have shown that statistical analysis of domain-speci c corpus of text
is an e ective way of nding appropriate vocabulary, that can be treated as a
part of semantic frames. Gradually we will be building new semantic frames in
this domain.</p>
        <p>In the future work, we will conduct an external evaluation with use of one of
available crowdsourcing platforms for evaluating resources that we have created
so far. Especially, we plan to perform a crowdsourcing experiment in which
contributors will decide whether a sample sentence is properly annotated. We
want to tackle the problem of taking into account the context of the sentence and
investigate the implications of that multiple frames can be evoked by the same
lexical units. We also plan to extend our corpus by new annotations that may
be published without publishing the original sentences or new texts. Moreover,
we want to search for new candidates for frame elements automatically. That
approach could be built on the basis of parts of speech or parts of sentences,
for example through nding similarities between existing, manually annotated,
sentences and new examples. We plan to use the created MLFrameNet resource
for relation extraction from the scienti c articles, in order to populate data
mining ontologies (DMOP) and schemas (ML Schema) and create Linked Data
describing machine learning experiments described in scienti c articles.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Buitelaar</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Eigner</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gulrajani</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schutz</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Siegel</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weber</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cimiano</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ladwig</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mantel</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhu</surname>
          </string-name>
          , H.:
          <article-title>Generating and visualizing a soccer knowledge base</article-title>
          .
          <source>In: Proceedings of the Eleventh Conference of the European Chapter of the Association for Computational Linguistics: Posters &amp; Demonstrations</source>
          . pp.
          <volume>123</volume>
          {
          <fpage>126</fpage>
          .
          <article-title>Association for Computational Linguistics (</article-title>
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Dolbey</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ellsworth</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sche</surname>
            <given-names>czyk</given-names>
          </string-name>
          , J.:
          <article-title>Bioframenet: A domain-speci c framenet extension with links to biomedical ontologies</article-title>
          .
          <source>In: In Proceedings of the Biomedical Ontology in Action Workshop at KR-MED</source>
          . pp.
          <volume>87</volume>
          {
          <issue>94</issue>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Esteves</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moussallem</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Neto</surname>
            ,
            <given-names>C.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Soru</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Usbeck</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ackermann</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lehmann</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>MEX vocabulary: a lightweight interchange format for machine learning experiments</article-title>
          .
          <source>In: Proceedings of the 11th International Conference on Semantic Systems, SEMANTICS</source>
          <year>2015</year>
          , Vienna, Austria,
          <source>September 15-17</source>
          ,
          <year>2015</year>
          . pp.
          <volume>169</volume>
          {
          <issue>176</issue>
          (
          <year>2015</year>
          ), http://doi.acm.
          <source>org/10</source>
          .1145/2814864.2814883
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Fillmore</surname>
            ,
            <given-names>C.J.:</given-names>
          </string-name>
          <article-title>Frame semantics and the nature of language</article-title>
          .
          <source>Annals of the New York Academy of Sciences: Conference on the Origin and Development of Language and Speech</source>
          <volume>280</volume>
          (
          <issue>1</issue>
          ),
          <volume>20</volume>
          {
          <fpage>32</fpage>
          (
          <year>1976</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Fillmore</surname>
            ,
            <given-names>C.J.</given-names>
          </string-name>
          :
          <article-title>Frames and the semantics of understanding</article-title>
          .
          <source>Quaderni di semantica 6</source>
          (
          <issue>2</issue>
          ),
          <volume>222</volume>
          {
          <fpage>254</fpage>
          (
          <year>1985</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Fillmore</surname>
            ,
            <given-names>C.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Baker</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>A frames approach to semantic analysis</article-title>
          .
          <source>The Oxford handbook of linguistic</source>
          analysis pp.
          <volume>313</volume>
          {
          <issue>339</issue>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Keet</surname>
            ,
            <given-names>C.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lawrynowicz</surname>
          </string-name>
          , A.,
          <string-name>
            <surname>d'Amato</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kalousis</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nguyen</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Palma</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stevens</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hilario</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>The data mining optimization ontology</article-title>
          .
          <source>J. Web Sem</source>
          .
          <volume>32</volume>
          ,
          <issue>43</issue>
          {
          <fpage>53</fpage>
          (
          <year>2015</year>
          ), http://dx.doi.org/10.1016/j.websem.
          <year>2015</year>
          .
          <volume>01</volume>
          .001
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Masolo</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Borgo</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gangemi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guarino</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Oltramari</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Ontology library</article-title>
          .
          <source>WonderWeb Deliverable D18 (ver. 1.0</source>
          ,
          <fpage>31</fpage>
          -
          <lpage>12</lpage>
          -
          <year>2003</year>
          ).
          <article-title>(</article-title>
          <year>2003</year>
          ), http://wonderweb.semanticweb.org
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Panov</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Soldatova</surname>
            ,
            <given-names>L.N.</given-names>
          </string-name>
          , Dzeroski, S.:
          <article-title>Ontology of core data mining entities</article-title>
          .
          <source>Data Min. Knowl. Discov</source>
          .
          <volume>28</volume>
          (
          <issue>5-6</issue>
          ),
          <volume>1222</volume>
          {
          <fpage>1265</fpage>
          (
          <year>2014</year>
          ), http://dx.doi.org/10. 1007/s10618-014-0363-0
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Ruppenhofer</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ellsworth</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Petruck</surname>
            ,
            <given-names>M.R.</given-names>
          </string-name>
          , Johnson,
          <string-name>
            <surname>C.R.</surname>
          </string-name>
          , Sche czyk, J.:
          <source>FrameNet II: Extended Theory and Practice</source>
          . International Computer Science Institute, Berkeley, California (
          <year>2006</year>
          ),
          <article-title>distributed with the FrameNet data</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Schmidt</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>The Kicktionary: Combining corpus linguistics and lexical semantics for a multilingual football dictionary</article-title>
          .
          <source>na</source>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Vanschoren</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Blockeel</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pfahringer</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Holmes</surname>
          </string-name>
          , G.:
          <article-title>Experiment databases - A new way to share, organize and learn from experiments</article-title>
          .
          <source>Machine Learning</source>
          <volume>87</volume>
          (
          <issue>2</issue>
          ),
          <volume>127</volume>
          {
          <fpage>158</fpage>
          (
          <year>2012</year>
          ), http://dx.doi.org/10.1007/s10994-011-5277-0
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Venturi</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lenci</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Montemagn</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vecchi</surname>
            ,
            <given-names>E.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sagri</surname>
            ,
            <given-names>M.T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tiscornia</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Towards a FrameNet resource for the legal domain</article-title>
          .
          <source>In: Proceedings of the Third Workshop on Legal Ontologies and Arti cial Intelligence Techniques</source>
          . Barcelona,
          <string-name>
            <surname>Spain</surname>
          </string-name>
          (
          <year>June 2009</year>
          ), http://sunsite.informatik.rwth-aachen.de/ Publications/CEUR-WS/Vol-
          <volume>465</volume>
          /
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>