<!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>Atalaya at TASS 2018: Sentiment Analysis with Tweet Embeddings and Data Augmentation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Franco M. Luque</string-name>
          <email>francolq@famaf.unc.edu.ar</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Juan Manuel Perez</string-name>
          <email>jmperez@dc.uba.ar</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Universidad Nacional de Cordoba &amp; CONICET</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Universidad de Buenos Aires &amp; CONICET</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2018</year>
      </pub-date>
      <fpage>29</fpage>
      <lpage>35</lpage>
      <abstract>
        <p>TASS 2018 workshop proposes di erent challenges on semantic analysis in Spanish. This work presents our participation as team Atalaya in the task of polarity classi cation of tweets. We followed standard techniques in preprocessing, representation and classi cation, and also explored some novel ideas. In particular, to obtain tweet embeddings we trained subword-aware word embeddings and use a weighted scheme to average them. To deal with over tting problems caused by training data scarcity, we tried a data augmentation strategy based on two-way machine translation. Experiments with linear classi ers and neural models show competitive results for the di erent subtasks proposed in the challenge.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>The TASS workshop presents every year
different challenges related to sentiment
analysis in Spanish. One of the main tasks is
polarity classi cation of tweets and tweet aspects.</p>
      <p>
        In particular, task 1 of TASS 2018
        <xref ref-type="bibr" rid="ref11">(Mart
nezCamara et al., 2018)</xref>
        proposes polarity
classi cation on tweet datasets from three di
erent Spanish speaking countries: Spain (ES),
Costa Rica (CR) and Peru (PE). This
article describes our participation in TASS 2018
task 1 with team Atalaya. We present
polarity classi cation systems using standard
techniques and propose improvements based on
an iterative experimental development
process. We tried di erent approaches for tweet
preprocessing, vector representation and
polarity classi cation models. Standard
preprocessing techniques, including text
simpli cation, stopword ltering, lemmatization
and negation handling were used. Tweets
were represented with bag-of-words,
bag-ofcharacters, tweet embeddings and
combinations of these. As classi cation models, we
considered linear classi ers and neural
networks.
      </p>
      <p>We used fastText subword-aware word
vectors using tweet datasets speci cally
pre</p>
      <p>Copyright © 2018 by the paper's authors. Copying permitted for private and academic purposes.
pared for the task. Tweet vectors were
computed from word vectors using a weighted
averaging scheme, with weights inversely
proportional to word frequency.</p>
      <p>To cope with scarcity of training data, we
experimented with a data augmentation trick
based on translation of training data to other
languages and back to Spanish.</p>
      <p>Embedding weighting and data
augmentation represent novel approaches in the
context of TASS. In experiments, both ideas
showed improvements in prediction quality
for some con gurations.</p>
      <p>The rest of the paper is as follows: Next
section describes the main techniques and
resources we tried; section 3 presents the
experimental development of the systems,
describing explored con gurations and nal models
selection; and section 4 summarizes our
nal results for the competition, and addresses
conclusions and future work.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Techniques and Resources</title>
      <p>This section describes the main techniques
and resources we used to de ne the basic
components to build our systems.
2.1</p>
      <sec id="sec-2-1">
        <title>Preprocessing</title>
        <p>Preprocessing is crucial in NLP
applications, specially when working with noisy
user-generated data.</p>
        <p>We divided preprocessing into a two-stage
process: First, we de ned basic tweet
preprocessing, using well-known standard and
general purpose techniques; then, we de ned
sentiment-oriented preprocessing, using
techniques that try to emphasize semantic
information.</p>
        <p>Basic tweet preprocessing includes:</p>
        <p>
          Tokenization using NLTK tweet
tokenizer
          <xref ref-type="bibr" rid="ref3">(Bird and Loper, 2004)</xref>
          .
        </p>
        <p>Replacement of handles with token
'@USER', URLs with 'URL', and e-mails
with 'user@mail.com'.</p>
        <p>Replacement of four or more repeated
letters with three letters.</p>
        <p>Sentiment-oriented preprocessing includes
