<!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>biCourage: ngram and syntax GCNs for Hate Speech detection</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Rodrigo Wilkens</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dimitri Ognibene</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Essex</institution>
          ,
          <country country="UK">UK</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Milano-Bicocca</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2021</year>
      </pub-date>
      <volume>1</volume>
      <fpage>3</fpage>
      <lpage>17</lpage>
      <abstract>
        <p>Hate Speech identification is a challenging task given the world knowledge required. Moreover, it is even more complex in the social media context due to language and media specificities. Despite these challenges, advances in this task may help improving collective well-being on social media. In this context, the biCourage team participated in the English version of Task 1 of HASOC 2021, a shared task for “Hate Speech and Ofensive Content Identification in English and Indo-Aryan Languages”. Our participation in this campaign aimed to examine the suitability of Graph Convolutional Neural Networks (GCN), due to their capability to integrate flexible contextual priors, as a computationally efective solution compared to more computationally expensive and relatively data-hungry methods, such as finetuning. Specifically, we explored and combined two text-to-graph strategies based on diferent language modelling objectives, comparing them with fine-tuned Bert. We submitted the results of several deep learning architectures, comprised of diferent arrangements of GCNs and transformer architectures. Our team achieved the best results in both subtasks using the GCNs based architectures combining two text-to-graph strategies ranked in 21st and 20th positions in Subtasks 1A and 1B. Assessing the models' prediction, we identify complementary capabilities in the text-to-graph strategies that further research on their combination can explore. Moreover, the proposed GCN model is 3.85 times faster than finetuned Bert in training speed and still outperforms it by 2.3% and 5.41% on the F1 score of Subtasks 1A and 1B, respectively.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;hate speech</kwd>
        <kwd>graph convolutional network</kwd>
        <kwd>text-to-graph</kwd>
        <kwd>biCourage</kwd>
        <kwd>Bert fine-tuning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        The freedom to publish [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] on social media marked a new era that goes beyond just-in-time
