<!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>Text Mining for Open Domain Semi-Supervised Semantic Role Labeling</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Quynh Ngoc Thi Do</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Steven Bethard</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marie-Francine Moens</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Katholieke Universiteit Leuven</institution>
          ,
          <country country="BE">Belgium</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Alabama at Birmingham</institution>
          ,
          <country country="US">United States</country>
        </aff>
      </contrib-group>
      <fpage>33</fpage>
      <lpage>48</lpage>
      <abstract>
        <p>The identification and classification of some circumstance semantic roles like Location, Time, Manner and Direction, a task of Semantic Role Labeling (SRL), plays a very important role in building text understanding applications. However, the performance of the current SRL systems on those roles is often very poor, especially when the systems are applied on domains other than the ones they are trained on. We present a method to build open domain SRL system, in which the training data is expanded by replacing its predicates by words in the testing domain. A language model, which is considered as a text mining technique, and some linguistic resources are used to select from the vocabulary of the testing domain the best words for the replacement. We apply our method on the case study of transferring a semantic role labeler trained on the news domain to the children story domain. It gives us valuable improvements over the four circumstance semantic roles Location, Time, Manner and Direction.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Playing an essential role in text understanding, Semantic Role Labeling is the
task of natural language processing that specifies “Who did What to Whom,
and How, When and Where?” in text [
        <xref ref-type="bibr" rid="ref13">12</xref>
        ].
      </p>
      <p>For example, the processing of the sentence “Mary gave Peter a book at school
yesterday” should result in the identification of a “giving” event with “Mary” as
the Agent of the event, “Peter” as the Recipient and “a book” as the Item being
given. The Location of the “giving” event, or where it took place, is “at school”
and the Time of the event is “yesterday”.</p>
      <p>In this paper, we call an event (“giving” event) in a sentence the semantic
frame, the verb or noun that evokes the frame (“gave”) the predicate, the words
(“Mary”, “Peter”, “a book”, “at school”, “yesterday”) that play a role in the
event the arguments and their roles (“Agent”, “Recipient”, “Thing being given”,
“Location”, “Time”) the semantic roles.</p>
      <p>The task of semantic role labeling is to detect the event, to identify its
arguments and assign the correct semantic roles to them. Thanks to the availability
of semantic annotated resources (e.g. PropBank3, FrameNet4 ), supervised
machine learning approaches have been very successful in constructing automatic
semantic role labellers. Assuming the predicates are already given, those
systems can reach an F15 score of 85% when the training and testing data are in
the same domain. But, when testing on other domains, the scores often drop
significantly6.</p>
      <p>
        Text mining is the task of automatic discovery of new, previously unknown
information from unstructured document collections. Meanwhile, a language model
tries to capture the properties of a language, and predicts the next word in a
word sequence. It is trained on a collection of unlabeled texts, and therefore is
considered as a text mining technique. Recently, we some attempts to use such
language models in a semi-supervised setting for semantic recognition [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ],
in which, other words or a statistical class of words provided by the language
model, that could be exchanged at a certain position in a sentence or phrase,
enriches the feature vectors used in training, or they are used to create training
examples artificially. However, there is no principled way to use such language
information.
      </p>
      <p>In this paper, we develop a methodology to generate additional training data
for SRL by replacing selected verbal predicate words in training examples using
a language model. For each selected predicate in the training examples, from
the vocabulary of the domain that the SRL is applied on, a list of replacement
words which we believe can occur at the same position as the selected word,
are generated. We introduce and explore a variety of features for identifying
how words should be replaced, including predicate vs. argument status, POS,
WordNet related words, and a replacement score based on a language model.
As for experiment, we present a case study of improving the performance of a
SRL system trained on the news domain when applying to the children story
domain. The case study is based on our ongoing European project “Machine
Understanding for interactive StorytElling” (MUSE)7. One of the fundamental
goals of MUSE is to detect actors, actions, plots in children stories, and render
them as 3D worlds. SRL with its function of identifying the events in texts plays
an essential role in solving our problem. Among the set of semantic roles, some
circumstance semantic roles like Location, Time etc. are very important to
understand the full meaning of an event, while the performance of the current SRL
systems on them is often very poor, especially when testing on a domain other
than the one they are trained on. Thus, in our case study, we target to improve
SRL on the four PropBank circumstance roles: AM-LOC (Location), AM-TMP
(Time), AM-MNR (Manner) and AM-DIR (Direction).</p>
      <p>In the next sections, we present related work (Section 2), linguistic resources</p>
    </sec>
    <sec id="sec-2">
      <title>3 http://verbs.colorado.edu/ mpalmer/projects/ace.html</title>
      <p>4 https://framenet.icsi.berkeley.edu
