<!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>for Humour Prejudice Detection</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Minna Peng</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Nankai Lin</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>School of Computer Science and Technology, Guangdong University of Technology</institution>
          ,
          <addr-line>Guangzhou, Guangdong</addr-line>
          ,
          <country country="CN">PR China</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>School of Information Science and Technology, Guangdong University of Foreign Studies</institution>
          ,
          <addr-line>Guangzhou, Guangdong, PR</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <abstract>
        <p>The expression of prejudice is the most common strategy used to hurt people of minority groups. Nowadays, humour becomes a space in which these prejudiced attitudes are maintained. The IberLEF 2023 shared task, titled ”HUrtful HUmour,” encompasses three distinct subtasks for the humour prejudice detection [1]. From the perspective of multi-task learning, this paper aims to construct a model to deal with three tasks. This paper proposes a cross-task interaction mechanism to increase the interaction between diferent tasks. The experimental results show the efectiveness of our method. In the final testing phase, our method achieved second place in subtask 1 and fith place in subtask 2A.</p>
      </abstract>
      <kwd-group>
        <kwd>Humour prejudice detection</kwd>
        <kwd>Multi-task learning</kwd>
        <kwd>Cross-task interaction mechanism</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>The expression of prejudice is the most common strategy used to hurt people of minority groups.
Prejudice is defined as the negative pre-judgment of members of a race or religion or of any other
socially significant group, regardless of the facts that contradict it. The expression of prejudice
is an issue directly related to stereotyping. Stereotypes are beliefs about the characteristics of a
social group that are originated in a pre-judgment, i.e. a prejudice that regards a certain group
as “diferent”. In the present era, characterized by the widespread use of social media platforms,
novel avenues have emerged for the propagation of prejudiced views. Often these messages
make use of humour to avoid the moral judgment that penalizes discrimination. In fact, when a
society begins to overcome its prejudices towards certain social groups, we can observe that
humour becomes a space in which these prejudiced attitudes are maintained.</p>
      <p>
        The IberLEF 2023 shared task, titled ”HUrtful HUmour,” encompasses three distinct subtasks
