<!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>Neural Semantic Role Labeling using Verb Sense Disambiguation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Domenico Alfano</string-name>
          <email>d.alfano@eustema.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Roberto Abbruzzese Donato Cappetta</string-name>
          <email>d.cappetta@eustema.it</email>
          <email>r.abbruzzese@eustema.it</email>
          <email>r.abbruzzese@eustema.it d.cappetta@eustema.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Eustema S.p.A.</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Eustema S.p.A. Eustema S.p.A.</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>The Natural Language Processing (NLP) community has recently experienced a growing interest in Semantic Role Labeling (SRL). The increased availability of annotated resources enables the development of statistical approaches specifically for SRL. This holds potential impact in NLP applications. We examine and reproduce the Marcheggiani's system and its individual components, including its annotated resources, parser, classification system, the features used and the results obtained by the system. Then, we explore different solutions in order to achieve better results by approaching to Verb-Sense Disambiguation (VSD). VSD is a sub-problem of the Word Sense Disambiguation (WSD) problem, that tries to identify in which sense a polysemic word is used in a given sentence. Thus a sense inventory for each word (or lemma) must be used. Finally, we also assess the challenges in SRL and identify the opportunities for useful further research in future.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>One of the fields where AI is gaining great
importance is the NLP. Nowadays, NLP has many
applications: search engines (semantic/topic search
rather than word matching), automated speech
translation, automatic summarization, etc.
Therefore, there are many sub-tasks for natural
language applications that have already been
studied. An example is the syntactic analysis of the
words of a sentence. The object of this research
study is the realization of a system able to perform
SRL.</p>
      <p>A SRL system does nothing more than take a set
of input phrases and, for each of them, it starts to
determine the various components that could play
a semantic role. A component of a proposition
that plays a semantic role is defined as constituent.
Once the possible candidates are determined,
Machine Learning techniques are used to label them
with the right role.</p>
      <p>This task becomes important for advanced
applications where it is also necessary to process the
semantic meaning of a sentence. Moreover, all this
applications have to deal with ambiguity.
Ambiguity is the term used to describe the fact
that a certain expression can be interpreted in more
than one way.</p>
      <p>In NLP, ambiguity is present at several stages in
the processing of a text or a sentence, such as:
tokenization, sentence-splitting, part-of-speech
(POS) tagging, syntactic parsing and semantic
processing. Semantic ambiguity is usually the last
to be addressed by NLP systems, and it tends to
be one of the hardest to solve among all types of
ambiguities mentioned.</p>
      <p>For this type of ambiguity, the sentence has
already been parsed and, even if its syntactic
analysis (parse tree) is unique and correct, some words
may feature more than one meaning for the
grammatical category they were tagged with.</p>
      <p>
        Usually this difference in meaning is associated to
syntactic properties. In order to overcome these
issues, this research study approaches to the VSD
task. The majority of the systems used in the VSD
task are based on Machine Learning techniques
        <xref ref-type="bibr" rid="ref1">(Witten, 2011)</xref>
        .
      </p>
      <p>We approach both the tasks by following two
different solutions.
2.1</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <sec id="sec-2-1">
        <title>SRL Approaches</title>
        <p>
          Until recently, state-of-the-art Semantic Role
Labeling (SRL) systems relied on complex sets of
lexico-syntactic features
          <xref ref-type="bibr" rid="ref2">(Pradhan, 2005)</xref>
          as well
as declarative constraints
          <xref ref-type="bibr" rid="ref3">(Punyakanok, 2008)</xref>
          .
Neural SRL models, instead, exploit induction
capabilities of neural networks, largely eliminating
the need for complex ”hand-made” features.
Recently, it has been shown that an accurate
spanbased SRL model can be constructed without
relying on syntactic features
          <xref ref-type="bibr" rid="ref4">(Jie Zhou, 2015)</xref>
          . In
particular, Roth and Lapata
          <xref ref-type="bibr" rid="ref5">(Roth and Lapata,
2016)</xref>
          argue that syntactic features are necessary
for the dependency-based SRL and show that
performance of their model degrades dramatically if
syntactic paths between arguments and predicates
are not provided as an input.
        </p>
        <p>
          Recent studies
          <xref ref-type="bibr" rid="ref6">(Luheng He, 2018)</xref>
          propose an
