<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>RGCL at IDAT: Deep Learning models for Irony Detection in Arabic Language</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Tharindu Ranasinghe</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hadeel Saadany</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alistair Plum</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Salim Mandhari</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Emad Mohamed</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Constantin Orasan</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ruslan Mitkov</string-name>
          <email>r.mitkovg@wlv.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Research Group in Computational Linguistics, University of Wolverhampton</institution>
          ,
          <country country="UK">UK</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This article describes the system submitted by the RGCL team to the IDAT 2019 Shared Task: Irony Detection in Arabic Tweets. The system detects irony in Arabic tweets using deep learning. The paper evaluates the performance of several deep learning models, as well as how text cleaning and text pre-processing in uence the accuracy of the system. Several runs were submitted. The highest F1 score achieved for one of the submissions was 0.818 making the team RGCL rank 4th out of 10 teams in nal results. Overall, we present a system that uses minimal pre-processing but capable of achieving competitive results.</p>
      </abstract>
      <kwd-group>
        <kwd>Irony Dectection</kwd>
        <kwd>Deep Learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        According to philosophers such as Grice, irony could be de ned as an utterance
which violates a conversational maxim [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. The user of irony intentionally breaks
the norms by an unexpected play on words. The wordplay in irony is often based
on common knowledge shared by the speaker and the listener which can relate
to their speci c culture or social background. This unexpectedness factor cuts
through di erent linguistic levels.
      </p>
      <p>On one level unexpectedness is achieved by what can be dubbed as \sentiment
imbalance". It refers to the use of a negative or positive word where the opposite
polarity is expected from the context. The ironic tweet,
\... YÓA éJºË ¬Q K øQåÖÏ@ XAJ¯B@" (The Egyptian economy is crumbling yet it
is unfaltering) is a good example of this. The use of the word ` YÓA' (`unfaltering
or rm') with its positive polarity where a negative item is expected creates an
ironic e ect.</p>
      <p>Moreover, the out-of-context ironic element can be pointed out by a
typographical element such as quotes, bold typing, ellipsis and emoticons. Other
observed features of the ironic data are the frequent use of parallel syntactic
structures, repetition of one or more lexical items and the use of polysemy or
multi-sense words.</p>
      <p>
        Recently, a lot of research has been carried out in the eld of natural
