<!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>Using Only Character Ngrams for Hate Speech and Ofensive Content Identification in Five Low-Ressource Languages</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Yves Bestgen</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Laboratoire d'analyse statistique des textes - Statistical Analysis of Text Laboratory (LAST - SATLab), Université catholique de Louvain</institution>
          ,
          <addr-line>10 place Cardinal Mercier, Louvain-la-Neuve, 1348</addr-line>
          ,
          <country country="BE">Belgium</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper describes the system proposed by the SATLab for hate speech and ofensive content identiifcation in five low-ressource languages. This language-agnostic system applies a classical supervised learning to character n-grams, using no other data than the learning materials. After optimizing a series of parameters, it ranked first in the Bodo task and second in the Gujarati task, for which the learning material contained only 200 tweets. It also performed well in the Sinhala and Assamese task, but was outperformed by several systems in the Bengali task.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Character ngrams</kwd>
        <kwd>logistic regression</kwd>
        <kwd>gradient boosting decision tree</kwd>
        <kwd>low-resource languages</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        This year, the SATLab team took part in five tasks proposed by HASOC 2023, the fifth edition
of the challenge on Hate Speech and Ofensive Content Identification in English and
IndoAryan Languages [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Identifying ofensive content on the Internet is both a crucial task and a
particularly complex one. It’s a very important task because an increasingly large proportion
of humanity is informed via the Internet, and because these same people have (a priori) the
possibility of disseminating any content they wish. It is therefore very easy to disseminate
hateful and ofensive content that could harm or afect a large number of users. The sheer
volume of content disseminated makes monitoring dificult, especially in languages with limited
linguistic resources. HASOC aims to promote the development of automatic techniques for
such resource-poor languages [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>
        In this NLP field as in many other NLP domains, deep learning and pre-computed embeddings
are the preferred solutions, even in low-resource languages [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ]. Despite this, the SATLab
presented at the two previous HASOC editions a language-agnostic system using only character
ngrams as features, with no other linguistic resources [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ]. This approach has achieved
excellent results, particularly for languages with few linguistic resources. As HASOC 2023 is
dedicated to this type of language, the same system has been proposed.
      </p>
      <p>A first important feature of this 2023 edition of HASOC is that it includes languages that have
never been the subject of this type of challenge, such as Sinhala, Bengali, Bodo and Assamese.
The proposed system achieved excellent results for Bodo, finishing first, and for Sinhala, fourth,
but very close to the best teams. A second important feature of HASOC 2023 is that for one of the
languages, Gujarati, the learning material contained just 200 tweets. The organizers expected
participants to explore various techniques to improve the system in a few short settings. The
system developed by the SATLab does not use any information sources other than the learning
material. Nevertheless, it achieved an excellent second place for this subtask, with a Marcro-F1
of 0.8383, 0.0105 points behind the best team.</p>
      <p>The remaining of this paper presents the five tasks in which the SATLab took part and the
challenge rules. Next, the general characteristics of the proposed systems are described. Finally,
the results obtained are discussed.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Tasks and Challenge Rules</title>
      <p>All the tasks involved identifying hate and ofensive content in short messages posted on
the Internet, such as tweets or YouTube comments. For each of them, the system was asked
to distinguish between messages that included ofensive language such as insulting, hurtful,
derogatory, or obscene content (HOF) and messages that did not (NOT). All the task languages
in which the SATLab participated were poorly endowed with linguistic resources.</p>
      <p>
        In Task 1A ([
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]), the tweets were written in Sinhala, an oficial language of Sri Lanka spoken
by just under 20 million people [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], while Task 1B focused on Gujarati, an oficial language of
India spoken by approximately 50 million people. The learning material for Task 1A consisted
of 7,500 instances and the test material of 2,500 instances. For Task 1B, there were only 200
tweets for learning and 1,196 for testing.
      </p>
      <p>
        Task 4 [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] involved three Indian languages and thus three subtasks: Assamese, Bengali [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]
and Bodo. The learning material for Assamese consisted of 4036 instances and the test material
of 1009 instances. For Bengali, there were 1281 instances for learning and 320 for testing. For
Bodo, there were 1679 instances for learning and 420 for testing.
      </p>
      <p>During the test phase of the challenge, five runs could be submitted for tasks 1A and 1B,
while for three subtasks of Task 4, five runs could be submitted every day for more than a
fortnight. The measure used to evaluate the systems is the Macro-F1 score.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Systems</title>
      <p>
        The systems proposed for the five tasks are all derived from the system that achieved excellent
results in the 2021 and 2022 editions of HASOC. These were supervised approaches based only
on the learning materials provided by the task organizers. Two supervised procedures were
used: the LIBLinear L2-regularized logistic regression model (dual, -s 7) for classification [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]
and a LightGBM gradient boosting decision tree approach [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. Since the only features used
to categorize instances are ngrams of characters, this approach can be used to analyze any
language, including the five in this challenge. This approach is very simple to deploy, as it
requires no language-specific resources. It is also powerful because a series of parameters can
be optimized by cross-validation on the learning material. The remainder of this section first
presents the parameters afecting feature extraction and then those afecting the supervised
learning procedures.
      </p>
      <sec id="sec-3-1">
        <title>3.1. Feature Extraction</title>
        <p>
          Of the many parameters evaluated for the 2021 and 2022 editions of HASOC, the following two
were retained:
• The maximum length of ngrams, which could vary from 4 to 7. In all cases, all ngrams
shorter than this maximum value were used.
• The weighting applied to the frequency of each feature in an instance: the sublinear TfIdf
and BM25 [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ].
        </p>
        <p>In all the systems developed, the minimum frequency of a feature in the material analyzed
has been set at 2, and the weighting scheme applied to all features in an instance is the L2
normalization.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Learning procedures</title>
        <p>For the LIBLinear L2-regularized logistic regression model (dual, -s 7), three parameters were
evaluated:
• The regularization parameter C.
• The -w1 options for adjusting the parameter C of the HOF category.</p>
        <p>
          • The bias parameter (-B), which shifts the separating hyperplane from the origin.
LightGBM’s parameters are far too numerous to present here. They have been optimized by the
automatic procedure described in Bestgen [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ].
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. System Optimization</title>
        <p>The parameters presented above were first optimized on the training material using a 4-fold
cross-validation procedure stratified by category. Secondly, some trials allowed by the challenge
rules were used to try to optimize these parameters for the test set. For each task, both the
LIBLinear and LightGBM procedures were evaluated. In the challenge submissions, the whole
training material was used.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Results</title>
      <p>This section successively presents the results of the systems submitted for each of the five tasks.</p>
      <sec id="sec-4-1">
        <title>4.1. Task 1A: Sinhala</title>
        <p>The cross-validation procedure on the training material led to the choice of the following
parameters for feature extraction: maximum length of 5 characters and sublinear TfIdf. The
cross-validation did not reveal any significant diferences between the supervised learning
procedures and so both approaches were evaluated on the test material. The system that
performed best was an ensemble of three other models: a LIBLinear (C=8, w1=1.8 and B=0.2)
and two LightGBM models, the first based on the same features as the LIBLinear and the second
based on ngrams ranging from 1 to 7 characters. These three models obtained cross-validation
Macro-F1 scores of 0.8018, 0.8289 and 0.8295 respectively. The best of them obtained 0.8304 on
the test material. The set of three systems (majority vote) came fourth in the challenge with a
Macro-F1 of 0.8351, just 0.0031 behind the best team, as shown in Table 1.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Task 1B: Gujarati</title>
        <p>As a reminder, the training set for this task contained only 200 instances. The cross-validation
procedure on this set led to the choice of the following parameters for feature extraction:
maximum length of 4 characters and sublinear TfIdf. Cross-validation showed that LightGBM
(Macro-F1 = 0.75) was clearly more eficient than LIBlinear (Macro-F1 = 0.68, C = 3.5, B =
1). This observation was confirmed on the test material (but to a lesser extent) with Macro-F1
values of 0.8188 and 0.8130 respectively.</p>
        <p>
          However, while precision and recall for the LightGBM version were almost identical,
LIBLinear’s precision (0.8890) was significantly higher than recall (0.7840), suggesting that the
system was assigning too few instances to the HOF category. On the basis of the probabilities of
belonging to this category returned by LIBLinear, the proportion of HOFs in the prediction was
increased by assigning to this category all instances with a probability greater than or equal
to 0.43 (instead of the default value of 0.50), raising the proportion of HOFs in predictions on
the test material from 0.20 to 0.28. This simple trick, which increased recall to 0.83 while only
reducing precision to 0.85, enabled the system to gain 0.02 points and take second place in the
challenge with a Macro-F1 of 0.8383, 0.0105 points behind the best team and more than 0.04
ahead of the third-placed team (see Table 1) . It would be interesting to compare the performance
of these systems using the bootstrap confidence intervals [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] to determine whether they are of
any practical use. When making such a comparison, it will be necessary to take into account
the resources employed by each system [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ].
        </p>
        <p>The proposed approach, which uses only 200 tweets for training, is therefore very efective.
However, there is a significant and unexpected diference between the performance on the
training material with a maximum Macro-F1 of 0.75 in cross-validation and the performance
on the test material with a Macro-F1 of 0.84. This diference may be due to the fact that
cross-validation training is carried out on only 150 tweets, whereas the test phase uses 200.</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Task 4: Assamese, Bengali and Bodo</title>
        <p>The results for these three subtasks are presented together because the proposed systems are
very similar. The LIBLinear procedure is used in each case. Table 2 shows the parameters
derived from the cross-validation and the Macro-F1 achieved on using the CV and on the test set.
These systems ranked first for Bodo with a 0.006 lead over the 2nd team, fourth for Assamese
with a 0.019 diference from the first and ninth for Bengali with a 0.10 diference from the first.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>
        The SATLab approach for identifying ofensive content in short social network posts proved
highly efective for four of the five languages (Bodo, Gujarati, Sinhala and Assamese), but much
less so for the last one (Bengali), since the diference with the best team for these two languages
is almost 0.10 Macro-F1 score. The origin of these diferences is unknown to me. Only a reading
of the organizers’ synthesis [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] could reveal whether there are diferences between these tasks
or between the systems presented to perform them.
      </p>
      <p>The eficiency obtained for Gujarati is quite astonishing and unexpected for an approach that
employs no other resources than the learning material, which is limited for this language to
200 instances. This result suggests that it would be interesting to repeat all the HASOC tasks
proposed over the last five years and determine for each of them the impact of the number of
instances available for learning on performance in the test phase. To be honest, I doubt that
such good results could be obtained for all of them. The diference in performance in Task 4
between Bodo and the other two languages also merits further analysis.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>The author wishes to thank the organizers of this shared task for putting together this valuable
event. He is a Research Associate of the Fonds de la Recherche Scientifique - FNRS (Fédération
Wallonie Bruxelles de Belgique). Computational resources have been provided by the
supercomputing facilities of the Université Catholique de Louvain (CISM/UCL) and the Consortium
des Equipements de Calcul Intensif en Fédération Wallonie Bruxelles (CECI).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>T.</given-names>
            <surname>Ranasinghe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Ghosh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. S.</given-names>
            <surname>Pal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Senapati</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. E.</given-names>
            <surname>Dmonte</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zampieri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Modha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Satapara</surname>
          </string-name>
          ,
          <source>Overview of the HASOC subtracks at FIRE</source>
          <year>2023</year>
          :
          <article-title>Hate speech and ofensive content identification in assamese, bengali, bodo, gujarati and sinhala</article-title>
          ,
          <source>in: Proceedings of the 15th Annual Meeting of the Forum for Information Retrieval Evaluation</source>
          ,
          <string-name>
            <surname>FIRE</surname>
          </string-name>
          <year>2023</year>
          , Goa,
          <source>India. December 15-18</source>
          ,
          <year>2023</year>
          , ACM,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <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>P.</given-names>
            <surname>Majumder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Patel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dave</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Mandalia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Patel</surname>
          </string-name>
          ,
          <source>Overview of the HASOC track at FIRE</source>
          <year>2019</year>
          :
          <article-title>Hate speech and ofensive content identification in indoeuropean languages</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.),
          <source>FIRE '19: Forum for Information Retrieval Evaluation</source>
          , Kolkata, India, December,
          <year>2019</year>
          , ACM,
          <year>2019</year>
          , pp.
          <fpage>14</fpage>
          -
          <lpage>17</lpage>
          . URL: https://doi.org/10.1145/3368567.3368584. doi:
          <volume>10</volume>
          .1145/3368567.3368584.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <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>A.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. R.</given-names>
            <surname>Chakravarthi</surname>
          </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="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bestgen</surname>
          </string-name>
          ,
          <article-title>A simple language-agnostic yet strong baseline system for hate speech and ofensive content identification</article-title>
          , in: P. Mehta,
          <string-name>
            <given-names>T.</given-names>
            <surname>Mandl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Majumder</surname>
          </string-name>
          , M. Mitra (Eds.), Working Notes of FIRE 2021 -
          <article-title>Forum for Information Retrieval Evaluation</article-title>
          , CEUR Workshop Proceedings, CEUR-WS.org,
          <year>2021</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>10</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bestgen</surname>
          </string-name>
          ,
          <article-title>Confirming the efectiveness of a simple language-agnostic yet very strong system for hate speech and ofensive content identification</article-title>
          , in: K. Ghosh,
          <string-name>
            <given-names>T.</given-names>
            <surname>Mandl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Majumder</surname>
          </string-name>
          , M. Mitra (Eds.), Working Notes of FIRE 2022 -
          <article-title>Forum for Information Retrieval Evaluation</article-title>
          , CEUR Workshop Proceedings, CEUR-WS.org,
          <year>2022</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S.</given-names>
            <surname>Satapara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Madhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Ranasinghe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. E.</given-names>
            <surname>Dmonte</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zampieri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Pandya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sandip</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Majumder</surname>
          </string-name>
          , T. Mandl,
          <article-title>Overview of the hasoc subtrack at fire 2023: Hatespeech identification in sinhala and gujarati</article-title>
          , in: K. Ghosh,
          <string-name>
            <given-names>T.</given-names>
            <surname>Mandl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Majumder</surname>
          </string-name>
          , M. Mitra (Eds.), Working Notes of FIRE 2023 -
          <article-title>Forum for Information Retrieval Evaluation, Goa, India</article-title>
          .
          <source>December 15-18</source>
          ,
          <year>2023</year>
          , CEUR Workshop Proceedings, CEUR-WS.org,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>T.</given-names>
            <surname>Ranasinghe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Anuradha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Premasiri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Silva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Hettiarachchi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Uyangodage</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zampieri</surname>
          </string-name>
          , Sold:
          <article-title>Sinhala ofensive language dataset</article-title>
          ,
          <source>arXiv preprint arXiv:2212.00851</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>K.</given-names>
            <surname>Ghosh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Senapati</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. S.</given-names>
            <surname>Pal</surname>
          </string-name>
          ,
          <article-title>Annihilate Hates (Task 4</article-title>
          ,
          <string-name>
            <surname>HASOC</surname>
          </string-name>
          <year>2023</year>
          )
          <article-title>: Hate Speech Detection in Assamese, Bengali, and Bodo languages</article-title>
          , in: K. Ghosh,
          <string-name>
            <given-names>T.</given-names>
            <surname>Mandl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Majumder</surname>
          </string-name>
          , M. Mitra (Eds.), Working Notes of FIRE 2023 -
          <article-title>Forum for Information Retrieval Evaluation, Goa, India</article-title>
          .
          <source>December 15-18</source>
          ,
          <year>2023</year>
          , CEUR Workshop Proceedings, CEUR-WS.org,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>N.</given-names>
            <surname>Romim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ahmed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Talukder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. Saiful</given-names>
            <surname>Islam</surname>
          </string-name>
          ,
          <article-title>Hate speech detection in the Bengali language: A dataset and its baseline evaluation</article-title>
          , in: M. S. Uddin,
          <string-name>
            <surname>J. C.</surname>
          </string-name>
          Bansal (Eds.),
          <source>Proceedings of International Joint Conference on Advances in Computational Intelligence</source>
          , Springer Singapore, Singapore,
          <year>2021</year>
          , pp.
          <fpage>457</fpage>
          -
          <lpage>468</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>R.-E. Fan</surname>
            ,
            <given-names>K.-W.</given-names>
          </string-name>
          <string-name>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.-J. Hsieh</surname>
            ,
            <given-names>X.-R.</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.-J. Lin</surname>
            ,
            <given-names>LIBLINEAR:</given-names>
          </string-name>
          <article-title>A library for large linear classification</article-title>
          ,
          <source>Journal of Machine Learning Research</source>
          <volume>9</volume>
          (
          <year>2008</year>
          )
          <fpage>1871</fpage>
          -
          <lpage>1874</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>G.</given-names>
            <surname>Ke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Meng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Finley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Chen</surname>
          </string-name>
          , W. Ma,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Ye</surname>
          </string-name>
          , T.-Y. Liu,
          <article-title>LightGBM: A highly eficient gradient boosting decision tree</article-title>
          , in: I. Guyon,
          <string-name>
            <given-names>U. V.</given-names>
            <surname>Luxburg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bengio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wallach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Fergus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Vishwanathan</surname>
          </string-name>
          , R. Garnett (Eds.),
          <source>Advances in Neural Information Processing Systems</source>
          <volume>30</volume>
          ,
          <string-name>
            <surname>Curran</surname>
            <given-names>Associates</given-names>
          </string-name>
          , Inc.,
          <year>2017</year>
          , pp.
          <fpage>3146</fpage>
          -
          <lpage>3154</lpage>
          . URL: http://papers.nips.cc/paper/ 6907-lightgbm
          <article-title>-a-highly-eficient-gradient-boosting-decision-tree.pdf.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bestgen</surname>
          </string-name>
          ,
          <article-title>Optimizing a supervised classifier for a dificult language identification problem</article-title>
          .,
          <source>in: Proceedings of the Eigth Workshop on NLP for Similar Languages, Varieties and Dialects (VarDial)</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>96</fpage>
          -
          <lpage>101</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bestgen</surname>
          </string-name>
          ,
          <article-title>LAST at CMCL 2021 shared task: Predicting gaze data during reading with a gradient boosting decision tree approach</article-title>
          ,
          <source>in: Proceedings of the Workshop on Cognitive Modeling and Computational Linguistics</source>
          , Association for Computational Linguistics, Online,
          <year>2021</year>
          , pp.
          <fpage>90</fpage>
          -
          <lpage>96</lpage>
          . URL: https://aclanthology.org/
          <year>2021</year>
          .cmcl-
          <volume>1</volume>
          .10. doi:
          <volume>10</volume>
          .18653/v1/
          <year>2021</year>
          .cmcl-
          <volume>1</volume>
          .
          <fpage>10</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bestgen</surname>
          </string-name>
          ,
          <article-title>Please, don't forget the diference and the confidence interval when seeking for the state-of-the-art status</article-title>
          ,
          <source>in: Proceedings of the Thirteenth Language Resources and Evaluation Conference</source>
          , European Language Resources Association, Marseille, France,
          <year>2022</year>
          , pp.
          <fpage>5956</fpage>
          -
          <lpage>5962</lpage>
          . URL: https://aclanthology.org/
          <year>2022</year>
          .lrec-
          <volume>1</volume>
          .
          <fpage>640</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>J.</given-names>
            <surname>Dodge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gururangan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Card</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Schwartz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. A.</given-names>
            <surname>Smith</surname>
          </string-name>
          ,
          <article-title>Show your work: Improved reporting of experimental results</article-title>
          ,
          <source>in: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)</source>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Hong Kong, China,
          <year>2019</year>
          , pp.
          <fpage>2185</fpage>
          -
          <lpage>2194</lpage>
          . URL: https://www.aclweb.org/anthology/D19-1224. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>D19</fpage>
          -1224.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>