<!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>Classi er Ensembles That Push the State-of-the-Art in Sentiment Analysis of Spanish Tweets</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Jhon Adrian Ceron-Guzman Santiago de Cali</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Valle del Cauca</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Colombia jadrian.ceron@gmail.com</string-name>
        </contrib>
      </contrib-group>
      <fpage>59</fpage>
      <lpage>64</lpage>
      <abstract>
        <p>This paper describes the JACERONG system proposed to participate in TASS-2017 Task 1. For such a benchmark evaluation, two ensemble methods widely utilized because of their proved ability to increase prediction accuracy were implemented, namely: averaging and stacking. First of all, (relatively) highly correct classi ers utilize supervised learning algorithms to predict a class label or probability estimates. Then, predictions from these classi ers are optimally combined in order to obtain a better nal prediction. Finally, how to choose which classi ers constitute an ensemble was also an important issue addressed in this work. Experimental results show that the proposed system is top-ranked on the test set of the InterTASS corpus, according to the accuracy metric. Together with this, results indicate that the predictive performance on the whole test set of the General Corpus of TASS outperforms the best result achieved in the four-label evaluation of the previous edition of TASS, in terms of the Macro-F1 metric.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Nowadays, `tweeting' has become an activity
par excellence to say what one thinks or feels.</p>
      <p>Thus, the large amount of user-generated
content on Twitter, in the form of short texts
limited to 140 characters that are known as
tweets, has led to develop new methods to
explore the human subjectivity at large scale.</p>
      <p>
        Sentiment analysis, as one of these
methods is known, has been widely utilized to
gauge public opinion regarding important
issues of people's everyday life, the society, and
the word in general, e.g. a political election
        <xref ref-type="bibr" rid="ref1 ref2 ref3">(Ceron-Guzman and Leon-Guzman, 2016b)</xref>
        ;
it also bene ts from the exponential growth
of the computational capacity to process such
a large volume of information.
      </p>
      <p>TASS is a workshop aimed at fostering
research on sentiment analysis of Spanish
tweets, which provides a benchmark
evalu</p>
      <p>Copyright © 2017 by the paper's authors. Copying permitted for private and academic purposes.
ation to compare the latest advances in the</p>
      <p>
        eld
        <xref ref-type="bibr" rid="ref6">(Mart nez-Camara et al., 2017)</xref>
        . One of
the proposed tasks is to determine the
opinion orientation expressed at tweet level. Task
1 consists in assigning one of four labels (P,
NEU, N, NONE) to a given tweet. Here, P,
N, and NEU, stand for positive, negative, and
neutral, respectively; NONE, instead, means
no sentiment.
      </p>
      <p>
        This paper describes the JACERONG
system proposed to participate in TASS-2017
Task 1. For this sixth edition, classi er
ensembles based on stacking were developed, in
addition to the ones based on averaging, with
several improvements, that were presented in
the previous edition
        <xref ref-type="bibr" rid="ref1 ref2 ref3">(Ceron-Guzman, 2016)</xref>
        .
      </p>
      <p>Regarding the ensembles, they are
constituted by (relatively) highly correct classi ers
that utilize Logistic Regression and Support
Vector Machines as the supervised learning
algorithms to predict a class label or
probability estimates. Then, predictions from
these classi ers are optimally combined in
order to obtain a better nal prediction.
Finally, how to choose which classi ers
constitute an ensemble was also an important issue
addressed in this work.</p>
      <p>The remainder of this paper is organized
as follows. Section 2 explains the system
architecture. Next, the submitted runs and the
obtained results are discussed in Section 3.</p>
      <p>Lastly, Section 4 concludes the paper.
2</p>
    </sec>
    <sec id="sec-2">
      <title>The System Architecture</title>
      <p>The system architecture can be viewed as a
pipeline consisting of several pre-processing
modules, a vectorizer that transforms a text
into a feature vector, machine learning
classi ers, and an ensemble combiner that takes
level-one predictions and then optimally
combines them to obtain a better nal prediction.
Figure 1 illustrates the system architecture.
In addition to this, code of the system is
publicly available to enable reproducibility.1
2.1</p>
      <sec id="sec-2-1">
        <title>Pre-processing</title>
        <sec id="sec-2-1-1">
          <title>2.1.1 Text Normalizer</title>
          <p>This is a rule-based normalizer as listed
below:</p>
          <p>Removing URLs and emails.</p>
          <p>HTML entities are mapped to their
textual representation (e.g., \&amp;lt;" ! \&lt;").
Speci c Twitter terms such as mentions
(@user) and hashtags (#topic) are
replaced by placeholders.</p>
          <p>Unknown characters are mapped to their
closest ASCII variant, using the Python
Unidecode module for the mapping.
Consecutive repetitions of a same
character are reduced to one occurrence.
Emoticons are recognized and then
classi ed into positive and negative,
according to the sentiment they convey
(e.g., \:)" ! \EMO POS", \:(" !
\EMO NEG").</p>
          <p>
            Uni cation of punctuation marks
            <xref ref-type="bibr" rid="ref15">(Vilares, Alonso, and Gomez-Rodr guez,
2015)</xref>
            .
          </p>
        </sec>
        <sec id="sec-2-1-2">
          <title>2.1.2 Spell Checker</title>
          <p>
            An open-source spell checker for Spanish
texts is used to normalize non-standard
word forms, i.e. out-of-vocabulary (OOV)
words, to their standard lexical form
            <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4">(CeronGuzman and Leon-Guzman, 2016a)</xref>
            .2
Normalesp suggests normalization candidates
that are identical or similar to the graphemes
or phonemes that make an OOV word, and
1https://github.com/jacerong/TASS-2017
2https://github.com/jacerong/normalesp
using contextual information, it selects the
best normalization candidate.
          </p>
        </sec>
        <sec id="sec-2-1-3">
          <title>2.1.3 Negation Detector</title>
          <p>
            Inspired by the approach proposed by Pang
et al.
            <xref ref-type="bibr" rid="ref11">(Pang, Lee, and Vaithyanathan, 2002)</xref>
            ,
a negated context is de ned as a segment of
the text that starts with a negation word and
ends with a punctuation mark (i.e., \!", \,",
\:", \?", \.", \;"), but only the rst n [0; 3]
or all tokens labeled with any or a speci c
POS tag (i.e., verb, adjective, adverb, and
common noun) are a ected by adding it the
\ NEG" su x; note that when n = 0, no
token is a ected. The negation detector uses
FreeLing
            <xref ref-type="bibr" rid="ref10">(Padro and Stanilovsky, 2012)</xref>
            to
tokenize the text and assign Part-of-Speech
(POS) tags to the resulting tokens.
2.2
          </p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>Feature Extraction</title>
        <p>Once the text has been normalized as
described above, it is transformed into a feature
vector that feeds a rst-level classi er. The
feature vector is formed by concatenating
basic and n-gram features.</p>
        <sec id="sec-2-2-1">
          <title>2.2.1 Basic Features</title>
          <p>Some of the following features are computed
before the text normalization is performed.</p>
          <p>The number of words completely in
uppercase.</p>
          <p>The number of words with more than
two consecutive repetitions of a same
character.</p>
          <p>The number of consecutive repetitions of
exclamation marks, question marks, and
both punctuation marks (e.g., \!!", \??",
\?!"), and whether the text ends with an
exclamation or question mark.</p>
          <p>The number of occurrences of each class
of emoticons, i.e. positive and negative,
and whether the last token of the text is
an emoticon.</p>
          <p>
            The number of positive and negative
words, relative to the ElhPolar lexicon
            <xref ref-type="bibr" rid="ref14 ref7">(Saralegi and Vicente, 2013)</xref>
            , the AFINN
lexicon
            <xref ref-type="bibr" rid="ref9">(Nielsen, 2011)</xref>
            , the iSOL
lexicon
            <xref ref-type="bibr" rid="ref8">(Molina-Gonzalez et al., 2013)</xref>
            ,
the EmoLex Lexicon
            <xref ref-type="bibr" rid="ref14 ref7">(Mohammad and
Turney, 2013)</xref>
            , the StrengthLex
lexicon
            <xref ref-type="bibr" rid="ref10 ref13">(Perez-Rosas, Banea, and Mihalcea,
2012)</xref>
            , or a union of two, three, four, or
all lexicons. In a negated context, the
polarity of a word is inverted, i.e.
positive words become negative words, and
vice versa. Additionally, a third feature
labels the tweet with the class whose
number of polarity words in the text is
the highest.
          </p>
          <p>The number of negated contexts.</p>
          <p>The number of occurrences of each
Partof-Speech tag.</p>
        </sec>
        <sec id="sec-2-2-2">
          <title>2.2.2 N-gram Features</title>
          <p>
            The xed-length set of basic features is
always extracted from a text. However, a text
varies from another in terms of length,
number of tokens, and vocabulary. For that
reason, a process that transforms textual data
into numerical feature vectors of xed length
is required. This process, known as
vectorization, is performed by applying the
TfIdf weighting scheme
            <xref ref-type="bibr" rid="ref5">(Manning, Raghavan,
and Schutze, 2008)</xref>
            . Thus, each document
(i.e., a tweet text) is represented as a vector
d = ft1; : : : ; tng RV , where V is the size of
the vocabulary that was built by considering
word n-grams with n [1; 4], or character
ngrams with n [2; 5] in the collection (i.e., the
training set). The vector is, hence, formed by
word n-grams, character n-grams, or a
concatenation of word and character n-grams.
2.3
          </p>
        </sec>
      </sec>
      <sec id="sec-2-3">
        <title>Machine Learning Classi er</title>
        <p>
          At this stage, a machine learning classi er, or
rst-level classi er, receives the feature
vector and predicts a class label or probability
estimates, i.e. the probability of the tweet
to be of a certain class. Whichever the
prediction be, it is denominated level-one
prediction. Logistic Regression and Support Vector
Machines (SVM) with `linear' kernel are the
algorithms utilized to develop a supervised
learning classi cation approach; Scikit-learn
          <xref ref-type="bibr" rid="ref12">(Pedregosa et al., 2011)</xref>
          is the machine
