<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>Forum for Information Retrieval Evaluation, December</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>yasuo at HASOC2020: Fine-tune XML-RoBERTa for Hate Speech Identification</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Li Xu</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jun Zeng</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Shi Chen</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>School of Information Science and Engineering, Yunnan University</institution>
          ,
          <addr-line>Kunming</addr-line>
          ,
          <country country="CN">P.R. China</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2020</year>
      </pub-date>
      <volume>1</volume>
      <fpage>6</fpage>
      <lpage>20</lpage>
      <abstract>
        <p>In recent years, people are more concerned about hate speech identification and identification than ever. This paper describes our system for English and German Sub-Task A in HASOC2020. For these subtasks, we fine-tune the XLM-RoBERTa pre-training model for sentence embedding and extract the layer with the best performance for slicing and splicing. In order to make full use of both English and German corpus, we propose a multi-task method to optimize two classification tasks at the same time. Our model has achieved 0.9076 for F1 score in English Sub-Task A and 0.8165 in German Sub-Task A.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>https://619496775.github.io/ (L. Xu)
© 2020 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Works</title>
      <p>
        Detecting abusive language in a sea of data on social media is a dificult and arduous work, and
researches have only conducted in recent years. Some research shows that the deep learning
model with word-embedding can achieve better results in text classification tasks. As a result,
Word2Vec is commonly used to obtain semantic information and attributes in the text through
an unsupervised word embedding method. Common machine learning algorithms include
Logistic Regression(LR), Support Vector Machine(SVM), Random Forest, etc. For deep learning
methods, most of them are based on Long-Short Term Memory network (LSTM), convolutional
neural network (CNN) or a recursive neural network (RNN). Some of the early work use features
like bag of words, word and character n-grams with relatively machine learning classifiers for
detection (Dinakar et al.[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]; Waseem and Hovy[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]; Nobata et al.[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]). Kim et. al[
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] use CNNs for
sentiment classification, It requires very few hyperparameter adjustments and static vectors
to achieve good results on multiple baseline. MacAvaney et al.[
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] propose a multi-view SVM
approach that achieves near state-of-the-art performance, while being simpler and producing
more easily interpretable decisions than neural methods.
      </p>
      <p>More recently, BERT released by Google gains more attention in the research community, as
it can capture both long-distance reliance and true bidirectional context information compared
with the traditional way of deep learning.</p>
      <p>
        BERT [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] and other models have achieved good results in monolingual NLP tasks, but for
NLP in addition to English, researchers have cultivated more and more monolingual models for
a variety of diferent languages. At the same time, there appears to be an alternative approach
that has received little attention: the multilingual model. XLM[
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] is a cross-language
pretraining model that extends the full-length and training strategy MLM (Masked Language
Model) proposed in BERT to multiple languages, and has been experimentally proven to take
efect.
      </p>
      <p>
        RoBERTa [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] is an upgraded version of BERT. Compared to BERT, it uses a larger number of
model parameters, a larger batch size and more training data. It is built on the BERT language
masking strategy, which modifies key hyperparameters in BERT, including deleting BERT’s
next sentence prediction task, which enables RoBERTa representation to be better expansibility
to downstream tasks than BERT.
      </p>
      <p>As for the XLM-RoBERTa model, it combines these advantages of both. We fine-tune
XLMRoBERTa and use multitask training to improve the performance of prediction. This enables
our model to achieve good results in the category of hate text.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Dataset and Task description</title>
      <p>The dataset of HASOC task A contains over 10,000 annotated tweets respectively composed of
userID, tweets, and labels from Twitter. Through our analysis on the dataset, English dataset
has a uniform distribution, while German dataset is uneven.</p>
      <p>We took part in the English and German Sub-Task A, which involves building a coarse-grained
binary categorization model to test whether a text is ofensive or insulting (HOF). If a text
contains any form of unacceptable verbal, aggression and profanity, it will be considered as</p>
    </sec>
    <sec id="sec-4">
      <title>4. Our Solution</title>
      <sec id="sec-4-1">
        <title>Not Hate/Ofensive/Profane</title>
      </sec>
      <sec id="sec-4-2">
        <title>Hate/Ofensive/Profane Total 3040 760</title>
        <p>Our solution is specifically divided into data preprocessing, feature extraction and model