the following additional steps:</p>
        <sec id="sec-2-1-1">
          <title>Lowercasing.</title>
          <p>Removal of stopwords, using NLTK
Spanish stopword list.</p>
        </sec>
        <sec id="sec-2-1-2">
          <title>Removal of numbers.</title>
          <p>using</p>
        </sec>
        <sec id="sec-2-1-3">
          <title>TreeTagger</title>
        </sec>
        <sec id="sec-2-1-4">
          <title>Lemmatization</title>
          <p>
            <xref ref-type="bibr" rid="ref15">(Schmid, 1995)</xref>
            .
          </p>
          <p>Simple negation handling: We nd
negation words and add the pre x 'NOT ' to
the following tokens. Up to three tokens
are negated, or less if a non-word token
is found. (Das et al., 2001; Pang, Lee,
and Vaithyanathan, 2002)</p>
        </sec>
        <sec id="sec-2-1-5">
          <title>Removal of punctuation.</title>
          <p>Removal of consecutive repetitions of
handles and URLs.</p>
          <p>No treatment was performed to
hashtags, emojis, interjections and onomatopeias.
Moreover, no spelling correction nor any
other additional normalization was applied.
2.2</p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>Bags of Words and Characters</title>
        <p>The simplest approach we considered to build
tweet representations was the bag-of-words
encoding. A bag-of-words (BOW) builds
feature vectors for each token seen in training
data. For a particular tweet, its BOW
vector contains the number of ocurrences of each
token in the tweet. Resulting vectors are
high-dimensional and sparse. Variations of
BOWs include counting not only single
tokens but also n-grams of tokens, binarizing
counts, and limiting the number of features.</p>
        <p>Character usage in tweets may also hold
useful information for sentiment analysis.
Character n-grams |such as presence and
repetition of uppercase letters, emoticons and
exclamation marks| may indicate strong
presence of sentiment of some kind, where
others may indicate a more formal writing
style, and therefore an absence of sentiment.</p>
        <p>To capture this information, we
considered a bag-of-characters (BOC)
representation that encodes counts of character n-grams
for some values of n. These vectors are
computed from original texts of tweets, with no
preprocessing at all. BOCs have the same
variants and parameters as BOWs.
2.3</p>
      </sec>
      <sec id="sec-2-3">
        <title>Word Embeddings</title>
        <p>
          Word embeddings are low-dimensional dense
vector representations of words
          <xref ref-type="bibr" rid="ref12">(Mikolov et
al., 2013)</xref>
          . These representations encode
syntactical and semantical relations of words,
useful for NLP tasks, and they can be learned
in an unsupervised fashion using large
quantities of plain text, providing high vocabulary
coverage. When precomputed embeddings
are used as features in supervised tasks, they
provide robust information for words that are
rare or unseen in training data. This is
particularly useful when training data is scarce,
as in this competition.
        </p>
        <p>Recent work on embeddings introduced
the usage of subword information to
compute word vectors. Informative
representations for out-of-vocabulary (OOV) words can
be obtained from subword embeddings. OOV
words are an important issue when working
with highly noisy data such as user generated
data in social networks. Here, the need for
text normalization in preprocessing can be
alleviated with subword-based embeddings.</p>
        <p>
          In our work, we used fastText
subwordbased embeddings library
          <xref ref-type="bibr" rid="ref4">(Bojanowski et al.,
2016)</xref>
          . Instead of using pretrained vectors,
we decided to train our own embeddings on
Twitter data.
        </p>
        <p>To address the multilingual character of
the challenge, we rst collected a database
of 90 million tweets from various
Spanishspeaking countries, including the ones
concerning the challenge. Then, we prepared
two versions of the data, one using only basic
preprocessing, and the other one using
sentiment oriented preprocessing (only excepting
lemmatization). For these two datasets, we
trained skipgram embeddings using di erent
parameter con gurations, including the
number of dimensions, size of word and subword
n-grams and size of context window.
2.4</p>
      </sec>
      <sec id="sec-2-4">
        <title>Tweet Embeddings</title>
        <p>
          There are a number of ways of using word
