<!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>Exploiting Contextualized Word Representations to Profile Haters on Twitter</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Tanise Ceron</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Camilla Casula</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>Fondazione Bruno Kessler</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Trento</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2021</year>
      </pub-date>
      <abstract>
        <p>In this paper, we present our submission to the Profiling Haters on Twitter shared task at PAN@CLEF2021. The task aims at analyzing Twitter feeds of users in two languages, English and Spanish, in order to determine whether these users spread hate speech on social media. For English, we propose an approach which exploits contextualized word embeddings and a statistical feature extraction method, in order to find words which are used in diferent contexts by haters and non-haters, and we use these words as features to train a classifier. For Spanish, on the other hand, we take advantage of BERT sequence representations, using the average of the sequence representations of all tweets from a user as a feature to train a model for classifying users into haters and non-haters.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;BERT</kwd>
        <kwd>word embeddings</kwd>
        <kwd>hate speech</kwd>
        <kwd>statistical feature extraction</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>The rise of social media in the past decade has undoubtedly changed interaction among people
and made the world more inter-connected. It has provided a way for people to keep constantly
in contact even when being far apart geographically, united people who have not seen each
other for years or who had never met before, helped numerous volunteer associations to gather
aid or recruit more volunteers, provided a place for entire communities with common interests
to interact with one another and share content, resources and ideas, and the list of benefits
continues relentlessly. However, on the flip side of the coin, the growing amounts of
usergenerated content online are tied to an increased presence of hateful content on social media.
Content moderation online is therefore important to identify and limit the spread of hate speech.</p>
      <p>
        The Profiling Haters on Twitter task [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] at PAN 2021 [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] aims at determining whether a
user spreads hate speech based on their Twitter feed. This shared task tackles the problem of
identifying hate spreaders from a multilingual perspective, including Twitter feeds in English
and Spanish.
      </p>
      <p>In this paper, we present our submission to the Profiling Haters on Twitter shared task,
which consists of two diferent approaches. First, we propose a novel approach to hate speech
detection for the English data set, which derives from the assumption that certain words are
used in diferent contexts by haters as opposed to non-haters. The idea is to exploit statistical
feature selection techniques in order to find words whose embedding vectors extracted from
BERT difer the most between classes, then use these words as features to train a classifier. The
Spanish model, on the other hand, is inspired by text classification models, as it allows us to
tackle the challenge of having a single representation for long sequences. Therefore, we build
the features as though all tweets of a given user were a unique text, without losing information
from any tweet. In order to do this, we use a Spanish pre-trained version of BERT for extracting
a single vector representation of each tweet by a user. These representations are then averaged
and fed into a classifier.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        The present work follows the definition of hate speech as described in the overview of this
edition’s shared task [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] and claimed by Nockleby [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] - it is defined as “any communication
that disparages a person or a group on the basis of some characteristic, such as race, colour,
ethnicity, gender, sexual orientation, nationality, religion, or others”.
      </p>
      <p>
        Most studies carried out on hate speech within natural language processing (NLP) so far have