endto-end approach for jointly predicting all
predicates, arguments spans, and the relations between
them. The model makes independent decisions
about what relationship, if any, holds between
every possible word-span pair, and learns
contextualized span representations that provide rich, shared
input features for each decision.
2.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>WSD Approaches</title>
        <p>
          An overview of the most used techniques and
features for WSD was also conducted, based on the
systems evaluated at the SensEval3. The most
common learning algorithms
          <xref ref-type="bibr" rid="ref1">(Witten, 2011)</xref>
          used
at SensEval3 are the following:
        </p>
        <p>The Naive Bayes algorithm, which estimates
the most probable sense for a given word w
based on the prior probability of each sense
and the conditional probability for each of the
features in that context.</p>
        <p>
          The Decision List algorithm
          <xref ref-type="bibr" rid="ref7">(Yarowsky,
1995)</xref>
          , which builds a list of rules, ordered
from the highest to the lowest weighted
feature. The correct sense of the word is
determined by the first rule that is matched.
        </p>
        <p>The Vector Space Model algorithm, which
considers the features of the context as binary
values in a vector. In the training phase, a
centroid is calculated for each possible sense
of the word. These centroids are then
compared with vectors of features from testing
examples using the cosine function.</p>
        <p>
          Support Vector Machines, the most widely
used classification technique in WSD at
SensEval3
          <xref ref-type="bibr" rid="ref10 ref8">(Agirre, 2004)</xref>
          ;
          <xref ref-type="bibr" rid="ref9">(Lee, 2004)</xref>
          ;
          <xref ref-type="bibr" rid="ref10">(Villarejo, 2004)</xref>
          , is a classification method that
finds the maximal margin hyperplane that
best separates the positive from the negative
examples. In the particular case of WSD,
this has to be slightly tuned for multiple class
classification. Usually, methods like
oneagainst-all are used, which lead to the
creation of one classifier per class.
        </p>
        <p>The most commonly used features used by the
systems proposed and presented at SensEval3 can be
divided as follows:</p>
        <p>Collocations: n-grams (usually bi-grams or
tri-grams) around the target word are
collected. The information stored for
thengrams is composed by the lemma, word-from
and part-of-speech tag of each word.</p>
        <p>Syntactic dependencies: syntactic
dependencies are extracted among words around the
target word. The relations most commonly
used are subject, object, modifier. However,
depending on the system, other dependencies
might also be extracted.</p>
        <p>Surrounding context: single words in a
defined window size are extracted and used in a
bag-of-words approach.</p>
        <p>Knowledge-Based information: Some
systems also make use of information suchas
WordNet’s domains, FrameNet’s syntactic
patterns or annotated examples, among
others.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Data</title>
      <p>The dataset used is the CoNLL 2009 Shared Task
built on the CoNLL 2008 task which has been
extended to multiple languages. The core of the task
was to predict syntactic and semantic
dependencies and their labeling.</p>
      <p>Data was provided for both statistical training and
evaluation, in order to extract these labelled
dependencies from manually annotated Treebanks
such as the Penn Treebank for English, the Prague
Dependency Treebank for Czech and similar
Treebanks for Catalan, Chinese, German, Japanese and
Spanish languages, enriched with semantic
relations. Great effort has been dedicated in providing
the participants with a common and relatively
simple data representation for all the languages,
similar to the 2008 English data. Role-annotated data
makes it available for many research opportunities
in SRL including a broad spectrum of
probabilistic and machine learning approaches.</p>
      <p>We have introduced the dataset associated with
SRL; we are now prepared to discuss the
approaches to automatic SRL and VBS.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Metrics</title>
      <p>
        For many of these subtasks there are standard
evaluations techniques and corpora. Standard
evaluation metrics from information retrieval include
precision, recall and a combined metric called F1
measure
        <xref ref-type="bibr" rid="ref11">(Jurafsky, 2000)</xref>
        .
      </p>
      <p>Precision is a measure of how much of the
information that the system returned is correct, also
known as accuracy. Recall is a measure of how
much relevant information the system has
extracted from text, thus a measure of the system’s
coverage. The F1 measure balances recall and
precision.</p>
      <p>A corpus is often divided into three sets: training
set, development set and testing set. Training set
is used for training systems, whereas the
development set is used to tune parameters of the learning
systems, and sselecting the best model. Testing
set is used for evaluation. Cross-corpora
evaluation is used in some tasks, for which a fresh test
set different from the training corpora is used for
evaluation.</p>
      <p>In this case, F1 measure is computed as the