structure.</p>
        <sec id="sec-4-2-1">
          <title>4.1. Data Preprocessing</title>
          <p>Because there was noise in tweets in oficial dataset, which would afect the performance of
model training, we cleaned the data before training. The steps are as following:
• Keep the label
• Handle user name and @ beginning uniformly as ”username”
• Separate conjunction
• Turn Emojis expression into the corresponding phrase
• Remove words that have no emotional meaning
• Remove all URLs
• Convert text to lowercase
• Numbers are normalized to strings as ”number”</p>
          <p>After data preprocessing, we combined the English and German datasets as one dataset.
In order to improve the generalization ability of model, let the model learn the real data
characteristic distribution, the method of stratified sampling is adopted to ensure the training
set and the valid set have the same data distribution.</p>
          <p>Besides, we divide 20% as the valid set, 80% as the train set. Table 1 shows the distribution of
HOF and NOT in the dataset. The test set is given by oficial.</p>
        </sec>
        <sec id="sec-4-2-2">
          <title>4.2. Feature vectors</title>
          <p>
            XLM-RoBERTa embeddings: We utilized XLM-RoBERTa[
            <xref ref-type="bibr" rid="ref14">14</xref>
            ] for embedding, which is a
multilingual model with Transformer for the major structure. There are 12 layers of the model, output
with 768 dimensions.
          </p>
          <p>[CLS] Tok1 Tok2
Layer1</p>
          <p>E[CLS]</p>
          <p>E1
[SEP]
E[SEP]</p>
          <p>Tok1
E1'</p>
          <p>TokM</p>
          <p>EM'
E2
T2</p>
          <p>XLM-RoBERTa
Layer12</p>
          <p>C</p>
          <p>T1</p>
          <p>T[SEP]</p>
          <p>T1'</p>
          <p>TM' 32×64×768</p>
          <p>Slice</p>
          <p>32×768
Sentences
De and En</p>
          <p>Labels De</p>
          <p>Labels En</p>
          <p>Softmax
Classifier</p>
          <p>Concatena
te</p>
          <p>Tc
32×768</p>
        </sec>
        <sec id="sec-4-2-3">
          <title>4.3. Our Model</title>
          <p>After getting the embedded vectors of the texts, we fine-tuned XLM-RoBERTa to make it more
suitable for the downstream task of hate speech identification. XLM-roBERTa has a total of 12
layers which learn diferent semantic information. Generally speaking, the shallower the layers,
the more word level semantic information is learned. The deeper layers, the more generalized
semantic information is learned. Whereas   ([CLS]vectors) contains the semantic information
for classification of the entire sentence, we try to combine   with vectors at a certain layer to
improve training performance. The influence of each layer is given in Table 2.</p>
          <p>Global semantic information is more helpful for binary classification such as sub-Task A. The
hidden layer of the XLM-RoBERTa model is 768 dimensions, with 12 layers of Transformer.
Because the shape of   is [32,768] and the hidden vector of the 12th layer’s shape is [32,60,768],
we take out 12th layer as dim= (0,2) and splice together with   , then passed it to classifier and
send the result to Softmax. We trained both English and German tasks by feeding the processed
data into the model.</p>
          <p>Multitask learning can learn useful information from similar tasks. All tasks will share
XLMRoBERTa’s layers. In order to take full advantage of each classification corpus, two classification
tasks are combined to carry out multi-task training. In this way, the number of datasets can
also be expanded.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Result</title>
      <sec id="sec-5-1">
        <title>5.1. Baslines</title>
        <p>LR is a machine learning method to solve the problem of categorization (0 or 1). We use it as
the baseline classifier for both English and German datasets. The configuration is as follows:
we use L2 regularization with the hyper parameter C=1.2 (Inverse of regularization strength)
and use TF-IDF features of word n-grams(1,6) for training the classifier.</p>
        <p>
          SVM is a binary classification model [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ]. The basic method is to solve the separated