5 Harmonic mean of recall and precision.
6 http://ufal.m↵.cuni.cz/conll2009-st/
7 http://www.muse-project.eu/
(Section 3), underlying assumptions, objectives and task definition (Section 4),
methodology (Section 5), case study (Section 6), and conclusion (Section 7).
2</p>
      <sec id="sec-2-1">
        <title>Related Work</title>
        <p>
          Semi-supervised approaches to semantic role labeling recently have received the
attention of the computational linguistics community. Information from language
models have been used as extra features to improve the performance of SRL. [
          <xref ref-type="bibr" rid="ref18">17</xref>
          ]
use deep learning techniques based on semi-supervised embeddings to improve
a SRL system. [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] pursue this track further and use a deep neural network
architecture to obtain good word representations in the form of word-embeddings.
The word embedding defines the related words which are the result of the
neural network training and are usually referred to as language models. [
          <xref ref-type="bibr" rid="ref17">16</xref>
          ] use
word embeddings obtained by recurrent neural networks to recover the syntactic
structure of a sentence, but the method is not applied to semantic role labeling.
Along these lines, a number of language models with hidden layers have been
developed based on generative probabilistic approaches and applied to
semantic role labeling. [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] define a latent words language model as a graphical model
where at each word position in a text the distribution of exchangeable words
are generated. The authors use a hidden Markov language model with
dependencies defined on two previous and two following words in the discourse, and
in a subsequent paper, [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] explain approximate methods to train such a model
among which is Gibbs sampling. In this model, each hidden variable or latent
word generates a distribution over the entire vocabulary of the training data
set. The model improves the performance of SRL on the CoNLL 2008 dataset
especially when few training data are given to the learner. [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] propose a hidden
Markov model that learns the distribution of a hidden variable that can take K
di↵erent values, and the hidden variable is dependent on the previous hidden
variable in the sentence. In contrast to [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], each hidden variable can generate a
span or sequence of words instead of a single word. The span contains the
sequence of words for the word under consideration and the predicate. Each latent
variable represents a distribution of categories of words. The model is trained
with a Baum-Welch algorithm. In both [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] and [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], the respectively most
probable hidden word or category of words is used as an extra feature to describe the
feature vector used in the recognition. In [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], several “hidden” features are used
each being the result of a di↵erent initialization of the Baum-Welch algorithm.
Although appealing, these latent words language models have disadvantages.
The model of [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] yields a distribution over all vocabulary words raising the need
to make a selection of possibly the most probable ones when using them in the
feature representation. The model of [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] relies on a fixed number of categories (or
latent topics) that form the hidden variables, but it is not clear how to choose
such a number especially when word spans of di↵erent sizes are used as observed
variables. In this paper, we aim at using a more flexible approach where such
free parameters are replaced by the use of linguistic knowledge.
        </p>
        <p>
          Besides the semi-supervised approaches that extend the feature set of SRL, there
are other attempts to generate new training examples automatically by using
unlabeled data. [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] automatically generate training examples by considering the
lexical and syntactic similarity between labeled and unlabeled sentences as a
graph alignment problem. use the language model of [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] to generate new training
examples by replacing the head word of temporal expression training examples
in the task of temporal expression recognition.
        </p>
        <p>None of the above works consider both structural similarity and language models
as a source of evidence for generating training examples, nor do they evaluate
di↵erent approaches to similarity depending on the roles sought. In contrast to
most of the above works, we evaluate the proposed methods when porting the
learned model to texts from a domain that is di↵erent from the one the semantic
role labeler was trained on.
3</p>
      </sec>
      <sec id="sec-2-2">
        <title>Linguistic resources</title>
        <p>
          The Penn Proposition Bank (PropBank) [
          <xref ref-type="bibr" rid="ref14">13</xref>
          ] provides a corpus annotated
with semantic roles. In this resource, a semantic frame which is evoked by a verb
is represented as a role set: Each role set is linked to a specific sense of the verb.
Therefore, each verb has several role sets corresponding to its possible senses.
The list of role sets and their semantic roles for each verb is defined in a frame
file. For example, in the sentence “Mary gave Peter a book at school yesterday”,
the role set give.01 with the meaning of “transfer” evoked by the verb “give”,
has three main arguments A0, A1 and A2 that are “Agent”, “Theme”, and “
Recipient”, respectively: “[Mary A0 ] gave (give.01 ) [Peter A2 ] [a book A1 ] [at
school AM-LOC ] [yesterday AM-TMP ]”.
        </p>
        <p>
          In VerbNet [
          <xref ref-type="bibr" rid="ref16">15</xref>
          ], English verbs are grouped into di↵erent classes, adapting the
