<!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>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Applying Recurrent Neural Networks to Sentiment Analysis of Spanish Tweets</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Oscar Araque</string-name>
          <email>o.araque@upm.es</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Rodrigo Barbado</string-name>
          <email>rodrigo.barbado.esteban@alumnos.upm.es</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>J. Fernando Sanchez-Rada y Carlos A. Iglesias</string-name>
          <email>carlosangel.iglesiasg@upm.es</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Intelligent Systems Group, Universidad Politecnica de Madrid Av. Complutense 30</institution>
          ,
          <addr-line>28040 Madrid</addr-line>
        </aff>
      </contrib-group>
      <fpage>71</fpage>
      <lpage>76</lpage>
      <abstract>
        <p>This article presents the participation of the Intelligent Systems Group (GSI) at Universidad Politecnica de Madrid (UPM) in the Sentiment Analysis workshop focused in Spanish tweets, TASS2017. We have worked on Task 1, aiming to classify sentiment polarity of Spanish tweets. For this task we propose a Recurrent Neural Network (RNN) architecture composed of Long Short-Term Memory (LSTM) cells followed by a feedforward network. The architecture makes use of two di erent types of features: word embeddings and sentiment lexicon values. The recurrent architecture allows us to process text sequences of di erent lengths, while the lexicon inserts directly into the system sentiment information. The results indicate that this feature combination leads to enhanced sentiment analysis performances.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Recent developments in the area of deep
learning are strongly impacting sentiment
analysis techniques. While traditional
methods based on feature engineering are still
prevalent, new deep learning approaches are
succeeding and reduce the need of labeled
corpus and feature de nition. Moreover,
traditional and deep learning approaches
can be combined obtaining improved
results
        <xref ref-type="bibr" rid="ref1">(Araque et al., 2017)</xref>
        .
      </p>
      <p>
        This paper describes our participation in
TASS 2017
        <xref ref-type="bibr" rid="ref8">(Mart nez-Camara et al., 2017)</xref>
        .
      </p>
      <p>Taller de Analisis de Sentimientos en la
SEPLN (TASS) is a workshop that fosters the
research of sentiment analysis in Spanish for
short text such as tweets. The rst task of
this challenge, Task 1, consists in
determining the global polarity at a message level.</p>
      <p>The dataset for the evaluation of this task</p>
      <p>Copyright © 2017 by the paper's authors. Copying permitted for private and academic purposes.
considers annotated tweets with 4 polarity
labels (P, N, NEU, NONE). P stands for
positive, while N means negative and NEU is
neutral. It is considered that NONE means
absence of sentiment polarity. This task
provides a corpus, which contains a total of 1514
tweets written in Spanish, describing a
diversity of subjects.</p>
      <p>We have faced this challenge as an
opportunity to evaluate how these techniques could
be applied in the TASS domain, and their
results compared with the traditional
techniques we used in a previous participation in
this challenge (Araque et al., 2015).</p>
      <p>The reminder of this paper is organized
as follows. Sect. 2 introduces related work.</p>
      <p>Then Sect.3 describes the proposed polarity
classi cation model and its implementation,
which is evaluated in Sect. 4. Finally,
conclusions are drawn in Sect. 6.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related work</title>
      <p>
        Many works in the last years involve the use
of neural architectures to learn text
classication problems and, more speci cally, to
perform Sentiment Analysis. A relevant
example of this are Recursive Neural Tensor
Networks
        <xref ref-type="bibr" rid="ref11">(Socher et al., 2013)</xref>
        . This
architecture makes use of the structure of parse
trees to e ectively capture the negation
phenomena and its scope. A similar work
        <xref ref-type="bibr" rid="ref13">(Tai,
Socher, and Manning, 2015)</xref>
        introduces the
use of LSTM in tree structures, leveraging
both the information contained in these trees
and the representation capabilities of gated
units. Although parse trees can result very
useful in sentiment analysis, many works do
not make use of them, as they introduce an
additional computation overhead. In
        <xref ref-type="bibr" rid="ref16">(Wang
et al., 2015)</xref>
        a data-driven approach is