hyperplane that can correctly divide the training dataset and has the maximum geometric spacing.
We use it as the baseline classifier for both English and German datasets. The configuration
is as follows: we uses the ‘linear’ kernel, L2 regularization with the hyper parameter C=1.0
(Inverse of regularization strength) , and the same TF-IDF features of word n-grams(1,6) to train
the classifier.
        </p>
        <p>
          BiLSTM[
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] model is implemented with 100 units, adopts sigmoid activation. For training,
binary cross entropy loss function and adam optimizer are used. As for regularization, 50%
dropout is configured. For English and German subtasks, we respectively use 300 dimensional
English fastText embeddings, 300 dimensional German fastText embeddings to initialize the
word vectors.
        </p>
      </sec>
      <sec id="sec-5-2">
        <title>5.2. Comparison</title>
        <p>XLM-RoBERTa model and other model’s accuracy and F1 macro-average score in English and
German are showed in Table 3 and Table 4. To verify the efectiveness of the fine-tuning
strategies, ablation experiments are conducted. We also using BERT base model and   −
   as the baseline.</p>
        <p>In the two subtasks, BERT and XLM-RoBERTa models performance better than LR, SVM and
BiLSTM models. It may because deep learning has great advantages over traditional machine
learning methods in document classification. For traditional machine learning methods, it is not
easy to extract text features. Moreover, these features cannot well represent the semantics and
syntax of the document, and a large part of useful information is lost. Deep learning is to hand
over the feature extraction to deep network for automatic completion. Higher computational
costs in exchange for more comprehensive and better text features. So deep learning methods
performance better in our hate speech identification tasks.</p>
        <p>These experiments prove that our fine-tune XLM-RoBERTa model is efective for both German
and English tasks. Table 3 and 4 show the comparison between diferent models where deep
learning models performs better than traditional machine learning models.</p>
        <p>Our system ranked 16th in the German subtask and 34th in the English subtask, F1
macroaverage Score for German subtask was 0.4968 (Top team was 0.5235) under the oficial private
dataset, F1 macro-average score for English subtask was 0.4856 (Top team was 0.5152) under
the oficial private dataset.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusions</title>
      <p>We have proposed a neural solution with fine-tuning XML-RoBERTa for hate speech
identification. Particularly, the output and hidden layers are slicing and splicing, which solves the sparsity
of data and increases the generalization ability of the model in a multi-task way. Experiments
have proved the competitiveness of our method.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments</title>
      <p>This work is supported by the National Natural Science Foundation of China (61962061), partially