embeddings for sentiment analysis on tweets:
approaches go from simple averaging of
vectors for each word in the tweet, to the use
of more complex architectures such as CNNs
or RNNs. In this work, we used
averaging to compute a single tweet embedding
of same dimensionality as the original word
embeddings. We followed two simple
approaches: plain averaging and weighted
averaging. For weighted averaging, we used a
scheme that resembles Smooth Inverse
Frequency (SIF)
          <xref ref-type="bibr" rid="ref1">Arora, Liang, and Ma (2017</xref>
          ),
inspired by TF-IDF reweighting. Each word
a
w is weighted with a+p(w) , where p(w) is the
word unigram probability, and a is a
smoothing hyper-parameter. Big values of a means
more smoothing towards plain averaging.
        </p>
        <p>We also considered two options that
affect tweet embeddings: binarization, which
ignores token repetitions in tweets; and
normalization, which scales resulting tweet
vectors to have unit norm.
2.5</p>
      </sec>
      <sec id="sec-2-5">
        <title>Data Augmentation</title>
        <p>
          As the amount of training instances was
small, we paid special attention to model
regularization. A technique used to
address this is data augmentation, which
consists of creating new synthetic instances out
of real ones by applying label-preserving
transformations. This over tting-reduction
strategy is widely used in Computer Vision
          <xref ref-type="bibr" rid="ref10 ref16 ref2">(Krizhevsky, Sutskever, and Hinton, 2012;
Simard, Steinkraus, and Platt, 2003)</xref>
          and
Speech Recognition
          <xref ref-type="bibr" rid="ref5 ref8 ref9">(Jaitly and Hinton, 2013;
Ko et al., 2015)</xref>
          . For instance, images can be
zoomed, cropped, rotated, etc., while keeping
the objects in it still recognizable.
        </p>
        <p>
          Data augmentation in NLP is a more
subtle problem: there are no straightforward
invariant-transformations such as in
Computer Vision. A common technique
          <xref ref-type="bibr" rid="ref17">(Zhang,
Zhao, and LeCun, 2015)</xref>
          is to replace words
with synonyms using a thesaurus.
        </p>
        <p>In this work we adopted a novel
technique successfully used in a recent Kaggle
NLP competition.1 The technique consists of
translating the texts to a di erent language,
and then translating them back to the
original one. This process results in tweets that
vary lexically and syntactically, while mostly
keeping its meaning.</p>
        <p>The tool selected to do this work was
Google Translate, and the languages used
as intermediates were English, French,
Portuguese and Arabic. We discarded other
options (e.g. Mandarin Chinese) as they greatly
altered the meaning of tweets. Table 1
displays examples of tweets and the resulting
arti cial instances.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Systems Development</title>
      <p>This section describes the polarity classi
cation systems we developed using the tools
introduced in the previous section.</p>
      <p>We worked on two type of classi ers:
linear classi ers and neural networks. In both
cases, we tried to do some kind of model
selection, at times using development as the
optimization target, and at other times using
cross-validation on the combination of train
and development.</p>
      <p>1https://www.kaggle.com/c/jigsaw-toxiccomment-classi cation-challenge/discussion/52557
Original Tweet Data-augmented tweets
Gracias por la informacion. Parece que el olor ha - Gracias por la informacion. Parece que el olor se ha detenido. Ayer
cesado. Ayer paso lo mismo sobre la misma hora sucedio lo mismo al mismo tiempo
- Gracias por la informacion. Parece que el olor se ha detenido. Ayer, lo
mismo ocurrio al mismo tiempo
Muy buenas amigos! Como podemos contactar - &lt;Muy buenos amigos! &gt;Como podemos ponernos en contacto con usted?
con ustedes - Muy buenos amigos! &gt;Como podemos contactarlo?
La verdad es que tiene buena pinta. Investigare, - La verdad es que parece bueno. Voy a investigar, gracias
gracias - La verdad es que se ve bien. Voy a investigar, gracias
- El hecho es que se ven bien. Lo comprobare, gracias</p>
      <p>Next subsections describe the