previous verbal classification of [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. Each verbal class takes di↵erent thematic
roles and certain syntactic constraints that describe their superficial behavior.
VerbNet’s hierarchical verb classes establish a set of possible thematic roles [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ].
However, the semantic roles in VerbNet are more thematic than the ones in
PropBank. For example, in VerbNet, Agent label is used instead of A0 label as
in PropBank. P atient and T heme can be referred to the label A1 of PropBank.
In Table 2, there is an example of the information that VerbNet contains for
the class give 13.1.1. Members of this class share the same syntactic patterns
(NP V NP PP) with corresponding thematic roles (Agent V Recipient Theme
Asset). Thus, two verbs “give” and “sell” in the two sentences “Mary gave Peter
a book for 20 EUR” and “Mary sold Peter a book for 20 EUR” which have the
same syntactic pattern, evoke two semantic frames with the same semantic role
patterns as follows:
“[Mary Agent ] gave (give.01 ) [Peter Recipient ] [a book Theme] [for 20 EUR
Asset ]”
“[Mary Agent ] sold (sell.01 ) [Peter Recipient ] [a book Theme] [for 20 EUR
Asset ]”
SemLink 8 is a project whose aim is to link together di↵erent lexical resources
via a set of mappings. These mappings will make it possible to combine the
different information provided by these di↵erent lexical resources for tasks such as
inferencing. The mapping between VerbNet and PropBank is available in
SemLink. Each frame in PropBank is linked to a suitable VerbNet class and each role
label in the PropBank frame is mapped to a VerbNet role label. Table 3 shows
a mapping from the PropBank role set “give.01” to the VerbNet class “13.1.1”.
WordNet [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] is a large lexical database of English. Nouns, verbs, adjectives
and adverbs are grouped into sets of cognitive synonyms (synsets), each
expressing a distinct concept. Synsets are interlinked by means of conceptual-semantic
and lexical relations. Noun and verb synsets are arranged into hierarchies. The
main relation among words in WordNet is synonymy, as between the words
“shut” and “close” or “car” and “automobile”. Each of WordNet’s 117000 synsets
is linked to other synsets by means of a small number of “conceptual” relations.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>8 http://verbs.colorado.edu/semlink/</title>
      <p>The most frequently encoded relation among synsets is the super-subordinate
relation (also called hyperonymy, hyponymy or IS-A relation). It links more
general synsets like furniture, piece of furniture to increasingly specific ones like bed
and bunkbed.
4</p>
      <p>
        Underlying assumptions, objectives and task definition
Semi-supervised learning is very dicult to accomplish in natural language
processing tasks. In general, it is successful when the labeled training data contain
seed examples that are representative for the whole data set and when the
cluster hypothesis holds, that is, when a suitable similarity metric can correctly
cluster the unlabeled examples with the labeled seed examples [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. With regard
to semantic role labeling, in order for the cluster hypothesis to hold, it requires
that “similar” or exchangeable syntactic structures and lexical words found in
the labeled and unlabeled examples cluster the linguistic phrases that form a
specific semantic role.
      </p>
      <p>
        We assume that a language model (e.g., [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]) with valuable generic
information on both frequent and infrequent legitimate linguistic expressions, gives
us exchangeable words in context. The exchangeable words are considered as a
cluster of words playing the same role on forming a specific semantic role.
In this respect, the goals of this paper are to:
– Set up a methodology for choosing unlabeled examples, guessing their
labels, then using them as new training data to improve the performance of a
semantic role labeler.
– Evaluate the methodology in our case study: when the SRL model is trained
on news domain and applied on children story domain.
      </p>
      <p>The notation of the symbols used in this paper is given in Table 4. The task
of the semi-supervised semantic role labeler discussed in this paper is to learn
from a set of manually annotated sentences, a set of unannotated sentences, a
language model and some linguistic resources, a model that assigns semantic
roles to the set of semantic frames of sentences in a test set. A sentence may
contain more than one frame. Each semantic frame consists of one predicate that
evokes the frame and several arguments that play a role in the frame. Predicates
and arguments may be composed of more than one word. In this paper, we work
with verbal predicates, and use head word labeling, which means if an argument
consists of more than one word then the semantic role is assigned to only the
head word. For instance, if “in the park” is the argument playing the role
AMLOC, then only the head word of the phrase “in the park”, “in”, is labeled with
the label AM-LOC. Given a sentence s composed of n words w1, w2, ..., wn, for
each semantic frame f in s, each word wi (i 2 { 1, 2, ...n}) has received a label
ri 2 R [ { NULL} during the manual annotation for training, or will receive
a label ri 2 R [ { NULL} during testing or evaluation, where R is a set of
predefined semantic roles and NULL means empty label. If ri 6= NULL, then wi
is the head of an argument of f with ri as the semantic role. In the approach
that we describe in this paper, R is the set of PropBank semantic roles (see
Table 1).</p>
      <p>Instead of training a SRL system on the given manually annotated sentences Sl,
we generate a set of new training examples by using a language model trained on
a set of unannotated sentences, then use them together with Sl as the training
data for the SRL.
5</p>
      <sec id="sec-3-1">
        <title>Methodology</title>
        <p>The steps of our methodology to generate new training examples and train a
SRL system are shown in Figure 1.</p>
        <p>Given a manually annotated sentence set Sl which can be used as training data, a
set of unannotated sentences Sul, a vocabulary V including words in the domain
of the testing data St, a language model L, and some linguistic resources, we
create new training examples and train the SRL system as follows: First, L is
trained on Sul. Then, L, Sl, V and the linguistic resources are used to generate
new training examples Snl. The algorithm to generate new training examples is
presented below. Finally, the SRL system is trained on Sl [ Snl.
5.1</p>
        <sec id="sec-3-1-1">
          <title>General model for generating new training instances</title>
          <p>In what follows, we present our general model to generate new training instances
for the semantic role labeling task. The detail of our algorithm is given in Figure
1 (in dashed rectangle) and Algorithm 1. It consists of five main steps:
Step 1. Selecting data for replacement. We select a set of semantic frames from
Sl used for the replacement. The selection can be performed in di↵erent ways
depending on specific case studies. For each of the selected semantic frame, we
choose its predicate as the word to be replaced. For example, given a sentence
“Mary gave a book to Peter at school”, the semantic frame “giving” has “gave”
as predicate. “gave” is the word selected for the replacement.</p>
          <p>Unannotated
examples</p>
          <p>Sul
Vocabulary
of test set</p>
          <p>V
Annotated
examples</p>
          <p>Sl</p>
          <p>Train language model
Generate replacement
words
Select data
for replacement</p>
          <p>Step 2. Generating replacement words for each word selected to be replaced.
A statistical language model assigns a probability to a sequence of m words by
means of a probability distribution. For each word selected to be replaced, we
use the language model L trained on Sul, and the vocabulary V of the testing
domain, to generate a list of replacement words. Given a sentence composed of
w1, w2, ..., wn, with wi is the word to be replaced, for each nwj 2 V, the score
of replacing wi by nwj is calculated by the probability of the sequence of words
wi z, wi z+1, ..., wi 1, nwj , wi+1, wi+2, ..., wi+z obtained by putting nwj in the
context of wi where z is size of the context window taken into account:
ReplacementScore(wi, nwj) = P (wi z, wi z+1, ..., wi 1, nwj, wi+1, wi+2, ..., wi+z)
This probability score is calculated by the language model. It is used to rank the
replacement words in our algorithm. Since the size of V may be very large and the
words at the end of the list may have a very low score which often represents noise,
only N words that have highest scores are chosen. After this step, we receive a ranked
list of the top N replacement words for each candidate of the replacement.
Step 3. Applying filters to reduce noise in the list of replacement words. There may
be a great deal of noise in the replacement words returned by the language model since
it does not take into account enough information (syntactic, semantic etc.) to generate
a replacement word that can be replaced perfectly for a word in a given sentence
assuring the same semantic role. Thus, some linguistics filters are needed to improve
the correctness and meaningfulness of the replacement.</p>
          <p>Step 4. Replacing words in each sentence selected to be replaced by their replacement
words that passed the filters, then we form a new unannotated set of sentences Su.
Step 5. Guessing semantic frames and their semantic labels for each sentence in Su to
have an annotated semantic frame set Snl.</p>
          <p>In the following sections, we will present in more detail the language model used, some
proposed filters, how to perform replacement and guess semantic role labels for the
new sentences obtained by the replacement.
Algorithm 1 Generate novel training examples.
1: procedure GenerateNewExample(L, Sl, V, z, N )
2: Su = ; , Snl = ; , Stemp = ; ;
3: Select semantic frames that are used for the replacement from Sl: Ssl = selected
semantic frames
4: for each sentence s 2 Sl do
5: for each word wi in s do
6: if wi is the predicate of a semantic frame 2 Ssl then
7: for each nwj 2 V do
8: ReplacementScore(wi, nwj) =</p>
          <p>P (wi z, wi z+1, ..., wi 1, nwj, wi+1, wi+2, ..., wi+z) obtained by using L;
9: end for
10: Sort nwj according to ReplacementScore, then choose top N words
that have highest scores forming the ranked list Listi;
11: Stemp = Stemp [ (s, wi, Listi);
12: end if
13: end for
14: end for
15: for each (s, wi, Listi) in Stemp do
16: for each replacement word nwj in Listi do
17: if nwj passes filters then
18: for each semantic frame f of s that is in Ssl and receives wi as the
predicate do
5.2</p>
        </sec>
        <sec id="sec-3-1-2">
          <title>Language model</title>
          <p>
            In this paper, we use the Recurrent Neural Network Language Model9 (RNNLM) [
            <xref ref-type="bibr" rid="ref10">10</xref>
            ]
[
            <xref ref-type="bibr" rid="ref9">9</xref>
            ] which is one of the most successful techniques for statistical language modeling.
Unlike previous approaches in using artificial neural networks for modeling sequential
data, recurrent neural networks are not trained with limited context size. By using
recurrent connections, information (e.g., words from previous sentences in a discourse)
can cycle inside these networks for a long time and have an influence on the final
language model obtained. The architecture of RNNLM is shown in Figure 2. The input
layer consists of a vector w(t) that represents the current word wt encoded as 1 of V
with V is the vocabulary (thus size of w(t) is equal to the size of the vocabulary), and of
vector s(t 1) that represents output values in the hidden layer from the previous time
step. After the network is trained, the output layer y(t) represents P (wt+1|wt, s(t 1)).
The network is trained by stochastic gradient descent using either usual
backpropagation algorithm, or backpropagation through time [
            <xref ref-type="bibr" rid="ref12 ref15">14</xref>
            ]. The network is represented by
input, hidden and output layers and corresponding weight matrices - matrices U and
W between the input and the hidden layer, and matrix V between the hidden and the
output layer. Output values in the layers are computed as follows:
sequence W = w1w2...wm = W1m. The language model probability of W is computed
as follows:
m
P (W ) = P (W1m) = Y P (wi|W1i 1)
i=1
(4)
Over the last few decades, an n-gram language model which assumes that the predicted
word only depends on the previous n-1 words, is the most popular technique since it
is simple and e↵ective. Instead of using Equation 4, P (W1m) is calculated in a more
m
simple way, as P (W1m) = Q P (wi|Wii n1+1). However, an n-gram language model
estii=1
mates its parameters in the discrete space, resulting in weak generalization capability
on unknown data. In addition, the standard n-gram language model su↵ers from
exponential growth of size, serious data fragmentation, and increased miss rate using longer
context [
            <xref ref-type="bibr" rid="ref19">18</xref>
            ]. To overcome this problem, RNNLM, which has activation feedback with
short-term memory and uses full history information instead of limiting context, can
help us to calculate more accurately and eciently P (W1m) by Equation 4 using the
output layer y(t).
          </p>
          <p>A language model tries to capture the properties of a language and is trained on a
collection of unlabeled texts, so it can be considered as a text mining technique.
5.3</p>
        </sec>
        <sec id="sec-3-1-3">
          <title>Filters</title>
          <p>Because the list of top N replaceable words returned by the language model may
contain a great deal of noise, we propose specific filters to improve the performance of the
system.</p>
          <p>Part-Of-Speech filter (POS filter): We keep replacement word nwj for wi if nwj has
the same POS tag as wi, when replacing wi in sentence s.</p>
          <p>WordNet filter : We keep replacement word nwj for wi if nwj and wi are synonyms
or have the same hypernym in WordNet. Here, we ignore the problem of word
disambiguation. We only use the first word sense when finding the synonyms and the words
that have the same hypernym.</p>
          <p>For example, “January” has “Jan” as synonym, “February”, “March”, etc. are the
words that have the same hypernym “Gregorian calendar month”.</p>
          <p>Predicate filter : A suitable replacement word of a predicate should also evoke a frame
with correct roles when it is placed in the sentence of the target. Our idea is to assign
role labels to the new frame based on the role labels of the current frame, but it raises
the problem of how to find a mapping between the role sets of the two frames, and
detect the correct sense of the new frame. Based on this idea, one possibility is to
select only replacement words for which the mappings between role sets are available.
By using SemLink (see Section 3), we define a filter specifically for predicates: for each
predicate wp evoking a frame f , we keep replacement predicate word nwj for wp if f
and one frame evoked by nwj are mapped to the same VerbNet class and the mappings
from those two frames to the VerbNet class are defined in SemLink.
5.4</p>
        </sec>
        <sec id="sec-3-1-4">
          <title>Replacing words and guessing semantic labels</title>
          <p>Replacement words that have passed filters are used to generate new training examples.
Given a semantic frame f of a sentence s composed of n words w1, w2, ..., wn, wp (p 2
{1, 2, ..., n}) is the predicate of f , and wa1, wa2, ..., wam (a1, a2, ..., am 2 { 1, 2, ..., n})
are the heads of the m arguments of f with r1, r2, ..., rm as semantic role labels,
respectively. After the filtering step, the list of replacement words of wp, Listp, includes
j words {nw1, nw2, ..., nwj}. For each nwt 2 Listp, we replace wp by nwt in sentence
s and obtain sentence s0 composed of n words w1, w2, ...wp 1, nwt, wp+1, ..., wn. If nwt
has passed the Predicate filter - which we use as a default filter -, it can be a semantic
predicate and the argument structure of the frame evoked by nwt is similar to the
argument structure of the frame evoked by wp. Thus, we guess that nwt also invokes
a semantic frame in s0 with wa1, wa2, ..., wam as arguments (the new semantic frame
and f - the frame evoked by wp - have the same argument words). In order to predict
the sense and role labels of the new semantic frame, we use the mappings between
PropBank semantic frames and VerbNet classes that can be found in SemLink. We
first find a frame f 0 of nwt so that both f 0 and f are mapped to a same VerbNet
class c. The mappings from f and f 0 to c are denoted by m1 and m2, respectively. If
the Predicate filter has been applied before, f 0 exists and can be found in this step.
Then, we can guess that f 0 is the new frame evoked by nwt in s0. As for semantic role
labels of f 0, if in f , wai (i 2 { 1, 2, ..., m}) with semantic role label ri, is a circumstance
role AM-s, then its role does not change in f 0. That means ri is also the role label of
wai in f 0. Otherwise, if the role label of wai in f is ri, then the role label of wai in
f 0 is m2 1(m1(ri)). For example, the sentence “Rachel wore a hat in her room” has
the frame “wear.01” (wore) with “Rachel” as A0, “hat” as A1, “in” (the head of the
prepostion phrase “in her room”) as AM-LOC, and the predicate “wore” has “donned”
as a replacement word. By replacing “wore” by “donned” in the sentence, we have a
new sentence “Rachel donned a hat in her room” and “donned” evokes a new frame. In
SemLink, we can find the VerbNet class “simple dressing-41.3.1” linked to the
Propbank frame “wear.01” and one PropBank frame of the predicate “don”, “don.01”. The
role mapping between the VerbNet class and the two frames can be found in Table5.
By applying our method, we have a new frame “don.01” with “Rachel” as A0 (mapped
to the “Agent” VerbNet role), “hat” as A1 (mapped to the “Theme” VerbNet role),
and “in” as AM-LOC (circumstance role) (See Figure 3).
In the EU-EP7 MUSE project10, in which KU Leuven is involved, we instantiate a
virtual world with information extracted from children stories. Our fundamental goal is
to introduce a new way of exploring and understanding information by “bringing text to
life” through 3D interactive storytelling. Children stories will be taken initially as input,
due to the relative simplicity of such stories and the relative ease of results evaluation,
10 http://www.muse-project.eu/
Original sentence s</p>
          <p>Original frame f
m1
m2</p>
          <p>A0
A0</p>
          <p>Rachel wore a hat in her room
w1 w2 w3w4 w5 w6 w7
wa1 wp wa2wa3
predicate</p>
          <p>A1</p>
          <p>AM-LOC</p>
          <p>Listp={donned (nw1)}
f = wear.01
A1</p>
          <p>AM-LOC
predicate</p>
          <p>f' = don.01
Verbnet class c Agent</p>
          <p>Theme</p>
          <p>c= simple_dressing-41.3.1
New frame f'
New sentence s'
wa1 wa2wa3</p>
          <p>Rawc1hel dnown1nedwa3hwa4t win5hwe6r rowo7m
and will then be translated into formal knowledge that represents the actions, actors,
plots and surrounding world. In a next step this formal knowledge is rendered as virtual
3D worlds in which the user can explore the text through interaction, re- enactment
and guided game play. Finally, we will evaluate to which degree this procedure enhances
the understanding by children of simple fantasy stories. In our project, NLP techniques
are necessary to bring natural language closer to 3D immersive environments. Among
the needed NLP techniques, SRL is one of the most important ones, since it labels the
textual content of the story by semantic roles identifying actors and activities, that are
then visualized in a 3D world. In this paper, we present our work on building a SRL
system for the children story domain.</p>
          <p>To create virtual 3D worlds, the location where the activities happen, the order of the
activities, the tools used by the actors in the activities and the direction where the
actors move toward, are very important information. Such kinds of information can
be represented by the semantic roles AM-LOC, AM-TMP, AM-MNR and AM-DIR
respectively in SRL. However, the performance of the current SRL systems on those
roles is often very poor, especially when testing on a domain other than the one they
are trained on. Therefore, in our work, we target to improve SRL system on those four
roles: AM-LOC, AM-TMP, AM-MNR and AM-DIR.
6.1</p>
        </sec>
        <sec id="sec-3-1-5">
          <title>Data</title>
          <p>We select “Tuk the Hunter” story as the data for our project demonstration. The story
(with some slight changes in the content) is the testing data in our case study. To
evaluate the performance of SRL on our domain, we annotate semantic roles for the story
following the PropBank annotation guideline and dependency head word labeling. The
total number of annotated semantic frames in our testing data is 154. The detailed
number of instances per role is given in Table 6.</p>
          <p>Most of the annotated data available for semantic role labeling are in news domain. To
Data AM-LOC AM-TMP AM-MNR AM-DIR
Testing 19 28 32 10</p>
          <p>Training 10387 23347 11837 1146
be used as our training data, we select CoNLL 200911 training dataset which contains
parts of the Wall Street Journal corpus12. The detail number of instances per role in
the training data is given in Table 6.
6.2</p>
        </sec>
        <sec id="sec-3-1-6">
          <title>Expanding training data to children story domain</title>
          <p>
            In our case study, we collect 252 children stories (mostly are fairy tales) to create the
domain of children story. They are used together with the first 80 million words of the
Reuters corpus to train the Recurrent Neutral Network Language Model13, and the
vocabulary of those stories is used to generate new training examples.
We realize that most of the instances of the four targeted roles are prepositions. It
suggests us to choose semantic frames that contain at least one preposition argument
in the CoNLL 2009 training data as the base for our training data expansion.
The SRL system is used in our experiment is the Lund university’s semantic parsing [
            <xref ref-type="bibr" rid="ref1">1</xref>
            ],
which is available freely, and one of the best systems in the CoNLL 2009 competition.
In order to evaluate the e↵ectiveness of our method, we compare the results obtained
on the Tuk story by the Lund university’s semantic parsing when training on our
expanded training data and on the original training data. In our experiment setting,
we use all of the three filters: POS filter, WordNet filter, Predicate filter. The maximum
number of replacement words for each replacement position, N = 500, and the context
window size, z = 5. Table 7 presents the results and the gains obtained on the four
circumstance roles when using our expanded training data in precision, recall and F1
measures. From the table, it is clear that we obtain valuable recall, precision and F1
improvements (at least 7% for recall and F1) over all of the tested roles.
11 http://ufal.m↵.cuni.cz/conll2009-st/
12 http://catalog.ldc.upenn.edu/LDC2012T04
13 http://www.fit.vutbr.cz/ imikolov/rnnlm/
          </p>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>Conclusion</title>
        <p>In this paper, we present a methodology of building an open-domain semantic role
labeling. In our case study, we transfer the SRL model trained on the news domain to
the children story domain, by collecting children stories to create the new domain, then
replacing verbal predicates in the training data by the words of the new domain given
a language model. We keep the precision score from dropping by using the occurrence
probabilities and some linguistic filters to verify linguistic patterns obtained by the
replacements. The valuable enhanced results over the four circumstance roles AM-LOC,
AM-TMP, AM-MNR and AM-DIR show clearly the e↵ectiveness of our methodology
on this case study14.</p>
      </sec>
      <sec id="sec-3-3">
        <title>Acknowledgement</title>
        <p>This work is funded by the EU ICT FP7 FET project “Machine Understanding for
interactive StorytElling” (MUSE) http://www.muse-project.eu/.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1. Bjo¨rkelund,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Hafdell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Nugues</surname>
          </string-name>
          ,
          <string-name>
            <surname>P.</surname>
          </string-name>
          :
          <article-title>Multilingual semantic role labeling</article-title>
          .
          <source>In: Proceedings of the Thirteenth Conference on Computational Natural Language Learning: Shared Task</source>
          . pp.
          <fpage>43</fpage>
          -
          <lpage>48</lpage>
          . CoNLL '09,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computational Linguistics, Stroudsburg, PA, USA (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Chapelle</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Scholkopf</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zien</surname>
            ,
            <given-names>A</given-names>
          </string-name>
          . (eds.):
          <article-title>Semi-Supervised Learning</article-title>
          . MIT Press (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Collobert</surname>
          </string-name>
          , R.:
          <article-title>Deep learning for ecient discriminative parsing</article-title>
          .
          <source>In: AISTATS</source>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Deschacht</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>De Belder</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moens</surname>
            ,
            <given-names>M.F.</given-names>
          </string-name>
          :
          <article-title>The latent words language model</article-title>
          .
          <source>Computer Speech and Language</source>
          <volume>26</volume>
          (
          <issue>5</issue>
          ),
          <fpage>384</fpage>
          -
          <lpage>409</lpage>
          (
          <year>Oct 2012</year>
          ), https://lirias. kuleuven.be/handle/123456789/344914
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Deschacht</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moens</surname>
            ,
            <given-names>M.F.</given-names>
          </string-name>
          :
          <article-title>Semi-supervised semantic role labeling using the latent words language model</article-title>
          .
          <source>In: EMNLP</source>
          . pp.
          <fpage>21</fpage>
          -
          <lpage>29</lpage>
          . ACL (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6. Fu¨rstenau, H.,
          <string-name>
            <surname>Lapata</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Semi-supervised semantic role labeling via structural alignment</article-title>
          .
          <source>Comput. Linguist</source>
          .
          <volume>38</volume>
          (
          <issue>1</issue>
          ),
          <fpage>135</fpage>
          -
          <lpage>171</lpage>
          (
          <year>Mar 2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ahuja</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Downey</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guo</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yates</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Learning Representations for Weakly Supervised Natural Language Processing Tasks</article-title>
          .
          <source>Computational Linguistics</source>
          <volume>40</volume>
          ,
          <fpage>85</fpage>
          -
          <lpage>120</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Levin</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>English Verb Classes and Alternations A Preliminary Investigation</article-title>
          . University of Chicago Press, Chicago and London (
          <year>1993</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Mikolov</surname>
          </string-name>
          , T.:
          <source>Statistical Language Models Based on Neural Networks. Ph.D. thesis, Ph. D. thesis</source>
          , Brno University of Technology (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Karafit</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Burget</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cernock</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Khudanpur</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          : In: Kobayashi,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Hirose</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Nakamura</surname>
          </string-name>
          , S. (eds.) INTERSPEECH. pp.
          <fpage>1045</fpage>
          -
          <lpage>1048</lpage>
          . ISCA (
          <year>2010</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>
          ),
          <fpage>39</fpage>
          -
          <lpage>41</lpage>
          (
          <year>Nov 1995</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <surname>14</surname>
          </string-name>
          <article-title>An expanded version of this paper with comparable experimental results on the out-of-domain CoNLL 2009 testing data is submitted to the journal of IEEE/ACM Transactions on Audio, Speech</article-title>
          and
          <string-name>
            <given-names>Language</given-names>
            <surname>Processing</surname>
          </string-name>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          12.
          <string-name>
            <surname>Palmer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gildea</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xue</surname>
          </string-name>
          , N.:
          <article-title>Semantic Role Labeling</article-title>
          .
          <source>Synthesis Lectures on Human Language Technologies</source>
          , Morgan &amp; Claypool Publishers (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          13.
          <string-name>
            <surname>Palmer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kingsbury</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gildea</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>The proposition bank: An annotated corpus of semantic roles</article-title>
          .
          <source>Computational Linguistics</source>
          <volume>31</volume>
          (
          <issue>1</issue>
          ),
          <fpage>71</fpage>
          -
          <lpage>106</lpage>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          14.
          <string-name>
            <surname>Rumelhart</surname>
            ,
            <given-names>D.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hinton</surname>
            ,
            <given-names>G.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Williams</surname>
            ,
            <given-names>R.J.:</given-names>
          </string-name>
          <article-title>Parallel distributed processing: Explorations in the microstructure of cognition</article-title>
          , vol.
          <volume>1</volume>
          . chap.
          <source>Learning Internal Representations by Error Propagation</source>
          , pp.
          <fpage>318</fpage>
          -
          <lpage>362</lpage>
          . MIT Press, Cambridge, MA, USA (
          <year>1986</year>
          ), http://dl.acm.org/citation.cfm?id=
          <volume>104279</volume>
          .
          <fpage>104293</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          15.
          <string-name>
            <surname>Schuler</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.K.: VerbNet: A Broad-Coverage</surname>
          </string-name>
          ,
          <article-title>Comprehensive Verb Lexicon</article-title>
          .
          <source>Ph.D. thesis</source>
          , University of Pennsylvania (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          16.
          <string-name>
            <surname>Socher</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>C.C.Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ng</surname>
            ,
            <given-names>A.Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Manning</surname>
          </string-name>
          , C.D.:
          <article-title>Parsing natural scenes and natural language with recursive neural networks</article-title>
          . In: Getoor,
          <string-name>
            <surname>L.</surname>
          </string-name>
          , Sche↵er, T. (eds.) ICML. pp.
          <fpage>129</fpage>
          -
          <lpage>136</lpage>
          .
          <string-name>
            <surname>Omnipress</surname>
          </string-name>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          17.
          <string-name>
            <surname>Weston</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ratle</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Collobert</surname>
          </string-name>
          , R.:
          <article-title>Deep learning via semi-supervised embedding</article-title>
          .
          <source>In: Proceedings of the 25th International Conference on Machine Learning</source>
          . pp.
          <fpage>1168</fpage>
          -
          <lpage>1175</lpage>
          . ICML '08,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA (
          <year>2008</year>
          ), http://doi.acm.
          <source>org/ 10</source>
          .1145/1390156.1390303
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          18.
          <string-name>
            <surname>Yujing</surname>
            <given-names>Si</given-names>
          </string-name>
          , Zhen Zhang,
          <string-name>
            <given-names>T.L.J.P.</given-names>
            ,
            <surname>Yan</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y.</surname>
          </string-name>
          :
          <article-title>Enhanced word classing for recurrent neural network language model</article-title>
          .
          <source>In: JICS: Journal of Information and Computational Science</source>
          , Vol.
          <volume>10</volume>
          . pp.
          <fpage>3595</fpage>
          -
          <lpage>3604</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>