<!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>BRUMS at HASOC 2019: Deep Learning Models for Multilingual Hate Speech and O ensive Language Identi cation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Tharindu Ranasinghe</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marcos Zampieri</string-name>
          <email>marcos.zampieri@rit.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hansi Hettiarachchi</string-name>
          <email>hansi.hettiarachchi@mail.bcu.ac.uk</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>College of Liberal Arts, Rochester Institute of Technology</institution>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Research Group in Computational Linguistics, University of Wolverhampton</institution>
          ,
          <country country="UK">UK</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>School of Computing and Digital Technology, Birmingham City University</institution>
          ,
          <country country="UK">UK</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2019</year>
      </pub-date>
      <abstract>
        <p>In this paper, we describe the BRUMS entry to the Hate Speech and O ensive Content Identi cation in Indo-European Languages (HASOC) shared task 2019. The HASOC organizers provided participants with annotated datasets containing posts from social media in English, German, and Hindi (including code-mixing). We present a multilingual deep learning model to identify hate speech and o ensive language in social media. Our best performing system was ranked 3rd among 79 entries in the English track of the HASOC sub-task 1.</p>
      </abstract>
      <kwd-group>
        <kwd>O ensive Language Identi cation Hate Speech Text Classi cation Deep Learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The various forms of abusive and o ensive content online pose risks to the users
of social media platforms. One such example is cyberbulling which has been
linked to depression and suicide risk among teenagers [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. As o ensive language
becomes pervasive in social media, scholars and companies have been working
on developing systems capable of identifying o ensive posts, which can be set
aside for human moderation or permanently deleted [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ]. The use of robust
NLP methods in these systems is paramount to cope with the many ways such
content can be presented. While direct abuse and insults containing profanity
are fairly easy to be identi ed, recognizing indirect insults for example, which
often include metaphors and sarcasm, are a challenge to human annotators and,
as a consequence, to most state-of-the-art systems [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
      </p>
      <p>
        In light of these important challenges, a recent growing interest of the NLP
community in detecting abusive and o ensive content online has been observed.
This is evidenced by previous work focusing on the identi cation of abusive
content [
        <xref ref-type="bibr" rid="ref19 ref8">19, 8</xref>
        ], aggression [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], cyberbullying [
        <xref ref-type="bibr" rid="ref32 ref4">4, 32</xref>
        ], hate speech [
        <xref ref-type="bibr" rid="ref15 ref17 ref6">6, 15, 17</xref>
        ], and
o ensive language [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ]. Along with these studies, a few shared tasks have been
organized on these topics, such as HatEval [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] and O ensEval [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ] co-located
with SemEval 2019.
      </p>
      <p>
        This paper revisits the problem of o ensive language identi cation
describing our submission to the sub-task A of the Hate Speech and O ensive Content
Identi cation in Indo-European Languages (HASOC) shared task [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ].4 The
remainder of this paper is structured as follows: Section 2 describes the system
that was submitted, split into a description of the dataset (Section 2.1), how the
data was processed (Section 2.2) and the architecture of the classi er that was
used (Section 2.3). 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). Finally, Section 4 o ers some nal remarks and a conclusion.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Methods and Data</title>
      <p>This section describes the shared task data, as well as the BRUMS system that
was used in the competition. As HASOC is a multilingual competition, we use
only minimal preprocessing methods to make the system portable to all
languages in the dataset. For classi cation, we used and compared seven di erent
neural network architectures suited to this task. Our implementation has been
made available on Github.5
2.1</p>
      <sec id="sec-2-1">
        <title>Dataset</title>
        <p>
          The multilingual HASOC dataset has posts from Facebook and Twitter and it
is distributed in tab separated format. The dataset contains posts written in
3 languages: German, English and code-mixed Hindi. The size of the training
set is approximately 8,000 posts for each language and the test data contains
approximately 1,000 posts for each language. The dataset is annotated using
a three-level hierarchical model similar to the proposed in the annotation of
the OLID datset [
          <xref ref-type="bibr" rid="ref33">33</xref>
          ]. In HASOC, each layer corresponds to one sub-task in
the competition. We participate in sub-task A which focus on hate speech and
o ensive language identi cation. It is a binary classi cation task in which the
goal is to develop systems able to classify tweets into two classes, namely: Hate
and O ensive (HOF) and Non- Hate and o ensive (NOT).
2.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Text Preprocessing</title>
        <p>As mentioned previously, the data preprocessing for this task was kept fairly
minimal to make it portable for all the languages. More speci cally, we perform</p>
        <sec id="sec-2-2-1">
          <title>4 https://hasoc2019.github.io/</title>
        </sec>
        <sec id="sec-2-2-2">
          <title>5 https://github.com/TharinduDR/HASOC-2019</title>
          <p>only three specialised tasks for this data, followed by tokenisation. The tasks
include removing usernames, removing URLs, and converting all tokens to lower
case.</p>
          <p>First, we completely remove all usernames from the texts, without inserting
a placeholder. This is carried out by removing all strings beginning with the
@ symbol, as this is how usernames are denoted on Twitter. The reasoning
behind this step is mainly to remove noisy text, as it is highly unlikely that there
would be any embeddings for the usernames. In addition to that, we believe that
these usernames don't add much semantic meaning. Moreover, if, for instance,
a majority of o ensive tweets were written by one user, this could lead to bias
in the system against one user.</p>
          <p>After that, we remove all the URLs from the texts. All the tweets contain
an URL which also refers to the URL of the particular tweet. All these URLs
start with https://t.co/ followed by an unique ID. Therefore, we used a regular
expression to remove all strings beginning with the https://t.co/. Similar to the
usernames, URLs too do not add any semantic meaning and can be considered
as noisy.</p>
          <p>Final prepossessing step is only applied to the architectures that used
character embeddings. The fastText pretrained character embedding models that we
used only contain lower-cased letters. Therefore, we convert the text to lower
case letters. However, the BERT models we used are cased. This preprocessing
step was not used to the BERT based architecture.
2.3</p>
        </sec>
      </sec>
      <sec id="sec-2-3">
        <title>Neural Network Architectures</title>
        <p>
          For the rst six architectures, after text processing we used fastText character
embeddings [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] to encode text. 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). The
parameters of each architecture were optimised using 5-fold cross-validation
considering binary cross entropy loss function and using adam optimiser [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. We
used the reducing 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="ref21">21</xref>
          ]. We