described that learns from noisy annotated data
also making use of LSTM units and a
error signal processing to avoid the problem
of vanishing gradient. Another useful
technique is attention
        <xref ref-type="bibr" rid="ref18 ref2 ref6">(Bahdanau, Cho, and
Bengio, 2014)</xref>
        , that enables weighting the
importance of the di erent words in a given piece of
text. Attention has been used in Sentiment
Analysis successfully in a recurrent
architecture, as presented in
        <xref ref-type="bibr" rid="ref17">(Wang et al., 2016)</xref>
        .
      </p>
      <p>
        In the context of the TASS challenge, it
has not been the rst time that neural
architectures have been proposed for solving the
di erent tasks. In
        <xref ref-type="bibr" rid="ref15">(Vilares et al., 2015)</xref>
        , the
authors propose a LSTM architecture that is
compared to linear classi ers. Also, word
embeddings have been leveraged in previous
versions, as shown in
        <xref ref-type="bibr" rid="ref9">(Mart nez-Camara et al.,
2015)</xref>
        . Nevertheless, neural networks have
not been thoroughly studied in TASS, and
many potentially interesting techniques
remain unused.
3
3.1
      </p>
    </sec>
    <sec id="sec-3">
      <title>Sentiment analysis Task</title>
      <sec id="sec-3-1">
        <title>Model architecture</title>
        <p>The approach followed for the Sentiment
Analysis at Tweet level Task consists in a
RNN composed of LSTM cells that parse the
input into a xed-size vector representation.
The representation of the text is used to
perform the sentiment classi cation. Two
variations of this architecture are used: (i) a
LSTM that iterates over the input word
vectors or (ii) over a combination of the input
word vectors and polarity values from a
sentiment lexicon.</p>
        <p>The general architecture of the model
takes as inputs the words vectors and the
lexicon values for each word from an input
tweet. Then, the inputs are passed through
a one-layer LSTM with a tunnable number
of hidden units. The generated
representation is then used to determine the polarity of
the input text using a feedforward layer with
softmax activation as output function. The
output of this last layer encodes the
probability that the input text belongs to each class.
Fig. 2 shows this architecture, which is
further described as follows:
1. The input vector is the word
embedding of each word in a given tweet. It
contains word-level information or
sentiment word-level information. Each
speci c case will be described in more detail
afterwards.
2. The RNN number of units is chosen
during training for optimization purposes.
In this work we use a one-layer LSTM
to avoid over tting of the network to the
training data.
3. The weight matrix has as input
dimension the RNN size, and the number of
classes as output dimension. This means
that, taking as inputs the last LSTM
output, we obtain a vector whose length
is the number of classes. This matrix is
also optimized during the training
process.
4. The nal probability vector is obtained
by passing the result of the previous
matrix multiplication through a softmax
function, which converts the values of
the components of this result vector into
probabilities representation. Finally, the
predicted label for the tweet is the
component of the output vector with the
highest probability.</p>
        <p>Following, the two types of inputs used are
described thoroughly.
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Word-level RNN</title>
        <p>For this input, the tweet text is tokenized into
word tokens, which are then expressed in a
one-hot representation. That is, each token is
represented as a IRjVj 1 vector with all 0s and
and one 1 at the index of that token in the
sorted token vocabulary. For example, the
representations for the tokens a, antes and
zebra would appear as:
wa = 1 0 0
0 ; wantes = 0 1 0
0
wzebra = 0 0 0
1</p>
        <p>We limit the number of words to a certain
vocabulary size in order to limit the
computational cost of this preprocessing step. Before
feeding this data to the network, each tweet
is presented by the one-hot representation of
all the tokens in the tweet.
3.3</p>
      </sec>
      <sec id="sec-3-3">
        <title>Sentiment word-level RNN</title>
        <p>Additionally, we include di erent sentiment
