<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>Conference and Labs of the Evaluation Forum, September</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>SINAI Participation in SimpleText Task 2 at CLEF 2023: GPT-3 in Lexical Complexity Prediction for General Audience</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Jenny Ortiz-Zambrano</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>César Espin-Riofrio</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Arturo Montejo-Ráez</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Guayaquil</institution>
          ,
          <addr-line>Delta Av. s/n, Guayaquil, 090510</addr-line>
          ,
          <country country="EC">Ecuador</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Jaén</institution>
          ,
          <addr-line>Las Lagunillas s/n, Jaén, 23071</addr-line>
          ,
          <country country="ES">Spain</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <volume>1</volume>
      <fpage>8</fpage>
      <lpage>21</lpage>
      <abstract>
        <p>In this paper our participation in the CLEF 2023 SimpleText track's Task 2.1 and 2.2 is described. In our approach, we explore zero-shot and few-shot learning strategies over the auto-regressive model GPT-3. Several prompts to achieve those strategies were tested. Our results were ranked among top submitted runs and demonstrated a solid performance for the task of lexical complexity prediction.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Lexical Complexity Prediction</kwd>
        <kwd>Auto-regressive models</kwd>
        <kwd>GPT-3</kwd>
        <kwd>Prompting</kwd>
        <kwd>Zero-shot learning</kwd>
        <kwd>Few-shot learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Reading involves a complex process that goes beyond dealing with words or sections that
