<!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>
      <journal-title-group>
        <journal-title>Data C Gamma Kernel
Document</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Classi cation and Event Identi cation Using Word Embedding</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Computer Science, University of Exeter</institution>
          ,
          <addr-line>Exeter EX4 4QE</addr-line>
          ,
          <country country="UK">UK</country>
        </aff>
      </contrib-group>
      <volume>1</volume>
      <issue>1</issue>
      <abstract>
        <p>This paper presents our contribution to the CLEF 2019 ProtestNews Track, which aims to classify and identify protest events in Englishlanguage news from India and China. We used traditional classi cation models, namely, support vector machines and XGBoost classi ers, combined with various word embedding approaches. Multiple models were tested for experimental purposes, in addition to the two models evaluated within the o cial campaign. Results show promising performance, especially in terms of precision on both document and sentence classi cation tasks.</p>
      </abstract>
      <kwd-group>
        <kwd>Data mining Classi cation bedding</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>The CLEF ProtestNews Track was introduced in 2019 aiming to evaluate
methods for event classi cation and detection from news articles across multiple
countries. This track has two main goals: rstly, development of generalisable
methods which can be applied to heterogeneous news article data; and secondly, to
support surveys conducted in other scienti c elds such as social and
political studies by providing data on political con ict events (e.g. protests, riots).
This track includes three tasks: news article classi cation, event sentence
detection and event extraction. Our contribution is focused on the rst two tasks.
The news article classi cation task consists of identifying news articles
associated with political con icts through a binary classi cation scheme ("protest"
vs. "non-protest"). The event sentence detection task focuses on identifying and
labeling sentences that refer to protest events (e.g. riots, social events).</p>
      <p>
        Both of the tasks attempted here relate to text classi cation and sentence