information into the word representations by
means of a sentiment lexicon. In this case,
a similar approach as the word-level RNN
is followed, but instead of using information
about the di erent words contained on each
tweet, information about the sentiment of
each word is used. In this case, the
preprocessing process is modi ed:
1. First, each tweet is split into tokens.
2. Secondly, a sentiment dictionary is used
to map words with sentiment polarity
values. In this way, each word is mapped
into a positive, neutral or negative value.
3. Finally, the representation of a word
consists in its word vector concatenated
with its sentiment polarity label.
3.4</p>
      </sec>
      <sec id="sec-3-4">
        <title>Regularization</title>
        <p>Given the reduced number of training
examples that is available for this task (Sec. 4) a
number of regularization techniques has been
used in the experiments. Regularization is
used in machine learning to control the
complexity of a learning model so it does not
over t to the training data and generalized
better to the test data.</p>
        <p>
          It is known that Recurrent Neural
Network tend to heavily over t to the training
set
          <xref ref-type="bibr" rid="ref18 ref2 ref6">(Zaremba, Sutskever, and Vinyals, 2014)</xref>
          .
For this, we employ two regularization
techniques to prevent this:
1. L2 regularization
          <xref ref-type="bibr" rid="ref10">(Ng, 2004)</xref>
          . This
technique is applied on the weights of the
feedforward layer of the network. Being
WMLP the weights of this layer, this
regularization adds to the cost function the
following value:
kW MTLP WMLP k
where is a parameter that represents
the importance that is assigned to this
regularization in the overall cost
function.
2. Dropout
          <xref ref-type="bibr" rid="ref12 ref3 ref4">(Srivastava et al., 2014; Gal
and Ghahramani, 2016b)</xref>
          . This strategy
consists in randomly setting a fraction
of units to 0 at each step of the training
process to prevent over tting. During
test time, the outputs are averaged by
this fraction. Dropout has been recently
found to be theoretically similar to
applying a bayesian prior to the network
weigths
          <xref ref-type="bibr" rid="ref3 ref4 ref5">(Gal and Ghahramani, 2016a)</xref>
          .
3.5
        </p>
      </sec>
      <sec id="sec-3-5">
        <title>TensorFlow implementation</title>
        <p>TensorFlow is an interface for expressing
machine learning algorithms, and an
implementation for executing such algorithms (Abadi,
Agarwal, and et al., 2015). For
implementing the model previously described, rst we
had to de ne a computation graph composed
by the RNN architecture, matrices and
operations needed. Once the graph is de ned,
the training process consists in iteratively
adjusting numerical values in order to reach the
best results. This task was done following
those ideas:</p>
        <p>The values to optimize are the internal
parameters and matrices that form the
network. Those are: the word
embedding representations, the LSTM internal
weights and the feedforward weight
matrix used as last layer. At the beginning
of training, those values are initialized
in a random way using a normal
distribution N ( ; ), with = 0, and are
considered variables to be optimized at
each training step by TensorFlow.</p>
        <p>
          Having those variables de ned, the
training process iteratively modi es
them in order to reach the better
results. In order to obtain a error signal
that can be used to modify the learning
parameters we use a cost function which
has to be minimized. That
minimization problem is solved by applying the
gradient descent method via
backpropagation
          <xref ref-type="bibr" rid="ref7">(LeCun et al., 2012)</xref>
          . In this work
we employ the Adam algorithm
          <xref ref-type="bibr" rid="ref18 ref2 ref6">(Kingma
and Ba, 2014)</xref>
          .
        </p>
        <p>In each iteration of the training process,
which are known as epochs, data from
the training set ows through all the
computation graph yielding to a
prediction result. The cost metric is computed
by comparing the obtained result with
the true training labels. When the
backpropagation is nished, the variable
values are updated and the following
iteration proceeds.</p>
        <p>In order to enhance performance, we use
early stopping on the accuracy on the
development set. That is, for each epoch
we monitor the performance of the
network in the development set. If it has
not improved for a number of epochs (in
this work, 3 epochs) the training
process is stopped and the model weights
are freezed.</p>
        <p>The number of iterations can be chosen
as well as other parameters such as the
RNN size. For testing new examples, we
use as input the test data, passing all
the tweets through our model having as
a result the vector of probabilities of the
class each tweet belongs to, choosing the
class with a higher probability value for
each tweet.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Experimental setup</title>
      <p>
        For the development of Task 1 a training