harmonic mean of Precision and Recall.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Semantic Role Labeling</title>
      <p>
        The model architecture for SRL is inspired from
the one ideated by Marcheggiani et al., 2017
        <xref ref-type="bibr" rid="ref12">(Marcheggiani, 2017)</xref>
        based on the following three
components.
      </p>
      <p>Then, a table with all the hyperparameter values
will be shown.
5.1</p>
      <sec id="sec-5-1">
        <title>Word Representation</title>
        <p>The word representation component builds from a
word wi in a sentence w a word representation xi.
Each word w is represented as the concatenation
of four vectors:
A randomly initialized word embedding
xre 2 Rdw .</p>
        <p>A pre-trained word embedding xpe 2 Rdw .
A randomly initialized part-of-speech tag
embedding xpos 2 Rdp .</p>
        <p>A randomly initialized lemma embedding
xle 2 Rdl that is only active if the word is
one of the predicates.</p>
        <p>Then, it has been used the Predicate-Specific
Encoding. Specifically, when identifying arguments
of a given predicate, the authors added a
predicatespecific feature to the representation of each word
in the sentence by concatenating a binary flag to
the word representation. The flag is set as 1 for
the word corresponding to the currently
considered predicate, it is set as 0 otherwise. In this way,
sentences with more than one predicate will be
reencoded by Bidirectional LSTMs multiple times.
5.2</p>
      </sec>
      <sec id="sec-5-2">
        <title>Encoder</title>
        <p>
          Recurrent neural networks (RNN)
          <xref ref-type="bibr" rid="ref13">(Elman,
1990)</xref>
          , more precisely, Long Short-Term Memory
(LSTM) networks
          <xref ref-type="bibr" rid="ref14">(Hochreiter and Schmidhuber,
1997)</xref>
          are one of the most effective ways to model
sequences. Formally, the LSTM is a function
that takes as input the sequence and returns a
hidden state. This state can be regarded as a
representation of the sentence from the start to the
position i, or, in other words, it encodes the word
at position i along with its left context.
        </p>
        <p>Bidirectional LSTMs make use oftwo LSTMs:
one for the forward pass, and another for the
backward pass. In this way the concatenation of
forward and backward LSTM states encodes both
left and right contexts of a word.</p>
        <p>In this case, the Bidirectional Long-Short Term
Memory (BiLSTM) Encoder takes as input the
word representation xi and provides a dynamic
representation of the word and its context in a
sentence.
5.3</p>
      </sec>
      <sec id="sec-5-3">
        <title>Role Classifier</title>
        <p>The goal of the classifier is to predict and label
arguments for a given predicate.</p>
        <p>The basic role classifier takes the hidden state of
the top-layer bidirectional LSTM corresponding to
the considered word at position i and uses it to
estimate the probability of the role r.</p>
        <p>However, since the context of a predicate in the
sentence is highly informative for deciding if a
word is its argument and for choosing its semantic
role, the authors provides the predicate’s hidden
state as another input to the classifier.</p>
        <p>
          Finally, it has been proven advantageous to jointly
embed the role r and predicate lemma l using
a non-linear transformation: ReLU
          <xref ref-type="bibr" rid="ref15">(Vinod Nair
and Geoffrey Hinton, 2010)</xref>
          that is the rectilinear
activation function. In this way each role
prediction is predicate-specific, and at the same time it
has expected to learn a good representation for
roles associated to in frequent predicates.
5.4
        </p>
      </sec>
      <sec id="sec-5-4">
        <title>Hyperparameters</title>
        <p>In the following table the hyperparameter values.</p>
      </sec>
      <sec id="sec-5-5">
        <title>Hyperparameter</title>
        <p>English word embeddings
POS embeddings
Lemma embeddings
LSTM hidden states
Role representation
Output lemma representation
BiLSTM depth
Learning rate</p>
        <p>Multi-Task Learning: by sharing
representations between related tasks (VBS), we can
enable our model to generalize better on our
primary task (SRL).</p>
        <p>Babelfy: usage of a pre-trained model that
helps to disambiguate sentences and verbs.
In the first solution the two models run in parallel.
In the second solution, since the SRL model uses
as input the Babelfy’s output, the two models run
sequentially.
6.1</p>
      </sec>
      <sec id="sec-5-6">
        <title>Multi-Task Learning Solution</title>
        <p>In Machine Learning we typically care about