classi cation. Recent work in natural language processing (NLP) and text
mining shows many applications that leverage text classi cation at di erent levels
of scope. At the document level, many classi cation techniques have been
proposed and have achieved good results in the literature [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Logistic regression
(LR) and support vector machines (SVMs) are two of the most-used techniques
[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Recently "deep learning" models based on neural networks have become
increasingly popular [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. At the sentence level, classi cation must operate on
texts that are much shorter than most documents ( 160 words), which
reduces performance of traditional text classi cation algorithms. Main limitations
concern the feature sparsity of short text which reduces the accuracy of
traditional algorithms, such as the similarity algorithm based on word frequency
and co-occurred words [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. To tackle problems arising from short texts, various
methods have been proposed to improve their capacity of semantic expression
[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. More recently, NLP has drawn attention in this context through the use
of language models learned by word embeddings, especially in models based on
neural networks [
        <xref ref-type="bibr" rid="ref6 ref7">6,7</xref>
        ].
      </p>
      <p>
        At both document and sentence levels, e ective feature extraction is
important to help the accuracy and robustness of classi cation models. Inspired by
recent work in e cient word representation learning [
        <xref ref-type="bibr" rid="ref8 ref9">9,8</xref>
        ] and considering the
topical scope of the proposed tasks CLEF ProtestNews Track 2019, here we
propose two models that were submitted for o cial evaluation and also several
other models that were developed for experimental purposes. All of them are
based on word vector learning combined with linear classi ers. The main aim of
these approaches is to nd the most e cient feature extraction and classi cation
method which can be applied at di erent levels of scope.
      </p>
      <p>The rest of this paper is organized as follows. Section 2 presents an overview
of the analytical framework. In Section 3, we describe a set of 9 di erent models
using di erent kinds of word embedding and classi er, with and without
dimension reduction. Then, we present results from experimental testing of these
models (Section 4) before giving results for the two models submitted to the
o cial CLEF ProtestNews track evaluation (Section 5) .
2</p>
    </sec>
    <sec id="sec-2">
      <title>Overview of the proposed framework</title>
      <p>In this section, we present the proposed framework consisting of three parts:
data processing, word vector learning and text classi cation.
2.1</p>
      <sec id="sec-2-1">
        <title>Data processing</title>
        <p>For each task respectively documents and sentences were converted to lowercase,
all URLs and stop-words were removed. After the tokenization process, all
tokens based only on non-alphanumeric characters and all short tokens (with &lt; 3
characters) were also deleted. Then, we perform a morphological analysis of all
tokens in order to identify lemmas, replacing each token by its lemma.
2.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Word vector models</title>
        <p>
          In word vector representations, each word is represented by a vector which is
concatenated or averaged with other word vectors in a context to form a
resulting vector which is used to predict other words in the context [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. These
vectors allow capture of hidden information about a language, like word
analogies or semantic associations. In the literature, word vector representations have
demonstrated e ciency in boosting accuracy of classi cation models. However,
inconsistent performances are observed in some application contexts [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. In this
paper, we explore three popular embedding models, namely, Word2Vec, GloVe
and FastText. Below, we introduce brie y their principle.
        </p>
        <p>
          { Word2Vec [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] is a group of related models based on two-layer neural
networks that are trained to reconstruct linguistic contexts of words. Two model
architectures can be used: continuous bag-of-words (CBOW) or continuous
skip-gram (SG). In CBOW architecture, the model predicts the current word
from a window of surrounding context words. As in other bag-of-words
approaches, the order of context words does not in uence prediction. In the
continuous SG architecture, the model uses the current word to de ne the
surrounding window of context words. The SG architecture weights nearby
context words more heavily than more distant context words.
{ GloVe [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] (global vectors for word representation) allows the user to
obtain word vector representations by mapping words into a meaningful space
where the distance between words is related to semantic similarity.
Training is performed on aggregated global word-word co-occurrence statistics
from a corpus, and the resulting representations showcase interesting linear
substructures of the word vector space.
{ FastText [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] is based on the SG model, where each word is represented
as a bag of character n-grams. A vector representation is associated to each
character n-gram; words being represented as the sum of these
representations.
        </p>
        <p>
          Pre-trained word embeddings on large training sets are publicly available, such as
those produced for word2vec [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ], GloVe [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] or Wiki word vectors for FastText1.
2.3
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>Linear classi ers</title>
        <p>
          Despite the popularity of models based on neural networks, linear classi ers
stand as strong baselines for text classi cation problems. Furthermore the
stateof-art about these models has proved their suitability and their robustness when
they are combined with right features [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ]. In addition, neural network models
tend in practice to increase computational cost. Following empirical studies
conducted on the training set provided for each CLEF ProtestNews task, SVM and
XGBoost provided best performances in term of accuracy and log loss scores.
1 https://fasttext.cc/docs/en/pretrained-vectors.html Date of access: 16th
        </p>
        <p>May 2019.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Proposed models</title>
      <p>
        Nine models were explored for the news article classi cation and event sentence
detection tasks. These models were selected from various combinations within
the framework presented above. The best models were chosen according to their
global performance in terms of precision, recall and F1-score obtained on the
training sets provided for each task. Parameter tuning was performed using
GridSearchCV2 in order to select parameter values that maximize the accuracy
of each model. Top parameters are presented in tables following the description
of each model below. The model architectures described below were used in
similar ways for the two tasks (except for the sum ner model, see below).
- The xgboost fast model uses word vector representations created by
FastText. Vectors were built from the training set provided for each task. Then
the XGBoost classi er was used to identify the class of each input.
Data
Document
Sentence
fraction of Gamma tree max.
columns depth
0.75 0.4 5
0.75 0.4 6
min. sum of alpha fraction of
weights observations
6 0.005 0.8
6 0.001 0.85
- The xgboost fast wiki model uses the same architecture as the xgboost fast
model except for word vector learning, which is performed through the use of
pre-trained word embeddings. The pretrained model3 is composed of 1
million word vectors trained on Wikipedia 2017, UMBC webbase corpus and
statmt.org news dataset. These vectors in dimension 300 were obtained using
the skip-gram model described in [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] with default parameters.
      </p>
      <p>Data
Document
Sentence
fraction of Gamma tree max.
columns depth
0.85 0.1 6
0.8 0.3 5
min. sum of alpha fraction of
weights observations
10 0 0.8
12 0.05 0.75
- The svm fast model uses word vectors built from FastText. Vectors were
designed from the training sets provided. Then SVM classi ers were used to
identify the class of each input.</p>
      <p>Data C Gamma Kernel
Document 10 1 rbf</p>
      <p>Sentence 0.001 0.001 linear
- The svm fast wiki model uses classi ers based on SVM. Word vector
representations are built from the same pre-trained model that was used for the
xgboost fast wiki model.
2 https://scikit-learn.org/stable/modules/grid_search.html Date of access:
16th May 2019.
3 https://dl.fbaipublicfiles.com/fasttext/vectors-english/
wiki-news-300d-1M.vec.zip Date of access: 16th May 2019.
- The xgboost glove model uses a pre-trained word vector embedding as
initialization for the representation of words. This embedding named GloVe4
is composed of 300-dimensional vectors trained over a larger vocabulary of
web data (840B words). Then XGBoost classi ers were used to identify the
class of each input.</p>
      <p>Data
Document
Sentence
fraction of Gamma tree max.
columns depth
0.8 0.0 6
0.75 0.3 6
min. sum of alpha fraction of
weights observations
8 0.05 0.75
6 0.05 0.8
- The xgboost w2v model is designed from a word vector representations
performed by Word2vec. Vectors were built from the training set provided
for each task. Then XGBoost classi ers were used to classify inputs.
Data
Document
Sentence
fraction of Gamma tree max.
columns depth
0.8 0.0 6
0.85 0.3 6
min. sum of alpha fraction of
weights observations
12 0.001 0.8
12 0.001 0.85
- The sum ner model uses slightly di erent text processing according to the
application context.</p>
      <p>For Task 1, the text was trimmed to capture sentences that are most
representative of the source document. In this way, we aimed to gain topical
clarity and reduce the vocabulary space. Similar to a text summarization
process, each sentence was scored as the sum of the weighted frequencies
of its words within the whole document. The highest-scoring sentences
were then chosen to give a concise representation of the document. The
best performances were observed by keeping the rst 4 sentences with
the highest scores.</p>
      <p>For both Task 1 (using sentences derived from document level as above)
and Task 2 (which begins at sentence level), we then apply text
normalization using a named entity recognition tool5. Only entities referring to
a person, a location or an organisation are identi ed. Each entity
localized is replaced by the name of its class. The aim with this process is
to provide harmonized vector patterns which can be bene cial in word
representation processes.</p>
      <p>For both tasks, the nal step is to perform classi cation using the
XGBoost technique.
4 http://nlp.stanford.edu/data/glove.840B.300d.zip Date of access: 17th June
2019.
5 https://nlp.stanford.edu/software/CRF-NER.shtml Date of access: 17th June
2019.
Document
Sentence
fraction of Gamma tree max.
columns depth
0.85 0.1 4
0.85 0.4 6
min. sum of alpha fraction of
weights observations
12 0.01 0.85
8 0.001 0.8
- The xgboost fast SVD and xgboost fast wiki SVD models were
created from the xgboost fast and xgboost fast wiki models above by the
addition of dimension reduction alongside feature extraction. Dimension
reduction was applied using the Singular Value Decomposition (SVD) method, a
commonly applied technique, in order to reduce noise and increase model
stability. Brie y, SVD is a matrix decomposition method for reducing a
matrix to its constituent parts, to make certain subsequent matrix calculations
simpler.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Experimental results</title>
      <p>In this section, we present experimental results obtained on the test sets provided
for intermediate evaluation in the CLEF ProtestNews track. The ProtestNews
evaluation process was divided into two phases. The rst phase (intermediate
evaluation) was conducted on test sets extracted from Indian news articles. The
second phase ( nal evaluation) includes English-language news articles from both
India and China (see below).</p>
      <p>The training sets used for experimental testing of the di erent models are
taken from the nal evaluation phase (3429 documents and 5884 sentences
extracted from India news articles). The test sets are from the intermediate phase
and are composed of 457 documents and 663 sentences respectively, extracted
from India news articles. Evaluation measures used for each task are precision,
recall, F1-score and the average of F1-scores obtained in these two tasks (Avg.2).</p>
      <p>cial CLEF ProtestNews results
In this section, we present results obtained for the nal evaluation phase of
CLEF ProtestNews 2019. Proposed models were evaluated on Task 1 (news
article classi cation) and Task 2 (event sentence detection) using two di erent
testing sets. Task 3 was not attempted.</p>
      <p>As in the experimental results above, the training sets provided were
composed of 3429 documents (Task 1) and 5884 sentences (Task 2) extracted from
English-language news articles from India. Table 2 gives details of the nal
evaluation test sets.
6 Due to problems with the ProtestNews submission system, only these two models
were entered into the nal evaluation, despite their relative poor performance in
experimental testing.
suspect that dimension reduction did not o er an advantage here. Usually used
on a large set of features, SVD appears not to have helped extraction of suitable
discriminant features for these classi cation tasks. With these settings, results
are better on the Task 1 than Task 2. This may be explained by the di erence in
length of the text records in these two levels of scope. However, it is interesting to
observe that the use of a pre-trained model improved results obtained in Task 1.</p>
      <p>Comparing performance between experimental testing and the nal
ProtestNews evaluation, we see a worse Avg. 2 score for xgboost fast SVD and slightly
better Avg.2 score for xgboost fast wiki SVD, for the nal evaluation relative
to the experimental test on intermediate evaluation data. We note that in the
intermediate phase, models are tested and trained on the same kinds of content
(Indian news), whereas in the nal phase models are trained on Indian content
and tested on both Indian and China content. It appears that use of a
pretrained model is less e ective in the sentence level than in the document level
when models are applied on the same kind of content. Conversely models trained
on similar content are more suitable. We conclude that with these settings,
features extracted are less generalisable, while those extracted from a pre-trained
model give a slight decrease in performance but are more robust when confronted
with another type of data.
6</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion</title>
      <p>In this paper, we presented our contribution to the CLEF 2019 ProtestNews
Track. Models evaluated combined word-embedding techniques (Word2Vec, GloVe
and FastText) with linear classi ers (SVM and XGBoost), as well as dimension
reduction as a pre-processing step (SVD). Models showed worse performance
when combined with dimension reduction. Word embedding, which is often
sensitive to the domain of application, provided best performance when word vectors
were generated from pre-trained models, independent of the level of scope.</p>
      <p>In future work, we plan to evaluate all models proposed during the
experimental phase on the datasets used in the nal evaluation phase of CLEF
ProtestNews. This will help explore the portability of these models to datasets extracted
from an another country and estimate their ability to adapt to new domains.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Rafeeque</surname>
            ,
            <given-names>P. C.</given-names>
          </string-name>
          , &amp; S. Sendhilkumar.:
          <article-title>A survey on short text analysis in web</article-title>
          .
          <source>In: Third International Conference on Advanced Computing. IEEE</source>
          , (
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Kowsari</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Meimandi</surname>
            ,
            <given-names>K. J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Heidarysafa</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mendu</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barnes</surname>
            ,
            <given-names>L. E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brown</surname>
          </string-name>
          , D. E.:
          <article-title>Text Classi cation Algorithms: A Survey</article-title>
          . In: arXiv preprint arXiv:
          <year>1904</year>
          .
          <fpage>08067</fpage>
          . (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Belinkov</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Glass</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>Analysis methods in neural language processing: A survey. Transactions of the Association for Computational Linguistics</article-title>
          , vol.
          <volume>7</volume>
          , pp.
          <volume>49</volume>
          {
          <fpage>72</fpage>
          . (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Allahyari</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pouriyeh</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Asse</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Safaei</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Trippe</surname>
            ,
            <given-names>E. D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gutierrez</surname>
            ,
            <given-names>J. B.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Kochut</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>A brief survey of text mining: Classi cation, clustering and extraction techniques</article-title>
          .
          <source>arXiv preprint arXiv:1707</source>
          .
          <fpage>02919</fpage>
          . (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Song</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ye</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Du</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Bie</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Short text classi cation: A survey</article-title>
          .
          <source>In: Journal of multimedia</source>
          , vol.
          <volume>9</volume>
          no.
          <issue>5</issue>
          , pp.
          <fpage>635</fpage>
          . (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
          </string-name>
          , H.,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Hao</surname>
          </string-name>
          , H.:
          <article-title>Semantic clustering and convolutional neural network for short text categorization</article-title>
          .
          <source>In: the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing</source>
          . vol.
          <volume>2</volume>
          , pp.
          <volume>352</volume>
          {
          <fpage>357</fpage>
          . (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Young</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hazarika</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Poria</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Cambria</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          :
          <article-title>Recent trends in deep learning based natural language processing</article-title>
          .
          <source>In: IEEE Computational intelligenCe magazine</source>
          , vol.
          <volume>13</volume>
          n.
          <issue>3</issue>
          , pp.
          <volume>55</volume>
          {
          <fpage>75</fpage>
          . (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Joulin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grave</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bojanowski</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Bag of tricks for e cient text classi cation</article-title>
          .
          <source>In: arXiv preprint arXiv:1607</source>
          .
          <fpage>01759</fpage>
          . (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Levy</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goldberg</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Dagan</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Improving distributional similarity with lessons learned from word embeddings</article-title>
          .
          <source>In: Transactions of the Association for Computational Linguistics</source>
          , vol.
          <volume>3</volume>
          , pp.
          <volume>211</volume>
          {
          <fpage>225</fpage>
          . (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Turian</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ratinov</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Bengio</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Word representations: a simple and general method for semi-supervised learning. In: the 48th annual meeting of the association for computational linguistics</article-title>
          .
          <source>Association for Computational Linguistics</source>
          . pp.
          <volume>384</volume>
          {
          <fpage>394</fpage>
          . (
          <year>2010</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Ghannay</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Favre</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Esteve</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Camelin</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          :
          <article-title>Word embedding evaluation and combination</article-title>
          .
          <source>In: the 10th edition of the Language Resources and Evaluation Conference</source>
          . pp.
          <volume>300</volume>
          {
          <fpage>305</fpage>
          . (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Bojanowski</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grave</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Joulin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Enriching word vectors with subword information</article-title>
          .
          <source>In: Transactions of the Association for Computational Linguistics</source>
          , vol.
          <volume>5</volume>
          , pp.
          <volume>135</volume>
          {
          <fpage>146</fpage>
          . (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Pennington</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Socher</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Manning</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          : Glove:
          <article-title>Global vectors for word representation</article-title>
          .
          <source>In: the 2014 conference on empirical methods in natural language processing (EMNLP)</source>
          . pp.
          <volume>1532</volume>
          {
          <fpage>1543</fpage>
          . (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corrado</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Dean</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>E cient estimation of word representations in vector space</article-title>
          .
          <source>In: arXiv preprint arXiv:1301</source>
          .
          <fpage>3781</fpage>
          . (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Manning</surname>
            ,
            <given-names>C. D.</given-names>
          </string-name>
          :
          <article-title>Baselines and bigrams: Simple, good sentiment and topic classi cation. In: the 50th annual meeting of the association for computational linguistics</article-title>
          : vol.
          <volume>2</volume>
          . pp.
          <volume>90</volume>
          {
          <fpage>94</fpage>
          .
          <article-title>Association for Computational Linguistics</article-title>
          . (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>