focused on the detection of hate speech in single messages. The singularity of this shared task
lies in the fact that, instead, it focuses on the quite novel approach of classifying users who
disseminate hateful messages (haters) and users who do no spread any type of hateful messages
(non-haters) on Twitter. To the best of our knowledge, a similar task was proposed only once
[
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. However, it is developed diferently, given that the features of their model are based on
the interaction among users and network metrics rather than linguistic features as proposed
in the present work. User information has been used to boost the performance of hate speech
detection in messages in other works as well [
        <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
        ].
      </p>
      <p>
        In the past years, many approaches have been proposed for the detection of hate speech in
single messages extracted from various social media channels, such as Twitter [
        <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
        ], Reddit
[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], and YouTube [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. A number of shared tasks have been organized on the topic, both from
a monolingual [10, 11, 12, 13] and a multilingual perspective [14, 15]. They vary from more
linear machine learning approaches with Naive Bayes [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], Logistic Regression [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], Support
Vector Machine [16] to non-linear approaches fed with features from non-contextualized word
embeddings [17] and the latest deep learning models consisting of contextualized word vector
representations as features [18].
      </p>
      <p>
        As in many other NLP and, more in general, supervised learning methods, feature selection is
one of the most crucial parts of the task. In addition to this, the task of hate speech detection is
particularly complex because messages can involve sarcasm, irony and neutral sentiments that
are challenging for NLP systems to identify. In early models, as Schmidt and Wiegand [19] put
it, simpler surface-level features such as n-gram and character n-grams have been implemented
[
        <xref ref-type="bibr" rid="ref6 ref7">20, 6, 7</xref>
        ]. In addition to that, linguistic and lexical features have also been employed for this
task, the former with the addition of part-of-speech or dependency information [21, 22] and the
latter with terms that are related to hatred against a certain community or general profanities
[
        <xref ref-type="bibr" rid="ref9">9, 20</xref>
        ]. Yet, other models have made use of features reliant on other common NLP tasks such as
sentiment analysis [23].
      </p>
      <p>
        Nobata et al. [20] experiment with features derived from static word embeddings with
annotated data of comments on Yahoo! in three ways. Two of them consist of averaging the
vector representation of all words in a comment derived from two types of word embeddings,
they are the pretrained and word2vec models, both containing 200 dimensions. Their third
approach is based on the representation of paragraph embeddings [
        <xref ref-type="bibr" rid="ref10">24</xref>
        ] following the work of
Djuric et al. [
        <xref ref-type="bibr" rid="ref11">25</xref>
        ], who use the same approach for abusive language detection. In this case, every
word of the comment is mapped to a matrix representing words, and every comment is mapped
into a vector in a matrix of comments. Finally, words and comment vectors are concatenated
forming a single representation of the comment. Besides the distributional semantic features,
character and token n-grams, linguistic features (such as length of comment in tokens, average
length of words, number of punctuation marks and so on), syntactic features, namely
part-ofspeech and dependency parsing relations, are also included in the model. The combination of
all these features yield better results than the use of the paragraph2vec technique alone [
        <xref ref-type="bibr" rid="ref11">25</xref>
        ].
      </p>
      <p>The latest classifiers for hate speech detection take advantage of models such as BERT,
RoBERTA and other large multilingual language models [15]. They usually feed the sentence
vector representation, the [CLS] token in BERT, into more recent deep learning architectures
such as convolutional neural networks, recurrent neural networks and gated recurrent units and
they reach very impressive results. In the last SemEval task for detection of ofensive language,
the best team reached a F1 score of 0.9204 and the other teams have mostly reached very similar
performance in a tight competition.</p>
      <p>
        Our model proposes to work on this line of features because of its potential to capture meaning
beyond a restricted list of words, besides the great number of successful NLP applications that
are based on non-contextualized vector representations of words, for instance GloVe [
        <xref ref-type="bibr" rid="ref12">26</xref>
        ] and
word2vec [
        <xref ref-type="bibr" rid="ref13">27</xref>
        ], and more recently contextualized representations of text with Deep Bidirectional
Transformers such as BERT [
        <xref ref-type="bibr" rid="ref14">28</xref>
        ]. The development of language models based on transformer
mechanisms is an important milestone in advancements of NLP, given that it has improved the
state of the art of many well-established NLP tasks. One of its greatest advantages is its capacity
to encompass the representation of a text in a single vector. Secondly, the vector representation
of each word is dynamic and contextualized, meaning that it is has the potential to adapt the
embeddings of a word according to its context. Whereas our Spanish model benefits from the
former advantage, the English model uses the latter in its favor.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Methods</title>
      <p>Both the English and Spanish training sets are balanced, consisting of 100 haters and 100
nonhaters. The dataset provided by the task organizers contains 200 tweets and a ground truth
label for each user. In both datasets provided, user mentions, URLs, and hashtags have been
replaced with tags in the form of #HASHTAG#. We remove all hash marks (#) while keeping the
accompanying words (USER, URL, and HASHTAG).</p>
      <p>We use diferent models to perform the task on English and on Spanish data. Both models
exploit contextualized word representations and implement a support vector machine for the
task of binary classification.</p>
      <p>
        Both models were tested by the task organizers using the TIRA tool [
        <xref ref-type="bibr" rid="ref15">29</xref>
        ].
      </p>
      <sec id="sec-3-1">
        <title>3.1. English</title>
        <sec id="sec-3-1-1">
          <title>3.1.1. Features exploration</title>
          <p>The idea underlying our English model is that haters and non-haters might use certain words in
diferent contexts. Example (1) below shows a tweet found in the hater class which mentions the
word gun in an aggressive circumstance, whereas tweet (2) illustrates an instance from the
nonhater class and mentions the same word in a more political context. Thus, the feature selection
for the model involves the identification of words and, in this case, of BERT embeddings that
significantly vary from one class to another.</p>
          <p>1. This money can’t fit in my pockets but I bet that gun fit.
2. New state laws for the new year: California limits gun rights, minimum wages increase
#url. . . #url.</p>
          <p>
            To verify whether there are significant diferences in the vector representation of words
between the two classes, we first carry out an experimental coarse analysis with t-SNE [
            <xref ref-type="bibr" rid="ref16">30</xref>
            ], a
technique of dimensionality reduction that is able to reduce the space to two dimensions so
that it can be plotted and interpreted.
          </p>
          <p>
            We first make a list of most frequent tokens by selecting the ones that occur at least 25 times
in both classes. In total there are 788 of them. Note that they are BERT WordPiece tokens [
            <xref ref-type="bibr" rid="ref17">31</xref>
            ]
taken from BertTokenizer [
            <xref ref-type="bibr" rid="ref18">32</xref>
            ] 1, meaning that tokens not correspondent to complete words are
also included in the list. However, even though words are not complete, they should still have
a rich contextualized vector representation, considering that BERT is able to distinguish the
diferent contexts of split words as well [
            <xref ref-type="bibr" rid="ref19">33</xref>
            ]. Throughout the whole experiment, we use the
uncased base version of BERT [
            <xref ref-type="bibr" rid="ref20">34</xref>
            ].
          </p>
          <p>For the t-SNE analysis, we feed each tweet of a given  of the class hater into the BERT
model and retrieve the vector representation of a given token () present in the most frequent
list. Then, we average all the vectors of  of  . More formally, let  be the token that
occurs in a tweet {1, 2,... } of a given  . Thus, the vector representation (⃗) of  in
 is:
⃗ [] =
∑︀
=1 []

(1)
where N is the number of occurrences of  in all tweets by  , and ⃗[] is the vector of
 in . We then repeat the same procedure for the non-hater class and reduce the dimensions.
For example, ⃗[gun], which is a matrix of [Nx768], is reduced to a matrix with 2 components
[Nx2]. Some of the results can be seen in Figure 1, where each dot represents a ⃗ [].</p>
          <p>This coarse evaluation shows that some tokens form well-defined clusters between the two
classes such as happy (Figure 1a) and world (Figure 1b). In contrast, others words like amazing
(Figure 1c) and indeed even the word gun (Figure 1d) are sprawling and occupy overlapping
spaces in both classes, suggesting that they do not have distinguishing vector representations.</p>
          <p>Given the results of this coarse analysis with t-SNE, and considering that the reduction of
vectors from 768 to 2 dimensions may cause the vector to lose a large amount of relevant
information, we turn to a more statistical approach to select the words for our model.
1https://huggingface.co/transformers/main_classes/tokenizer.html
(a) Happy
(b) World
(c) Amazing
(d) Gun</p>
          <p>
            Instead of using predefined term lists, we employ a technique called filter approach for
selecting the features (in our case the words) that most diverge between the two classes in
terms of word embeddings. This technique requires two steps. First of all, a statistical test
measures the diference in the vector representation of the tokens, and returns the p-value for
the diference in vector between the two classes for each token. Then, a p-value (our threshold)
is chosen, in order to pick the k most relevant features/tokens. In this study, we analysed
the diference in vectors using the Kolmogorov-Smirnov (K-S) test. Biesiada and Duch [
            <xref ref-type="bibr" rid="ref21">35</xref>
            ]
suggest that the K-S test helps in feature selection of high-dimensions and can significantly
improve the performance of classifiers such as the one used here (SVM). The K-S test allows
us to understand the maximum diference between the cumulative distribution of two random
variables. Therefore, we assume that the more dissimilar the vectors are, as determined by a
two-tailed K-S test, the easier it is for the classifier to distinguish between classes.
          </p>
          <p>To start with, we retrieve the same vector representation for each user presented in Equation
1. After that, considering that in this case we want to have a single representation of a token t
for each class, we average ⃗[] of all users to get the final representation of , as in:
⃗[] =
∑︀
=1 ⃗[]

(2)</p>
          <p>In this case N is the number of users that have at least one occurrence of the given  and
we call the vector ⃗ because it is used for the statistical test. We reach this point with two
dictionaries, one for each class, with  as key and its corresponding ⃗[] as the value and are
ready to run the K-S test. For example, the ⃗[ℎ] from the hater label as variable x and
⃗[− ℎ] as variable y, letting the K-S test be the function  − − (x, y).</p>
          <p>The results of the K-S test for each token are p-values very close to 1 for most tokens, since
they are drawn from the same distribution. However, this is not a problem in our case, because
we do not want to know whether they are statistically significant according to the confidence
interval. The goal instead is to find out which ⃗[] are lower compared to others, meaning
that the ⃗[] between classes are more dissimilar.</p>
        </sec>
        <sec id="sec-3-1-2">
          <title>3.1.2. Model implementation</title>
          <p>Now that we have the p-values for each token in our most frequent list, we must decide on a
threshold that will select the number of relevant features to be fed into the classifier. This is
done by various runs with diferent thresholds in the model. That is, we pick a p-value, get a
single vector representation that is the average of all the ⃗ with t under the p-value of the
K-S test, such as:</p>
          <p>The embeddings is called feat because it is the feature representation of each user. ⃗[user]
is fed to the classifier. The performance is evaluated in terms of accuracy with 5-fold
crossvalidation. We finally choose the set of features that results in the model’s best performance.
The threshold selected in our submission is 0.998 and the set of tokens consists in a total of
394 tokens/features for the model. As a matter of fact, some of them can be very relevant
semantically in the context of hate speech detection such as war, liberal, black, woman, violence,
racism, bitch and so forth (all the tokens are presented in Appendix A - List of wordpieces used
in the English model).</p>
          <p>
            After having selected the features, we also try diferent layers of representations from BERT’s
outputs given that it is has been observed that each of the 12 layers capture diferent features of
the input text [
            <xref ref-type="bibr" rid="ref22">36</xref>
            ]. More precisely, we experiment with the last three layers because they seem
to be the ones that encapsulate more context-specific representations [
            <xref ref-type="bibr" rid="ref23">37</xref>
            ]. Hence, we run the
classifier with feature vector representations from the 10th, 11th and 12th layer to see which
performs the best. The 12th layer shows to produce better results even though the diferent in
performance between one layer and another is not statistically significant.
          </p>
          <p>
            As a final step, we add to the features the averaged CLS tokens of each tweet because we
notice that even though the set of tokens is large, there are some users from the test set who do
not contain any of those tokens. Again, we run tests to see which layer of the CLS token is more
advantageous to the model and choose the 12th layer. The experiments are conducted with two
kernels of the support vector machine, the radial basis function (rbf) and the polynomial kernel.
We utilize Bayesian optimization technique [
            <xref ref-type="bibr" rid="ref24">38</xref>
            ] for finding the best hyper-parameters in order
to spare some time and computational power in executing the traditional grid search approach.
The best performing model is the rbf (C≈ 14.0749, gamma≈ 0.0095).
          </p>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Spanish</title>
        <p>During the experimental phase, we tested the same approach used in the English data set on
Spanish as well. However, in our final submission, we opted for a simpler model, which in our
experiments worked better on the Spanish data.</p>
        <p>
          This model follows a more straightforward approach inspired by text classification [
          <xref ref-type="bibr" rid="ref22">36</xref>
          ] with
BERT representations. It is based on text classification systems because all tweets of each user
are treated like a long text. Besides that, given that the 200 tweets are longer than 512 tokens,
such as in the case of text classification, in order to have a single representation of the whole
text, we use the strategy of averaging the sequence representation of every tweet of the user.
For that, we use the uncased and base pre-trained Spanish version of BERT called BETO 2 [
          <xref ref-type="bibr" rid="ref25">39</xref>
          ]
throughout the training and testing of the Spanish data set.
        </p>
        <p>After pre-processing, every tweet {1, 2,... } of a given user is fed into BETO. Then, we
extract the vector representation of the CLS token, which encapsulates a single representation
of the whole sequence. Lastly, we average these vectors to create the feature representation of
each user such as in:</p>
        <p>Where N is always 200 given that this is a fixed number of tweets in  . The ⃗ is fed
into the support vector machine.</p>
        <p>We also experimented with summing the CLS tokens and found that results are very
similar, given that there is no confound with the frequency of tokens. Similarly to the English
model, we test the last three layers of the CLS token in rbf and polynomial functions with
Bayesian optimization, and verify that the 11th layer trained on the polynomial kernel (C≈ 7.3588,
gamma≈ 0.0285, degree≈ 1.2859) and the 10th layer trained on rbf give the best result in the
5 fold cross-validation, so we submitted both for the shared task, and indeed they have even
returned the same labels for the test set.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Results</title>
      <p>Table 1 shows that the best accuracy in the training set in English is reached by the model
with fewer features (210 tokens) compared to the second place. However, a paired t-test with the
results of the 5 fold CV showed that the first and second model are not statistically significantly
diferent in the training set (p-value=0.1998). The results of the test test, on the other hand, difer
considerably from one another with the 394-token model reaching 4 points better accuracy.
One reason for the diference in classification of the test set is that a broader range of tokens
included in the features can enhance the performance on unseen data.</p>
      <p>2https://github.com/dccuchile/beto</p>
      <p>Alternatively to averaging, we try to sum the vectors based on the idea that the frequency
with which words occur in the tweets may help the classifier to discriminate better between
classes. However, despite having indeed performed better (accuracy 7% higher that our final
submission model) in the training set overall, the classification in the test set was overwhelmingly
imbalanced with 97 haters out of 100 users and the accuracy was also very imbalanced within
the 5 fold cross-validation, showing that it did not generalize well in all folds. It suggests,
though, that the classifier learns from the frequency and that there should be a similar number
of occurrences for a reasonable performance.</p>
      <p>For what concerns the Spanish model, even though we chose the model that extracts the CLS
token representation from the 11th layer, the three models actually perform similarly in terms
of accuracy as seen in Table 2. The first and second model have even returned the same labels
for the classification.</p>
      <p>Moreover, we have attempted to apply same approach we used for the English data set, but
the results in the training set drop considerably reaching lower performance than with the CLS
token approach. One hypothesis for the diference in results could be related to the corpora on
which the pre-trained language models are trained. It might be that the language used in the
Spanish tweets is more similar to the language in the corpora used for training BETO compared
to the English data set and BERT, which would help encompassing the meaning and context of
the dataset more easily, therefore prompting better results. Nonetheless, it is dificult to know
precisely the reason why they perform so diferently, because of the lack of interpretability of
these large language models.</p>
      <p>In terms of layer selection, we observed that both models perform quite similarly when
trained in each of the three last layers, suggesting that they have very similar representations
of tokens.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>We present two novel approaches to profile haters on Twitter. The English approach relies on
the idea that a set of words can be used in diferent contexts by the hater and non-hater users.
The state-of-the-art language model BERT is adopted to capture the contextualized embeddings
of tokens. Then, the diference of the vector representation in both classes is measured through
the K-S statistical test. And finally, the relevant features are chosen by feeding a set of tokens
from diferent thresholds of the test into the support vector machine.</p>
      <p>In contrast, we have seen that the same approach does not work as well for the Spanish model.
Therefore, inspired by text classification methods, we use the averaged vector representation of
all CLS tokens from every tweet of each user as input for the support vector machine. Despite
being a simpler model, it yields impressive results considering the amount of training data
available.</p>
      <p>As a future step, it would be interesting to test the same models with more training data to
check whether it boosts their performance, and perhaps replace the SVM approach with a deep
learning model. In addition, in this shared task we only process textual information, but in a
real scenario other features related to metadata could be included to have more informative and
characteristic features, which may improve classification. Lastly, more related to the English
model, other types of statistical tests might be experimented as well, in order to distinguish
better features for the model. Otherwise, after the statistical test, the model could be trained
iteratively with the ablation technique to select best performing features among the ones already
selected by the threshold.
classification and statistical modeling for policy and decision making, Policy &amp; internet 7
(2015) 223–242.
[10] M. Zampieri, S. Malmasi, P. Nakov, S. Rosenthal, N. Farra, R. Kumar, Semeval-2019
task 6: Identifying and categorizing ofensive language in social media (ofenseval), in:
Proceedings of the 13th International Workshop on Semantic Evaluation, 2019, pp. 75–86.
[11] C. Bosco, F. Dell’Orletta, F. Poletto, M. Sanguinetti, M. Tesconi, Overview of the evalita
2018 hate speech detection task, in: EVALITA@CLiC-it, 2018.
[12] M. Sanguinetti, G. Comandini, E. Nuovo, S. Frenda, M. Stranisci, C. Bosco, T. Caselli,
V. Patti, I. Russo, Haspeede 2 @ evalita2020: Overview of the evalita 2020 hate speech
detection task, 2020.
[13] J. Struß, M. Siegel, J. Ruppenhofer, M. Wiegand, M. Klenner, Overview of germeval task 2,
2019 shared task on the identification of ofensive language, 2019.
[14] V. Basile, C. Bosco, E. Fersini, D. Nozza, V. Patti, F. M. Rangel Pardo, P. Rosso, M. Sanguinetti,
SemEval-2019 task 5: Multilingual detection of hate speech against immigrants and women
in Twitter, in: Proceedings of the 13th International Workshop on Semantic Evaluation,
Association for Computational Linguistics, Minneapolis, Minnesota, USA, 2019, pp. 54–63.</p>
      <p>URL: https://www.aclweb.org/anthology/S19-2007. doi:10.18653/v1/S19-2007.
[15] M. Zampieri, P. Nakov, S. Rosenthal, P. Atanasova, G. Karadzhov, H. Mubarak, L.
Derczynski, Z. Pitenis, Ç. Çöltekin, SemEval-2020 task 12: Multilingual ofensive language
identification in social media (OfensEval 2020), in: Proceedings of the Fourteenth
Workshop on Semantic Evaluation, International Committee for Computational Linguistics,
2020, pp. 1425–1447. URL: https://www.aclweb.org/anthology/2020.semeval-1.188.
[16] S. Malmasi, M. Zampieri, Challenges in discriminating profanity from hate speech, Journal
of Experimental &amp; Theoretical Artificial Intelligence 30 (2018) 187–202.
[17] P. Mishra, H. Yannakoudakis, E. Shutova, Neural character-based composition models for
abuse detection, arXiv preprint arXiv:1809.00378 (2018).
[18] M. Mozafari, R. Farahbakhsh, N. Crespi, A bert-based transfer learning approach for
hate speech detection in online social media, in: International Conference on Complex
Networks and Their Applications, Springer, 2019, pp. 928–940.
[19] A. Schmidt, M. Wiegand, A survey on hate speech detection using natural language
processing, in: Proceedings of the fifth international workshop on natural language
processing for social media, 2017, pp. 1–10.
[20] C. Nobata, J. Tetreault, A. Thomas, Y. Mehdad, Y. Chang, Abusive language detection in
online user content, in: Proceedings of the 25th international conference on world wide
web, 2016, pp. 145–153.
[21] J.-M. Xu, K.-S. Jun, X. Zhu, A. Bellmore, Learning from bullying traces in social media, in:
Proceedings of the 2012 conference of the North American chapter of the association for
computational linguistics: Human language technologies, 2012, pp. 656–666.
[22] Y. Chen, Y. Zhou, S. Zhu, H. Xu, Detecting ofensive language in social media to protect
adolescent online safety, in: 2012 International Conference on Privacy, Security, Risk and
Trust and 2012 International Confernece on Social Computing, IEEE, 2012, pp. 71–80.
[23] N. D. Gitari, Z. Zuping, H. Damien, J. Long, A lexicon-based approach for hate speech
detection, International Journal of Multimedia and Ubiquitous Engineering 10 (2015)
215–230.</p>
      <p>Appendix A - List of wordpieces used in the English model</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>F.</given-names>
            <surname>Rangel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. L. D. L. P.</given-names>
            <surname>Sarracén</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Fersini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Chulvi</surname>
          </string-name>
          ,
          <source>Profiling Hate Speech Spreaders on Twitter Task at PAN</source>
          <year>2021</year>
          ,
          <article-title>in: CLEF 2021 Labs and Workshops, Notebook Papers, CEUR-WS</article-title>
          .org,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>J.</given-names>
            <surname>Bevendorf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Chulvi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. L. D. L. P.</given-names>
            <surname>Sarracén</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kestemont</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Manjavacas</surname>
          </string-name>
          , I. Markov,
          <string-name>
            <given-names>M.</given-names>
            <surname>Mayerl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Potthast</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Rangel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Stamatatos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Stein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wiegmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wolska</surname>
          </string-name>
          , , E. Zangerle, Overview of PAN 2021:
          <article-title>Authorship Verification,Profiling Hate Speech Spreaders on Twitter,and Style Change Detection</article-title>
          ,
          <source>in: 12th International Conference of the CLEF Association (CLEF</source>
          <year>2021</year>
          ), Springer,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>J. T.</given-names>
            <surname>Nockleby</surname>
          </string-name>
          ,
          <article-title>"Hate Speech"</article-title>
          , Encyclopedia of the American Constitution, ed. Leonard W. Levy and
          <string-name>
            <surname>Kenneth L. Karst</surname>
          </string-name>
          , vol.
          <volume>3</volume>
          . (2nd ed.), Detroit: Macmillan Reference US.
          <article-title>Cited in "Library 2.0 and the Problem of Hate Speech," by Margaret Brown-Sica and Jefrey Beall</article-title>
          ,
          <source>Electronic Journal of Academic and Special Librarianship</source>
          , vol.
          <volume>9</volume>
          no.
          <issue>2</issue>
          (
          <issue>Summer</issue>
          <year>2008</year>
          ),
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M.</given-names>
            <surname>Ribeiro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Calais</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Santos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Almeida</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Meira</surname>
          </string-name>
          <string-name>
            <surname>Jr</surname>
          </string-name>
          ,
          <article-title>Characterizing and detecting hateful users on twitter</article-title>
          ,
          <source>in: Proceedings of the International AAAI Conference on Web and Social Media</source>
          , volume
          <volume>12</volume>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>P.</given-names>
            <surname>Mishra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Del Tredici</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yannakoudakis</surname>
          </string-name>
          , E. Shutova,
          <article-title>Author profiling for abuse detection</article-title>
          ,
          <source>in: Proceedings of the 27th international conference on computational linguistics</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>1088</fpage>
          -
          <lpage>1098</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <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="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>T.</given-names>
            <surname>Davidson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Warmsley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Macy</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Weber</surname>
          </string-name>
          ,
          <article-title>Automated hate speech detection and the problem of ofensive language</article-title>
          ,
          <source>in: Proceedings of the International AAAI Conference on Web and Social Media</source>
          , volume
          <volume>11</volume>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>A.</given-names>
            <surname>Olteanu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Castillo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Boy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Varshney</surname>
          </string-name>
          ,
          <article-title>The efect of extremist violence on hateful speech online</article-title>
          ,
          <source>in: Proceedings of the International AAAI Conference on Web and Social Media</source>
          , volume
          <volume>12</volume>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>P.</given-names>
            <surname>Burnap</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. L.</given-names>
            <surname>Williams</surname>
          </string-name>
          ,
          <article-title>Cyber hate speech on twitter: An application of machine</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Le</surname>
          </string-name>
          , T. Mikolov,
          <article-title>Distributed representations of sentences and documents</article-title>
          ,
          <source>in: International conference on machine learning, PMLR</source>
          ,
          <year>2014</year>
          , pp.
          <fpage>1188</fpage>
          -
          <lpage>1196</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [25]
          <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="ref12">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>J.</given-names>
            <surname>Pennington</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Socher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Manning</surname>
          </string-name>
          , Glove:
          <article-title>Global vectors for word representation</article-title>
          ,
          <source>in: Proceedings of the 2014 conference on empirical methods in natural language processing (EMNLP)</source>
          ,
          <year>2014</year>
          , pp.
          <fpage>1532</fpage>
          -
          <lpage>1543</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>T.</given-names>
            <surname>Mikolov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Chen</surname>
          </string-name>
          , G. Corrado,
          <string-name>
            <given-names>J.</given-names>
            <surname>Dean</surname>
          </string-name>
          ,
          <article-title>Eficient estimation of word representations in vector space</article-title>
          ,
          <source>arXiv preprint arXiv:1301.3781</source>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [28]
          <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="ref15">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>M.</given-names>
            <surname>Potthast</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Gollub</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wiegmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Stein</surname>
          </string-name>
          , TIRA Integrated Research Architecture, in: N.
          <string-name>
            <surname>Ferro</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          Peters (Eds.),
          <source>Information Retrieval Evaluation in a Changing World, The Information Retrieval Series</source>
          , Springer, Berlin Heidelberg New York,
          <year>2019</year>
          . doi:
          <volume>10</volume>
          .1007/ 978-3-
          <fpage>030</fpage>
          -22948-1\_5.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>L.</given-names>
            <surname>Van der Maaten</surname>
          </string-name>
          , G. Hinton,
          <article-title>Visualizing data using t-sne.</article-title>
          ,
          <source>Journal of machine learning research 9</source>
          (
          <year>2008</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Schuster</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q. V.</given-names>
            <surname>Le</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Norouzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Macherey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Krikun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Macherey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Klingner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Shah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Johnson</surname>
          </string-name>
          , X. Liu, Łukasz Kaiser,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gouws</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kato</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Kudo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Kazawa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Stevens</surname>
          </string-name>
          , G. Kurian,
          <string-name>
            <given-names>N.</given-names>
            <surname>Patil</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Young</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Smith</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Riesa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rudnick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Vinyals</surname>
          </string-name>
          , G. Corrado,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hughes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Dean</surname>
          </string-name>
          ,
          <article-title>Google's neural machine translation system: Bridging the gap between human and machine translation</article-title>
          ,
          <source>CoRR abs/1609</source>
          .08144 (
          <year>2016</year>
          ). URL: http://arxiv.org/abs/1609.08144.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>T.</given-names>
            <surname>Wolf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chaumond</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Debut</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Sanh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Delangue</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Moi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Cistac</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Funtowicz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Davison</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Shleifer</surname>
          </string-name>
          , et al.,
          <article-title>Transformers: State-of-the-art natural language processing</article-title>
          ,
          <source>in: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>38</fpage>
          -
          <lpage>45</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>K.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Ethayarajh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Jurafsky</surname>
          </string-name>
          ,
          <article-title>Frequency-based distortions in contextualized word embeddings</article-title>
          ,
          <source>arXiv preprint arXiv:2104.08465</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [34]
          <string-name>
            <given-names>I.</given-names>
            <surname>Turc</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>
          ,
          <article-title>Well-read students learn better: On the importance of pre-training compact models</article-title>
          , arXiv preprint arXiv:
          <year>1908</year>
          .08962v2 (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>J.</given-names>
            <surname>Biesiada</surname>
          </string-name>
          , W. Duch,
          <article-title>Feature selection for high-dimensional data: A kolmogorov-smirnov correlation-based filter</article-title>
          ,
          <source>in: Computer Recognition Systems</source>
          , Springer,
          <year>2005</year>
          , pp.
          <fpage>95</fpage>
          -
          <lpage>103</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [36]
          <string-name>
            <given-names>C.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Qiu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <article-title>How to fine-tune bert for text classification?</article-title>
          ,
          <source>in: China National Conference on Chinese Computational Linguistics</source>
          , Springer,
          <year>2019</year>
          , pp.
          <fpage>194</fpage>
          -
          <lpage>206</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [37]
          <string-name>
            <given-names>K.</given-names>
            <surname>Ethayarajh</surname>
          </string-name>
          ,
          <article-title>How contextual are contextualized word representations? comparing the geometry of bert, elmo, and gpt-2 embeddings</article-title>
          , arXiv preprint arXiv:
          <year>1909</year>
          .
          <volume>00512</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [38]
          <string-name>
            <given-names>F.</given-names>
            <surname>Nogueira</surname>
          </string-name>
          , Bayesian Optimization:
          <article-title>Open source constrained global optimization tool for Python, 2014-</article-title>
          . URL: https://github.com/fmfn/BayesianOptimization.
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [39]
          <string-name>
            <given-names>J.</given-names>
            <surname>Cañete</surname>
          </string-name>
          , G. Chaperon,
          <string-name>
            <given-names>R.</given-names>
            <surname>Fuentes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-H.</given-names>
            <surname>Ho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Kang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Pérez</surname>
          </string-name>
          ,
          <article-title>Spanish pre-trained bert model and evaluation data</article-title>
          ,
          <source>in: PML4DC at ICLR</source>
          <year>2020</year>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>