optimizing a particular metric. In order to do this,
we generally train a single model to perform our
desired task, then fine-tune and tweak this model
until its performance no longer increases.
Even if it is possible to achieve generally
acceptable performance, in this way we could miss
information that might help us to optimize the relevant
metric. Specifically, information deriving from the
training signals of related tasks.</p>
        <p>We can consider multi-task learning as a form
of inductive transfer. Inductive transfer can help
to improve a model by introducing an inductive
bias, defining a model as preferable with respect
to other hypotheses.</p>
        <p>Furthermore, the Verb Sense Disambiguation
model has been created; following, a brief
explanation of the model. We use the same Word
Representation and Encoder of the Marcheggiani’s
system explained in sections 5.1, 5.2.</p>
        <p>The output of the Encoder is used to predict the
sense of the verb by applying the Softmax
activation function.</p>
      </sec>
      <sec id="sec-5-7">
        <title>Model</title>
        <p>Lei (2015)
FitzGerald (2015)
Roth and Lapata
(2016)
Marcheggiani
(2017)
SRL+VSD Model</p>
        <p>As Table 2 shows, performance worsens in terms
of Precision and Recall.</p>
        <p>Therefore, we have a lower value in term of F1
score, which, as already mentioned above, is the
harmonic mean of Precision and Recall.</p>
        <p>
          For this reason another solution was developed in
order to improve the results on both Precision and
Recall and then of F1.
B
          <xref ref-type="bibr" rid="ref16">abelfy (Navigli, 2014</xref>
          ) is both a multilingual
encyclopedic dictionary and a semantic network
which connects concepts and named entities in a
very large network of semantic relations called
Babel synsets. Each Babel synset represents a given
meaning and contains all the synonyms which
express that meaning.
        </p>
        <p>Specifically, Babelfy performs the tasks of
multilingual Word Sense Disambiguation and Entity
Linking.</p>
        <p>Extracted senses have been used as input of the
SRL Model, by replacing the randomly initialized
lemma embedding xle 2 Rdl of the word
representation of 5.1</p>
        <p>
          In this case we can observe improvements in all
fields. This improvement is not so significant
          <xref ref-type="bibr" rid="ref12 ref17">(Reimers and Gurevich, 2017)</xref>
          because
LSTMbased models tend to be significantly sensible to
initialization, for this reason 0.2% improvement in
a small dataset like CoNLL2009 may not be a
satisfactory increase.
        </p>
        <p>Moreover, this results shows that improving the
VSD task determines improvements in SRL task.
7</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Conclusions</title>
      <p>The realized work represents the development of a
complete system for the Semantic Role Labeling,
an important tool to be used in advanced Natural
Language Processing applications.</p>
      <p>A system of SRL alone is not very useful and it
necessarily must be included in a wider
application, for example a Question&amp;Answering system
or a Neural Machine Translation system.
In conclusion, as all the new applications of
natural language processing must be able to handle
semantic information if they want to have good
performances, this type of system can be considered
a valuable solution to achieve such performances.
The statistical analysis of the errors registered by
the system, developing from this analysis new
algorithms in order to correct such errors, is another
aspect to be considered in the evaluation of this
system.
8</p>
    </sec>
    <sec id="sec-7">
      <title>Future Works</title>
      <p>As for future works we could certainly try to
develop a new Semantic Role Labeling model
architecture trying to discover approaches related to
models based on Attention.</p>
      <p>
        Attention
        <xref ref-type="bibr" rid="ref18">(Bahdanau, 2015)</xref>
        is one of the main
innovations for machine translation based on
neural networks, the key idea that allowed neural
networks to overcome classics translation models.
The main obstacle for the sequence-to-sequence
learning is the need to compress all the
information contained in the original sequence into a
prefixed vector. Attention alleviates this problem
        <xref ref-type="bibr" rid="ref19">(Luong, 2015)</xref>
        , allowing the decoder to look again at
the list of hidden states corresponding to the
original sequence, whose weighted average is used as
input from the decoder in addition to the
compressed vector representation.
      </p>
      <p>
        An interesting effect of attention
        <xref ref-type="bibr" rid="ref20">(Vaswani, 2017)</xref>
        is the possibility to observe, superficially, the