experimental development and the best con gurations
we found for both types of system
3.1</p>
      <sec id="sec-3-1">
        <title>Linear Classi ers</title>
        <p>
          We rst built a classifying pipeline using
simple linear classifying models |such as
logistic regressions and SVMs| that were
implemented with scikit-learn
          <xref ref-type="bibr" rid="ref14">(Pedregosa et al.,
2011)</xref>
          . Next, we describe the model
selection process, done almost entirely using the
InterTASS ES corpus.
        </p>
        <p>As input features, we combined the three
representations described in the previous
section: bag-of-words, bag-of-characters and
tweet embeddings.</p>
        <p>For the bag of words and characters, early
experiments showed a clear advantage of
binary values over counts, together with
TFIDF re-weighting. First choices for n-gram
ranges were (1, 2) for words and (1, 3) for
characters.</p>
        <p>For the embeddings, sentiment-oriented
word vectors showed an advantage over
basic vectors. We tried embeddings of
dimensions 50, 100, 200 and 300. Best results were
found with 50 dimensions, and there were no
statistically signi cant di erences.</p>
        <p>To compute tweet embeddings, we tried
basic averaging (as provided by fastText ) and
the weighted averaging scheme described in
section 2.4. We experimented with
smoothing values a = 10n for n 2 f 3; : : : ; 3g
resulting in a signi cant advantage of using
a = 0:1. Here, binarization and
normalization as described in section 2.4 showed better
results.</p>
        <p>For the classi er, we tried logistic
regressions (LRs) and linear-kernel SVMs. To
alleviate the class imbalance problem,
training items were weighted according to the
inverse of the class frequency. Both LR and
linear SVM hyper-parameters were selected
targeting the optimization of accuracy and</p>
        <sec id="sec-3-1-1">
          <title>Model LR LR+DA LR</title>
          <p>LR+DA</p>
          <p>BOW BOC
(1, 2) (1, 3)
(1, 2) (1, 3)
(1, 5) (1, 6)
(1, 5) (1, 6)</p>
          <p>Macro-F1 over InterTASS ES development
set. In particular, the best regularization
parameters found were C = 1:0 for LRs, and
C = 0:05 for SVMs. Logistic regressions were
selected over SVMs as they performed
consistently better in all experiments.</p>
          <p>When adding augmented data, rst
results showed a signi cant degradation in
accuracy. However, an exploration of
parameter values showed that it allowed an
improvement in performance when increasing the
range of n-gram sizes considered for BOWs
and BOCs. Best results were found with up
to 5-grams for words, and up to 6-grams for
characters. Tab. 2 shows how data
augmentation combined with bigger n-gram ranges
improved results.</p>
          <p>Most previous parameter selection was
reviewed after data augmentation, con rming
selected values. We also tried adding
training data from General TASS corpus, to nd
that this was harmful for our models. With
the optimal models found in this process we
submitted nal results for the Spanish (ES)
monolingual task.</p>
          <p>For Costa Rica (CR) and Peru (PE)
monolingual tasks, same values than for
ES were used for most parameters. Only
weighted averaging, data augmentation and
n-gram ranges were explored. In CR data,
weighting improved results, with the peak at</p>
          <p>InputLayer
dense_1: Dense
dropout_1: Dropout</p>
          <p>dense_2: Dense
dropout_2: Dropout</p>
          <p>Output: Softmax
a = 0:5. Data augmentation also was good,
with the best results using up to 4-grams for
words and 6-grams for characters. In PE
data, neither weighting nor data
augmentation were helpful. Best results were found
using up to 2-gram for words and 5-grams
for characters.
3.2</p>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>Multilayer Perceptron</title>
        <p>
          In the second set of experiments we used
multilayer perceptrons (MLP) neural networks.
MLPs performed well in previous editions of
the challenge
          <xref ref-type="bibr" rid="ref7">(D az-Galiano et al., 2018)</xref>
          .
        </p>
        <p>Fig. 1 displays the chosen architecture,