monitored validation macro F1 score and if no improvement was seen for 2 epochs,
the learning rate was reduced by a factor of 0:6, since this value seemed to o er
the best improvement. These architectures were successfully applied to a number
of classi cation tasks such as GRU with pooling for sequence labeling [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], GRU
with capsule for toponym detection [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ], and their success in these tasks inspired
us to use them for the task at hand.
        </p>
        <p>
          As the last architecture we ne-tuned BERT [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] model. For the English task,
we used whole word masking variant of BERT-Large 6. For the German and
Hindi tasks, we used BERT-Base, Multilingual Cased model, which has been
trained with 104 languages including German and Hindi. BERT-Large model
has been widely used in text classi cation tasks like sentiment analysis [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ]
which motivated us to use it for aggression detection 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="ref5">5</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="ref23">23</xref>
          ]. After this, the
outputs of the two pooling layers are concatenated and connected to a dense layer
[
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] activated with a sigmoid function. Additionally, there is a spatial dropout
[
          <xref ref-type="bibr" rid="ref27">27</xref>
          ] between the embedding layer and the bi-directional GRU layer to avoid
overtting. This architecture has been discussed in [
          <xref ref-type="bibr" rid="ref13">13</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 are fed into a bi-directional LSTM-layer [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ]. The output of
this layer is again fed into a bi-directional LSTM-layer [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ] with self attention
[
          <xref ref-type="bibr" rid="ref28">28</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="ref11">11</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 Kaggle7.
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="ref27">27</xref>
          ] and is then fed in
parallel to a bi-directional LSTM-layer [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ] with self attention and a bi-directional
GRU-layer [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] with self attention [
          <xref ref-type="bibr" rid="ref28">28</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="ref25">25</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
different approach than the previous architectures by using 2D convolution layers
[
          <xref ref-type="bibr" rid="ref31">31</xref>
          ], rather than LSTM or GRU layers. The outputs of the embedding layer
are connected to four 2D convolution layers [
          <xref ref-type="bibr" rid="ref31">31</xref>
          ], each with max pooling layers.
All the 2D convolution layers were initialised with normal kernel initialiser. The
        </p>
        <sec id="sec-2-4-1">
          <title>6 https://github.com/google-research/bert</title>
        </sec>
        <sec id="sec-2-4-2">
          <title>7 https://www.kaggle.com/c/jigsaw-toxic-comment-classi cation-challenge</title>
          <p>
            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="ref25">25</xref>
            ]. This architecture has been used
in the Quora Insincere Questions Classi cation Kaggle competition8.
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="ref10">10</xref>
            ] rather than pooling