operating mechanisms inside the model: the
attention makes visible which parts of the input have
proved important for a certain output, thanks to the
weights applied to get the average of the incoming
sequence.
      </p>
      <p>Another future research activity could be the
examination of the abovementioned models under
different languages, such as Italian.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <surname>Witten</surname>
            ,
            <given-names>I. H.</given-names>
          </string-name>
          , E. Frank, and
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Hall</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>Data Mining: Practical Machine Learning Tools and Techniques (3 ed</article-title>
          .).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <given-names>Sameer</given-names>
            <surname>Pradhan</surname>
          </string-name>
          , Kadri Hacioglu,
          <string-name>
            <surname>Wayne H. Ward</surname>
          </string-name>
          ,
          <string-name>
            <surname>James H. Martin</surname>
            ,
            <given-names>and Daniel</given-names>
          </string-name>
          <string-name>
            <surname>Jurafsky</surname>
          </string-name>
          .
          <year>2005</year>
          .
          <article-title>Semantic role chunking combining complementary syntactic views</article-title>
          .
          <source>In Proceedings of CoNLL.</source>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <given-names>Vasin</given-names>
            <surname>Punyakanok</surname>
          </string-name>
          , Dan Roth, and
          <string-name>
            <surname>Wen-tau Yih</surname>
          </string-name>
          .
          <year>2008</year>
          .
          <article-title>The importance of syntactic parsing and inference in semantic role labeling</article-title>
          .
          <source>Computational Linguistics</source>
          <volume>34</volume>
          (
          <issue>2</issue>
          ):
          <fpage>257</fpage>
          -
          <lpage>287</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <given-names>Jie</given-names>
            <surname>Zhou</surname>
          </string-name>
          and
          <string-name>
            <given-names>Wei</given-names>
            <surname>Xu</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>End-to-end learning of semantic role labeling using recurrent neural networks</article-title>
          .
          <source>In Proceedings of ACL.</source>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <given-names>Michael</given-names>
            <surname>Roth</surname>
          </string-name>
          and
          <string-name>
            <given-names>Mirella</given-names>
            <surname>Lapata</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Neural semantic role labeling with dependency path embeddings</article-title>
          .
          <source>In Proceedings of ACL.</source>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <given-names>Luheng</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Kenton</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <surname>Omer Levy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Luke</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Jointly Predicting Predicates and Arguments in Neural Semantic Role Labeling In Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>Yarowsky D.</surname>
          </string-name>
          <year>1995</year>
          .
          <article-title>Unsupervised word sense disambiguation rivaling supervised methods</article-title>
          .
          <source>In Proceedings of the 33rd annual meeting on Association for Computational Linguistics</source>
          .
          <fpage>189</fpage>
          -
          <lpage>196</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <given-names>Agirre E.</given-names>
            ,
            <surname>Aldabe</surname>
          </string-name>
          <string-name>
            <given-names>I.</given-names>
            ,
            <surname>Lersundi</surname>
          </string-name>
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Martınez</surname>
          </string-name>
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Pociello</surname>
          </string-name>
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Uria</surname>
          </string-name>
          <string-name>
            <surname>L.</surname>
          </string-name>
          <year>2004</year>
          .
          <article-title>The Basque LexicalSample Task Third International Workshop on the Evaluation of Systems for the Semantic Analysis of Text, Barcelona, Spain, Association for Computational Linguistics (</article-title>
          <year>2004</year>
          )
          <fpage>1</fpage>
          -
          <lpage>413</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>Y.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ng</surname>
            ,
            <given-names>H.T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chia</surname>
            ,
            <given-names>T.K.</given-names>
          </string-name>
          <year>2004</year>
          .
          <article-title>Supervised Word Sense Disambiguation with Support Vector Machines and Multiple Knowledge Sources</article-title>
          .
          <source>Third International Workshop on the Evaluation of Systems for the Semantic Analysis of Text</source>
          , Barcelona, Spain, Association for Computational Linguistics (
          <year>2004</year>
          )
          <fpage>137</fpage>
          -
          <lpage>14014</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <given-names>Villarejo L.</given-names>
            ,
            <surname>Marquez</surname>
          </string-name>
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Agirre</surname>
          </string-name>
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Martınez</surname>
          </string-name>
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Magnini</surname>
          </string-name>
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Strapparava</surname>
          </string-name>
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>McCarthy</surname>
          </string-name>
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Montoyo</surname>
          </string-name>
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Suarez</surname>
          </string-name>
          <string-name>
            <surname>A.</surname>
          </string-name>
          <year>2004</year>
          .
          <article-title>The ”Meaning” System on the English All-Words Task</article-title>
          .
          <source>Third International Workshop on the Evaluation of Systems for the Semantic Analysis of Text</source>
          , Barcelona, Spain, Association for Computational Linguistics (
          <year>2004</year>
          )
          <fpage>253</fpage>
          -
          <lpage>256</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <given-names>Jurafsky D.</given-names>
            and
            <surname>Martin</surname>
          </string-name>
          <string-name>
            <surname>J. H.</surname>
          </string-name>
          <year>2000</year>
          .
          <article-title>Machine Translation</article-title>
          .
          <source>In Speech and Language Processing</source>
          . Prentice Hall.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <given-names>Diego</given-names>
            <surname>Marcheggiani</surname>
          </string-name>
          , Anton Frolov and
          <string-name>
            <given-names>Ivan</given-names>
            <surname>Titov</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>A simple and accurate syntax-agnostic neural model for dependency-based semantic role labeling</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <given-names>Jeffrey L.</given-names>
            <surname>Elman</surname>
          </string-name>
          .
          <year>1990</year>
          .
          <article-title>Finding structure in time</article-title>
          .
          <source>Cognitive Science</source>
          <volume>14</volume>
          (
          <issue>2</issue>
          ):
          <fpage>179</fpage>
          -
          <lpage>211</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <given-names>Sepp</given-names>
            <surname>Hochreiter</surname>
          </string-name>
          and
          <string-name>
            <given-names>Jurgen</given-names>
            <surname>Schmidhuber</surname>
          </string-name>
          .
          <year>1997</year>
          .
          <article-title>Long short-term memory</article-title>
          .
          <source>Neural Computation</source>
          <volume>9</volume>
          (
          <issue>8</issue>
          ):
          <fpage>1735</fpage>
          -
          <lpage>1780</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <given-names>Vinod</given-names>
            <surname>Nair</surname>
          </string-name>
          and
          <string-name>
            <given-names>Geoffrey</given-names>
            <surname>Hinton</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>Rectified Linear Units Improve Restricted Boltzmann Machines</article-title>
          . ICML.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <string-name>
            <given-names>A.</given-names>
            <surname>Moro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Raganato</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Navigli</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Entity Linking meets Word Sense Disambiguation: a Unified Approach. Transactions of the Association for Computational Linguistics (TACL), 2</article-title>
          , pp.
          <fpage>231</fpage>
          -
          <lpage>244</lpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <string-name>
            <surname>Reimers</surname>
          </string-name>
          and Gurevich.
          <year>2017</year>
          .
          <article-title>Reporting Score Distributions Makes a Difference: Performance Study of LSTM-networks for Sequence Tagging</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          <string-name>
            <given-names>Bahdanau D.</given-names>
            ,
            <surname>Cho</surname>
          </string-name>
          <string-name>
            <given-names>K.</given-names>
            , and
            <surname>Bengio</surname>
          </string-name>
          <string-name>
            <surname>Y.</surname>
          </string-name>
          <year>2015</year>
          .
          <article-title>Neural Machine Translation by Jointly Learning to Align and Translate</article-title>
          .
          <source>In ICLR</source>
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          <string-name>
            <surname>Luong M.-T.</surname>
          </string-name>
          ,
          <string-name>
            <surname>Pham</surname>
            <given-names>H.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Manning</surname>
            <given-names>C. D.</given-names>
          </string-name>
          <year>2015</year>
          .
          <article-title>Effective Approaches to Attention-based Neural Machine Translation</article-title>
          .
          <source>In Proceedings of EMNLP</source>
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          <string-name>
            <given-names>Vaswani A.</given-names>
            ,
            <surname>Shazeer</surname>
          </string-name>
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Parmar</surname>
          </string-name>
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Uszkoreit</surname>
          </string-name>
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Jones</surname>
          </string-name>
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Gomez</surname>
          </string-name>
          <string-name>
            <given-names>A. N.</given-names>
            ,
            <surname>Polosukhin</surname>
          </string-name>
          <string-name>
            <surname>I.</surname>
          </string-name>
          <year>2017</year>
          .
          <article-title>Attention Is All You Need</article-title>
          .
          <source>In Advances in Neural Information Processing Systems</source>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>