consisting of two hidden layers and a softmax
output. ReLU units were used as activation
functions in the hidden layers. To avoid
overtting, we tried dropout (Srivastava et al.,
2014) and early stopping.</p>
        <p>
          To nd the best con gurations, we
performed random search
          <xref ref-type="bibr" rid="ref10 ref2">(Bergstra and
Bengio, 2012)</xref>
          using 5-fold cross-validation over
the InterTASS ES training and development
datasets. The explored con gurations and
hyperparameters were:
        </p>
        <p>BOW features: No BOW features at all,
top-50 or top-150.</p>
        <p>Tweet embeddings: Basic or weighted
averaging.</p>
        <p>Hidden layers: Di erent number of
neu</p>
        <sec id="sec-3-2-1">
          <title>Task</title>
        </sec>
        <sec id="sec-3-2-2">
          <title>Mono ES</title>
        </sec>
        <sec id="sec-3-2-3">
          <title>Mono CR</title>
        </sec>
        <sec id="sec-3-2-4">
          <title>Mono PE</title>
        </sec>
        <sec id="sec-3-2-5">
          <title>Cross Lingual ES Cross Lingual PE Cross Lingual CR</title>
        </sec>
        <sec id="sec-3-2-6">
          <title>Model</title>
          <p>MLP
LR
MLP
LR
MLP
LR
MLP</p>
          <p>rons and keep-probabilities2.</p>
          <p>Results of this search showed that
bag-ofwords features and embedding weighting did
not improve performance. Regarding the
MLP architecture, we selected 256 as the
size of the rst layer and 128 for the
second, and keep-probabilities of 0:25 and 0:55
respectively. This con guration was used in
all subtasks.</p>
          <p>Data augmentation in combination with
MLPs showed mixed results. For the
monolingual ES subtask, using synthetic data
resulted in a Macro-F1 gain while for
monolingual PE it degraded the results.</p>
          <p>All monolingual models were trained
using the respective train sections of InterTASS
datasets. General TASS was not used as it
not showed improvements. For cross-lingual
tasks, models for each language were trained
using the datasets for the two other
languages.</p>
          <p>
            We used Keras
            <xref ref-type="bibr" rid="ref17 ref5">(Chollet and others, 2015)</xref>
            to implement the model and scikit-learn
            <xref ref-type="bibr" rid="ref14">(Pedregosa et al., 2011)</xref>
            to perform the
crossvalidation.
4
          </p>
          <p>Conclusions and Future Work
We presented our participation on TASS 2018
task 1 as team Atalaya. We explored
standard approaches as well as some simple but
original recent ideas such as data
augmentation and word embedding weighting. Table
3 displays results for each subtask. Our
systems ranked among the rst three in all the
subtasks.</p>
          <p>Experiments show that competitive
results can be achieved without having to
resort to complex neural architectures such as
CNNs, RNNs, LSTMs, etc. Even simple
lo2Probability of keeping the value of a neuron when
training with dropout.
gistic regressions were able to rank among the
top performing systems.</p>
          <p>Future work includes further exploration