and development dataset is made public,
containing 1,514 labeled tweets which belong
to the InterTASS corpus. Additionally, we
use the TASS2015 edition training dataset
that was extracted from the general
corpus
        <xref ref-type="bibr" rid="ref5">(Garc a Cumbreras et al., 2016)</xref>
        . We
train the system with the InterTASS and the
TASS General Corpus training datasets, and
adjust the hyper-parameters with the
InterTASS development set. For the lexicon, we
used ElhPolar dictionary
        <xref ref-type="bibr" rid="ref14">(Urizar and Roncal,
2013)</xref>
        , as it has been previously used in TASS
competitions.
      </p>
      <p>There are three test datasets, one
belonging to the InterTASS corpus and two
belonging to the General Corpus of TASS: the full
version, with all the 60,798 tweets; and the
1k version, that contains a subset of 1,000
tweets.</p>
      <p>In order to enhance the classi cation
performance several hyper-parameters have been
explored, and the values that yield better
performance are selected to be used in the
testing phase. The vocabulary size is set to
20,000, with a batch size of 256 and the
num</p>
      <sec id="sec-4-1">
        <title>Model</title>
        <p>LSTM + MLP
LSTM + MLP</p>
        <p>LSTM + MLP
LSTM + MLP + Lexicon
LSTM + MLP + Lexicon
LSTM + MLP + Lexicon</p>
      </sec>
      <sec id="sec-4-2">
        <title>Corpus</title>
        <p>InterTASS
TASS (1k)
TASS (Full)
InterTASS
TASS (1k)
TASS (Full)
ber of epochs being 20. With this value, the
early stopping mechanism stopped the
training before its completion. Regarding the size
of the layers, the number of dimensions of the
word embeddings is set to 16, as well as it is
done with the number of units in the LSTM
layer. The dimensionality of the feedforward
layer is given by the output of the LSTM,
which is 16, and the number of classes of the
classi cation task (in this case, 4). Note that
these values are smaller than in the usual
neural architectures in order to further
prevent over tting. Also, we select the
parameter to 0.05, and the dropout rate to 0.7.
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Experimental Results</title>
      <p>Table 1 shows the results of the two variations
of the proposed model: LSTM+MLP stack
with or without lexicon values. In light of this
results it is possible to a rm that the used
architecture shows promising performances in
the task of sentiment analysis of tweets.
Although, the achieved performances are below
the best in this year challenge. This indicates
that further work should be done in order to
improve the results.</p>
      <p>The experimental results con rm the idea
that the introduction of a sentiment lexicon
into the word presentations results, in
general, bene cial for the nal performance. We
see this improvement in the InterTASS and
1k corpora. Nevertheless, when attending to
the Full corpus, a performance decrease in
the Marco-F1 is observed.
6</p>
    </sec>
    <sec id="sec-6">
      <title>Conclusions and Future Work</title>
      <p>In this paper we have described the
participation of the GSI in the TASS 2017 challenge.
Our proposal relies on a Recurrent Neural
Network architecture for Sentiment Analysis
with Long Short-Term Memory cells. This
network can be fed with both word vectors
and sentiment lexicon values. This approach
is able to represent a arbitrarily long
sequence of text due to the dynamic recurrent
structure of the architecture. Also, several
techniques have been used for avoiding
overtting. From the experiments, it is seen that
adding a sentiment lexicon can enhance the
classi cation performance.</p>
      <p>However, the proposed model does not
compare with the best results in the TASS
competition. This can be due to a number
of reasons, but the training process suggests
that over tting is a relevant issue. Although
bene t comes from the use of regularization
techniques, the network is not able to largely
generalize. To address this, we think that
future work in this direction should include the
expansion of the training set.</p>
      <p>Other possible improvement for future
work is doing a better preprocessing of
input texts at word level. In addition,
Convolutional Neural Networks could be used for
feature extraction in combination with the
Recurrent Neural Network architecture. This
could lead to the computation of most
complex features, which could also yield better
results.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgement</title>
      <p>
        The authors gratefully acknowledge the