learning library used.
2.4
        </p>
      </sec>
      <sec id="sec-2-4">
        <title>Ensemble Combiner</title>
        <p>
          Two ensemble methods were implemented to
take level-one predictions and then optimally
combine them in order to obtain a better nal
prediction, namely: averaging and stacking
(Li et al., 2014). The former chooses the class
with the highest unweighted average
probability from probability estimates predicted by
rst-level classi ers. In spite of its simplicity,
it has proved to be a competitive method that
allows to achieve top results
          <xref ref-type="bibr" rid="ref1 ref2 ref3">(Ceron-Guzman,
2016)</xref>
          . Regarding the latter, it stacks class
labels predicted by rst-level classi ers and
then provides them as input to a second-level
classi er to generate an ensemble prediction,
i.e. the nal prediction. SVM with `radius
basis function' kernel is the algorithm utilized
to generate nal predictions.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Experiments</title>
      <p>
        Firstly, the training data were used to t
8,774 rst-level classi ers (4,387 of which
were learned from the training set of the
InterTASS corpus, while to learn the remaining
ones the training set of the General Corpus
of TASS was used) via 5-fold cross validation
in order to nd the best parameter settings,
namely: scope of the negated context,
polarity lexicon, order of word and character
n-grams, and other parameters related to the
vectorizer (e.g., frequency thresholds).
Secondly, these classi ers were ranked
according to their predictive performance on cross
validation, i.e. the (out-of-fold) prediction
accuracy obtained by averaging among the
k iterations; out-of-fold predictions in the
k-th iteration are the predictions obtained
by applying a rst-level classi er, which was
trained on k 1 folds, to the remaining
one subset. Thus, the best 100 rst-level
classi ers for each training set were ltered.
Thirdly, how to choose which rst-level
classi ers constitute an ensemble was an
important issue tackled in this work.
Empirical ndings indicate that the less-correlated
combination of classi ers achieves top results
        <xref ref-type="bibr" rid="ref1 ref2 ref3">(Ceron-Guzman, 2016)</xref>
        . Finally, second-level
classi ers were trained using out-of-fold
predictions on cross validation. Regarding this
matter, only ensembles based on stacking
were trained via 5-fold cross validation.
      </p>
      <p>
        In order to evaluate the predictive
performance of the system, the test set of the
InterTASS corpus and the two test sets of the
General Corpus of TASS (the whole set and the
strati ed sample of 1,000 tweets) were used.
Speci cally, given a tweet from any of the test
sets, its polarity should be predicted; the
polarity, or class label, can be P, N, NEU, or
NONE. Macro-F1 and Accuracy are the
ofcial metrics used to rank the participating
systems. Regarding the provided corpora,
and the way these are split into training and
test sets, the reader is referred to
        <xref ref-type="bibr" rid="ref6">(Mart
nezCamara et al., 2017)</xref>
        where they are
thoroughly described.
legacy-run-3: it is the same run
submitted to TASS-2016 Task 1 that
achieved the best results
(CeronGuzman, 2016), namely: the
lesscorrelated combination of 25 rst-level
classi ers learned from the training
set of the General Corpus of TASS,
which constitute an ensemble based on
averaging.
      </p>
      <p>In the same way, the runs submitted to
evaluate the system on the test set of the
InterTASS corpus are described below:
InterTASS-run-1: the less-correlated
combination of 3 rst-level classi ers
learned from the training set of the
InterTASS corpus, which constitute an
ensemble based on averaging.</p>
      <p>InterTASS-run-2: the less-correlated
combination of 19 rst-level classi ers
learned from the training set of the
InterTASS corpus, which constitute an
ensemble based on stacking.</p>
      <p>InterTASS-run-3: the less-correlated
combination of 14 rst-level classi ers
learned from the training set of the
General Corpus of TASS, which constitute
an ensemble based on averaging.</p>
      <p>
        In summary, it is worth to state that
ensembles based on averaging are signi cantly
better than the ones based on stacking. And
this signi cance does not only correspond to
the slightly better results achieved by the
former, but also to their ability to increase
prediction accuracy given their simplicity and
their computational e ciency. Thus, the
proposed system outperforms all the
participating systems in predictive performance on the
test set of the InterTASS corpus, in terms
of the accuracy metric; likewise, the
predictive performance on the whole test set of
the General Corpus of TASS turns out to be
slightly better than the best result achieved
in the four-label evaluation of the previous
edition
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4">(Garc a-Cumbreras et al., 2016)</xref>
        , in
terms of the Macro-F1 metric. Additionally,
the obtained results of the third run
submitted to evaluate the system on the InterTASS
corpus (\InterTASS-run-3") should be
highlighted, taking into account that the domain
from which the rst-level classi ers that
constitute the ensemble were learned di ers from
the one of evaluation; speci cally, these
results are above-average (0.5642 in terms of
the accuracy metric, taking only the best
result from each participating system).
      </p>
      <p>As a nal point, class imbalance is a major
problem that has not been properly tackled
yet. Speci cally, the overall performance of
the system was signi cantly a ected by the
low discriminative power for the NEU class,
on both the test set of the InterTASS Corpus
and the two test sets of the General Corpus
of TASS. With this in mind, future research
e orts should be focused on dealing with the
low representativeness of the NEU class.</p>
    </sec>
    <sec id="sec-4">
      <title>Conclusion</title>
      <p>This paper has described the JACERONG
system proposed to participate in TASS-2017
Task 1. For such a benchmark evaluation,
two ensemble methods were implemented,
namely: averaging and stacking. Findings
indicate that ensembles based on averaging are
signi cantly better than the ones based on
stacking. This signi cance corresponds to the
former's ability to increase prediction
accuracy given their simplicity and their
computational e ciency, in addition to the slightly
better results achieved by them. Moreover,
ndings show that the less-correlated
combination of classi ers achieves top results. The
experimental evaluation on the test set of the
InterTASS corpus showed that the proposed
system is top-ranked. Together with this,
results indicated that the predictive
performance on the whole test set of the General
Corpus of TASS outperforms the best result
achieved in the four-label evaluation of the
previous edition of TASS.
Proceedings of TASS 2016: Workshop on
Sentiment Analysis at SEPLN co-located
with the 32nd SEPLN Conference
(SEPLN 2016), pages 13{21.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <surname>Ceron-Guzman</surname>
            ,
            <given-names>J. A.</given-names>
          </string-name>
          <year>2016</year>
          . Jacerong at TASS 2016:
          <article-title>An ensemble classi er for sentiment analysis of Spanish tweets at global level</article-title>
          .
          <source>In Proceedings of TASS</source>
          <year>2016</year>
          :
          <article-title>Workshop on Sentiment Analysis at SEPLN co-located with the 32nd SEPLN Conference (SEPLN</article-title>
          <year>2016</year>
          ), pages
          <fpage>35</fpage>
          {
          <fpage>39</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <surname>Ceron-Guzman</surname>
            ,
            <given-names>J. A.</given-names>
          </string-name>
          and
          <string-name>
            <given-names>E.</given-names>
            <surname>Leon-Guzman</surname>
          </string-name>
          .
          <year>2016a</year>
          .
          <article-title>Lexical normalization of Spanish tweets</article-title>
          .
          <source>In Proceedings of the 25th International Conference Companion on World Wide Web, WWW'16 Companion</source>
          , pages
          <volume>605</volume>
          {
          <fpage>610</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <surname>Ceron-Guzman</surname>
            ,
            <given-names>J. A.</given-names>
          </string-name>
          and
          <string-name>
            <given-names>E.</given-names>
            <surname>Leon-Guzman</surname>
          </string-name>
          .
          <year>2016b</year>
          .
          <article-title>A sentiment analysis system of Spanish tweets and its application in Colombia 2014 presidential election</article-title>
          .
          <source>In Proceedings of the 2016 IEEE International Conferences on Big Data and Cloud Computing (BDCloud)</source>
          ,
          <article-title>Social Computing and Networking (SocialCom), Sustainable Computing</article-title>
          and
          <string-name>
            <surname>Communications (SustainCom) (BDCloud-SocialComSustainCom)</surname>
          </string-name>
          , pages
          <fpage>250</fpage>
          {
          <fpage>257</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>Garc</surname>
            a-Cumbreras,
            <given-names>M. A.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Villena-Roman</surname>
          </string-name>
          ,
          <string-name>
            <surname>E.</surname>
          </string-name>
          <article-title>Mart nez-</article-title>
          <string-name>
            <surname>Camara</surname>
            ,
            <given-names>M. C.</given-names>
          </string-name>
          <article-title>D az-</article-title>
          <string-name>
            <surname>Galiano</surname>
            ,
            <given-names>M. T.</given-names>
          </string-name>
          <string-name>
            <surname>Mart</surname>
            n-Valdivia, and
            <given-names>L. A.</given-names>
          </string-name>
          <string-name>
            <surname>UrenaLopez</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Overview of TASS 2016</article-title>
          . In Li,
          <string-name>
            <surname>Y.</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Li</surname>
          </string-name>
          , and
          <string-name>
            <given-names>W.</given-names>
            <surname>Fan</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Ensemble learning</article-title>
          .
          <source>In Data Classi cation: Algorithms and Applications</source>
          . Chapman &amp; Hall/CRC.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>Manning</surname>
            ,
            <given-names>C. D.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Raghavan</surname>
          </string-name>
          , and H. Schutze.
          <year>2008</year>
          .
          <article-title>Scoring, term weighting and the vector space model</article-title>
          .
          <source>In An Introduction to Information Retrieval</source>
          . Cambridge University Press.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <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>
          .
          <source>In 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. CEUR-WS.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>Mohammad</surname>
            ,
            <given-names>S. M.</given-names>
          </string-name>
          and
          <string-name>
            <given-names>P. D.</given-names>
            <surname>Turney</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Crowdsourcing a word-emotion association lexicon</article-title>
          .
          <source>Computational Intelligence</source>
          ,
          <volume>29</volume>
          (
          <issue>3</issue>
          ):
          <volume>436</volume>
          {
          <fpage>465</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <surname>Molina-Gonzalez</surname>
            ,
            <given-names>M. D.</given-names>
          </string-name>
          , E. Mart nezCamara,
          <string-name>
            <surname>M. T. Mart</surname>
          </string-name>
          n-Valdivia,
          <article-title>and</article-title>
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Perea-Ortega</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Semantic orientation for polarity classi cation in Spanish reviews</article-title>
          .
          <source>Expert Systems with Applications</source>
          ,
          <volume>40</volume>
          (
          <issue>18</issue>
          ):
          <volume>7250</volume>
          {
          <fpage>7257</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <surname>Nielsen</surname>
            ,
            <given-names>F. A.</given-names>
          </string-name>
          <year>2011</year>
          .
          <article-title>A new anew: evaluation of a word list for sentiment analysis in microblogs</article-title>
          .
          <source>In Proceedings of the ESWC2011 Workshop on `Making Sense of Microposts': Big things come in small packages</source>
          , pages
          <volume>93</volume>
          {
          <fpage>98</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <surname>Padro</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          and
          <string-name>
            <given-names>E.</given-names>
            <surname>Stanilovsky</surname>
          </string-name>
          .
          <year>2012</year>
          .
          <article-title>Freeling 3.0: Towards wider multilinguality</article-title>
          .
          <source>In Proceedings of the Language Resources and Evaluation Conference (LREC</source>
          <year>2012</year>
          ), Istanbul, Turkey, May. ELRA.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <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 ACL-02 Conference on Empirical Methods in Natural Language Processing -</source>
          Volume
          <volume>10</volume>
          , EMNLP '
          <volume>02</volume>
          , pages
          <fpage>79</fpage>
          {
          <fpage>86</fpage>
          .
          <article-title>Association for Computational Linguistics</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <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="ref13">
        <mixed-citation>
          <string-name>
            <surname>Perez-Rosas</surname>
            , V.,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Banea</surname>
            , and
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Mihalcea</surname>
          </string-name>
          .
          <year>2012</year>
          .
          <article-title>Learning sentiment lexicons in Spanish</article-title>
          .
          <source>In Proceedings of the Eighth International Conference on Language Resources and Evaluation (LREC2012)</source>
          , pages
          <fpage>3077</fpage>
          {
          <fpage>3081</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <surname>Saralegi</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          and
          <string-name>
            <given-names>I. S.</given-names>
            <surname>Vicente</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Elhuyar at TASS 2013</article-title>
          .
          <source>In Proceedings of the Sentiment Analysis Workshop at SEPLN (TASS2013)</source>
          , 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>M. A.</given-names>
            <surname>Alonso</surname>
          </string-name>
          , and
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>GomezRodr guez</article-title>
          .
          <year>2015</year>
          .
          <article-title>On the usefulness of lexical and syntactic processing in polarity classi cation of twitter messages</article-title>
          .
          <source>Journal of the Association for Information Science and Technology</source>
          ,
          <volume>66</volume>
          (
          <issue>9</issue>
          ):1799{
          <year>1816</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>