language processing in order to detect irony. This is evidenced by an increase in
irony detection shared tasks. SemEval-2018 Task 3 focused on irony detection in
English tweets [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Also, there were shared tasks for irony detection in French [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]
and Italian [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>Another such task, which is at the FIRE 2019 conference, is Irony Detection
in Arabic Tweets (IDAT). Given a tweet, systems have to classify it as either
ironic or not ironic. This paper describes our submission to the IDAT shared
task in irony detection. We propose a simple, low-e ort approach, with minimal
data processing. We employ six di erent neural network architectures in order to
detect irony in tweets, evaluate each network and select the three best performing
architectures for our nal submissions.</p>
      <p>The paper is structured as follows. Section 2 describes the system developed
for this shared task and the dataset used to train and test it. Section 3 presents
an analysis of the results of our evaluation of the ve di erent architectures
(Section 3.1), as well as of the nal submission (Section 3.2). Section 4 describes
the error analysis we performed for the test set. The paper is concluded by
Section 5 o ering some nal remarks.
2</p>
    </sec>
    <sec id="sec-2">
      <title>System Description</title>
      <p>This section describes the shared task data, as well as the system that was used
to classify the data. We use minimal preprocessing in order to use the data. For
classi cation, we used and compared six di erent neural network architectures
suited to this task. Our implementation has been made available on Github.1
2.1</p>
      <sec id="sec-2-1">
        <title>Dataset</title>
        <p>
          The dataset contains tweets related to di erent political issues and events related
to the Middle East that hold during the years 2011 to 2018 [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. The data provided
by the task organisers was split into training and evaluation sets. The complete
dataset is comprised of 4024 instances. We used 20% of the available data for
evaluation and the rest of the data for training, resulting in 805 instances for
evaluation and 3219 instances for training. The tweets were labelled with 1 to
indicate irony and with 0 for non-irony. Duplicates, retweets and tweets containing
pictures which would need to be interpreted to understand the ironic content
have been removed by the organisers. The tweets are written using standard
Arabic (formal) and di erent Arabic language varieties: Egypt, Gulf, Levantine,
and Maghrebi dialects.
        </p>
        <sec id="sec-2-1-1">
          <title>1 https://github.com/TharinduDR/Irony-Detection</title>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>Text Processing</title>
        <p>The main objective of the classi cation task is to capture the irony-de ning
features in the Arabic tweets, and hence the data has been cleaned accordingly.
The team has chosen to delete a number of textual features that do not contribute
to the classi cation and maintain others which may be signi cant in spotting an
ironic tone in the tweet.</p>
        <p>Twitter users writing in Arabic can either write in Modern Standard Arabic
(MSA) or in their particular dialects. If the tweet is written in MSA, it may
or may not include diacritics whereas dialectical Arabic does not include any.
Ironic tweets can be formulated in any of these di erent versions of the Arabic
transcript. Thus, in order to avoid false classi cations due to a non-de ning
feature, regular expressions were used to delete diacritics.</p>
        <p>Moreover, native Arabic tweeters can either include punctuation or ignore it
completely. Again, regular expressions were used to delete a number of
punctuation markers, and multiple spaces were reduced to a single space. Some
punctuation markers were not deleted if it was assumed to be signi cant for capturing
irony. For example, it has been observed that the ellipsis is often used in ironic
tweets to indicate a pause, a hesitation or a trailing-o in thought that marks a
shift to an ironic tone.</p>
        <p>Similarly, emojis were not omitted as they were deemed important for the
classi cation. Finally, English characters which are either used to refer to the
user's account or to a word in Arabizi (the Arabic Chat Alphabet) were also
deleted. Arabizi characters were removed as they are not written in an Arabic
script, but rather a mixture of English characters and symbols which would not
be captured by the Arabic word-embedding model employed for classi cation.
2.3</p>
      </sec>
      <sec id="sec-2-3">
        <title>System Architecture</title>
        <p>
          After data processing each text is encoded using Arabic fasttext [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]
embeddings.2 The encoded tweets are then classi ed by one of the neural network
architectures. We evaluated six di erent neural network architectures for the
classi cation tasks: pooled Gated Recurrent Unit (GRU) (Section 2.3.1), Long
Short-Term Memory (LSTM) and GRU with Attention (Section 2.3.3), 2D
Convolution with Pooling (Section 2.3.4), GRU with Capsule (Section 2.3.5) and
LSTM with Capsule and Attention (Section 2.3.6).
        </p>
        <p>
          The parameters of each architecture were optimised using 10-fold
crossvalidation considering a binary cross entropy loss function and using adam
optimiser [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] which provided the best results of all tested optimisers. We also used
the reduced-learning rate on plateau technique when a deep learning architecture
stopped improving. Deep learning architectures often bene t from reducing the
learning rate by a factor once learning stagnates [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]. We monitored validation
loss and if no improvement was seen for 2 epochs, the learning rate was reduced
by a factor of 0.6. These architectures were successfully applied to a number of
2 https://dl.fbaipublicfiles.com/fasttext/vectors-wiki/wiki.ar.vec
classi cation tasks such as aggression detection [
          <xref ref-type="bibr" rid="ref15 ref8">8,15</xref>
          ], toponym detection [
          <xref ref-type="bibr" rid="ref16 ref17">16,17</xref>
          ]
and their success in these tasks inspired us to use them for this task.
2.3.1 Pooled GRU In this architecture, after the embedding layer,
embedding vectors are fed to the bi-directional GRU [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] at their respective timestep.
The bi-directional GRU-layer has 80 units. The nal timestep output is fed
into a max pooling layer and an average pooling layer in parallel [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ]. After
this, the outputs of the two pooling layers are concatenated and connected to a
dense layer [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] activated with a sigmoid function. Additionally, there is a
spatial dropout [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ] between the embedding layer and the bi-directional GRU layer
to avoid over- tting. This architecture has been discussed in [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] as a common
architecture to perform text classi cation tasks.
        </p>
      </sec>
      <sec id="sec-2-4">
        <title>2.3.2 Stacked LSTM with Attention In this architecture, each of the</title>
        <p>
          embedding vectors is fed into a bi-directional LSTM-layer [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ]. The output of
this layer is again fed into a bi-directional LSTM-layer [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] with self attention
[
          <xref ref-type="bibr" rid="ref23">23</xref>
          ]. Each of the bi-directional LSTM-layers has 64 units. Finally, the output is
connected to two dense layers that are [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] activated rst with a relu function,
and then with a sigmoid function. We adopted this architecture from the Toxic
Comment Classi cation Challenge in Kaggle.3
2.3.3 LSTM and GRU with Attention With this architecture, the output
of the embedding layer goes through a spatial dropout [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ] and is then fed in
parallel to a bi-directional LSTM-layer [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] with self attention and a bi-directional
GRU-layer [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] with self attention [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ]. Both the bi-directional LSTM-layer and
the bi-directional GRU-layer have 40 units. The output from the bi-directional
GRU-layer is fed into an average pooling layer and a max pooling layer. The
output from these layers and the output of the bi-directional LSTM-layer are
concatenated and connected to a dense layer with ReLU activation. After that,
a dropout [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ] is applied to the output and connected to a dense layer activated
with a sigmoid function.
2.3.4 2D Convolution with Pooling The fourth architecture takes a di
erent approach than the previous architectures by using 2D convolution layers [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ],
rather than LSTM or GRU layers. The outputs of the embedding layers are
connected to four 2D convolution layers [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ], each with max pooling layers. All the
2D convolution layers were initialised with a normal kernel initialiser. The
outputs of these are concatenated and connected to a dense layer activated with a
sigmoid function after applying a dropout [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ]. This architecture has been used
in the Quora Insincere Questions Classi cation Kaggle competition.4
3 https://www.kaggle.com/c/jigsaw-toxic-comment-classification-challenge
4 https://www.kaggle.com/c/quora-insincere-questions-classification
2.3.5 GRU with Capsule Most of the previous architectures rely on a
pooling layer. However, this architecture uses a capsule layer [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] rather than pooling
layers. After applying a spatial dropout [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ] the output of the embedding layer
is fed into a bi-directional GRU-layer [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. The bi-directional GRU-layer has 100
units and was initialised with the Glorot normal kernel initialiser and
orthogonal recurrent initialiser with 1.0 gain. The output is then connected to a capsule
layer [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. The output of the capsule layer is attened and connected to a dense
layer with ReLU activation, a dropout [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ] and batch normalisation applied, and
re-connected to a dense layer with sigmoid activation. This architecture has been
used to detect aggression in tweets [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ].
2.3.6 LSTM with Capsule and Attention The nal architecture uses
combination of a capsule layer [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] and a self attention layer [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ]. After the embedding
layer a spatial dropout [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ] is applied to the output, which is then fed into a
bidirectional LSTM-layer [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] with 80 units. The layer is initialised with the Glorot
normal kernel initialiser and orthogonal recurrent initialiser with 1.0 gain. The
output of the bi-directional LSTM-layer is fed into a capsule layer and to a self
attention layer in parallel. Then each output of both capsule layers and the self
attention layer goes through a DropConnect [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ]. They are concatenated before
connecting to a dense layer with sigmoid activation. This architecture has been
used in the Jigsaw Unintended Bias in Toxicity Classi cation competition.5
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Results</title>
      <p>This section presents the results of the evaluation of the six architectures, as
well as the evaluation of the nal submissions. The competitors were allowed to
submit three runs of their system to the evaluations. Therefore, we compare the
performance of six di erent neural network architectures in order to select three
submissions for the task.
3.1</p>
      <sec id="sec-3-1">
        <title>Architecture Evaluation</title>
        <p>This section describes how we selected the architectures for the nal submission.
To evaluate the architectures, we used 20% of the available training data, and
used the rest of the data for training. Table 1 shows the evaluation results of
each architecture. We used three evaluation metrics: Precision (P), Recall (R)
and F1 score as denoted in Table 1. As shown, 2D Convolution with Pooling,
GRU with Capsule and Pooled GRU architectures had the best F1 scores of
the six experimented architectures. Therefore, we submitted outputs from those
three architectures as our nal submissions.</p>
        <sec id="sec-3-1-1">
          <title>5 http://bit.ly/32toTbN</title>
          <p>Architecture</p>
          <p>P</p>
          <p>R</p>
          <p>F1
This section presents the results of the evaluation of our submission. The
evaluation was carried out by the task organisers, and at the time of writing the paper
the GOLD standard for the test set is not available. Therefore, we report only
the evaluation provided to us by the task organisers which is solely based on
F1 score. Our selected architectures 2D Convolution with Pooling, Pooled GRU
and GRU with Capsule had F1 scores of 0.818, 0.816 and 0.804, respectively.
Our best result 2D Convolution with Pooling ranked seventh in the nal results.
4</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Error Analysis</title>
      <p>The deep learning architecture used in our models is fundamentally based on
word-embeddings and their sequential relations. Accordingly, the rst step for
error analysis was to explore the most informative features on the word-level
which were crucial in classi cation. In order to achieve this, the top 30 vectors
for ironic and non-ironic tweets were extracted (see Figure (1) for the most ironic
vectors and Figure (2) for the most non-ironic).</p>
      <p>A number of observations were made on the above lists. First, the most
informative tokens for ironic tweets revolve around Middle East political gures who
were usually the target of jokes in social platform discussions during the time
frame of the compiled data (e.g `Mursi', former president of Egypt, `Bashar',
president of Syria, `Mubarak', ousted president of Egypt, `Okasha', an Egyptian
TV anchor famous for propagating hoax news). These are essentially divisive
political gures who typically provoke ironic comments on their actions or
political stance. Second, elongated words such as ` éêêêêêë' (hahaha) referring to
an exaggerated sentiment is irony de ning. Third, the most non-ironic features
similarly include words referring to political gures or entities such as `Trump',
`Isis' and `Putin'. However, it is noticeable that a less formal reference to the
political gure is included in the ironic tweet. For example, in the most
informative ironic features, reference to `Vladimir Putin' is informally given by his
rst name `Vladimir' whereas his surname `Putin' becomes the most informative
feature in non-ironic tweets. Fourth, the most informative features for non-ironic
tweets seem to include particular hashtags which may have been retweeted in
the corpus. This is concluded from the use of the underscore, ` ' , in more than
one non-ironic vector (e.g. `àAJ« ú×A' (Sami Anaan), seems to be a retweeted
hashtag concerned with the imprisonment of the Egyptian chief of sta who was
imprisoned after announcing his run for the Egyptian presidential elections).
These hashtags refer to current news which may be more factual than sarcastic.
Finally, 50% of the most ironic tokens belong to di erent Arabic dialects whereas
only 10% of the non-ironic features was dialectical.</p>
      <p>The second step in the error analysis was the investigation of the
misclassied instances in the test set. Given that access to the o cial annotation for the
test set was not available, one of the authors of the paper, who is an Egyptian
Arabic native speaker analysed the automatic classi cation. The total
misclassied tweets was 188 tweets: 133 belong to the false positives, where the tweet is
wrongly classi ed as ironic, and 55 false negatives, where the tweet is mistakenly
considered non-ironic. Generally speaking, the false positive instances typically
include reference to one of the political gures contained in the most informative
ironic features shown in Figure (1) above. For example, the following tweet:
(Asmaa, wife of the Syrian president Bashar, is pregnant in her fth month)
is misclassi ed as ironic because of the presence of the word `PA . ' (Bashar)
which is one of the most informative features for the positive class. Thus, tweets
reporting news about one of the gures typically mentioned in ironic tweets
are misclassi ed. It was also noticed that a number of the false positives were
wrongly annotated tweets. For example:
(Oh you who see through the future .. oh you who see through pants #bassem yussif
style) is an ironic tweet mistakenly annotated as non-ironic. Interestingly, our
model correctly classi ed it as ironic. Moreover, a number of tweets that were
misclassi ed included slang or dialectical words. For example,
is part of a tweet written in dialectical Egyptian Arabic that was misclassi ed
as ironic.</p>
      <p>As for false negatives, it was observed that the ironic tweet typically included
an emoticon indicating a positive sentiment (such as laughter or a smile). The
preprocessing stage for our model deleted any non-characters and hence
emoticons were not captured by the classi er. In the future, we plan to investigate
whether the use of other features such as emoticons can improve the classi cation
accuracy.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusions</title>
      <p>In this paper, we have presented our system for identifying irony in Arabic tweets.
The system uses minimal preprocessing and relies on word embeddings. We
experimented with di erent neural network architectures in order to determine
the most suitable for this task. Going by our evaluation, and the results provided
by the task organisers, it is clear that 2D Convolution with Pooling scores highest
overall.</p>
      <p>
        While the word embeddings performed well in the task there were a lot of out
of vocabulary words. In the future, we would like to experiment with the
performance of contextualised word embeddings, such as ELMo [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] and BERT [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] in
irony detection. We have experienced these architectures in the recent Germeval
Task 2, 2019 | Shared Task on the Identi cation of O ensive Language [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
Therefore, we would like to take the system presented here further, in order to
see how it may perform in other languages on similar tasks.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Benamara</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grouin</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Karoui</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moriceau</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Robba</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Analyse d'opinion et langage guratif dans des tweets : presentation et</article-title>
          resultats du de fouille de textes deft2017 (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Chung</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , Caglar Gulcehre, Cho,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Bengio</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y.</surname>
          </string-name>
          :
          <article-title>Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling</article-title>
          .
          <source>CoRR</source>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Cignarella</surname>
            ,
            <given-names>A.T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Frenda</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Basile</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bosco</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Patti</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosso</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Overview of the evalita 2018 task on irony detection in italian tweets (ironita)</article-title>
          . In: EVALITA@
          <string-name>
            <surname>CLiC-it</surname>
          </string-name>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Devlin</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chang</surname>
            ,
            <given-names>M.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Toutanova</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Bert: Pre-training of deep bidirectional transformers for language understanding</article-title>
          .
          <source>In: NAACL-HLT</source>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Ghanem</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Karoui</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Benamara</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moriceau</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosso</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Idat@ re2019: Overview of the track on irony detection in arabic tweets</article-title>
          . In: Mehta P.,
          <string-name>
            <surname>Rosso</surname>
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Majumder</surname>
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mitra</surname>
            <given-names>M</given-names>
          </string-name>
          . (Eds.)
          <article-title>Working Notes of the Forum for Information Retrieval Evaluation (FIRE 2019)</article-title>
          . CEUR Workshop Proceedings. In: CEUR-WS.org, Kolkata, India, December
          <volume>12</volume>
          -
          <fpage>15</fpage>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Grice</surname>
            ,
            <given-names>H.P.</given-names>
          </string-name>
          :
          <article-title>Studies in the Way of Words</article-title>
          . Harvard University Press (
          <year>1989</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Hee</surname>
            ,
            <given-names>C.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lefever</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hoste</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Semeval-2018 task 3: Irony detection in english tweets</article-title>
          .
          <source>In: Proceedings of SemEval@NAACL-HLT</source>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Hettiarachchi</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ranasinghe</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Emoji powered capsule network to detect type and target of o ensive posts in social media</article-title>
          .
          <source>In: Proceedings of RANLP</source>
          <year>2019</year>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Hinton</surname>
            ,
            <given-names>G.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sabour</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Frosst</surname>
          </string-name>
          , N.:
          <article-title>Matrix capsules with EM routing</article-title>
          .
          <source>In: Proceedings of ICLR</source>
          <year>2018</year>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weinberger</surname>
            ,
            <given-names>K.Q.</given-names>
          </string-name>
          :
          <article-title>Densely Connected Convolutional Networks</article-title>
          .
          <source>Proceedings of IEEE CVPR</source>
          <year>2017</year>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Kingma</surname>
            ,
            <given-names>D.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ba</surname>
          </string-name>
          , J.:
          <article-title>Adam: A Method for Stochastic Optimization</article-title>
          .
          <source>Proceedings of CoRR</source>
          <year>2015</year>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Kowsari</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jafari Meimandi</surname>
            ,
            <given-names>K.</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>
          .
          <source>Information</source>
          <volume>10</volume>
          (
          <issue>4</issue>
          ) (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</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>
          ,
          <string-name>
            <surname>Puhrsch</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Joulin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Advances in PreTraining Distributed Word Representations</article-title>
          .
          <source>In: Proceedings of LREC</source>
          <year>2018</year>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Peters</surname>
            ,
            <given-names>M.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Neumann</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Iyyer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gardner</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Clark</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zettlemoyer</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Deep contextualized word representations (</article-title>
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Plum</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ranashinghe</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Orasan</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mitkov</surname>
          </string-name>
          , R.: Rgcl at germeval 2019:
          <article-title>Offensive language detection with deep learning</article-title>
          .
          <source>In: Proceedings of GermEval at KONVENS</source>
          <year>2019</year>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Plum</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ranasinghe</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Calleja</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Orasan</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mitkov</surname>
          </string-name>
          , R.:
          <article-title>Rgcl-wlv at semeval2019 task 12: Toponym detection</article-title>
          .
          <source>In: Proceedings of SemEval 2019</source>
          . pp.
          <volume>1297</volume>
          {
          <issue>1301</issue>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Plum</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ranasinghe</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Orasan</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Toponym detection in the bio-medical domain: A hybrid approach with deep learning</article-title>
          .
          <source>In: Proceedings of RANLP</source>
          <year>2019</year>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Ravaut</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gorti</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Gradient descent revisited via an adaptive online learning rate</article-title>
          . arXiv preprint arXiv:
          <year>1801</year>
          .
          <volume>09136</volume>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Scherer</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , Muller,
          <string-name>
            <given-names>A.C.</given-names>
            ,
            <surname>Behnke</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.</surname>
          </string-name>
          :
          <article-title>Evaluation of Pooling Operations in Convolutional Architectures for Object Recognition</article-title>
          .
          <source>In: Proceedings of ICANN</source>
          <year>2010</year>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Schuster</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Paliwal</surname>
            ,
            <given-names>K.K.:</given-names>
          </string-name>
          <article-title>Bidirectional recurrent neural networks</article-title>
          .
          <source>IEEE Trans. Signal Processing</source>
          <volume>45</volume>
          ,
          <volume>2673</volume>
          {
          <fpage>2681</fpage>
          (
          <year>1997</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Srivastava</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hinton</surname>
            ,
            <given-names>G.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Krizhevsky</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sutskever</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Salakhutdinov</surname>
            ,
            <given-names>R.R.</given-names>
          </string-name>
          :
          <article-title>Dropout: a simple way to prevent neural networks from over tting</article-title>
          .
          <source>Journal of Machine Learning Research 15</source>
          ,
          <year>1929</year>
          {
          <year>1958</year>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Tompson</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goroshin</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jain</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>LeCun</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bregler</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>E cient object localization using Convolutional Networks</article-title>
          .
          <source>Proceedings of IEEE CVPR</source>
          <year>2015</year>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Vaswani</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shazeer</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Parmar</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Uszkoreit</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jones</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gomez</surname>
            ,
            <given-names>A.N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kaiser</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Polosukhin</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Attention Is All You Need</article-title>
          .
          <source>In: Proceedings of NIPS</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Wan</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zeiler</surname>
            ,
            <given-names>M.D.</given-names>
          </string-name>
          , Zhang,
          <string-name>
            <surname>S.</surname>
          </string-name>
          , LeCun,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Fergus</surname>
          </string-name>
          , R.:
          <article-title>Regularization of Neural Networks using DropConnect</article-title>
          . In: ICML (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zha</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yuan</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>A Comparison of 1-D and 2</article-title>
          -
          <string-name>
            <given-names>D</given-names>
            <surname>Deep Convolutional</surname>
          </string-name>
          <article-title>Neural Networks in ECG Classi cation</article-title>
          .
          <source>In: Proceedings of IEEE Engineering in Medicine and Biology Society</source>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>