connectivity with a network of friends and like-minded people. Moreover, social media has also
fostered negative social phenomena [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Consequently, threats, including Hate Speech (HS),
have become subject of interest in diferent research contexts.
      </p>
      <p>
        The automatic classification of text generated in social media, and Twitter, in particular [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ],
poses several significant challenges. Indeed, their informality, noisiness, and limited size lead
ifrst to a lack of features for classification, negatively afecting results, second to a lack of context
and thus ambiguity, and, finally to a mismatch with models based on standard language corpora.
Moreover, some works discriminate the type and target of the hate (e.g., sexism, ofensive and
profane) and may have to deal with noisy labels in the ground truth, as the classification of this
type of content is often subjective. However, fostering this line of research may help improving
collective well-being on social media by enabling AI supported governance and moderation
strategies [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>
        Concerning HS detection on social media, HASOC1 [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ] provides a forum and a data
challenge for multilingual research on the identification of problematic content. This shared
task campaign in 2021 ofered two tasks targeting English and Hindi. In this work, we report the
approach proposed by the biCourage team in the English version of Task 1. This task is divided
into two subtasks, both using the same Twitter corpus but with diferent annotation granularity.
Subtask-1A targets a binary classification for identifying hate and non hate posts. In a more
ifne-grained perspective, Subtask-1B also proposes the distinction between hate, profane and
ofensive posts.
      </p>
      <p>In this paper, we report the participation of the biCourage team at the HASOC shared task.
Our goal in this work is to explore the suitability of Graph Convolutional Neural Networks
(GCN) as a computationally and data eficient solution. Specifically, we explore and combine two
text-to-graph strategies with diferent modelling objectives, comparing them with fine-tuned
Bert, which is our baseline.2 In specific, this paper is organised as follows. We start presenting
initiatives for HS classification in the machine learning and language encoding perspectives,
then, in Section 3, describing the proposed GCN model, the word encoding and the text-to-graph
strategies. A discussion of the performance of the diferent models is presented in Section 4.
Finally, in Section 5, we summarize our finds.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        A critical component in a Hate Speech classifier is the language encoding. It may employ
methods that are context-sensitive (e.g. BERT [
        <xref ref-type="bibr" rid="ref6 ref7 ref8">6, 7, 8</xref>
        ]) or context-independent, which may be
based on language models trained on external corpus (e.g. word embeddings [
        <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
        ] and doc2vec
[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]) or they can be based on the studied corpus (e.g. TF-IDF [
        <xref ref-type="bibr" rid="ref12 ref6 ref8">6, 8, 12</xref>
        ]). In addition to language
encoding, various machine learning approaches have been explored in HS classification literature.
For example, Rodríguez-Sánchez et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], Liu et al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], Canós [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], Wang and Manning [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]
resorted to Support Vector Machine (SVM), Wang and Manning [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] used Naïve Bayes, Liu
et al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] employed Random Forests and Gradient Boosted Trees, Rodríguez-Sánchez et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]
used Bi-LSTM, and Rodríguez-Sánchez et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], Lavergne et al. [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] fine-tuned BERT models. In
addition, some works, such as Liu et al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] employing a soft vote approach, Shushkevich and
Cardif [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] using a blended model [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], Hofmann and Kruschwitz [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] exploring ensemble of
three SVMs, combine classification models. These models, except for LSTM models, process
the input as a set of features without sequential information. Word independence is usually a
common assumption in machine learning architectures. However, this assumption is not held
for Graph Neural Networks because nodes (i.e. words) are associated [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. Moreover, GCNs
allow explicitly specify the associations of the words.
      </p>
      <p>GCN, convolutional networks that operate on graphs, can explicitly model the relationships</p>
      <sec id="sec-2-1">
        <title>1https://hasocfire.github.io/hasoc/2021 2The models are available at https://github.com/rswilkens/biCourage.</title>
        <p>
          between words by representing words as nodes and their relations as edges in the graph. Aiming
to study the possible advantages of this representation, we explore the GCN as a solution for
identifying Hate Speech on social networks. GCN mainly difers from other neural networks
in the forward step that connects nodes by considering an adjacency matrix. In other words,
while a forward step in traditional neural networks is defined as +1 =  ( + ) in
GCN it is +1 =  ( + ), where  are the weights at layer ,  is the feature
representation at layer ,  is the bias at layer , +1 is the feature representation at layer  + 1,
and  is the adjacency matrix. In a broad sense, a GCN can be seen as sequences map-reduce
operations, corresponding to transformation and several aggregation operations on graphs [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ].
The aggregation aims to combine multiple messages between a node and its context and reduce
them into one element. The graph pooling aims to aggregate elements in a graph, reducing
them into high-order graph-level representations.
        </p>
        <p>
          Inspired by Kipf and Welling [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ], Yao et al. [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] proposed TextGCN, a GCN for text document
classification. TextGCN model produces a single graph where words and documents are nodes.
In this graph, all documents are connected, and edges also indicate words in the same document.
Yao et al. [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] also compared the performance of TextGCN and 13 other widely-used models (e.g.,
fastText, LSTM, CNN, and doc2vec) in diferent corpora, showing impressive results. However,
this model is based on transductive learning. In other words, it needs all documents available
during the training phase and cannot make predictions for new documents, which poses an
issue for applying it in the social media context, given the speed at which new data is created.
In a diferent perspective, Wilkens and Ognibene [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ] explored graph classification using GCN
models for sexism identification on social media. This work explored the MeanPool (a simple
model that pools the graph after aggregations using the mean), SAGpoolh [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] (a GCN that
applies a self-attention mechanism to select nodes to drop) and set2set [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] (the inclusion of
an LSTM in the aggregation step). The results obtained in this work point out that for the
generalisation of the GCN models due to they showed similar results in social media diferent
of the one used in the training [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ].
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Proposed model</title>
      <p>
        This work explores GCN models for HS classification on social media, extending the MeanPool
model used by Wilkens and Ognibene [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]. Here, we add features normalisation steps in each
GCN layer, and the GCN layers are replaced by GraphSAGE layer [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ], which is closely related
to the GCN layer [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. GraphSAGE aggregates information from node local neighbours, and, as
this process iterates, nodes incrementally gain information from further reaches of the graph
[
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. In addition to the MeanPool model that used only a mean pooling approach to compress the
matrix representation into a vector that summarise the post, we propose a richer representation
concatenating min, max, mean and sum pooling operations.
      </p>
      <p>
        In order the associate the nodes, i.e. to define the graph structure, we explore two diferent
text-to-graph strategies (ngram and parser), similarly to Wilkens and Ognibene [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]. The parser
strategy, inspired by syntacticGCN [
        <xref ref-type="bibr" rid="ref22 ref23">22, 23</xref>
        ], links nodes using the dependency attachment based
on parsing information, while the ngram strategy associates all words in a context window
of three words. In this work, we set the edge weight as the normalised distance of words
in the document, contrarily to Wilkens and Ognibene [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] who propose the word similarity.
Moreover, we use only word embeddings from a roberta-base model3 trained on 58M tweets [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ]
as node features and truncate all sentences with more than 300 words long due to computational
limitations. We use this model targeting a text encoding trained in documents close to those
used in HASOC.
      </p>
      <p>Parser and ngram text-to-graph strategies have diferent modelling objectives. The first one
aims to connect words according to their syntactic function in the sentence, while the second
strategy prioritises local context. They have also diferent robustness to the noise present on
social media text. Therefore, it could be desirable to combine the two strategies. To carry
out this combination, there are several diferent possible approaches. We propose a siamese
network keeping the two networks independent of each other and concatenating the output of
the pooling approaches. In this way, the convolutional layer can adjust the weights for each
text-to-graph strategy, and the classification layers (i.e. set of dense layers) learn to separate the
classes upon the combination of eight poolings (2 networks by 4 pooling operations) by 200
features characterising high level nodes. The joined architecture is presented in Figure 1, where
the dark red and dark green dashed-boxes respectively indicate the ngramGCN and parserGCN,
each one using a copy of the same node features and diferent adjacency matrices. Moreover,
the blue dashed-box indicates the biCourage that uses the same components of the other two
GCN except for their classification layers.</p>
      <p>
        Finally, we propose Bert fine-tuning as baseline. We start this process by fine-tuning the
English Bert model [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] on the binary classification version of the English corpora used in
the shared task’s previous editions [
        <xref ref-type="bibr" rid="ref26 ref27">26, 27</xref>
        ]. This new model is then fine-tuned using the 2021
version of the corpus. We merely continue the fine-tuning process for Subtask-1A, and, for
Subtask-1B, we replace the binary classification layer with one capable of classifying four
classes.
      </p>
      <p>
        Despite the model, we start our pipeline by cleaning and tokenizing the text before training
the models. The cleaning step tokenizes the text, standardizes symbols, and replaces URL and
emojis by the domain and the emoji textual representation based on the post’s language. The
text is then annotated with dependency attachment [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ].
      </p>
      <p>Concerning the data preprocessing, we identified 60 posts with repeated or near-repeated
content. Based on a quick analysis, we concluded that diferent users posted those, and they
most likely come from defamation/hate campaigns. Given the substantial similarity between
these posts, we randomly keep one and discard the others because they impact our internal
comparison of the models. Then, we use a 90/10 split to obtain training and validation sets.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Results</title>
      <p>The oficial evaluation system used in HASOC shared task ranks only the best run of each team,
then compares only the best models. Consequently, our biCourage4 model respectively ranked
in the 21st (out of 56 teams) in Subtask-1A and 20th positions (out of 37 teams) in Subtask-1B.
Tables 1 and 2 show the results of all our models.</p>
      <sec id="sec-4-1">
        <title>3https://huggingface.co/cardifnlp/twitter-roberta-base 4In the oficial leaderboard, biCourage is shown as 2GCNs and biGCN.</title>
        <p>text input</p>
        <p>Node features
ngramGCN
parserGCN
ngram-base
adjacency matrix</p>
        <p>Sage - 50
Sage - 100
Sage - 200</p>
        <p>Sage - 200
Classification
layers</p>
        <p>parser-base
adjacency matrix</p>
        <p>Sage - 50
Sage - 100
Sage - 200
Sage - 200
Classification
layers</p>
        <p>concatenate
Mean</p>
        <p>Max</p>
        <p>Min</p>
        <p>Sum</p>
        <p>Mean</p>
        <p>Max</p>
        <p>Min</p>
        <p>Sum
biCourage</p>
        <p>Classification</p>
        <p>layers</p>
        <p>In Subtask-1A, its precision and accuracy are considerably better than the other models, but
the recall is below the line. On the other hand, in Subtask-1B, its precision is close to the GCNs,
but its recall is considerable low, even Bert achieving the best accuracy.</p>
        <p>Focusing on the single graph input GCN models, we observe that the ngram-based GCN
consistently outperforms the syntactic one. Moreover, the performance diference between this
two GCNs is bigger in the Subtask-1A. Considering that both models share the same information
about the words, this suggests that the local context plays a more meaningful role in the task, at
least for English. Analysing the biCourage models, we note that the combination of parserGCN
and ngramGCN models (i.e. biCourage) consistently improves precision in both subtasks. This
indicates that ngramGCN and parserGCN models are apparently modelling diferent clues of
Hate Speech classification.</p>
        <p>Aiming to measure the diferences between the GCN models, we examine the Cohen kappa
agreement in the test set. In this way, we identified that the three models present a good
agreement. The parserGCN and ngramGCN models present an agreement of 0.6296 in
Subtask1A and 0.6738 in Subtask-1B. The biCourage presents an agreement of 0.7176 with ngramGCN
(Subtask-1A) and 0.6979 (Subtask-1B), but on the other hand, the biCourage agrees with the
parserGCN 0.6213 for Subtask-1A and 0.7025 in Subtask-1B. These results point out that
ngramand parser-based text-to-graph approaches provide diferent information to the model and it
can be successfully mixed throw the biCourage model. Moreover, the agreement diferences
in Subtask 1A and 1B between biCourage, and ngramGCN and parserGCN imply that the
biCourage model can be capable of prioritising part of the network, which is a desirable feature
for siamese networks. Furthermore, our results propose that syntactic information might be
more relevant for recognising the subtype of HS (i.g. hate speech, ofensive and profane content)
than for distinguishing between hate and non-hate posts.</p>
        <p>The results obtained from GCN, particularly the biCourage, are remarkable, especially in
Subtask-1B. First, the biCourage architecture is computationally cheaper to train; i.e. biCourage
trains 3.85 times faster (CPU time spent according to the OS) than the Bert fine-tuned using the
same data and similar machines. Second, in terms of the F1 score it outperforms the fine-tuned
Bert by 2.3% and 5.41% for Subtasks 1A and 1B respectively. However, at this point, we cannot
identify the source of this performance. In other words, we are comparing models based on
diferent language encoding approach. Therefore, we prepare a final experiment. In this, we
train the biCourage model using the Bert fine-tuned on the 2019 and 2020 versions of the HASOC
shared task. This analysis allows us directly compare the results from the biCourage model
with the Bert fine-tuning approach. As shown in Table 3, the biCourage trained using Bert
embeddings achieves results similar to the biCourage submitted (biCourage RoBERTa in Table
3) and better than Bert’s fine-tuning. This point out that the diference between the fine-tuned
Bert and the biCourage in Table 2 comes mainly from the GCN architecture. Moreover, these
results reveal that the proposed model can take advantage of more suitable language encoding
models.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>
        Threats detection on social media is a complex task due to language and media specificities.
Their detection may help improving Collective Well-Being on the network by enabling targeted
artificial intelligence social media governance strategies [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Aiming for it, we (biCourage team)
participated in the English version of Task 1 at HASOC 2021, a shared task for “Hate Speech
and Ofensive Content Identification in English and Indo-Aryan Languages.”
      </p>
      <p>
        Inspired by Kipf and Welling [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], Yao et al. [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] and building on our previous work Wilkens
and Ognibene [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ], our approach uses Graph Convolutional Networks to associate words in
a post, exploring diferent word association approaches (ngram and parser). We applied the
Bert model fine-tuned on external HS corpora and then fine-tuned on the shared task corpus
as a baseline for this approach. Among our models, our biCourage model achieved the best
result in both subtasks. In Subtask-1A, the biCourage is ranked in the 21st position and 20th
in Subtask-1B. Looking close at the results, we identified that the biCourage model might
be capable of prioritising part of the network depending on the task, which is beneficial for
networks that combine diferent inputs. Aiming to check the performance of biCourage in
Subtask-1B, we train a new biCourage that may be directly compared to the fine-tuned Bert.
This analysis indicated that the performance improvement, compared to Bert fine-tuned, may
be attributed to the GCN model, and the language encoding approaches had a small impact.
      </p>
      <p>The main contribution of this work goes beyond the rank in the shared task. We propose a
new model capable of outperforming Bert’s fine-tuning process and is 3.85 times faster to train.
However, our results are limited to the shared task dataset. Thus the generalisation to other
languages and tasks is still open.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>This work has been developed in the framework of the project COURAGE - A social media
companion safeguarding and educating students (no. 95567), funded by the Volkswagen Foundation
in the topic Artificial Intelligence and the Society of the Future. The authors acknowledge the
use of the High Performance Computing Facility (Ceres) and its associated support services at
the University of Essex in the completion of this work.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>R.</given-names>
            <surname>Baeza-Yates</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Ribeiro-Neto</surname>
          </string-name>
          (Eds.),
          <source>Modern Information Retrieval</source>
          , 2nd ed.,
          <source>AddisonWesley</source>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>D.</given-names>
            <surname>Ognibene</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Taibi</surname>
          </string-name>
          , U. Kruschwitz,
          <string-name>
            <given-names>R. S.</given-names>
            <surname>Wilkens</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hernandez-Leo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Theophilou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Scifo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. A.</given-names>
            <surname>Lobo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Lomonaco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Eimler</surname>
          </string-name>
          , et al.,
          <article-title>Challenging social media threats using collective well-being aware recommendation algorithms and an educational virtual companion</article-title>
          ,
          <source>arXiv preprint arXiv:2102.04211</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Michelson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Macskassy</surname>
          </string-name>
          ,
          <article-title>Discovering users' topics of interest on twitter: a first look</article-title>
          ,
          <source>in: Proceedings of the fourth workshop on Analytics for noisy unstructured text data</source>
          ,
          <year>2010</year>
          , pp.
          <fpage>73</fpage>
          -
          <lpage>80</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <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>H.</given-names>
            <surname>Madhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Satapara</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>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Ranasinghe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zampieri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Nandini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. K.</given-names>
            <surname>Jaiswal</surname>
          </string-name>
          ,
          <article-title>Overview of the HASOC subtrack at FIRE 2021: Hate Speech and Ofensive Content Identification in English and Indo-Aryan Languages</article-title>
          , in: Working Notes of FIRE 2021 -
          <article-title>Forum for Information Retrieval Evaluation</article-title>
          ,
          <string-name>
            <surname>CEUR</surname>
          </string-name>
          ,
          <year>2021</year>
          . URL: http://ceur-ws.org/.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S.</given-names>
            <surname>Modha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Mandl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. K.</given-names>
            <surname>Shahi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Madhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Satapara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Ranasinghe</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Zampieri, Overview of the HASOC Subtrack at FIRE 2021: Hate Speech and Ofensive Content Identification in English and Indo-Aryan Languages and Conversational Hate Speech</article-title>
          , in: FIRE 2021:
          <article-title>Forum for Information Retrieval Evaluation, Virtual Event</article-title>
          ,
          <fpage>13th</fpage>
          -17th
          <source>December</source>
          <year>2021</year>
          , ACM,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>F.</given-names>
            <surname>Rodríguez-Sánchez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Carrillo-de Albornoz</surname>
          </string-name>
          , L. Plaza,
          <article-title>Automatic classification of sexism in social networks: An empirical study on twitter data</article-title>
          ,
          <source>IEEE Access 8</source>
          (
          <year>2020</year>
          )
          <fpage>219563</fpage>
          -
          <lpage>219576</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>E.</given-names>
            <surname>Lavergne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Saini</surname>
          </string-name>
          , G. Kovács,
          <string-name>
            <given-names>K.</given-names>
            <surname>Murphy</surname>
          </string-name>
          ,
          <article-title>Thenorth@ haspeede 2: Bert-based language model fine-tuning for italian hate speech detection</article-title>
          ,
          <source>in: 7th Evaluation Campaign of Natural Language Processing and Speech Tools for Italian. Final Workshop</source>
          ,
          <string-name>
            <surname>EVALITA</surname>
          </string-name>
          <year>2020</year>
          , volume
          <volume>2765</volume>
          ,
          <string-name>
            <surname>CEUR-WS</surname>
          </string-name>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>J.</given-names>
            <surname>Hofmann</surname>
          </string-name>
          , U. Kruschwitz, Ur nlp@ haspeede 2 at evalita 2020:
          <article-title>Towards robust hate speech detection with contextual embeddings, in: 7th Evaluation Campaign of Natural Language Processing and Speech Tools for Italian</article-title>
          . Final Workshop,
          <string-name>
            <surname>EVALITA</surname>
          </string-name>
          <year>2020</year>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>P.</given-names>
            <surname>Bojanowski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Grave</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Joulin</surname>
          </string-name>
          , T. Mikolov,
          <article-title>Enriching word vectors with subword information, Transactions of the Association for Computational Linguistics 5 (</article-title>
          <year>2017</year>
          )
          <fpage>135</fpage>
          -
          <lpage>146</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>G.</given-names>
            <surname>Gambino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Pirrone</surname>
          </string-name>
          ,
          <article-title>Chilab@ haspeede 2: Enhancing hate speech detection with part-of-speech tagging</article-title>
          ,
          <source>in: 7th Evaluation Campaign of Natural Language Processing and Speech Tools for Italian. Final Workshop</source>
          ,
          <string-name>
            <surname>EVALITA</surname>
          </string-name>
          <year>2020</year>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>H.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Chiroma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Cocea</surname>
          </string-name>
          ,
          <article-title>Identification and classicfiation of misogynous tweets using multi-classifier fusion, in: Evaluation of Human Language Technologies for Iberian Languages: IberEval 2018 (IberEval@SEPLN)</article-title>
          ,
          <source>CEUR Workshop Proceedings</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>268</fpage>
          -
          <lpage>273</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>J. S.</given-names>
            <surname>Canós</surname>
          </string-name>
          ,
          <article-title>Misogyny identification through svm at ibereval 2018., in: Evaluation of Human Language Technologies for Iberian Languages: IberEval 2018 (IberEval@SEPLN</article-title>
          ),
          <year>2018</year>
          , pp.
          <fpage>229</fpage>
          -
          <lpage>233</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>S. I.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Manning</surname>
          </string-name>
          ,
          <article-title>Baselines and bigrams: Simple, good sentiment and topic classiifcation, in: Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics</article-title>
          (Volume
          <volume>2</volume>
          :
          <string-name>
            <surname>Short</surname>
            <given-names>Papers)</given-names>
          </string-name>
          ,
          <year>2012</year>
          , pp.
          <fpage>90</fpage>
          -
          <lpage>94</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>E.</given-names>
            <surname>Shushkevich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Cardif</surname>
          </string-name>
          ,
          <article-title>Classifying misogynistic tweets using a blended model: The ami shared task in ibereval 2018., in: Evaluation of Human Language Technologies for Iberian Languages: IberEval 2018 (IberEval@SEPLN</article-title>
          ),
          <year>2018</year>
          , pp.
          <fpage>255</fpage>
          -
          <lpage>259</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Pan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Long</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. Y.</given-names>
            <surname>Philip</surname>
          </string-name>
          ,
          <article-title>A comprehensive survey on graph neural networks, IEEE transactions on neural networks and learning systems (</article-title>
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>J.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Qian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Fang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , C. Xu,
          <article-title>Eficient graph deep learning in tensorflow with tf_geometric</article-title>
          ,
          <source>arXiv preprint arXiv:2101.11552</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>T. N.</given-names>
            <surname>Kipf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Welling</surname>
          </string-name>
          ,
          <article-title>Semi-supervised classification with graph convolutional networks</article-title>
          ,
          <source>arXiv preprint arXiv:1609.02907</source>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>L.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Mao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <article-title>Graph convolutional networks for text classification</article-title>
          ,
          <source>in: Proceedings of the AAAI Conference on Artificial Intelligence</source>
          , volume
          <volume>33</volume>
          ,
          <year>2019</year>
          , pp.
          <fpage>7370</fpage>
          -
          <lpage>7377</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>R.</given-names>
            <surname>Wilkens</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ognibene</surname>
          </string-name>
          ,
          <article-title>Mb-courage @ exist: Gcn classification for sexism identification in social networks</article-title>
          ,
          <source>EXIST: sEXism Identification in Social neTworks - First Shared Task at IberLEF</source>
          <year>2021</year>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>J.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kang</surname>
          </string-name>
          ,
          <article-title>Self-attention graph pooling</article-title>
          ,
          <source>in: International Conference on Machine Learning, PMLR</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>3734</fpage>
          -
          <lpage>3743</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>W. L.</given-names>
            <surname>Hamilton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ying</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Leskovec</surname>
          </string-name>
          ,
          <article-title>Inductive representation learning on large graphs</article-title>
          ,
          <source>in: Proceedings of the 31st International Conference on Neural Information Processing Systems</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>1025</fpage>
          -
          <lpage>1035</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>D.</given-names>
            <surname>Marcheggiani</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Titov</surname>
          </string-name>
          ,
          <article-title>Encoding sentences with graph convolutional networks for semantic role labeling</article-title>
          ,
          <source>arXiv preprint arXiv:1703.04826</source>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>J.</given-names>
            <surname>Bastings</surname>
          </string-name>
          , I. Titov,
          <string-name>
            <given-names>W.</given-names>
            <surname>Aziz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Marcheggiani</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.</surname>
          </string-name>
          <article-title>Sima'an, Graph convolutional encoders for syntax-aware neural machine translation</article-title>
          ,
          <source>arXiv preprint arXiv:1704.04675</source>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>F.</given-names>
            <surname>Barbieri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Camacho-Collados</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Neves</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Espinosa-Anke</surname>
          </string-name>
          ,
          <article-title>Tweeteval: Unified benchmark and comparative evaluation for tweet classification</article-title>
          , arXiv preprint arXiv:
          <year>2010</year>
          .
          <volume>12421</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <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="ref26">
        <mixed-citation>
          [26]
          <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>
          ,
          <source>Overview of the HASOC track at FIRE</source>
          <year>2020</year>
          :
          <article-title>Hate speech and ofensive content identification in indo-european languages</article-title>
          ,
          <source>volume abs/2108.05927</source>
          ,
          <year>2021</year>
          . URL: https://arxiv.org/abs/2108.05927. arXiv:
          <volume>2108</volume>
          .
          <fpage>05927</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <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>
            <surname>A. K. M</surname>
            ,
            <given-names>B. R. Chakravarthi</given-names>
          </string-name>
          ,
          <source>Overview of the HASOC track at FIRE</source>
          <year>2020</year>
          :
          <article-title>Hate speech and ofensive language identification in tamil, malayalam, hindi, english and german</article-title>
          , in: P. Majumder,
          <string-name>
            <given-names>M.</given-names>
            <surname>Mitra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gangopadhyay</surname>
          </string-name>
          , P. Mehta (Eds.), FIRE 2020:
          <article-title>Forum for Information Retrieval Evaluation, Hyderabad</article-title>
          , India,
          <source>December 16-20</source>
          ,
          <year>2020</year>
          , ACM,
          <year>2020</year>
          , pp.
          <fpage>29</fpage>
          -
          <lpage>32</lpage>
          . URL: https://doi.org/10.1145/3441501.3441517. doi:
          <volume>10</volume>
          .1145/3441501.3441517.
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>P.</given-names>
            <surname>Qi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bolton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Manning</surname>
          </string-name>
          ,
          <article-title>Stanza: A python natural language processing toolkit for many human languages, arXiv preprint</article-title>
          arXiv:
          <year>2003</year>
          .
          <volume>07082</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>