[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Firstly, it aims to discern whether a tweet containing prejudice is intended to be humourous.
Secondly, it involves identifying the targeted groups within each tweet, which can be considered
as a multi-label classification task. Lastly, the task evaluates the degree of prejudice present in
the messages, specifically focusing on the average impact on minority groups.
      </p>
      <p>From the perspective of multi-task learning, this paper aims to construct a model to deal with
three tasks. This paper proposes a cross-task interaction mechanism to increase the interaction
among diferent tasks and ensure that the information between tasks can be transferred to
each other, so as to improve the performance of each task. The experimental results show the
efectiveness of our method. In the final testing phase, our method achieved second place in
subtask 1 and fith place in subtask 2A.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        2.1. Detection of Humour Spreading Prejudice
Recently, humour becomes a space in which these prejudiced attitudes are maintained.
Individuals may employ humor as a means of conveying their prejudiced and discriminatory
views occasionally. Such humor might appear benign, but in reality it can intensify and
perpetuate prejudice and discrimination towards specific groups. Mpofu [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] demonstrated the
pernicious utilization of disparagement humour in perpetuating racist tendencies and
bodyshaming practices, leading to consequential outcomes. Of-colour humour represents a genre
of comedy widely criticized for its perceived lack of decorum and excessive vulgarity. This
type of humour typically encompasses content featuring derogatory remarks targeting specific
ethnic groups or genders, depictions of violence, domestic abuse, sexually explicit acts, and
the use of excessive swearing or profanity. Among the various manifestations of of-colour
humour, notable subcategories include blue humour, dark humour, and insult humour. While
insult humour is explicitly designed to provoke ofense, both blue and dark humour often sufer
from misclassification due to the presence of insulting and harmful language. Addressing the
pressing need to distinguish between dark and blue humour and ofensive humour, Ahuja et al.
[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] presented an innovative approach and a novel dataset comprising nearly 15,000 instances.
Their contribution to resolving this challenge was crucial for preserving unrestricted freedom
of speech on the internet.
      </p>
      <p>
        The field of natural language processing(NLP) has proposed many tasks related to humour
detection. The HAHA 2018 [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and HAHA 2019 [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] competition provided a corpus consisting
of Spanish tweets, where each tweet contained two attributes of whether it was humourous
and a funniness score. The challenger needed to use this corpus to complete the automatic
detection and automatic rating of humour in Spanish tweets, that is, to decide whether a tweet
was humourous or not, and to predict a funniness score value of the tweet. Based on the tasks
of HAHA 2018 and 2019, the HAHA 2021 competition added two new tasks: humourous logic
mechanism classification and humour target classification [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. However, the above tasks only
aim at detecting whether the text is humourous, not at detecting ofensive humour. Greenwood
and Gautam [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] highlighted the power of social media as a vehicle for disparaging humour to
activate, reinforce, and reproduce bias by examining whether gender, anti-obesity attitudes,
and sexism influence joke perception, as well as moderate perception of joke-related targets,
and highlighted the importance of taking jokes seriously in online Settings. Therefore, it is
important to detect and identify such prejudiced humour.
      </p>
      <p>
        To delve into the impact of hurtful and emotive language on sarcasm detection, Frenda
et al. [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] proposed an innovative transducer-based system named AlBERToIS. This approach
efectively combined the pre-trained AlBERTo model with linguistic features, leading to superior
performance in both sarcasm detection and sarcasm identification tasks, particularly on the
IronITA dataset. Building upon this research, Merlo et al. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] explored the representation of
humorous text by leveraging statistically significant diferences in various features using data
from the HaHackaton task. Through the application of a reduction test, the most relevant
features were identified to distinguish non-ofensive jokes from highly ofensive ones. Merlo
[10] employed computational linguistics to discern the distinctive features indicative of the
ofensive level present in humorous texts. The SemEval 2021 task 7, HaHackathon, introduced
a groundbreaking shared task by amalgamating the previously separated domains of humor
detection and ofense detection. This task involved the manual annotation of 10,000 texts
collected from Twitter and Kaggle short joke datasets, with assessments for humor and ofense.
Contestants were required to predict humor ratings, ofense ratings, and determine if the
variance in humor ratings surpassed a specific threshold [ 11].
2.2. Multi-task Learning
In natural language processing (NLP) tasks, multi-task learning models have shown great
success. Multi-task learning(MTL) model is a machine learning algorithm that can handle
multiple related tasks at the same time and share the learned knowledge between diferent tasks
to improve the overall performance. Most researchers use multi-task learning to improve the
performance of NLP related tasks. In multi-task text classification, Xiao et al. [ 12] innovatively
integrated a gate mechanism into a multi-task convolutional neural network (CNN), thereby
introducing a novel gated sharing unit. This proposed unit efectively filtered the flow of features
across tasks, resulting in a substantial reduction in interference. Liu et al. [13] proposed two
architectures for multi-task learning with neural sequence models, which can dynamically learn
the relationship between diferent tasks. At the same time, a general framework of graph
multitask learning was proposed, so that diferent tasks can efectively communicate with each other.
In deep-learning-based facial expression recognition task, Zhao et al. [14] proposed a selective
feature sharing method and built a multi-task network for facial expression recognition and
facial expression synthesis, which can efectively transfer beneficial features between diferent
tasks and filter out those useless and harmful information. Previous research has established
that multi-task learning has achieved good results in processing NLP tasks.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Our Method</title>
      <p>The architecture of our model is depicted in Figure 1, illustrating the sequential steps involved.
Initially, sentences are encoded using the BERT model, enabling the extraction of their semantic
representations. Subsequently, the original semantic representations are further expanded
through a linear layer, yielding distinct semantic representations corresponding to the three
tasks. To foster enhanced interplay among the tasks and facilitate the transfer of information
between them, we propose a cross-task interaction mechanism. This mechanism ensures that
relevant information is efectively shared across tasks, thereby bolstering the performance
of each individual task. The updated task representations, obtained through the cross-task
interaction mechanism, are then employed for prediction and output generation pertaining to
the respective tasks.
3.1. Text Representation
In the text representation module, sentences are encoded using a pre-trained model that performs
well in the semantic representation of text. In the pre-training stage, non-autoregressive
language models learn general language representations from massive corpora by unsupervised
training, and learn a large amount of prior linguistic, syntactic and lexical information for
downstream tasks.</p>
      <p>The BERT model is a language model based on multi-layer bidirectional Transformer, which
internally uses Transformer as the encoding structure. The input to the BERT model is a
sum of 3 vectors. For each input token, the representation consists of three parts: token
embeddings, segment embeddings, and position embeddings. The token embeddings represent
the representation of the current token. The segment embeddings represent the position
encoding of the sentence in which the current token is located, and the position embeddings
represent the position encoding of the current word. In the classification task, the input sentence
uses the unique tokens [CLS] and [SEP] as opening and ending markers. The fully connected
layers are connected at the [CLS] position of the last encoder layer, and finally, the softmax
layer completes the classification of sentences or sentence pairs. We chose the Spanish version
of BERT (bertbasespanishwwmuncased) as the pre-trained model.</p>
      <p>The semantic feature   is obtained by encoding the input sequence   and the calculation
process is as follows:
  =  (
 ,   ,   )
where   ,   ,   are the token embeddings, segment embeddings, and position embeddings of
the input sequence   .
3.2. Cross-task Interaction Mechanism
To enable the model to handle diferent tasks, we construct three linear layers to project the
semantic representation   into three diferent representations:
  1 =  1   +  1
  2 =  2   +  2
  3 =  3   +  3
 1 =  (
 2 =  (
 3 =  (



  1)
  2)
  3)
where,  1,  2,  3,  1,  2 and  3 are the learnable parameters of the three linear layers
respectively to learn the information of diferent tasks.</p>
      <p>In order to further increase the interaction between diferent tasks, that is, information
between tasks can be transmitted to each other to improve the performance of each task,
we construct a learnable matrix  ∈</p>
      <p>× , where each behavior of the matrix represents a
corresponding representation of a task, where  is the number of tasks handled by the model
and  is the dimension of semantic representation. The matrix can be backpropagated to learn
the representation of each task. By using matrix M to multiply the semantic representation of
the three tasks and softmax, we can get the degree of information correlation between each
pair of tasks:</p>
      <p>For task  , its correlation degree   represents how much information should be transferred
to task  by each task. Based on the information correlation degree, the semantic representation
of three tasks is updated and the new semantic representations across tasks are obtained:
(1)
(2)
(3)
(4)
(5)
(6)
(7)
as a special gate mechanism.
3.3. Text Prediction
to predict diferent tasks.
formulated as follows:
We further use the new semantic representations through the cross-task interaction mechanism</p>
      <p>For subtask 1 humor recognition, we treat it as a binary classification task, and input the
semantic representation of task 1 into a linear classifier with the softmax function, which is</p>
      <p>′
  2 = {
1   2 &gt; 
0  2 &lt; 
where    = [  1,   2,   3]. In essence, the cross-task interaction mechanism can be regarded
(8)
(9)
(10)
(11)
(12)
(13)
(14)
  1 =  (</p>
      <p>′
4   1 +  4)

as follows, where  5 and  5 are trainable parameters:
where  4 and  4 are learnable parameters, and   1 is the predicted probability.</p>
      <p>For subtask 2A target group identification, we treat it as a multi-label classification task.
We predict the targeted groups probability distribution for each sentence S. Its corresponding
feature vector   2′ is put into a linear classifier with the softmax function, which is formulated
  2 =  (</p>
      <p>′
5 ⋅   2 +  5)
where   2 ∈   and  is the number of labels. Since the model assigns one or more labels to
each sentence in the subtask 2A, we set a probability threshold  to assign the labels exceeding
the threshold to the corresponding emotions of the sentence:
sentence.</p>
      <p>where  ∈ (1, ) .   2′ denotes the assignment of the label  to the corresponding label of the
For subtask 2B prejudice degree measure, we build a linear classification layer for regressing
a continuous value to represent the judgment degree:
′
  3 =  5   3 +  5
where   3 is the predicted prejudice value, and its value range is { | ≥ 0} .</p>
      <p>The three sub-tasks choose binary cross-entropy, multi-label classification cross-entropy and
Huber loss as the loss functions, and the total loss of the model is the sum of the losses of the
three sub-tasks.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Eeperiments</title>
      <p>4.1. Experimental Setup
All experimental procedures are conducted utilizing the NVIDIA 3060 6-GB GPU. The
feedforward layer is initialized using weights drawn from a truncated normal distribution with a
standard deviation of 2e−2, while the bias is initialized to zero. A fixed initial learning rate of
2e−5 is consistently applied across all experiments. The maximum sequence length is set to 128,
representing the prescribed constraint on the number of tokens within a sentence. To optimize
training, a warmup proportion of 1e-3 is implemented. The training episodes span 20 epochs,
utilizing a batch size of 8.</p>
      <p>In order to ensure a comprehensive evaluation of the efectiveness of our strategies, we
employ a 5-fold cross-validation methodology. This approach involves dividing the datasets into
ifve distinct subsets, enabling the construction of an ensemble model that exhibits enhanced
generalization capabilities. Among these subsets, four are assigned for training purposes,
while the remaining subset is utilized for verification. The evaluation results pertaining to the
efectiveness of our strategies are derived by averaging the outcomes obtained from the five
cross models.
4.2. Experimental results</p>
      <p>As presented in Table 1, we conducted a comparative analysis of three distinct models trained
individually, the integration of the three tasks during training, and the incorporation of a
cross-task interaction mechanism within the combined training approach. The experimental
ifndings highlight the efective performance of our proposed method, particularly evident in
achieving the best results for subtask 1 and subtask 2B during five-fold cross-validation.</p>
      <p>During the final evaluation phase, our method exhibited exemplary performance by achieving
the highest scores in subtask 1 (0.7990) and subtask 2A (0.7580). Notably, our approach secured
the second position in subtask 1 and the fith position in subtask 2A on the leaderboard, further
underscoring its competitive performance within the task benchmarks.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>Within the context of multi-task learning, the primary objective of this study is to devise a model
capable of efectively addressing three distinct tasks. To foster increased interplay between these
tasks, a cross-task interaction mechanism is proposed. The experimental findings corroborate
the eficacy of our proposed approach. Notably, during the final testing phase, our method
attained a commendable position, securing second place in subtask 1 and fith place in subtask
2A.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>This work was supported by the Guangdong Philosophy and Social Science Foundation (No.
GD20CWY10), the National Social Science Fund of China (No. 22BTQ045), and the Science and
Technology Program of Guangzhou (No.202002030227).
[10] L. I. Merlo, When humour Hurts: A Computational Linguistic Approach, Ph.D. thesis,</p>
      <p>Universitat Politècnica de València, 2022.
[11] J. A. Meaney, S. Wilson, L. Chiruzzo, A. Lopez, W. Magdy, SemEval 2021 task 7:
HaHackathon, detecting and rating humor and ofense, in: Proceedings of the 15th
International Workshop on Semantic Evaluation (SemEval-2021), Association for Computational
Linguistics, Online, 2021, pp. 105–119. URL: https://aclanthology.org/2021.semeval-1.9.
doi:1 0 . 1 8 6 5 3 / v 1 / 2 0 2 1 . s e m e v a l - 1 . 9 .
[12] L. Xiao, H. Zhang, W. Chen, Gated multi-task network for text classification, in:
Proceedings of the 2018 Conference of the North American Chapter of the Association for
Computational Linguistics: Human Language Technologies, Volume 2 (Short Papers),
Association for Computational Linguistics, New Orleans, Louisiana, 2018, pp. 726–731.</p>
      <p>URL: https://aclanthology.org/N18-2114. doi:1 0 . 1 8 6 5 3 / v 1 / N 1 8 - 2 1 1 4 .
[13] P. Liu, J. Fu, Y. Dong, X. Qiu, J. C. Kit Cheung, Learning multi-task communication with
message passing for sequence learning, Proceedings of the AAAI Conference on Artificial
Intelligence 33 (2019) 4360–4367. URL: https://ojs.aaai.org/index.php/AAAI/article/view/
4346. doi:1 0 . 1 6 0 9 / a a a i . v 3 3 i 0 1 . 3 3 0 1 4 3 6 0 .
[14] H. Zheng, R. Wang, W. Ji, M. Zong, W. K. Wong, Z. Lai, H. Lv, Discriminative deep
multitask learning for facial expression recognition, Information Sciences 533 (2020) 60–71.
URL: https://www.sciencedirect.com/science/article/pii/S0020025520303601. doi:h t t p s : / /
d o i . o r g / 1 0 . 1 0 1 6 / j . i n s . 2 0 2 0 . 0 4 . 0 4 1 .</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>R.</given-names>
            <surname>Labadie-Tamayo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Chulvi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          ,
          <article-title>Everybody hurts, sometimes. overview of hurtful humour at iberlef 2023: Detection of humour spreading prejudice in twitter</article-title>
          ,
          <source>in: Procesamiento del Lenguaje Natural (SEPLN)</source>
          , volume
          <volume>71</volume>
          ,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Mpofu</surname>
          </string-name>
          , '
          <article-title>If Ever I Ofended You I Am Sorry': Disparagement Humour</article-title>
          ,
          <source>Black Twitectives and the Dream Deferred</source>
          , Springer International Publishing, Cham,
          <year>2021</year>
          , pp.
          <fpage>215</fpage>
          -
          <lpage>231</lpage>
          . URL: https://doi.org/10.1007/978-3-
          <fpage>030</fpage>
          -81969-9_
          <fpage>11</fpage>
          .
          <source>doi:1 0 . 1 0</source>
          <volume>0 7 / 9 7 8 - 3 - 0 3 0 - 8 1 9 6 9 - 9</volume>
          _
          <fpage>1</fpage>
          1 .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>V.</given-names>
            <surname>Ahuja</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Mamidi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <article-title>From humour to hatred: A computational analysis of of-colour humour</article-title>
          , in: M. Zhang,
          <string-name>
            <given-names>V.</given-names>
            <surname>Ng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zan</surname>
          </string-name>
          (Eds.),
          <source>Natural Language Processing and Chinese Computing</source>
          , Springer International Publishing, Cham,
          <year>2018</year>
          , pp.
          <fpage>144</fpage>
          -
          <lpage>153</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S.</given-names>
            <surname>Castro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Chiruzzo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rosá</surname>
          </string-name>
          ,
          <article-title>Overview of the haha task: Humor analysis based on human annotation at ibereval 2018</article-title>
          , in: IberEval@SEPLN,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>L.</given-names>
            <surname>Chiruzzo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Castro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Etcheverry</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Garat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. J.</given-names>
            <surname>Prada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rosá</surname>
          </string-name>
          , Overview of haha at iberlef 2019:
          <article-title>Humor analysis based on human annotation</article-title>
          , in: IberLEF@SEPLN,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>L.</given-names>
            <surname>Chiruzzo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Castro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Góngora</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rosá</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Meaney</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Mihalcea</surname>
          </string-name>
          , Overview of haha at iberlef 2021:
          <article-title>Detecting, rating and analyzing humor in spanish</article-title>
          ,
          <source>Proces. del Leng. Natural</source>
          <volume>67</volume>
          (
          <year>2021</year>
          )
          <fpage>257</fpage>
          -
          <lpage>268</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>D.</given-names>
            <surname>Greenwood</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Gautam</surname>
          </string-name>
          ,
          <article-title>What's in a tweet? gender and sexism moderate reactions to antifat sexist humor on twitter</article-title>
          ,
          <source>HUMOR</source>
          <volume>33</volume>
          (
          <year>2020</year>
          )
          <fpage>265</fpage>
          -
          <lpage>290</lpage>
          . URL: https://doi.org/10.1515/ humor-2019
          <source>-0026. doi:d o i : 1 0 . 1 5</source>
          <volume>1 5</volume>
          / h u m
          <source>o r - 2</source>
          <volume>0 1 9 - 0 0 2 6 .</volume>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S.</given-names>
            <surname>Frenda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. T.</given-names>
            <surname>Cignarella</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Basile</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Bosco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Patti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          ,
          <article-title>The unbearable hurtfulness of sarcasm</article-title>
          ,
          <source>Expert Systems with Applications</source>
          <volume>193</volume>
          (
          <year>2022</year>
          )
          <article-title>116398</article-title>
          . URL: https://www. sciencedirect.com/science/article/pii/S0957417421016870. doi:h t t p s : / / d o i .
          <source>o r g / 1 0 . 1 0</source>
          <volume>1 6</volume>
          / j . e
          <source>s w a . 2 0</source>
          <volume>2 1 . 1 1 6 3 9 8 .</volume>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>L. I.</given-names>
            <surname>Merlo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Chulvi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ortega-Bueno</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          ,
          <article-title>When humour hurts: linguistic features to foster explainability</article-title>
          ,
          <source>Proces. del Leng. Natural</source>
          <volume>70</volume>
          (
          <year>2023</year>
          )
          <fpage>85</fpage>
          -
          <lpage>98</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>