are dificult for the reader to understand. Therefore, it is necessary to have an adequate
understanding of the content of the texts in order to build coherent mental representations and
thus fully grasp their meaning [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>
        Information technologies make it possible for people to access abundant information in
diferent fields such as education, information, social, health or government and even science.
However, this information is not accessible to many, since some people face great reading
barriers such as long sentences, technical language or complex linguistic structures that do
not allow them to understand the content of the texts, being directly afected people with
intellectual disabilities and people with low learning level; including university students, who
are people with a high level of education and specialized knowledge in diferent subjects of
study but, even so, could be part of groups of people with reading disabilities [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>
        The task of detecting in the content of the documents the words that are dificult or complex
to understand for a certain group is called Complex Word Identification. This task is essential
in many applications related to Natural Language Processing (NLP), such as Text Simplification
[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>
        The SimpleText1 lab at CLEF2023 [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] aims to generate a concise summary of various scientific
documents, based on a popular scientific query, in order to provide the user with an easily
understandable overview of a specific topic, as people generally avoid reliable sources, such
as scientific literature, due to their complex language and lack of prior knowledge. Instead,
they prefer to rely on superficial, web- and social media-generated sources, which are often
motivated by commercial or political interests, rather than providing quality information. Can
text simplification help to remove some of these access barriers? The purpose of the task is to
generate a shortened version of several scientific papers, based on a popular scientific query, in
order to provide the user with an easy-to-understand overview of a specific subject.
      </p>
      <p>The main purpose of this article is to demonstrate the ability of the GPT-3 Transformers-based
language model to perform text classification in the realm of lexical simplification achieved by
creating and evaluating several prompt variants for few-shot and zero-shot learning examples
of short sentences to determine word complexity.</p>
      <p>The paper is organized as follows: first, a brief overview of the state-of-art is provided in
lexical complexity prediction and complex word identification (which are synonyms for the
same NLP task). Then, large language models are introduced, with special emphasis on
autoregressive ones (generative models). This is complemented with a brief description of zero-shot
and few-shot learning approaches usually applied with these models. In Section 4, Task 2 in
SimpleText track is introduced. Section 5 presents our solution and the results obtained with
diferent variations on prompting. Finally, conclusions and some insights on planned work is
provided in Section 6.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        In recent years, Complex Word Identification (CWI) has aroused great interest in the
scientific community and in computational linguistics researchers. These initiatives contribute to
development and research in the field of simplifying texts and improving the accessibility of
information. These proposals include conferences, workshops and specific tasks that seek to
address the challenges and promote advances in the field of text simplification. This is evidenced
in the development of computational semantic analysis systems, as demonstrated in CWI shared
tasks at events such as SemEval 2016 [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], NAACL-HTL 2018 [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], ALexS at IberLEF 2020 [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], the
15th edition of SemEval and the first Lexical Complexity Prediction task [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], TSAR-2022 - the
workshop on Simplification, Accessibility and Readability of Texts [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], the SimpleText task at
CLEF in 2021 [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] and 2022 [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], among other initiatives in this regard.
1texttthttp://simpletext-project.com/2023/clef/
      </p>
      <sec id="sec-2-1">
        <title>2.1. GPT-3 for solving NLP tasks</title>
        <p>
          State-of-the-art deep learning models such as BERT [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ], RoBERTa [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ], GPT-3 [14] and others
outperform traditional approaches. Last generation GPT-3, or Generative Pre-trained
Transformer 3, is a transformer-based large language model developed by OpenAI2. It contains 175
billion parameters. Due to its extensive language knowledge, enormous processing power, and
potential to learn from vast amounts of online text data, GPT-3 can perform a wide variety
of general natural language-based tasks with unprecedented ease such as the generation and
classification of the text [ 15]. The enormous scale of the model allows to generate results
with quality, precision and diversity of the generated content. This breakthrough has sparked
considerable interest and concern in the NLP field, the machine learning industry in general,
the media, the AI ethics communities, and civil society [16].
        </p>
        <p>Although GTP-3 is a generative model, it can take several approaches to get to classify text,
which are mainly zero shot classification (in which no examples are provided to the model) to
single shot and few shot classification (in which it shows some examples to the model) [15].</p>
        <p>In zero-shot learning, no prior training or adjustment to the labeled data is required. Currently,
GPT-3 produces results for invisible data, but in order to perform zero-shot classification with
GPT-3, we must provide you with a compatible prompt [15].</p>
        <p>In few-shot learning, the prompt is composed including some examples of the task to be
solved. The ability to learn with few attempts, never before seen in Natural Language Processing
(NLP) models, is a prominent feature of GPT-3 [16].</p>
        <p>Another method of classifying text is by fine-tuning an AI model with one or a few training
examples, known as one or few-shot text classification. By providing examples of how to classify
text, the model can learn information about object categories based on those examples [15].</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. SimpleText task at CLEF 2023</title>
      <p>
        The SimpleText track at CLEF faces the challenges of text simplification methods with the
purpose of promoting access to scientific information. Provided a corpus of scientific literature
abstracts and popular science requests. Three tasks were proposed. First, the content selection
task (what is in, or out?) poses a challenge to systems, as they must choose which passages
to include in a simplified summary in response to a query, deciding what information should
be present, and what information should be omitted. Second, the goal of complexity detection
(what is unclear?) is to identify what is unclear in a passage and a query. It seeks to classify
the terms or concepts that require additional explanation to understand the passage, including
definitions, context, and applications. Third, the text simplification task (rewrite this!) is to
simplify passages of scientific abstracts in response to a query, while keeping the essential
content intact [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
      <p>We have only participated in task 2, complexity spotting.</p>
      <sec id="sec-3-1">
        <title>3.1. Task 2: What is unclear?</title>
        <p>Complexity Spotting: Identifying and explaining dificult concepts for general audience. The
goal of this task is:
1. to decide which terms (up to 5) require explanation and contextualization to help a reader
to understand a complex scientific text – for example, with regard to a query, terms that
need to be contextualized (with a definition, example and/or use-case)
2. to provide short (one/two sentence) explanations/definitions for the detected dificult
terms. For the abbreviations, the definition would be the extended abbreviation.</p>
        <p>For each piece of text, participants must submit an ordered list of terms that are dificult,
along with scores on a scale of 1 to 3 (where 3 indicates the most dificult terms, and 1 are
easiest to deduce or guess), and also provide definitions for these terms. The text fragments
(sentences) are considered independently, which means that the repetition of dificult terms in
diferent fragments is allowed.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Proposed system</title>
      <p>As stated before, our approach consists in applying zero-shot or few-shot prompting to GPT-3
model, extracting the predictions from the generated sequence. The details of the model are
given in Table 1. The model is queried through its Python API and OpenAI playground is a
convenient web interface that can be used to generate the needed code in a fast and easy way.</p>
      <sec id="sec-4-1">
        <title>4.1. Experiments with few-shot learning</title>
        <p>We apply three executions with few-shot learning with diferent prompts. The values of
the settings also varied, it was observed that in the determination of the level of complexity
(dificult, very dificult or neutral), the model tended to identify terminology beyond its verbatim
expression in the text. After the experiments, we show that this approach is important because
the model can be adapted to a specific task. Next is the detail of the diferent prompts tested:
To retrieve up to 5 difficult terms in a given passage from a
scientific abstract. Rank the list of difficult terms with
corresponding scores on the scale 1-3 where 3 is the most
difficult term. You have a maximum of 250 tokens you can t go over
that. (here is an example)
context: quantum computing
Text: This paper describes a tool that converts Unreal levels to web-ready
environments in VRML and X3D.
##
Term 1: X3D
Difficulty:2
Term 2: vrml
Difficulty:2
##
Context: drones
Text: In an attempt to achieve the above mentioned tasks, we
propose an imitation learning based, data-driven solution to UAV
autonomy for navigating through city streets by learning to fly
by imitating an expert pilot.
###</p>
        <sec id="sec-4-1-1">
          <title>Prompt PRM_FS_TASK2_1_V2:</title>
          <p>To decide which terms (up to 5) require explanation and
contextualization to help a reader to understand a complex
scientific text. Rank the list of difficult terms with
corresponding scores on the scale 1-3 where 3 is the most
difficult term. You have a maximum of 250 tokens you can t go
over that. (here is an example)
context: quantum computing
Text: This paper describes a tool that converts Unreal levels to web-ready
environments in VRML and X3D.
##
Term 1:X3D
Difficulty:2
Term 2: vrml
Difficulty:2
Now it is your turn
##
Context: misinformation
Text: We find that Italy is the most polarized country, followed
by France, Germany and lastly Spain.
###</p>
        </sec>
        <sec id="sec-4-1-2">
          <title>Prompt PRM_FS_TASK2_2_V1:</title>
          <p>Select a number from 1 to 5 terms within the sentence named
text, rank them from 1 to 3 is the most difficult and finally
give the meaning of each difficult term and add an example and
an use-case. Use next form (term, difficulty, ’definition,
example, use-case’). You have a maximum of 250 tokens you can t go
over that. Here is an example:
context: quantum computing
Text: This paper describes a tool that converts Unreal levels to
web-ready environments in VRML and X3D.
##
Term 1:3D
Difficulty:2
Definition: X3D is an ISO-ratified, file format and run-time
architecture to represent and communicate 3D scenes and objects.</p>
          <p>X3D fully represents 3-dimensional data.</p>
          <p>Term 2:vrml
Difficulty:2
Definition: Virtual Reality Modeling Language (VRML) is a
standard file format for representing 3-dimensional interactive
vector graphics, designed particularly with the World Wide Web
in mind. It has been superseded by X3D.</p>
          <p>The Table 2 presents the results generated by applying few-shot learning, where the model
has been able to learn from a very small number of training examples.</p>
        </sec>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Experiments with zero-shot learning</title>
        <p>In the case of zero-shot learning, no examples are provided in the prompt.</p>
        <sec id="sec-4-2-1">
          <title>Prompt PRM_ZS_TASK2_1_V1:</title>
          <p>To retrieve up to 5 difficult terms in a given passage from a
scientific abstract. Rank the list of difficult terms with
corresponding scores on the scale 1-3 where 3 is the most
difficult term. you have a maximum of 250 tokens you can t go over that.
##
Context: drones
Text: With the ever increasing number of unmanned aerial
vehicles getting involved in activities in the civilian and
commercial domain, there is an increased need for autonomy in
these systems too.
###</p>
        </sec>
        <sec id="sec-4-2-2">
          <title>Prompt PRM_ZS_TASK2_1_V2:</title>
          <p>To decide which difficult terms (up to 5) are in the complex
scientific text. Rank the list of difficult terms with
corresponding scores on the scale 1-3 where 3 is the most
difficult term. you have a maximum of 250 tokens you can t go over that.
##
Context: drones
Text: In an attempt to achieve the above mentioned tasks, we
propose an imitation learning based, data-driven solution to UAV
autonomy for navigating through city streets by learning to fly
by imitating an expert pilot.
###</p>
        </sec>
        <sec id="sec-4-2-3">
          <title>Prompt PRM_ZS_TASK2_2_V1</title>
          <p>Select a number from 1 to 5 terms within the sentence named
text, rank them from1 to 3 is the most difficult and finally
give the meaning of each difficult term and add an example and
an use-case. Use next form (term, difficulty, ’definition,
example, use-case’). you have a maximum of 250 tokens you can t go over that.
##
Context: drones
Text: Derived from the classic image classification algorithms,
our classifier has been constructed in the form of a fast
39layered Inception model, that evaluates the presence of roads
using the tomographic reconstructions of the input frames.
###</p>
          <p>The Table 3 presents the results generated by applying zero-shot learning, where the model
has been able to generate its own results without the need for it to learn from a small number</p>
          <p>In the example of one of the texts presented by the Table 3 for the task 2.1 on first run
PRM_ZS_TASK2_1_V1, the model has identified a total of 5 words (corresponds to the column
Term_rank_snt) achieving to generate its response according to the request made. The model
has also managed to identify the complex terms of the text (corresponds to the column Term),
The model has also been able to provide a complexity value for each term (corresponds to the
column Dificulty ).</p>
          <p>In the second execution for the generation of results of task 2.1 - PRM_ZS_TASK2_1_V2, the
model has not only been able to identify a total of 5 dificult terms from the content of the text,
but it has also been able to generate a brief description of the dificult terms; we must emphasize
that it had not been specified in the request.</p>
          <p>Finally, taking as a sample one of the examples resulting from the third execution
PRM_ZS_TASK2_2_V1, and as a requirement specified in task 2.2, the model has generated a
definition, an example, and a use case to better illustrate the reader about the term identified as
dificult. In the run example, the model has identified 4 complex words in the text.</p>
          <p>According to the examples of the analyzed sample, GPT-3 has shown an outstanding ability
to recognize the definitions of acronyms, generating coherent definitions, examples and use
cases, the issue of identification and recognition of complex words have been addressed with
success.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Results</title>
      <p>In Tables 4 and 5 we show the results obtained in our participation at task 2.1 and 2.2 respectively,
according to the scores oficially released by the organizers. The runs were named against our
team ID (SINAI) together with the prompt strategy used from the ones described in previous
sections. We have omitted our team ID for simplification.</p>
      <p>Our results in task 2.1 show a significant performance of the proposed approach close to top
performing systems. It is interesting to note that, in general, version 1 for the prompt is better
and that zero-shot learning prompts are better at detecting a dificult word, while few-shot
learning prompts are better at determining a dificulty score. A mixture of both approach could
be worth exploring.</p>
      <p>In task 2.2 we obtain high values at semantic match. For providing definitions or explanations
over dificult terms, few-shot learning prompting is consistently better than zero-shot learning
prompts.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusion and future work</title>
      <p>We present the results obtained by a auto-regressive language model with 175 billion parameters
that demonstrates strong performance in solving tasks 2.1 and 2.2 proposed in
SimpleText@CLEF2023.</p>
      <p>The model demonstrated a solid performance in obtaining the results in the experiments
applying zero-shot and few-shot approaches, generating high-quality samples. In addition,
the model shows that learning carried out with few samples has the ability to generalize from
limited information. Few-shot learning has been applied to a never-before-performed task
where it has been shown to overcome the limitation of large training data sets allowing the
model to learn quickly and efectively with few examples.</p>
      <p>Despite the fact that the model presents several limitations and weaknesses, these results
indicate that extremely large language models as GPT-3 can play a crucial role in the development
of accessibility related solutions.</p>
      <p>As future work, we plan to explore more strategies on prompting, like Chain-of-Thought or
adding more examples.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments</title>
      <p>This work has been partially supported by WeLee project (1380939, FEDER Andalucía 2014-2020)
funded by the Andalusian Regional Government, and projects CONSENSO
(PID2021-122263OBC21), MODERATES (TED2021-130145B-I00), SocialTOX (PDC2022-133146-C21) funded by Plan
Nacional I+D+i from the Spanish Government, and project PRECOM (SUBV-00016) funded by
the Ministry of Consumer Afairs of the Spanish Government.</p>
      <p>We appreciate Arteaga Burgos Anthony Alexander, graduate of the Computer Systems
Engineering degree from the University of Guayaquil, for his valuable contribution to the
development of our work.
arXiv:1907.11692 (2019).
[14] T. Brown, B. Mann, N. Ryder, M. Subbiah, J. D. Kaplan, P. Dhariwal, A. Neelakantan,
P. Shyam, G. Sastry, A. Askell, et al., Language models are few-shot learners, Advances in
neural information processing systems 33 (2020) 1877–1901.
[15] S. Kublik, S. Saboo, GPT-3: Building innovative NLP products using large language models,</p>
      <p>O’Reilly Media (2022).
[16] A. Chan, GPT-3 and InstructGPT: technological dystopianism, utopianism, and
“Contextual” perspectives in AI ethics and industry, AI and Ethics 3 (2023) 53–64.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>P. van den Broek</surname>
          </string-name>
          ,
          <article-title>Using texts in science education: Cognitive processes and knowledge representation</article-title>
          ,
          <source>Science</source>
          (New York, N.Y.)
          <volume>328</volume>
          (
          <year>2010</year>
          )
          <fpage>453</fpage>
          -
          <lpage>6</lpage>
          . doi:
          <volume>10</volume>
          .1126/science.1182594.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>R.</given-names>
            <surname>Alarcón</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Moreno</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Martínez</surname>
          </string-name>
          ,
          <string-name>
            <surname>Hulat-ALexS CWI</surname>
          </string-name>
          Task-
          <article-title>CWI for Language and</article-title>
          Learning Disabilities Applied to University Educational Texts,
          <source>in: Proceedings of the Iberian Languages Evaluation Forum (IberLEF</source>
          <year>2020</year>
          ),
          <article-title>CEUR-WS, Malaga</article-title>
          , Spain,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Rico-Sulayes</surname>
          </string-name>
          ,
          <article-title>General lexicon-based complex word identification extended with stem n-grams and morphological engines</article-title>
          ,
          <source>in: Proceedings of the Iberian Languages Evaluation Forum (IberLEF</source>
          <year>2020</year>
          ),
          <article-title>CEUR-WS, Malaga</article-title>
          , Spain,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M.</given-names>
            <surname>Aliannejadi</surname>
          </string-name>
          , G. Faggioli,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Vlachos</surname>
          </string-name>
          , Working Notes of CLEF 2023 -
          <article-title>Conference and Labs of the Evaluation Forum, CEUR-</article-title>
          <string-name>
            <surname>WS</surname>
          </string-name>
          ,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>G.</given-names>
            <surname>Paetzold</surname>
          </string-name>
          , L. Specia,
          <source>SemEval 2016 Task</source>
          <volume>11</volume>
          :
          <string-name>
            <surname>Complex Word Identification</surname>
          </string-name>
          ,
          <year>2016</year>
          , pp.
          <fpage>560</fpage>
          -
          <lpage>569</lpage>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>S16</fpage>
          -1085.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S. M.</given-names>
            <surname>Yimam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Biemann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Malmasi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Paetzold</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Specia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Štajner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Tack</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zampieri</surname>
          </string-name>
          ,
          <source>A Report on the Complex Word Identification Shared Task</source>
          <year>2018</year>
          ,
          <source>in: Proceedings of the Thirteenth Workshop on Innovative Use of NLP for Building Educational Applications</source>
          , Association for Computational Linguistics, New Orleans, Louisiana,
          <year>2018</year>
          , pp.
          <fpage>66</fpage>
          -
          <lpage>78</lpage>
          . URL: https://aclanthology.org/W18-0507. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>W18</fpage>
          -0507.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>J.</given-names>
            <surname>Ortiz-Zambrano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Montejo-Ráez</surname>
          </string-name>
          ,
          <source>Overview of ALexS 2020: First workshop on lexical analysis at SEPLN, in: Proceedings of the Iberian Languages Evaluation Forum (IberLEF</source>
          <year>2020</year>
          ), volume
          <volume>2664</volume>
          ,
          <year>2020</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>M.</given-names>
            <surname>Shardlow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Evans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. H.</given-names>
            <surname>Paetzold</surname>
          </string-name>
          , M. Zampieri, SemEval
          <article-title>-2021 task 1: Lexical complexity prediction</article-title>
          ,
          <source>in: Proceedings of the 15th International Workshop on Semantic Evaluation (SemEval-2021)</source>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Online,
          <year>2021</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>16</lpage>
          . URL: https://aclanthology.org/
          <year>2021</year>
          .semeval-
          <volume>1</volume>
          .1. doi:
          <volume>10</volume>
          .18653/v1/
          <year>2021</year>
          .semeval-
          <volume>1</volume>
          .1.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>S.</given-names>
            <surname>Štajner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Saggion</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ferrés</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Shardlow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. C.</given-names>
            <surname>Sheang</surname>
          </string-name>
          , K. North,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zampieri</surname>
          </string-name>
          , W. Xu,
          <source>Proceedings of the Workshop on Text Simplification</source>
          , Accessibility, and
          <string-name>
            <surname>Readability</surname>
          </string-name>
          (TSAR-
          <year>2022</year>
          ),
          <source>in: Proceedings of the Workshop on Text Simplification</source>
          , Accessibility, and
          <string-name>
            <surname>Readability</surname>
          </string-name>
          (TSAR-
          <year>2022</year>
          ),
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>L.</given-names>
            <surname>Ermakova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bellot</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Braslavski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kamps</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mothe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Nurbakova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Ovchinnikova</surname>
          </string-name>
          , E. Sanjuan, Overview of SimpleText CLEF 2021 workshop and pilot tasks,
          <source>in: 12th Conference and Labs of the Evaluation Forum (CLEF</source>
          <year>2021</year>
          ), volume
          <volume>2936</volume>
          , CEUR-WS. org,
          <year>2021</year>
          , pp.
          <fpage>2212</fpage>
          -
          <lpage>2227</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>L.</given-names>
            <surname>Ermakova</surname>
          </string-name>
          , E. SanJuan, J. Kamps,
          <string-name>
            <given-names>S.</given-names>
            <surname>Huet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Ovchinnikova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Nurbakova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Araújo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Hannachi</surname>
          </string-name>
          , E. Mathurin,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bellot</surname>
          </string-name>
          ,
          <article-title>Overview of the clef 2022 simpletext lab: Automatic simplification of scientific texts</article-title>
          , in: A.
          <string-name>
            <surname>Barrón-Cedeño</surname>
          </string-name>
          , G. Da San Martino, M. Degli
          <string-name>
            <surname>Esposti</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Sebastiani</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Macdonald</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Pasi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Hanbury</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Potthast</surname>
          </string-name>
          , G. Faggioli, N. Ferro (Eds.),
          <source>Experimental IR Meets Multilinguality, Multimodality, and Interaction</source>
          , Springer International Publishing, Cham,
          <year>2022</year>
          , pp.
          <fpage>470</fpage>
          -
          <lpage>494</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <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="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ott</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Joshi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Levy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          , V. Stoyanov,
          <article-title>RoBERTa: A robustly optimized BERT pretraining approach</article-title>
          , arXiv preprint
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>