support of NVIDIA Corporation with
the donation of the Titan X Pascal GPU
used in this research. This research
work is partially supported through the
projects Semola
        <xref ref-type="bibr" rid="ref13">(TEC2015-68284-R)</xref>
        ,
EmoSpaces (RTC-2016-5053-7), MOSI-AGIL
        <xref ref-type="bibr" rid="ref14">(S2013/ICE-3019)</xref>
        , Somedi (ITEA3 15011)
and Trivalent (H2020 Action Grant No.
740934, SEC-06-FCT-2016).
      </p>
    </sec>
    <sec id="sec-8">
      <title>Bibliograf a</title>
      <p>Abadi, M., A. Agarwal, and P. B. et al. 2015.</p>
      <p>TensorFlow: Large-scale machine learning
on heterogeneous systems. Software
available from tensor ow.org.</p>
      <p>Araque, O., I. Corcuera, C. Roman, C. A.
Iglesias, and J. F. Sanchez-Rada. 2015.
Aspect based sentiment analysis of
spanish tweets. In TASS@ SEPLN, pages 29{
34.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <surname>Araque</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
            Corcuera-Platas,
            <given-names>J. F.</given-names>
          </string-name>
          <string-name>
            <surname>Sanchez-Rada</surname>
            , and
            <given-names>C. A.</given-names>
          </string-name>
          <string-name>
            <surname>Iglesias</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Enhancing Deep Learning Sentiment Analysis with Ensemble Techniques in Social Applications</article-title>
          .
          <source>Expert Systems with Applications</source>
          , June.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <surname>Bahdanau</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Cho</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bengio</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Neural machine translation by jointly learning to align and translate</article-title>
          .
          <source>arXiv preprint arXiv:1409</source>
          .
          <fpage>0473</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <surname>Gal</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          and
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ghahramani</surname>
          </string-name>
          . 2016a.
          <article-title>Dropout as a bayesian approximation: Representing model uncertainty in deep learning</article-title>
          .
          <source>In international conference on machine learning</source>
          , pages
          <volume>1050</volume>
          {
          <fpage>1059</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>Gal</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          and
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ghahramani</surname>
          </string-name>
          .
          <year>2016b</year>
          .
          <article-title>A theoretically grounded application of dropout in recurrent neural networks</article-title>
          .
          <source>In Advances in neural information processing systems</source>
          , pages
          <volume>1019</volume>
          {
          <fpage>1027</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>Garc a Cumbreras</surname>
            ,
            <given-names>M. A.</given-names>
          </string-name>
          , E. Mart nez Camara,
          <source>J. Villena Roman, and J. Garc a Morera</source>
          .
          <year>2016</year>
          .
          <article-title>Tass 2015{the evolution of the spanish opinion mining systems</article-title>
          .
          <source>Procesamiento del Lenguaje Natural</source>
          ,
          <volume>56</volume>
          :
          <fpage>33</fpage>
          {
          <fpage>40</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>Kingma</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Ba</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Adam: A method for stochastic optimization</article-title>
          .
          <source>arXiv preprint arXiv:1412</source>
          .
          <fpage>6980</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>LeCun</surname>
            ,
            <given-names>Y. A.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Bottou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. B.</given-names>
            <surname>Orr</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          K.-R. Muller.
          <year>2012</year>
          .
          <article-title>E cient backprop</article-title>
          .
          <source>In Neural networks: Tricks of the trade. Springer</source>
          , pages
          <volume>9</volume>
          {
          <fpage>48</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <surname>Mart</surname>
            nez-Camara,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>M. C.</surname>
          </string-name>
          <article-title>D az-</article-title>
          <string-name>
            <surname>Galiano</surname>
            ,
            <given-names>M. A.</given-names>
          </string-name>
          <string-name>
            <surname>Garc</surname>
            a-Cumbreras,
            <given-names>M.</given-names>
          </string-name>
          <article-title>Garc aVega, and</article-title>
          <string-name>
            <given-names>J.</given-names>
            <surname>Villena-Roman</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Overview of tass 2017</article-title>
          . In J. Villena Roman,
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Garc a Cumbreras</surname>
          </string-name>
          ,
          <string-name>
            <surname>D. G. M. C. Mart</surname>
            nez-Camara, Eugenio, and
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Garc</surname>
          </string-name>
          a Vega, editors,
          <source>Proceedings of TASS 2017: Workshop on Semantic Analysis at SEPLN (TASS</source>
          <year>2017</year>
          ), volume
          <volume>1896</volume>
          <source>of CEUR Workshop Proceedings</source>
          , Murcia, Spain, September. CEURWS.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <surname>Mart</surname>
            nez-Camara, E.,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Gutierrez-Vazquez</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Fernandez</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Montejo-Raez</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>R.</given-names>
            <surname>Munoz-Guillena</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Ensemble classi er for twitter sentiment analysis</article-title>
          . In R. Izquierdo, editor,
          <source>Proceedings of the Workshop on NLP Applications: completing the puzzle, number 1386 in CEUR Workshop Proceedings</source>
          , Aachen.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <surname>Ng</surname>
            ,
            <given-names>A. Y.</given-names>
          </string-name>
          <year>2004</year>
          .
          <article-title>Feature selection, l 1 vs. l 2 regularization, and rotational invariance</article-title>
          .
          <source>In Proceedings of the twenty- rst international conference on Machine learning, page 78</source>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <surname>Socher</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Perelygin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. Y.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chuang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Manning</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. Y.</given-names>
            <surname>Ng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Potts</surname>
          </string-name>
          , et al.
          <year>2013</year>
          .
          <article-title>Recursive deep models for semantic compositionality over a sentiment treebank</article-title>
          .
          <source>In Proceedings of the conference on empirical methods in natural language processing (EMNLP)</source>
          , volume
          <volume>1631</volume>
          , page 1642.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <surname>Srivastava</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>G. E.</given-names>
            <surname>Hinton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Krizhevsky</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Sutskever</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Salakhutdinov</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Dropout: a simple way to prevent neural networks from over tting</article-title>
          .
          <source>Journal of Machine Learning Research</source>
          ,
          <volume>15</volume>
          (
          <issue>1</issue>
          ):
          <year>1929</year>
          {
          <year>1958</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <surname>Tai</surname>
            ,
            <given-names>K. S.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Socher</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Manning</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Improved semantic representations from tree-structured long shortterm memory networks</article-title>
          .
          <source>arXiv preprint arXiv:1503</source>
          .
          <fpage>00075</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <surname>Urizar</surname>
            ,
            <given-names>X. S. and I. S. V.</given-names>
          </string-name>
          <string-name>
            <surname>Roncal</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Elhuyar at tass 2013</article-title>
          .
          <source>In Proceedings of the Workshop on Sentiment Analysis at SEPLN (TASS</source>
          <year>2013</year>
          ), pages
          <fpage>143</fpage>
          {
          <fpage>150</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <surname>Vilares</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Doval</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Alonso</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Gomez-Rodr guez</surname>
          </string-name>
          .
          <year>2015</year>
          . Lys at tass 2015:
          <article-title>Deep learning experiments for sentiment analysis on spanish tweets</article-title>
          .
          <source>In TASS@ SEPLN</source>
          , pages
          <volume>47</volume>
          {
          <fpage>52</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Wang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Predicting polarities of tweets by composing word embeddings with long short-term memory</article-title>
          .
          <source>In ACL (1)</source>
          , pages
          <fpage>1343</fpage>
          {
          <fpage>1353</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhu</surname>
          </string-name>
          , and
          <string-name>
            <given-names>L.</given-names>
            <surname>Zhao</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Attention-based lstm for aspectlevel sentiment classi cation</article-title>
          .
          <source>In EMNLP</source>
          , pages
          <volume>606</volume>
          {
          <fpage>615</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          <string-name>
            <surname>Zaremba</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          , I. Sutskever, and
          <string-name>
            <given-names>O.</given-names>
            <surname>Vinyals</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Recurrent neural network regularization</article-title>
          .
          <source>arXiv preprint arXiv:1409</source>
          .
          <fpage>2329</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>