supported by the Yunnan Provincial Foundation for Leaders of Disciplines in Science and
Technology, Top Young Talents of ”Ten Thousand Plan” in Yunnan Province, the Program for
Excellent Young Talents of Yunnan University.</p>
    </sec>
    <sec id="sec-8">
      <title>A. Online Resources</title>
      <p>• GitHub</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>R.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. K.</given-names>
            <surname>Ojha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Malmasi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zampieri</surname>
          </string-name>
          ,
          <article-title>Benchmarking aggression identification in social media</article-title>
          ,
          <source>in: Proceedings of the First Workshop on Trolling, Aggression and Cyberbullying (TRAC-2018)</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>11</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>C.</given-names>
            <surname>Chelmis</surname>
          </string-name>
          , D.-S. Zois,
          <string-name>
            <given-names>M.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <article-title>Mining patterns of cyberbullying on twitter</article-title>
          ,
          <source>in: 2017 IEEE International Conference on Data Mining Workshops (ICDMW)</source>
          , IEEE,
          <year>2017</year>
          , pp.
          <fpage>126</fpage>
          -
          <lpage>133</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Chelmis</surname>
          </string-name>
          , D.-S. Zois,
          <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>
          , IEEE,
          <year>2018</year>
          , pp.
          <fpage>401</fpage>
          -
          <lpage>408</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J.</given-names>
            <surname>Waldron</surname>
          </string-name>
          ,
          <article-title>The harm in hate speech</article-title>
          , Harvard University Press,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>C.</given-names>
            <surname>Nobata</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tetreault</surname>
          </string-name>
          , A. Thomas,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Mehdad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <article-title>Abusive language detection in online user content</article-title>
          ,
          <source>in: Proceedings of the 25th international conference on world wide web</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>145</fpage>
          -
          <lpage>153</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>T.</given-names>
            <surname>Mandl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Modha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. K.</given-names>
            <surname>Shahi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. K.</given-names>
            <surname>Jaiswal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Nandini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Patel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Majumder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Schäfer</surname>
          </string-name>
          ,
          <article-title>Overview of the HASOC track at FIRE 2020: Hate Speech and Ofensive Content Identification in Indo-European Languages)</article-title>
          ,
          <source>in: Working Notes of FIRE 2020 - Forum for Information Retrieval Evaluation</source>
          ,
          <string-name>
            <surname>CEUR</surname>
          </string-name>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>K.</given-names>
            <surname>Dinakar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Reichart</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Lieberman</surname>
          </string-name>
          ,
          <article-title>Modeling the detection of textual cyberbullying</article-title>
          ,
          <source>in: In Proceedings of the Social Mobile Web, Citeseer</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Waseem</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hovy</surname>
          </string-name>
          ,
          <article-title>Hateful symbols or hateful people? predictive features for hate speech detection on twitter</article-title>
          ,
          <source>in: Proceedings of the NAACL student research workshop</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>88</fpage>
          -
          <lpage>93</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <article-title>Convolutional neural networks for sentence classification</article-title>
          ,
          <source>arXiv preprint arXiv:1408.5882</source>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>M.</given-names>
            <surname>Sap</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Card</surname>
          </string-name>
          , S. Gabriel,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Choi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. A.</given-names>
            <surname>Smith,</surname>
          </string-name>
          <article-title>The risk of racial bias in hate speech detection</article-title>
          ,
          <source>in: Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>1668</fpage>
          -
          <lpage>1678</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , Bert:
          <article-title>Pre-training of deep bidirectional transformers for language understanding</article-title>
          , arXiv preprint arXiv:
          <year>1810</year>
          .
          <volume>04805</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>G.</given-names>
            <surname>Lample</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Conneau</surname>
          </string-name>
          ,
          <article-title>Cross-lingual language model pretraining</article-title>
          , arXiv preprint arXiv:
          <year>1901</year>
          .
          <volume>07291</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Lan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Goodman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Gimpel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Sharma</surname>
          </string-name>
          , R. Soricut,
          <string-name>
            <surname>Albert:</surname>
          </string-name>
          <article-title>A lite bert for self-supervised learning of language representations</article-title>
          , arXiv preprint arXiv:
          <year>1909</year>
          .
          <volume>11942</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>A.</given-names>
            <surname>Conneau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Khandelwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Chaudhary</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Wenzek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Guzmán</surname>
          </string-name>
          , E. Grave,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ott</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Stoyanov</surname>
          </string-name>
          ,
          <article-title>Unsupervised cross-lingual representation learning at scale</article-title>
          , arXiv preprint arXiv:
          <year>1911</year>
          .
          <volume>02116</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>N.</given-names>
            <surname>Djuric</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Morris</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Grbovic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Radosavljevic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Bhamidipati</surname>
          </string-name>
          ,
          <article-title>Hate speech detection with comment embeddings</article-title>
          ,
          <source>in: Proceedings of the 24th international conference on world wide web</source>
          ,
          <year>2015</year>
          , pp.
          <fpage>29</fpage>
          -
          <lpage>30</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>A.</given-names>
            <surname>Baruah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Barbhuiya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Dey</surname>
          </string-name>
          , Abaruah at semeval
          <article-title>-2019 task 5: Bi-directional lstm for hate speech detection</article-title>
          ,
          <source>in: Proceedings of the 13th International Workshop on Semantic Evaluation</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>371</fpage>
          -
          <lpage>376</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>