on data augmentation, tweet embedding
techniques, and sentiment-oriented word
embeddings. We also aim at improving
preprocessing and adopting modern neural
classifying models.
neural networks applied to visual
document analysis. In null, page 958. IEEE.</p>
        </sec>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <surname>Arora</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Ma</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>A simple but tough-to-beat baseline for sentence embeddings</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <surname>Bergstra</surname>
            , J. and
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Bengio</surname>
          </string-name>
          .
          <year>2012</year>
          .
          <article-title>Random search for hyper-parameter optimization</article-title>
          .
          <source>Journal of Machine Learning Research</source>
          ,
          <volume>13</volume>
          (Feb):
          <volume>281</volume>
          {
          <fpage>305</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <surname>Bird</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          and
          <string-name>
            <given-names>E.</given-names>
            <surname>Loper</surname>
          </string-name>
          .
          <year>2004</year>
          .
          <article-title>Nltk: the natural language toolkit</article-title>
          .
          <source>In Proceedings of the ACL 2004 on Interactive poster and demonstration sessions, page 31</source>
          .
          <article-title>Association for Computational Linguistics</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>Bojanowski</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , E. Grave,
          <string-name>
            <given-names>A.</given-names>
            <surname>Joulin</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Mikolov</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Enriching word vectors with subword information</article-title>
          .
          <source>arXiv preprint arXiv:1607</source>
          .
          <fpage>04606</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>Chollet</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          et al.
          <year>2015</year>
          . Keras.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>Das</surname>
            ,
            <given-names>S. R.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>M. Y.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. V.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Brooks</surname>
          </string-name>
          , Y. shee
          <string-name>
            <surname>Chan</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Gibson</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Leinweber</surname>
            ,
            <given-names>A</given-names>
          </string-name>
          . Martinez-jerez, P. Raghubir,
          <string-name>
            <given-names>S.</given-names>
            <surname>Rajagopalan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ranade</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Rubinstein</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Tufano</surname>
          </string-name>
          .
          <year>2001</year>
          .
          <article-title>Yahoo! for amazon: Sentiment extraction from small talk on the web</article-title>
          .
          <source>In 8th Asia Paci c Finance Association Annual Conference.</source>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <article-title>D az-</article-title>
          <string-name>
            <surname>Galiano</surname>
            ,
            <given-names>M. C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>E.</surname>
          </string-name>
          <article-title>Mart nez-</article-title>
          <string-name>
            <surname>Camara</surname>
            ,
            <given-names>M. Angel</given-names>
          </string-name>
          <string-name>
            <surname>Garc</surname>
            a Cumbreras,
            <given-names>M. G.</given-names>
          </string-name>
          <string-name>
            <surname>Vega</surname>
            , and
            <given-names>J. V.</given-names>
          </string-name>
          <string-name>
            <surname>Roman</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>The democratization of deep learning in tass 2017</article-title>
          .
          <source>Procesamiento del Lenguaje Natural</source>
          ,
          <volume>60</volume>
          (
          <issue>0</issue>
          ):
          <volume>37</volume>
          {
          <fpage>44</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <surname>Jaitly</surname>
            , N. and
            <given-names>G. E.</given-names>
          </string-name>
          <string-name>
            <surname>Hinton</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Vocal tract length perturbation (vtlp) improves speech recognition</article-title>
          .
          <source>In Proc. ICML Workshop on Deep Learning for Audio, Speech and Language</source>
          , volume
          <volume>117</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <surname>Ko</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Peddinti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Povey</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Khudanpur</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Audio augmentation for speech recognition</article-title>
          .
          <source>In Sixteenth Annual Conference of the International Speech Communication Association.</source>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <surname>Krizhevsky</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>I. Sutskever</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G. E.</given-names>
            <surname>Hinton</surname>
          </string-name>
          .
          <year>2012</year>
          .
          <article-title>Imagenet classi cation with deep convolutional neural networks</article-title>
          .
          <source>In Advances in neural information processing systems</source>
          , pages
          <volume>1097</volume>
          {
          <fpage>1105</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <surname>Mart</surname>
            nez-Camara, E.,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Almeida Cruz</surname>
          </string-name>
          , M. C.
          <article-title>D az-</article-title>
          <string-name>
            <surname>Galiano</surname>
            ,
            <given-names>S. Estevez</given-names>
          </string-name>
          <string-name>
            <surname>Velarde</surname>
            ,
            <given-names>M. A.</given-names>
          </string-name>
          <string-name>
            <surname>Garc</surname>
            a-Cumbreras, M. Garc aVega,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Gutierrez Vazquez</surname>
            ,
            <given-names>A. Montejo</given-names>
          </string-name>
          <string-name>
            <surname>Raez</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Montoyo</surname>
            <given-names>Guijarro</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Mun</surname>
          </string-name>
          <article-title>~oz Guillena, A. Piad Mor s, and</article-title>
          <string-name>
            <given-names>J.</given-names>
            <surname>Villena-Roman</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Overview of TASS 2018: Opinions, health and emotions</article-title>
          . In E. Mart
          <string-name>
            <surname>nez-Camara</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Almeida Cruz</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. C. D azGaliano</surname>
            ,
            <given-names>S. Estevez</given-names>
          </string-name>
          <string-name>
            <surname>Velarde</surname>
            ,
            <given-names>M. A.</given-names>
          </string-name>
          <string-name>
            <surname>Garc</surname>
            a-Cumbreras,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Garc</surname>
            a-Vega,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Gutierrez Vazquez</surname>
            ,
            <given-names>A. Montejo</given-names>
          </string-name>
          <string-name>
            <surname>Raez</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Montoyo</surname>
            <given-names>Guijarro</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Mun</surname>
          </string-name>
          <article-title>~oz Guillena, A. Piad Mor s, and</article-title>
          J. Villena-Roman, editors,
          <source>Proceedings of TASS 2018: Workshop on Semantic Analysis at SEPLN (TASS</source>
          <year>2018</year>
          ), volume
          <volume>2172</volume>
          <source>of CEUR Workshop Proceedings</source>
          , Sevilla, Spain, September. CEUR-WS.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          , I. Sutskever,
          <string-name>
            <given-names>K.</given-names>
            <surname>Chen</surname>
          </string-name>
          , G. Corrado, and
          <string-name>
            <given-names>J.</given-names>
            <surname>Dean</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Distributed representations of words and phrases and their compositionality</article-title>
          .
          <source>CoRR, abs/1310</source>
          .4546.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <surname>Pang</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Lee</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Vaithyanathan</surname>
          </string-name>
          .
          <year>2002</year>
          .
          <article-title>Thumbs up? sentiment classi - cation using machine learning techniques</article-title>
          .
          <source>In Proceedings of the 2002 Conference on Empirical Methods in Natural Language Processing</source>
          , pages
          <volume>79</volume>
          {
          <fpage>86</fpage>
          .
          <article-title>Association for Computational Linguistics</article-title>
          ,
          <year>July</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <surname>Pedregosa</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Varoquaux</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gramfort</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Michel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Thirion</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Grisel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Blondel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Prettenhofer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Weiss</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Dubourg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Vanderplas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Passos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Cournapeau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Brucher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Perrot</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E.</given-names>
            <surname>Duchesnay</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>Scikit-learn: Machine learning in Python</article-title>
          .
          <source>Journal of Machine Learning Research</source>
          ,
          <volume>12</volume>
          :
          <fpage>2825</fpage>
          {
          <fpage>2830</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <surname>Schmid</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <year>1995</year>
          .
          <article-title>Improvements in partof-speech tagging with an application to german</article-title>
          . In
          <source>In Proceedings of the ACL SIGDAT-Workshop</source>
          , pages
          <volume>47</volume>
          {
          <fpage>50</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <string-name>
            <surname>Simard</surname>
            , P. Y.,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Steinkraus</surname>
            , and
            <given-names>J. C.</given-names>
          </string-name>
          <string-name>
            <surname>Platt</surname>
          </string-name>
          .
          <year>2003</year>
          .
          <article-title>Best practices for convolutional Srivastava</article-title>
          , N.,
          <string-name>
            <given-names>G.</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>The Journal of Machine Learning Research</source>
          ,
          <volume>15</volume>
          (
          <issue>1</issue>
          ):
          <year>1929</year>
          {
          <year>1958</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhao</surname>
          </string-name>
          , and
          <string-name>
            <surname>Y. LeCun.</surname>
          </string-name>
          <year>2015</year>
          .
          <article-title>Character-level convolutional networks for text classi cation</article-title>
          . In C. Cortes,
          <string-name>
            <given-names>N. D.</given-names>
            <surname>Lawrence</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. D.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sugiyama</surname>
          </string-name>
          , and R. Garnett, editors,
          <source>Advances in Neural Information Processing Systems</source>
          <volume>28</volume>
          . Curran Associates, Inc., pages
          <volume>649</volume>
          {
          <fpage>657</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>