layers. After applying a spatial dropout [
            <xref ref-type="bibr" rid="ref27">27</xref>
            ] the output of the embedding layer
is fed into a bi-directional GRU-layer [
            <xref ref-type="bibr" rid="ref5">5</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="ref10">10</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="ref25">25</xref>
            ] and batch normalisation applied, and
re-connected to a dense layer with sigmoid activation. This architecture has been
used to detect locations within word windows [
            <xref ref-type="bibr" rid="ref9">9</xref>
            ].
2.3.6 LSTM with Capsule and Attention This architecture uses
combination of a capsule layer [
            <xref ref-type="bibr" rid="ref10">10</xref>
            ] and a self attention layer [
            <xref ref-type="bibr" rid="ref28">28</xref>
            ]. After the embedding
layer a spatial dropout [
            <xref ref-type="bibr" rid="ref27">27</xref>
            ] is applied to the output, which is then fed into a
bidirectional LSTM-layer [
            <xref ref-type="bibr" rid="ref24">24</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="ref29">29</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.9
2.3.7 BERT for Text Classi cation For this method we used a di erent
approach than the above architectures [
            <xref ref-type="bibr" rid="ref7">7</xref>
            ]. All of the above architectures use
fastText character embeddings [
            <xref ref-type="bibr" rid="ref3">3</xref>
            ] feed in to neural network. In more details, a
pre-trained neural network produces character embeddings which are then used
as features in NLP models. In this approach we use a di erent approach with
transfer learning - pre-training a neural network model on a known task, and
then performing ne-tuning | using the trained neural network as the basis
of a new purpose-speci c model. The known task that the BERT uses is next
sentence prediction. In the BERT training process, the model receives pairs of
sentences as input and learns to predict if the second sentence in the pair is the
subsequent sentence in the original document. Classi cation tasks can be done
similarly to Next Sentence classi cation, by adding a classi cation layer on top
of the Transformer output for the token. We used this particular method for this
aggression detection task.
          </p>
        </sec>
        <sec id="sec-2-4-3">
          <title>8 https://www.kaggle.com/c/quora-insincere-questions-classi cation</title>
        </sec>
        <sec id="sec-2-4-4">
          <title>9 https://www.kaggle.com/c/jigsaw-unintended-bias-in-toxicity-classi cation</title>
          <p>3</p>
        </sec>
      </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. We compare the performance of above
neural network architectures in order to select submissions for each language.
3.1</p>
      <sec id="sec-3-1">
        <title>Architecture Evaluation</title>
        <p>
          This section describes how we selected the architecture for the nal submission
in each language. 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 two evaluation metrics:
macroaveraged F1-score and weighted F1-score score as denoted in the table 1.
As shown in the table 1, BERT based architecture had the best F1 scores from the
seven experimented architectures for all the languages. Therefore, we submitted
output from the BERT architecture as our nal submission.
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 standards of the test set is not available. Therefore, we report only
the evaluation provided to us by the task organisers which is solely based on
F1scores. Our submission had macro-averaged F1-scores 0.7694, 0.5464 and 0.8025
for English, German and Hindi respectively. Furthermore, our BERT based
submission had weighted F1 0.8379, 0.7870, 0.8030 for English, German and Hindi
respectively. According to the results presented in [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ], our best performing
system was ranked 3rd among 79 entries in the English track of the HASOC sub-task
1.
4
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusion</title>
      <p>In this paper, we have presented the BRUMS system for identifying o ensive
language in tweets and Facebook posts in German, English, and Hindi. The
system uses minimal preprocessing, and relies on word and context embeddings.
We experimented with di erent deep neural network architectures in order to
determine the most suitable for this task. According to our evaluation, and
the results provided by the task organisers, it is clear that ne tuning BERT
architecture scores highest overall.</p>
      <p>Due to non language-speci c preprocessing, our system performs well in all
the three languages. Compared to the performance obtained by the other
participants of the HASOC sub-task 1, our model achieves its best results on English
data ranking 3rd among 79 entries. We are interested in investigating the
performance of our system in other sub-tasks too. In the future, we would like to
see how to extend this system to other languages as well as similar tasks and
datasets.</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgements</title>
      <p>We would like to thank the HASOC shared task organizers for organizing this
interesting shared task and for replying promptly to all our inquiries. We further
thank the anonymous reviewers for their feedback.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <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>Fersini</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nozza</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Patti</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pardo</surname>
            ,
            <given-names>F.M.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosso</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sanguinetti</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Semeval-2019 task 5: Multilingual detection of hate speech against immigrants and women in twitter</article-title>
          .
          <source>In: Proceedings of the 13th International Workshop on Semantic Evaluation</source>
          . pp.
          <volume>54</volume>
          {
          <issue>63</issue>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Bauman</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Toomey</surname>
            ,
            <given-names>R.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Walker</surname>
            ,
            <given-names>J.L.</given-names>
          </string-name>
          :
          <article-title>Associations among bullying, cyberbullying, and suicide in high school students</article-title>
          .
          <source>Journal of adolescence 36(2)</source>
          ,
          <volume>341</volume>
          {
          <fpage>350</fpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <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>
          ,
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Enriching word vectors with subword information</article-title>
          .
          <source>arXiv preprint arXiv:1607.04606</source>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Chelmis</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zois</surname>
            ,
            <given-names>D.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yao</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Mining patterns of cyberbullying on twitter</article-title>
          .
          <source>In: 2017 IEEE International Conference on Data Mining Workshops (ICDMW)</source>
          . pp.
          <volume>126</volume>
          {
          <fpage>133</fpage>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <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="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Davidson</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Warmsley</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Macy</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weber</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Automated Hate Speech Detection and the Problem of O ensive Language</article-title>
          .
          <source>In: Proceedings of ICWSM</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <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="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Founta</surname>
            ,
            <given-names>A.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Djouvas</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chatzakou</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Leontiadis</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Blackburn</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stringhini</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vakali</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sirivianos</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kourtellis</surname>
          </string-name>
          , N.:
          <article-title>Large scale Crowdsourcing and Characterization of Twitter Abusive Behavior</article-title>
          . In: Twelfth
          <source>International AAAI Conference on Web and Social Media</source>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <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: Proc. of the Recent Advances in Natural Language Processing (RANLP)</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <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="ref11">
        <mixed-citation>
          11.
          <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="ref12">
        <mixed-citation>
          12.
          <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="ref13">
        <mixed-citation>
          13.
          <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="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Kumar</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ojha</surname>
            ,
            <given-names>A.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Malmasi</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zampieri</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Benchmarking Aggression Identi cation in Social Media</article-title>
          .
          <source>In: Proceedings of TRAC</source>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Malmasi</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zampieri</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Detecting Hate Speech in Social Media</article-title>
          .
          <source>In: Proceedings of the International Conference Recent Advances in Natural Language Processing (RANLP)</source>
          . pp.
          <volume>467</volume>
          {
          <issue>472</issue>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Malmasi</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zampieri</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>Challenges in Discriminating Profanity from Hate Speech</article-title>
          .
          <source>Journal of Experimental &amp; Theoretical Arti cial Intelligence</source>
          <volume>30</volume>
          ,
          <issue>1</issue>
          {
          <fpage>16</fpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Mathew</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Illendula</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Saha</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sarkar</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goyal</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mukherjee</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Temporal e ects of unmoderated hate speech in gab</article-title>
          . arXiv preprint arXiv:
          <year>1909</year>
          .
          <volume>10966</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Modha</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mandl</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Majumder</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Patel</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Overview of the HASOC track at FIRE 2019: Hate Speech and O ensive Content Identi cation in Indo-European Languages</article-title>
          .
          <source>In: Proceedings of the 11th annual meeting of the Forum for Information Retrieval Evaluation</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Nobata</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tetreault</surname>
          </string-name>
          , J.,
          <string-name>
            <surname>Thomas</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mehdad</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Abusive Language Detection in Online User Content</article-title>
          .
          <source>In: Proceedings of WWW</source>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <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.:
          <string-name>
            <surname>RGCL-WLV at</surname>
          </string-name>
          SemEval-2019
          <source>Task</source>
          <volume>12</volume>
          :
          <string-name>
            <given-names>Toponym</given-names>
            <surname>Detection</surname>
          </string-name>
          .
          <source>In: Proceedings of SemEval-2019</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <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="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Risch</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Krestel</surname>
          </string-name>
          , R.:
          <article-title>Delete or not Delete? Semi-Automatic Comment Moderation for the Newsroom</article-title>
          .
          <source>In: Proceedings of the First Workshop on Trolling, Aggression and Cyberbullying (TRAC-2018)</source>
          . pp.
          <volume>166</volume>
          {
          <issue>176</issue>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <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="ref24">
        <mixed-citation>
          24.
          <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="ref25">
        <mixed-citation>
          25.
          <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="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Sun</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Qiu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          :
          <article-title>How to ne-tune bert for text classi cation? ArXiv abs/</article-title>
          <year>1905</year>
          .05583 (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <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="ref28">
        <mixed-citation>
          28.
          <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="ref29">
        <mixed-citation>
          29.
          <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="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Wiegand</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Siegel</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ruppenhofer</surname>
          </string-name>
          , J.:
          <article-title>Overview of the GermEval 2018 Shared Task on the Identi cation of O ensive Language</article-title>
          .
          <source>In: Proceedings of GermEval</source>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <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 id="ref32">
        <mixed-citation>
          32.
          <string-name>
            <surname>Yao</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chelmis</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zois</surname>
            ,
            <given-names>D.S.:</given-names>
          </string-name>
          <article-title>Cyberbullying detection on instagram with optimal online feature selection</article-title>
          .
          <source>In: 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)</source>
          . pp.
          <volume>401</volume>
          {
          <fpage>408</fpage>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <surname>Zampieri</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Malmasi</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nakov</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosenthal</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Farra</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kumar</surname>
          </string-name>
          , R.:
          <article-title>Predicting the type and target of o ensive posts in social media</article-title>
          .
          <source>In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          , Volume
          <volume>1</volume>
          (Long and Short Papers). pp.
          <volume>1415</volume>
          {
          <issue>1420</issue>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          34.
          <string-name>
            <surname>Zampieri</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Malmasi</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nakov</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosenthal</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Farra</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kumar</surname>
          </string-name>
          , R.: SemEval
          <article-title>-2019 Task 6: Identifying and Categorizing O ensive Language in Social Media (O ensEval)</article-title>
          .
          <source>In: Proceedings of The 13th International Workshop on Semantic Evaluation (SemEval)</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>