<!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>application of Large Language Models for language teaching and assessment technology</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Andrew Caines</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Luca Benedetto</string-name>
          <email>luca.benedetto@cl.cam.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Shiva Taslimipoor</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Christopher Davis</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yuan Gao</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Øistein Andersen</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Zheng Yuan</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mark Elliott</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Russell Moore</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Christopher Bryant</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marek Rei</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Helen Yannakoudakis</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andrew Mullooly</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Diane Nicholls</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Paula Buttery</string-name>
          <email>paula.buttery@cl.cam.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>King's College London</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>ALTA Institute &amp; Computer Laboratory, University of Cambridge</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Cambridge University Press &amp; Assessment</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <abstract>
        <p>The recent release of very large language models such as PaLM and GPT-4 has made an unprecedented impact in the popular media and public consciousness, giving rise to a mixture of excitement and fear as to their capabilities and potential uses, and shining a light on natural language processing research which had not previously received so much attention. The developments ofer great promise for education technology, and in this paper we look specifically at the potential for incorporating large language models in AI-driven language teaching and assessment systems. We consider several research areas - content creation and calibration, assessment and feedback - and also discuss the risks and ethical considerations surrounding generative AI in education technology for language learners. Overall we ifnd that larger language models ofer improvements over previous models in text generation, opening up routes toward content generation which had not previously been plausible. For text generation they must be prompted carefully and their outputs may need to be reshaped before they are ready for use. For automated grading and grammatical error correction, tasks whose progress is checked on well-known benchmarks, early investigations indicate that large language models on their own do not improve on state-of-the-art results according to standard evaluation metrics. For grading it appears that linguistic features established in the literature should still be used for best performance, and for error correction it may be that the models can ofer alternative feedback styles which are not measured sensitively with existing methods. In all cases, there is work to be done to experiment with the inclusion of large language models in education technology for language learners, in order to properly understand and report on their capacities and limitations, and to ensure that foreseeable risks such as misinformation and harmful bias are mitigated.</p>
      </abstract>
      <kwd-group>
        <kwd>large language models</kwd>
        <kwd>education technology</kwd>
        <kwd>natural language processing</kwd>
        <kwd>question dificulty estimation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        The training of large language models (LLMs) – also known as pre-trained language models or
foundation models – has had a transformative efect on the fields of natural language processing
(NLP) and artificial intelligence (AI) more broadly. LLMs are ‘large’ because they are neural
networks made up of billions or trillions of parameters. The networks are Transformers [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]
trained on huge swathes of text from the World Wide Web, using language modelling objectives
such as predicting omitted (or, ‘masked’) words and sentence pairs [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], or predicting the next
token in a sequence [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Furthermore, in the few-shot learning paradigm, LLMs can be directed
towards new tasks without large quantities of task-specific data [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ], the collection of which
tends to be time-consuming and costly. Overall, LLMs also ofer great potential for educational
applications. One previous paper has already provided an overview of some of the possible
applications of LLMs to educational technology as a whole [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], across subjects. Our distinct
contribution is to focus on the language learning and assessment domain specifically. In this
paper, we describe some of the uses for LLMs in the context of language learning, discuss the
state of the art or work in progress, and consider practical, societal and ethical implications.
      </p>
      <p>
        We set out a number of uses for LLMs in the language learning domain, relating to content
creation and calibration, automated assessment of written texts, and personalised feedback. In
each case the general principles of the approach are well established thanks to previous work
with pre-existing LLMs such as BERT [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] – language models with millions of parameters have
existed for several years already. We look at the opportunities presented by the recent and rapid
steps taken by OpenAI in releasing new variants from the ‘generative pre-training’ (GPT) model
series, along with some newly published pre-prints relating to LLMs and the language learning
research field. We refer to some LLM-driven language learning applications already in use, and
outline the variety of LLMs available besides GPT. It is a fast evolving research field, one being
driven by industry developments. We perceive some possible risks in this research trajectory,
which include but are not limited to the absence of proper safeguards on education technology,
the lack of public understanding as to how LLMs are trained and how they can confidently
assert incorrect information, and the harm to the advancement of education technology as a
whole if it is considered ‘solved’ by investors and research councils – not to mention the ethical
issues that are already well known, such as data protection [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], examination malpractice [
        <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
        ]1,
environmental impact [
        <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
        ], and internet addiction [
        <xref ref-type="bibr" rid="ref13 ref14 ref15">13, 14, 15</xref>
        ], among others.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Large Language Models &amp; Language Learning EdTech</title>
      <p>
        At the time of writing, one of the most prominent LLMs is OpenAI’s GPT-4 [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] released in
March 2023 after six months of pre-launch work improving safety and fact-checking, also for
product development with selected partners including the education technology (EdTech) firms
Duolingo2 and Khan Academy3. This built on the prior success and notoriety of GPT-3, released
1Note that the text-matching tool Turnitin [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], which is commonly used to detect
plagiarism, has developed a module to detect the use of AI in essays: https://www.turnitin.com/blog/
the-launch-of-turnitins-ai-writing-detector-and-the-road-ahead
2https://blog.duolingo.com/duolingo-max/
3https://blog.khanacademy.org/harnessing-ai-so-that-all-students-benefit-a-nonprofit-approach-for-equal-access/
in June 2020, along with its related chatbot application, ChatGPT4. Recently, we have seen more
focus on the efects and implications of using chatbots for creating interactions with language
learners [
        <xref ref-type="bibr" rid="ref17 ref18">17, 18</xref>
        ].
      </p>
      <p>
        Of most relevance here is the partnership between OpenAI and Duolingo, the language
learning application developer, which resulted in the subscription service Duolingo Max [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ].
Duolingo Max presents two new features: ‘Role Play’ and ‘Explain My Answer’. The former
involves some limited conversation towards a goal such as ordering food, which starts with a
pre-scripted prompt but then proceeds over several open-ended chat turns between user and
chatbot. The latter is an option for additional feedback on grammatical points, involving a
limited dialogue with pre-specified responses for the user to guide the conversation (e.g. “Yes,
I’m all set”, “Can I see an example?”, “No, please elaborate”). Another limitation is that the
service is only currently available in selected countries and for a few languages.
      </p>
      <p>
        Nevertheless, this development points towards further opportunities in AI-driven education
technology for language learning, as discussed below. It should be noted that there are many
alternatives to the GPT models, including the ‘text-to-text Transformer’ (T5) [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ], PaLM (Parallel
Language Model) [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] and LaMDA (Language Model for Dialogue Applications) [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ] by Google;
LLaMA [23] and Open Pre-trained Transformers (OPT) [24] by Meta AI; and DeepMind’s Gopher
[25]. At least a few of these models are ‘multilingual’, having been trained on corpora from
multiple languages, albeit with a strong bias towards English5. In addition there are models
which have been trained on bilingual data, notably Chinese–English [26] and Russian–English6.
Alongside LLM developments by large technology companies, we also note the various
opensource eforts to train on known datasets (e.g. EleutherAI’s GPT-X [ 27] and The Pile [28]), or as
massive research collaborations (e.g. BLOOM: the BigScience Large Open-science Open-access
Multilingual Language Model [29]), or to democratise LLMs for wider use in web applications
involving natural language interfaces (e.g. langchain7, Cohere AI8, and Transformers [
        <xref ref-type="bibr" rid="ref23">30</xref>
        ]).
There are also open-source alternatives to ChatGPT, such as Open Assistant9 and StableVicuna10.
Finally we highlight eforts to transparently evaluate LLMs in comprehensive and varied ways,
for instance in the HELM project (Holistic Evaluation of Language Models) [
        <xref ref-type="bibr" rid="ref24">31</xref>
        ].
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Content Creation: Creating Assessment Items and Teaching</title>
    </sec>
    <sec id="sec-4">
      <title>Materials</title>
      <p>
        Pre-trained transformer models are being explored to generate exam texts and items for
educational purposes like in the Duolingo English Test [
        <xref ref-type="bibr" rid="ref25">32</xref>
        ], or in Google’s quantitative reasoning
application, Minerva [
        <xref ref-type="bibr" rid="ref26">33</xref>
        ]. Variations of GPT models are best known to the wider public as being
able to create common forms of language assessment tests. However, there are other successful
4https://openai.com/blog/chatgpt
5e.g. See the distribution of languages in the training data for GPT-3: https://github.com/openai/gpt-3/blob/master/
dataset_statistics/languages_by_document_count.csv
6https://github.com/yandex/YaLM-100B
7https://python.langchain.com/en/latest/index.html
8https://cohere.com/
9https://open-assistant.io/
10https://stability.ai/blog/stablevicuna-open-source-rlhf-chatbot
pre-trained LLMs such as variations of BERT [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], BART [
        <xref ref-type="bibr" rid="ref27">34</xref>
        ], or T5 [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] which are popular
among NLP scientists. Since these models are trained with diferent target task objectives,
they should be prompted diferently for various kinds of text generation. None of them has
been trained with a storytelling objective to generate fluent long texts as GPT* models have.
Nevertheless, since the target tasks are better defined, evaluation of the performance of these
models is more thorough and explainable. BERT-based models have shown impressive results in
iflling the gaps in sequences of text. BART achieves state-of-the-art results in generating parallel
sentences as in machine translation or grammatical error correction [
        <xref ref-type="bibr" rid="ref27 ref28">34, 35</xref>
        ]. T5 modelled 24
tasks as text-to-text generation and proved very successful in question answering and text
summarisation [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ].
      </p>
      <p>
        These models are widely used for narrower tasks like question generation [
        <xref ref-type="bibr" rid="ref29">36</xref>
        ], for reading
comprehension exercises [
        <xref ref-type="bibr" rid="ref30">37</xref>
        ], or prompt generation for writing and speaking. For example,
Felice et al. [
        <xref ref-type="bibr" rid="ref31">38</xref>
        ] use BERT and ELECTRA [
        <xref ref-type="bibr" rid="ref32">39</xref>
        ] to predict the position of the gaps for designing
high-quality cloze tests for language learners, while various pre-trained language models are
used for generating distractors [
        <xref ref-type="bibr" rid="ref33 ref34 ref35">40, 41, 42</xref>
        ]. In addition LLMs have been put to use for the
purpose of text simplification, which is relevant for language learners in the context of reading
comprehension exercises and adapting texts automatically to an appropriate level. Notably, a
GPT-3 based solution by the UniHD team was the winning entry for the English track of the
TSAR-2022 Shared Task on Multilingual Lexical Simplification [
        <xref ref-type="bibr" rid="ref36 ref37">43, 44</xref>
        ].
      </p>
      <p>
        Datasets and Evaluation With the emergence of LLMs, large-scale datasets are required for
evaluation. Text generation methods are evaluated using text-similarity based metrics like BLEU
[
        <xref ref-type="bibr" rid="ref38">45</xref>
        ], ROUGE [
        <xref ref-type="bibr" rid="ref39">46</xref>
        ], METEOR [
        <xref ref-type="bibr" rid="ref40">47</xref>
        ], and more recently BERTScore [
        <xref ref-type="bibr" rid="ref41">48</xref>
        ], or learned evaluation
metrics [
        <xref ref-type="bibr" rid="ref42 ref43">49, 50</xref>
        ] which assess the correlation between generated texts (e.g. the question) and
the ones originally written by human experts. Automatic evaluations require top-quality and
expert-designed datasets. Available datasets for language learning exams for NLP research
include RACE [
        <xref ref-type="bibr" rid="ref44">51</xref>
        ], SCDE [
        <xref ref-type="bibr" rid="ref45">52</xref>
        ] and CLOTH [
        <xref ref-type="bibr" rid="ref46">53</xref>
        ]. However, there are smaller-scale datasets such
as CEPOC [
        <xref ref-type="bibr" rid="ref47">54</xref>
        ] for Cloze test creation, and the Teacher-Student Chatroom Corpus [
        <xref ref-type="bibr" rid="ref48">55</xref>
        ], which
can be used as test sets to evaluate zero-shot or few-shot learning models. Evaluation approaches
for open-ended text generation are still far from being ideal. Human-centric evaluations involve
ranking the generated texts based on diferent factors, such as fluency and coherence of the
generated texts, or its relevance to the context document and the answer (where available) [
        <xref ref-type="bibr" rid="ref49">56</xref>
        ].
In this new era of increasingly large language models, human evaluation is more dificult and
time-consuming, leading researchers to design comparison datasets that contain human-labelled
comparisons between outputs of diferent systems [
        <xref ref-type="bibr" rid="ref50">57</xref>
        ].
      </p>
      <p>Human-in-the-loop content generation As an exploratory study, we have worked with
publicly available GPT-3 models to generate open-ended texts and evaluate their suitability as a
basis for low-stakes, self-study language learning exercises. Having a human-in-the-loop policy
in mind, the prompts are engineered by a human expert, with post-generation text refinement
and question authoring also carried out by experts. Such an approach can be seen as helping
mitigate against various known risks associated with the output of LLMs (e.g., hallucinations,
ofensive content, stereotyping, etc).</p>
      <p>All definable model parameters (Temperature, Frequency Penalty, Presence Penalty and Max
Length) are kept to fixed levels throughout to limit the number of variables across the dataset.
Input prompts containing target genre and key content points are designed by the human expert
in order to provide a basis for possible testing foci at the target level. The key content points
also help generate similar enough output texts from a single (or slightly modified) input prompt,
to allow for collation of the best elements from multiple output versions.</p>
      <p>For this research, the generated texts are intended to support single B2 CEFR level11
multiple choice reading comprehension questions with 3 answer options. The generated texts are
reviewed by the human expert and given an ‘accept’ or ‘reject’ status based on their
appropriateness for the target proficiency level and relevance to the content points. Accepted texts are
added to a content pool, also containing fully human-authored texts. Another group of human
experts (question writers) approach the accepted texts as they would any other content. For
openness and transparency, question writers are informed in advance that the pool contains
AI-generated content, but not which texts are AI-generated, and which have been written by
human authors. Question writers select and edit the texts, writing one 3-option multiple choice
question per text. The annotations of this dataset, including the accept/reject status and the
measures of quality of the generated texts assessed by question writers (based on the amounts
of edits made on the texts) can be used to train models which can automatically assess the
generated texts in future. The dataset can also be used to train reward functions for further
ifne-tuning of the generative models.</p>
      <p>
        ChatGPT has been trained using a combination of supervised fine-tuning and reinforcement
learning from human feedback (RLHF) [
        <xref ref-type="bibr" rid="ref51 ref52">58, 59</xref>
        ]. It uses InstructGPT [
        <xref ref-type="bibr" rid="ref50">57</xref>
        ] and includes the
steps: pre-training, fine-tuning, and reward learning. The reward function used to fine-tune
InstructGPT is trained using a dataset of pairs of generated texts with a human-labelled
judgement on which text is better, with the objective to maximise the score diference between the
‘winning’ and ‘losing’ texts. The purpose of collecting coarse human labelling is to mitigate any
mismatch between the true objective and the preferences of human annotators, thus increasing
inter-annotator agreement [
        <xref ref-type="bibr" rid="ref52">59</xref>
        ]. Nevertheless, relying solely on general annotations, as in the
case of InstructGPT, results in a reward function that fails to shed light on the quality of texts
across various aspects, making it too broad to apply in narrower tasks and fields. To address
this limitation, we can take advantage of the existing high-quality annotations available to us
from skilled and experienced professional human annotators. By exploiting their expertise,
we can train a more nuanced reward function that ofers fine-grained evaluation and provides
interpretable scores, aligning more efectively with our specific research goals. Finally, we can
evaluate diferent methods of content generation on our reading practice platform,
Read&amp;Improve12 [
        <xref ref-type="bibr" rid="ref53">60</xref>
        ]. By collecting both implicit user feedback – which texts they engage with more by
spending longer reading them, clicking on definitions, completing the tasks, etc – and explicit
user feedback (e.g. by asking them to rate texts and express opinions) we can assess which
LLM-driven systems are most successful.
11The Common European Framework of Reference for Languages (CEFR) organises language proficiency in six
levels, A1 to C2, which represent Basic User, Independent User and Proficient User.
12https://readandimprove.englishlanguageitutoring.com/
      </p>
    </sec>
    <sec id="sec-5">
      <title>4. Calibrating Assessment Items and Teaching Materials</title>
      <p>
        In addition to content creation, LLMs can potentially be leveraged for the evaluation and
calibration of existing learning content: test items and teaching content. An example of this is
question dificulty estimation (QDE) from text, which has received increasing research interest
in recent years [
        <xref ref-type="bibr" rid="ref54 ref55">61, 62</xref>
        ]. QDE from text ofers a way to overcome the limitations of traditional
approaches such as manual calibration and statistical analysis from pre-testing. These traditional
approaches are either subjective or introduce a long delay between item creation and deployment
due to the complexities of pre-testing on sizeable and representative populations.
      </p>
      <p>
        QDE from text is a regression task, where the model is asked to provide, given the text of the
question, a numerical estimation of its dificulty on a given scale. It can be either a supervised
or unsupervised task, depending on whether a dataset of already calibrated exam questions is
available, and LLMs have been used in both scenarios. Regarding supervised estimation, LLMs
that leverage transfer learning – specifically, BERT [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and DistilBERT [
        <xref ref-type="bibr" rid="ref56">63</xref>
        ] – are the current
state of the art [
        <xref ref-type="bibr" rid="ref57 ref58">64, 65</xref>
        ] and have been shown to outperform other approaches using traditional
NLP-derived features [
        <xref ref-type="bibr" rid="ref59">66</xref>
        ]. There has been less work on unsupervised estimation but, even in
this scenario, LLMs have been shown to be helpful for estimating question dificulty from text
[
        <xref ref-type="bibr" rid="ref60">67</xref>
        ].
      </p>
      <p>All the models proposed in previous research require some kind of transfer learning starting
from the publicly available pre-trained models, which might be expensive and not feasible in all
scenarios. Bigger LLMs, such as the aforementioned GPT models, could be used for zero-shot or
few-shot dificulty estimation from text, which is yet to be explored. As an example, ChatGPT
can be asked to rank given questions by dificulty, and it can also provide an indication of the
specific dificulty level (e.g. Easy, Medium, Hard). Crucially, the dificulty of a pool of questions
depends on the specific student population that is assessed with them, and it is dificult to
provide the LLM with all the information required to describe the specific pool of learners
that will be assessed with the items. The model seems to be – at least partially – capable of
distinguishing between diferent CEFR levels, since the same question can be assigned diferent
levels depending on whether the model is asked to consider learners of level A1 or C1. However,
extensive experiments should be carried out to better evaluate this, as the model sometimes
performs counterintuitive estimations: in our preliminary experiments, for instance, ChatGPT
sometimes estimated a question to be more dificult for C1-level learners (i.e., “Proficient”) than
A1-level learners (i.e., “Basic”).</p>
    </sec>
    <sec id="sec-6">
      <title>5. Automated Assessment of Language Learners</title>
      <p>
        Automated assessment has long been a prominent task in educational applications research: for
instance assessing learner English speech [
        <xref ref-type="bibr" rid="ref61 ref62 ref63 ref64">68, 69, 70, 71</xref>
        ] and writing [
        <xref ref-type="bibr" rid="ref65 ref66 ref67 ref68 ref69">72, 73, 74, 75, 76</xref>
        ]. Here we
focus on writing and the task of ‘automated essay scoring’ (AES). Whereas previous systems have
involved feature engineering – typically centred around informative sequences of characters,
words, part-of-speech tags, as well as phrase structures from a parser and automatically detected
errors [
        <xref ref-type="bibr" rid="ref66 ref70">73, 77</xref>
        ] – more recent research systems have involved neural models for assessment
[
        <xref ref-type="bibr" rid="ref67 ref68 ref69">74, 75, 76</xref>
        ]. These models tend to be carefully crafted and evaluated, since language assessment
can be a task with major consequences for the learner, including education and career prospects.
Therefore any involvement of LLMs in assessment systems must be approached cautiously
and its impact measured on existing benchmarks. Deployment of LLM-based assessment
models should be restricted to human-in-the-loop low-stakes contexts first, including practice
applications [
        <xref ref-type="bibr" rid="ref53 ref70">77, 60</xref>
        ] or placement tests such as Linguaskill13.
      </p>
      <p>
        The idea of using ChatGPT for assessing students’ answers was put forward by Jeon &amp;
Lee [
        <xref ref-type="bibr" rid="ref71">78</xref>
        ]. Further practical steps were taken by Mizumoto &amp; Eguchi [
        <xref ref-type="bibr" rid="ref72">79</xref>
        ] who experimented
with GPT-3.5 for AES on 12,000 essays from the ETS Corpus of Non-Native Written English
(TOEFL11) [
        <xref ref-type="bibr" rid="ref73">80</xref>
        ], compared the scores to benchmark levels on a 0-9 scale, and concluded that
a GPT-only model only achieves weak agreement with the reference scores (.388 quadratic
weighted kappa). The authors furthermore compare the GPT scorer with several models
involving various combinations of 45 linguistic features – related to lexical diversity, lexical
sophistication, syntactic complexity and dependency, and cohesion – and observe that although
the GPT baseline is outperformed by the linguistic features on their own, the best results are
obtained by combining the two approaches (.605 QWK). This is a finding similar to previous
research, as the previous state-of-the-art performance was obtained by combining BERT-style
neural models and feature-based models [
        <xref ref-type="bibr" rid="ref69 ref74">76, 81</xref>
        ].
      </p>
      <p>
        One potential use for LLMs regarding assessment that, to the best of our knowledge, has
not been thoroughly explored is for explaining assessment predictions. Explainable AI is an
emerging research topic, a regulatory prospect [
        <xref ref-type="bibr" rid="ref75">82</xref>
        ], and a challenge for NLP models dependent
on ‘black box’ neural networks. One possibility is to adopt the ‘chain-of-thought’ prompting
style [
        <xref ref-type="bibr" rid="ref76">83</xref>
        ] – as opposed to zero-shot or few-shot prompting [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] – to elicit explanations about
assessment decisions from LLMs. Exactly how to engineer a series of prompts for the LLM in
the chain-of-thought style is a matter for investigation, but for instance they could be similar to
the following (albeit longer to elicit better explanations):
      </p>
      <p>A class of students has been given the essay prompt: &lt;essay_prompt&gt;.
This student essay -- &lt;example_text&gt;
-- was given a score of &lt;example_score&gt;.</p>
      <p>Explanation: the use of language and grammatical resource are advanced
but there is a spelling error in the first sentence and a grammatical
error in the final sentence.</p>
      <p>This student essay -- &lt;target_text&gt;
-- has been given a score of &lt;predicted_score&gt;.</p>
      <p>Please give an explanation why the text was given this score.</p>
      <p>The aim of such an approach would be to obtain explanations specific to the essay, pinpointing
relevant sections from the text if possible, and grounded in marking criteria for the learner’s
target level so that the explanation is relevant and useful. In common with other tasks described
in this paper, further research with LLMs and proper evaluation on existing benchmarks and
by human experts is needed before we can definitively conclude that this is a research avenue
worth exploring.
13https://www.cambridgeenglish.org/exams-and-tests/linguaskill/</p>
      <p>Finally we note that there are concerns around LLMs being used in fraudulent ways by
learners, but that plagiarism concerns are long-standing in computer-based exam settings. If
proctoring software is set up to prevent text import from elsewhere (e.g. disabling
copy-andpaste keyboard shortcuts) or to detect bursty text insertion through keystroke logging, then
this is one defence against exam malpractice from LLM text generation or any other online
source. In this way, LLMs are an extension of a threat we are already familiar with. Furthermore,
automatic detection of LLM-generated text is the subject of the AuTexTification (Automated Text
Identification), part of IberLEF 2023 (the 5th Workshop on Iberian Languages Evaluation Forum)
co-located with the SEPLN Conference this year14. It appears that the level of performance
from submitted systems has been high, outdoing a logistic regression baseline in many cases,
with system descriptions to be presented in September. It may be that such systems can be
employed as an additional line of defence against exam malpractice involving LLM-generated
text.</p>
    </sec>
    <sec id="sec-7">
      <title>6. Providing Feedback to Language Learners</title>
      <p>
        As a precursor to providing automatic lexico-syntactic feedback to language learners, one
requirement is to first carry out the NLP task of grammatical error detection (GED) or grammatical
error correction (GEC). These tasks have a rich pedigree involving various benchmark corpora
[
        <xref ref-type="bibr" rid="ref77 ref78 ref79 ref80">84, 85, 86, 87</xref>
        ], research papers [
        <xref ref-type="bibr" rid="ref81 ref82 ref83 ref84 ref85">88, 89, 90, 91, 92</xref>
        ] and shared tasks [
        <xref ref-type="bibr" rid="ref86 ref87 ref88">93, 94, 95</xref>
        ] – all of which
enable us to establish that the current state-of-the-art approach to GED and GEC tends to
involve supervised fine-tuning of neural network language models using carefully annotated
training data [
        <xref ref-type="bibr" rid="ref89">96</xref>
        ]. The recent emergence of LLMs, however, ofers the prospect of developing
GED or GEC models which are largely unsupervised other than some examples for few-shot
learning15.
      </p>
      <p>
        The challenge ahead, in common with the application of LLMs to other tasks described in
this paper, is to properly benchmark LLM-based models for GED and GEC on existing corpora,
so that their performance can be compared to previous models. Some preliminary work has
been done towards this aim, as described in a recent survey of GEC [
        <xref ref-type="bibr" rid="ref89">96</xref>
        ]. For instance, Wu
et al. [
        <xref ref-type="bibr" rid="ref90">97</xref>
        ] and Coyne &amp; Sakaguchi [
        <xref ref-type="bibr" rid="ref91">98</xref>
        ] present preliminary results applying LLMs to GEC.
The former compares ChatGPT to Grammarly and GECToR [
        <xref ref-type="bibr" rid="ref92">99</xref>
        ], a previous state-of-the-art
GEC system, and the latter compares GPT-3.516 to two other GEC systems [
        <xref ref-type="bibr" rid="ref93 ref94">100, 101</xref>
        ]. Both
approaches find the GPT* models perform worse than existing systems when measured using
automatic evaluation techniques on existing benchmark corpora (namely CoNLL-2014 [
        <xref ref-type="bibr" rid="ref87">94</xref>
        ],
JFLEG [
        <xref ref-type="bibr" rid="ref95">102</xref>
        ], BEA-2019 [
        <xref ref-type="bibr" rid="ref88">95</xref>
        ]). The authors ascribe this to the model’s tendency to over-correct
learner text; by inserting additional text or re-structuring phrases, the corrected text moves
further from the original text and is penalised by the automatic scorers. However, both works
carry out human evaluation to rate the output from each system and find a preference for the
GPT* output because the corrected sentences tend to be more fluent. At the same time, they
14https://sites.google.com/view/autextification
15Note that LLM training is often described as ‘self-supervised’ due to the human-authored training data, but for the
purpose of GED/GEC, we say ‘unsupervised’ because in this context no task-specific training data is required.
16Specifically, they use text-davinci-003.
found instances of under -correction in the human-generated reference sentence: in other words
GPT* models catching and correcting errors which were not corrected by the expert annotators.
      </p>
      <p>
        While both approaches are preliminary and human evaluation tentative – based on only
small samples of 100 sentences at a time from each test set – overly fluent corrections present a
challenge for automatic evaluation methods as they are much more open-ended than minimal
edits targeting grammatical errors rather than stylistic choices. Furthermore, while fluent
corrections may at times be preferred by human evaluators, they may not aid language learners
if they drift too far from the original text. Existing annotation guides for error correction state
that edits should be as minimal as possible so that the learner can be helped to express what
they are trying to say, rather than told how to express it diferently: that is, how to amend
an error rather than avoid it [
        <xref ref-type="bibr" rid="ref96">103</xref>
        ]. The issue is not a new one [
        <xref ref-type="bibr" rid="ref97">104</xref>
        ] but remains a matter for
further investigation under the new conditions presented by more capable LLMs.
      </p>
      <p>
        Another potential use of LLMs in this area is providing automatically-generated feedback
comments to learners to explain linguistic concepts, grammatical points or semantic nuance.
Indeed there was a recent shared task on feedback comment generation [
        <xref ref-type="bibr" rid="ref98">105</xref>
        ] where, when
presented with an erroneous sentence such as, “He agrees the opinion”, the task was to produce a
comment such as: The verb agree is an intransitive verb and cannot take direct
objects: add the appropriate preposition17. Participants in the shared task were able
to outperform the baseline system (‘an encoder-decoder with a copy mechanism based on a
pointer generator network’18) through careful feature extraction from parsers and GEC models,
combined with prominent LLMs at the time such as T5 or GPT-Neo [
        <xref ref-type="bibr" rid="ref99">106</xref>
        ] (e.g. Babakov et al. [
        <xref ref-type="bibr" rid="ref100">107</xref>
        ]
achieved second place in the shared task; developers of the first-placed entry have not published
a system description to the best of our knowledge). It remains to be seen whether current LLMs
can be tuned towards even better performance on this task: it may be that the pre-processing of
texts to obtain additional linguistic information and the incorporation of pre-defined templates
will continue to be vital for accurate and sensible feedback comment generation, even with
ever-larger LLMs involved [
        <xref ref-type="bibr" rid="ref101">108</xref>
        ]. These are methods we can trial through A/B testing of diferent
feedback models on our essay-writing practice platform, Write&amp;Improve19 [
        <xref ref-type="bibr" rid="ref66 ref70">73, 77</xref>
        ].
      </p>
      <p>
        Other applications of LLMs for language learning feedback include chatbot interaction to
explain linguistic concepts – akin to the ‘Explain My Answer’ feature in Duolingo Max, but also
going beyond this with dialogue which is adaptive to the learner level [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] – word suggestion,
paraphrasing and translation to aid learners with essay writing, and document-level feedback
on, for instance, inter-sentence coherence markers, co-reference and anaphoric reference,
maintaining tense and aspect consistently, argumentation structure, task completion and more.
Key desiderata are that the feedback should be accurate, based on evidence, personalised,
inofensive and preferably linked to teaching materials so that the learner may continue to
benefit from EdTech applications for language.
17https://fcg.sharedtask.org/
18https://github.com/k-hanawa/fcg_genchal2022_baseline
19https://writeandimprove.com/
      </p>
    </sec>
    <sec id="sec-8">
      <title>7. Risks &amp; Ethical Considerations</title>
      <p>
        We advocate for a cautious approach to the incorporation of LLMs in EdTech for language
learning, in which the training process, performance and limitations, and pathway to delivery
are well documented and the risks of misapplication of such technology are understood. There
are general concerns about AI for NLP and education which are recorded in the literature and
continue to be relevant, perhaps more so, as LLMs come to the fore. Firstly there is a bias
towards English, and specific genres of English, due to a combination of commercial pressures,
training data availability, and data sourcing from the World Wide Web: even though several
models have been trained in multilingual ways, the general trend with LLMs has exacerbated
this pre-existing bias [
        <xref ref-type="bibr" rid="ref102 ref103 ref104">109, 110, 111</xref>
        ]. As LLMs grow, so does their climate impact: an issue
which interacts with societal and infrastructure complexities but which we should nevertheless
bear in mind and attempt to mitigate [
        <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
        ]. In addition, LLMs are known to exhibit certain
biases [
        <xref ref-type="bibr" rid="ref105">112</xref>
        ] – both representational (language use around demographic groups) [
        <xref ref-type="bibr" rid="ref106 ref107">113, 114</xref>
        ] and
allocational (how a system distributes resources or opportunities) [
        <xref ref-type="bibr" rid="ref106 ref108">115, 113</xref>
        ] – which need to be
debiased or otherwise controlled [116, 117].
      </p>
      <p>
        Suresh &amp; Guttag identified various sources of harm in the ‘machine learning life cycle’
[
        <xref ref-type="bibr" rid="ref108">115</xref>
        ]: historical bias, representation bias, measurement bias, learning bias, aggregation bias,
evaluation bias, deployment bias. They note that efects cascade downstream and cycle around
ML systems. They provide some mitigation strategies and reference previous work in this area
[118, 119]. Kasneci et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] also point to copyright issues with output from LLMs which are
largely unresolved, as well as concerns about pedagogical and learning efects: namely that
both teachers and students, “may rely too heavily on the model”, and that it may be dificult
to, “distinguish model-generated from student-generated answers” [120, 121, 122]. In addition
they raise data privacy and security issues which require firmer regulation and auditing of
EdTech firms, the problem of false information issued by LLMs, and of designing appropriate
application interfaces which are both engaging and beneficial to end-users. It is worth noting
that NLP researchers have made some attempts at using LLMs to assess the trustworthiness of
generated texts, which could go some way towards mitigating the false information problem
[123, 124, 125].
      </p>
      <p>Regarding AIED and language learning, LLMs present specific risks relating to generated
outputs which may be inaccurate, confusing, ofensive, and so on – risks which are present in
human teachers too, but made no less harmful as a result. For this reason the most successful
systems may be human-machine hybrids, with humans in-the-loop or similar, where LLMs are
viewed as assistive technology for human experts rather than replacements for them –
performing the more mundane and mechanical tasks while experts provide the inputs characteristic
of human interaction [126]. Another way that humans can monitor LLM outputs is through
evaluation, and feedback mechanisms for systems in production, so that problematic outputs
may be flagged.</p>
      <p>We can also look at standards for ‘responsible AI’ published by technology firms and research
institutes [127, 128, 129]20. For example, Duolingo [130] sets out its approach to responsible
AI under Validity &amp; Reliability, Fairness, Privacy &amp; Security, Accountability &amp; Transparency
20https://huggingface.co/blog/ethical-charter-multimodal
– all of which have been touched on in this paper. Regarding the last attribute in particular –
Transparency – it is apparent from recent media stories that more can be done in this area in
terms of educating the general public about how LLMs are trained, how trustworthy they may
or may not be, and how best to interact with them. This is a general problem but one which
nonetheless presents a challenge for EdTech applications.</p>
    </sec>
    <sec id="sec-9">
      <title>8. Conclusion</title>
      <p>In this paper, we have explored the opportunities for language-learning EdTech ofered by
‘generative AI’ through LLMs. We conclude that preliminary indications are promising, but that
the best systems may still require human intervention and/or the inclusion of well-established
linguistic features. It may well be that LLMs can enhance language-learning EdTech, if we can
establish the following through further empirical work:
1. that models enhanced by LLMs perform better than existing models on established
benchmarks, or on alternative evaluation metrics which need to be defined in order to
properly probe LLM capabilities for language teaching and assessment [131] – moreover
that performance is suficiently better to justify the additional costs in computing and
environmental terms;
2. that LLM-enhanced technology is of benefit to language learners, whether that is measured
through engagement, enjoyment, learning outcomes or some combination of the three;
3. that LLM-enhanced technology does not disadvantage relevant groups (learners, teachers,
writers and editors of materials, examiners) whether through bias, misinformation, or
adversely afecting student progress – instead, the technology should be assistive to all
groups in some regard.</p>
      <p>
        Finally, we note that LLMs should not be over-hyped as an AI revolution, but rather as an
evolutionary step in neural network models – the inevitable result of the inexorable growth
in network size since the Transformer was first applied to language tasks in 2017 [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. LLMs
represent a milestone on an evolutionary path which has been unfolding for many years and
thus is well documented in open access publications and open source code repositories. If we
maintain this tradition – by close inspection of proprietary models, or opting to use models
trained in open ways – it will be of benefit both to future researchers and scientific development,
but also users of AI applications who require some transparency regarding the technology.
Harmful bias and other risks remain an ongoing challenge for developers of AI systems, and
LLMs deployed in language learning EdTech may only exacerbate these. Therefore, proper
mitigations should be put in place to address the issues which have been identified in this paper
and elsewhere.
      </p>
      <p>
        Nevertheless, LLMs present a great opportunity to continue improving EdTech for language
learning, including novel ways to generate content, provide feedback, and deal with other
linguistic features which hitherto have not been commonly attempted: for instance, chatting
in open-ended ways at the level of the learner [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], providing document-level assessment and
feedback [132], handling code-switching or ‘plurilingual’ learning [133].
      </p>
    </sec>
    <sec id="sec-10">
      <title>Acknowledgments</title>
      <p>This work was supported by Cambridge University Press &amp; Assessment. We thank Dr Nick
Saville and Professor Michael McCarthy for their support. We are grateful to the anonymous
reviewers for their helpful comments.
M. Diaz, B. Hutchinson, K. Olson, A. Molina, E. Hofman-John, J. Lee, L. Aroyo, R.
Rajakumar, A. Butryna, M. Lamm, V. Kuzmina, J. Fenton, A. Cohen, R. Bernstein, R. Kurzweil,
B. Aguera-Arcas, C. Cui, M. Croak, E. Chi, Q. Le, LaMDA: Language models for dialog
applications arXiv:2201.08239 (2022). URL: https://arxiv.org/abs/2201.08239.
[23] H. Touvron, T. Lavril, G. Izacard, X. Martinet, M.-A. Lachaux, T. Lacroix, B. Rozière,
N. Goyal, E. Hambro, F. Azhar, A. Rodriguez, A. Joulin, E. Grave, G. Lample, LLaMA:
Open and eficient foundation language models arXiv:2302.13971 (2023). URL: https:
//arxiv.org/abs/2302.13971.
[24] S. Zhang, S. Roller, N. Goyal, M. Artetxe, M. Chen, S. Chen, C. Dewan, M. Diab, X. Li, X. V.</p>
      <p>Lin, T. Mihaylov, M. Ott, S. Shleifer, K. Shuster, D. Simig, P. S. Koura, A. Sridhar, T. Wang,
L. Zettlemoyer, OPT: Open Pre-trained Transformer language models arXiv:2205.01068
(2022). URL: https://arxiv.org/abs/2205.01068.
[25] J. W. Rae, S. Borgeaud, T. Cai, K. Millican, J. Hofmann, F. Song, J. Aslanides, S. Henderson,
R. Ring, S. Young, E. Rutherford, T. Hennigan, J. Menick, A. Cassirer, R. Powell, G. van den
Driessche, L. A. Hendricks, M. Rauh, P.-S. Huang, A. Glaese, J. Welbl, S. Dathathri,
S. Huang, J. Uesato, J. Mellor, I. Higgins, A. Creswell, N. McAleese, A. Wu, E. Elsen,
S. Jayakumar, E. Buchatskaya, D. Budden, E. Sutherland, K. Simonyan, M. Paganini, L. Sifre,
L. Martens, X. L. Li, A. Kuncoro, A. Nematzadeh, E. Gribovskaya, D. Donato, A. Lazaridou,
A. Mensch, J.-B. Lespiau, M. Tsimpoukelli, N. Grigorev, D. Fritz, T. Sottiaux, M. Pajarskas,
T. Pohlen, Z. Gong, D. Toyama, C. de Masson d’Autume, Y. Li, T. Terzi, V. Mikulik,
I. Babuschkin, A. Clark, D. de Las Casas, A. Guy, C. Jones, J. Bradbury, M. Johnson,
B. Hechtman, L. Weidinger, I. Gabriel, W. Isaac, E. Lockhart, S. Osindero, L. Rimell,
C. Dyer, O. Vinyals, K. Ayoub, J. Stanway, L. Bennett, D. Hassabis, K. Kavukcuoglu,
G. Irving, Scaling language models: Methods, analysis &amp; insights from training Gopher
arXiv:2112.11446 (2022). URL: https://arxiv.org/abs/2112.11446.
[26] A. Zeng, X. Liu, Z. Du, Z. Wang, H. Lai, M. Ding, Z. Yang, Y. Xu, W. Zheng, X. Xia,
W. L. Tam, Z. Ma, Y. Xue, J. Zhai, W. Chen, P. Zhang, Y. Dong, J. Tang, GLM-130B: An
open bilingual pre-trained model arXiv:2210.02414 (2022). URL: https://arxiv.org/abs/
2210.02414.
[27] S. Black, S. Biderman, E. Hallahan, Q. Anthony, L. Gao, L. Golding, H. He, C. Leahy,
K. McDonell, J. Phang, M. Pieler, U. S. Prashanth, S. Purohit, L. Reynolds, J. Tow,
B. Wang, S. Weinbach, GPT-NeoX-20B: An open-source autoregressive language
model, in: Proceedings of BigScience Episode #5 – Workshop on Challenges &amp;
Perspectives in Creating Large Language Models, Association for Computational
Linguistics, virtual+Dublin, 2022, pp. 95–136. URL: https://aclanthology.org/2022.bigscience-1.9.
doi:10.18653/v1/2022.bigscience- 1.9.
[28] L. Gao, S. Biderman, S. Black, L. Golding, T. Hoppe, C. Foster, J. Phang, H. He, A. Thite,
N. Nabeshima, S. Presser, C. Leahy, The Pile: An 800GB dataset of diverse text for
language modeling arXiv:2101.00027 (2020). URL: https://arxiv.org/abs/2101.00027.
[29] BigScience Workshop, :, T. L. Scao, A. Fan, C. Akiki, E. Pavlick, S. Ilić, D. Hesslow,
R. Castagné, A. S. Luccioni, F. Yvon, M. Gallé, J. Tow, A. M. Rush, S. Biderman, A. Webson,
P. S. Ammanamanchi, T. Wang, B. Sagot, N. Muennighof, A. V. del Moral, O. Ruwase,
R. Bawden, S. Bekman, A. McMillan-Major, I. Beltagy, H. Nguyen, L. Saulnier, S. Tan, P. O.
Suarez, V. Sanh, H. Laurençon, Y. Jernite, J. Launay, M. Mitchell, C. Rafel, A. Gokaslan,
Optimization (EAAMO), 2021. URL: https://doi.org/10.1145/3465416.3483305.
[116] M. Kaneko, D. Bollegala, Debiasing pre-trained contextualised embeddings, in:
Proceedings of the 16th Conference of the European Chapter of the Association for
Computational Linguistics: Main Volume, 2021. URL: https://aclanthology.org/2021.eacl-main.107.
doi:10.18653/v1/2021.eacl- main.107.
[117] J. Lalor, Y. Yang, K. Smith, N. Forsgren, A. Abbasi, Benchmarking intersectional biases
in NLP, in: Proceedings of the 2022 Conference of the North American Chapter of
the Association for Computational Linguistics: Human Language Technologies, Seattle,
United States, 2022. URL: https://aclanthology.org/2022.naacl-main.263. doi:10.18653/
v1/2022.naacl- main.263.
[118] S. A. Friedler, C. Scheidegger, S. Venkatasubramanian, S. Choudhary, E. P. Hamilton,
D. Roth, A comparative study of fairness-enhancing interventions in machine learning,
in: Proceedings of the Conference on Fairness, Accountability, and Transparency, FAT*
’19, 2019. URL: https://doi.org/10.1145/3287560.3287589. doi:10.1145/3287560.3287589.
[119] J. Finocchiaro, R. Maio, F. Monachou, G. K. Patro, M. Raghavan, A.-A. Stoica, S. Tsirtsis,
Bridging machine learning and mechanism design towards algorithmic fairness, in:
Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency,
FAccT ’21, 2021. URL: https://doi.org/10.1145/3442188.3445912. doi:10.1145/3442188.
3445912.
[120] N. Dehouche, Plagiarism in the age of massive Generative Pre-trained Transformers
(GPT-3), Ethics in Science and Environmental Politics 21 (2021) 17–23.
[121] D. R. E. Cotton, P. A. Cotton, J. R. Shipway, Chatting and cheating: Ensuring academic
integrity in the era of ChatGPT, Innovations in Education and Teaching International
(2023) 1–12. URL: https://doi.org/10.1080/14703297.2023.2190148. doi:10.1080/14703297.
2023.2190148.
[122] J. Kirchenbauer, J. Geiping, Y. Wen, J. Katz, I. Miers, T. Goldstein, A watermark for large
language models arXiv:2301.10226 (2023). URL: https://arxiv.org/abs/2301.10226.
[123] P. Manakul, A. Liusie, M. J. F. Gales, SelfCheckGPT: Zero-resource black-box hallucination
detection for generative large language models, 2023. arXiv:2303.08896.
[124] N. Lee, B. Z. Li, S. Wang, W. tau Yih, H. Ma, M. Khabsa, Language models as fact checkers?,
2020. arXiv:2006.04102.
[125] B. Peng, M. Galley, P. He, H. Cheng, Y. Xie, Y. Hu, Q. Huang, L. Liden, Z. Yu, W. Chen,
J. Gao, Check your facts and try again: Improving large language models with external
knowledge and automated feedback, 2023. arXiv:2302.12813.
[126] E. Santoro, B. Monin, The AI Efect: People rate distinctively human attributes as more
essential to being human after learning about artificial intelligence advances, Journal of
Experimental Social Psychology 107 (2023) 104464. doi:https://doi.org/10.1016/j.
jesp.2023.104464.
[127] V. Prabhakaran, M. Mitchell, T. Gebru, I. Gabriel, A human rights-based approach to
responsible AI arXiv:2210.02667 (2022). URL: https://arxiv.org/abs/2210.02667, presented as
a (non-archival) poster at the 2022 ACM Conference on Equity and Access in Algorithms,
Mechanisms, and Optimization or (EAAMO ’22).
[128] D. Thakkar, A. Ismail, P. Kumar, A. Hanna, N. Sambasivan, N. Kumar, When is machine
learning data good?: Valuing in public health datafication, in: Proceedings of the</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Vaswani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shazeer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Parmar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Uszkoreit</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. N.</given-names>
            <surname>Gomez</surname>
          </string-name>
          , L. u. Kaiser,
          <string-name>
            <surname>I. Polosukhin</surname>
          </string-name>
          ,
          <article-title>Attention is all you need</article-title>
          ,
          <source>in: Advances in Neural Information Processing Systems</source>
          ,
          <year>2017</year>
          . URL: https://proceedings.neurips.cc/paper_files/paper/2017/file/ 3f5ee243547dee91fbd053c1c4a845aa-Paper.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <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>
          ,
          <source>in: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          , Volume
          <volume>1</volume>
          (Long and Short Papers),
          <source>Association for Computational Linguistics</source>
          , Minneapolis, Minnesota,
          <year>2019</year>
          , pp.
          <fpage>4171</fpage>
          -
          <lpage>4186</lpage>
          . URL: https://aclanthology.org/ N19-1423. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>N19</fpage>
          - 1423.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Narasimhan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Salimans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Sutskever</surname>
          </string-name>
          , et al.,
          <article-title>Improving language understanding by generative pre-training (</article-title>
          <year>2018</year>
          ). URL: https://cdn.openai.com/research-covers/ language-unsupervised/language_understanding_paper.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Child</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Luan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Amodei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Sutskever</surname>
          </string-name>
          , et al.,
          <article-title>Language models are unsupervised multitask learners</article-title>
          ,
          <source>OpenAI blog 1</source>
          (
          <year>2019</year>
          )
          <article-title>9</article-title>
          . URL: https://cdn.openai.
          <article-title>com/ better-language-models/language_models_are_unsupervised_multitask_learners</article-title>
          .pdf.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>T.</given-names>
            <surname>Brown</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Mann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ryder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Subbiah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. D.</given-names>
            <surname>Kaplan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Dhariwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Neelakantan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Shyam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Sastry</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Askell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Herbert-Voss</surname>
          </string-name>
          , G. Krueger,
          <string-name>
            <given-names>T.</given-names>
            <surname>Henighan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Child</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ramesh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ziegler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Winter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Hesse</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chen</surname>
          </string-name>
          , E. Sigler,
          <string-name>
            <given-names>M.</given-names>
            <surname>Litwin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gray</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Chess</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Clark</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Berner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>McCandlish</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Sutskever</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Amodei</surname>
          </string-name>
          ,
          <article-title>Language models are few-shot learners</article-title>
          , in: H.
          <string-name>
            <surname>Larochelle</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Ranzato</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Hadsell</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Balcan</surname>
          </string-name>
          , H. Lin (Eds.),
          <source>Advances in Neural Information Processing Systems</source>
          , volume
          <volume>33</volume>
          ,
          <string-name>
            <surname>Curran</surname>
            <given-names>Associates</given-names>
          </string-name>
          , Inc.,
          <year>2020</year>
          , pp.
          <fpage>1877</fpage>
          -
          <lpage>1901</lpage>
          . URL: https://proceedings.neurips.cc/paper_ files/paper/2020/file/1457c0d6bfcb4967418bfb8ac142f64a-Paper.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>E.</given-names>
            <surname>Kasneci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Seßler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Küchemann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bannert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dementieva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Fischer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>U.</given-names>
            <surname>Gasser</surname>
          </string-name>
          , G. Groh,
          <string-name>
            <given-names>S.</given-names>
            <surname>Günnemann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Hüllermeier</surname>
          </string-name>
          , et al.,
          <article-title>ChatGPT for good? On opportunities and challenges of large language models for education</article-title>
          ,
          <source>Learning and Individual Diferences</source>
          <volume>103</volume>
          (
          <year>2023</year>
          )
          <article-title>102274</article-title>
          . URL: https://doi.org/10.1016/j.lindif.
          <year>2023</year>
          .
          <volume>102274</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>N.</given-names>
            <surname>Carlini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Tramer</surname>
          </string-name>
          , E. Wallace,
          <string-name>
            <given-names>M.</given-names>
            <surname>Jagielski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Herbert-Voss</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Roberts</surname>
          </string-name>
          , T. B.
          <string-name>
            <surname>Brown</surname>
            , D. Song,
            <given-names>U.</given-names>
          </string-name>
          <string-name>
            <surname>Erlingsson</surname>
          </string-name>
          , et al.,
          <article-title>Extracting training data from large language models</article-title>
          .,
          <source>in: USENIX Security Symposium</source>
          , volume
          <volume>6</volume>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>P.</given-names>
            <surname>Fyfe</surname>
          </string-name>
          ,
          <article-title>How to cheat on your final paper: Assigning AI for student writing</article-title>
          ,
          <source>AI &amp; SOCIETY</source>
          (
          <year>2022</year>
          )
          <fpage>1</fpage>
          -
          <lpage>11</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>R. J. M.</given-names>
            <surname>Ventayen</surname>
          </string-name>
          ,
          <article-title>OpenAI ChatGPT generated results: Similarity index of artificial intelligence-based contents</article-title>
          ,
          <source>Advances in Intelligent Systems and Computing</source>
          (
          <year>2023</year>
          ). URL: https://dx.doi.org/10.2139/ssrn.4332664.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>A.</given-names>
            <surname>Mphahlele</surname>
          </string-name>
          ,
          <string-name>
            <surname>S. McKenna</surname>
          </string-name>
          ,
          <article-title>The use of Turnitin in the higher education sector: Decoding the myth</article-title>
          ,
          <source>Assessment &amp; Evaluation in Higher Education</source>
          <volume>44</volume>
          (
          <year>2019</year>
          )
          <fpage>1079</fpage>
          -
          <lpage>1089</lpage>
          . doi:
          <volume>10</volume>
          . 1080/02602938.
          <year>2019</year>
          .
          <volume>1573971</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>E.</given-names>
            <surname>Strubell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ganesh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>McCallum</surname>
          </string-name>
          ,
          <article-title>Energy and policy considerations for deep learning in NLP, in: Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics</article-title>
          , Florence, Italy,
          <year>2019</year>
          . URL: https://aclanthology.org/P19-1355. doi:
          <volume>10</volume>
          .18653/ v1/
          <fpage>P19</fpage>
          - 1355.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>J.</given-names>
            <surname>Dodge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Prewitt</surname>
          </string-name>
          , R. Tachet des Combes, E. Odmark,
          <string-name>
            <given-names>R.</given-names>
            <surname>Schwartz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Strubell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. S.</given-names>
            <surname>Luccioni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. A.</given-names>
            <surname>Smith</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>DeCario</surname>
          </string-name>
          , W. Buchanan,
          <article-title>Measuring the carbon intensity of AI in cloud instances</article-title>
          , in: 2022 ACM Conference on Fairness, Accountability, and Transparency,
          <source>FAccT '22</source>
          ,
          <year>2022</year>
          , p.
          <fpage>1877</fpage>
          -
          <lpage>1894</lpage>
          . URL: https://doi.org/10.1145/3531146.3533234. doi:
          <volume>10</volume>
          . 1145/3531146.3533234.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>C.</given-names>
            <surname>Chou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Condron</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. C.</given-names>
            <surname>Belland</surname>
          </string-name>
          ,
          <article-title>A review of the research on Internet addiction</article-title>
          ,
          <source>Educational Psychology Review</source>
          <volume>17</volume>
          (
          <year>2005</year>
          )
          <fpage>363</fpage>
          -
          <lpage>388</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>V. R.</given-names>
            <surname>Bhargava</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Velasquez</surname>
          </string-name>
          ,
          <article-title>Ethics of the attention economy: The problem of social media addiction</article-title>
          ,
          <source>Business Ethics Quarterly</source>
          <volume>31</volume>
          (
          <year>2021</year>
          )
          <fpage>321</fpage>
          -
          <lpage>359</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>F.</given-names>
            <surname>Gioia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Rega</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Boursier</surname>
          </string-name>
          ,
          <article-title>Problematic internet use and emotional dysregulation among young people: A literature review</article-title>
          .,
          <source>Clinical Neuropsychiatry: Journal of treatment Evaluation</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16] OpenAI, GPT-4
          <source>technical report arXiv:2303.08774</source>
          (
          <year>2023</year>
          ). URL: https://arxiv.org/abs/2303. 08774.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>W.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. F.</given-names>
            <surname>Hew</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. K.</given-names>
            <surname>Fryer</surname>
          </string-name>
          ,
          <article-title>Chatbots for language learning-are they really useful? a systematic review of chatbot-supported language learning</article-title>
          ,
          <source>Journal of Computer Assisted Learning</source>
          <volume>38</volume>
          (
          <year>2022</year>
          )
          <fpage>237</fpage>
          -
          <lpage>257</lpage>
          . URL: https://onlinelibrary. wiley.com/doi/abs/10.1111/jcal.12610. doi:https://doi.org/10.1111/jcal.12610. arXiv:https://onlinelibrary.wiley.com/doi/pdf/10.1111/jcal.12610.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>G.</given-names>
            <surname>Tyen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Brenchley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Caines</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Buttery</surname>
          </string-name>
          ,
          <article-title>Towards an open-domain chatbot for language practice</article-title>
          ,
          <source>in: Proceedings of the 17th Workshop on Innovative Use of NLP for Building Educational Applications (BEA</source>
          <year>2022</year>
          ), Seattle, Washington,
          <year>2022</year>
          . URL: https: //aclanthology.org/
          <year>2022</year>
          .bea-
          <volume>1</volume>
          .28. doi:
          <volume>10</volume>
          .18653/v1/
          <year>2022</year>
          .bea-
          <volume>1</volume>
          .
          <fpage>28</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Duolingo</surname>
            <given-names>Team</given-names>
          </string-name>
          ,
          <article-title>Introducing Duolingo Max, a learning experience powered by gpt-4, 2023</article-title>
          . URL: https://blog.duolingo.com/duolingo-max/.
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>C.</given-names>
            <surname>Rafel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shazeer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Roberts</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Narang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Matena</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. J.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <article-title>Exploring the limits of transfer learning with a unified text-to-text Transformer</article-title>
          ,
          <source>The Journal of Machine Learning Research</source>
          <volume>21</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          <source>[21] Google, PaLM 2 technical report</source>
          ,
          <year>2023</year>
          . URL: https://ai.google/static/documents/ palm2techreport.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>R.</given-names>
            <surname>Thoppilan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. D.</given-names>
            <surname>Freitas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Hall</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shazeer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kulshreshtha</surname>
          </string-name>
          , H.-T. Cheng, A. Jin,
          <string-name>
            <given-names>T.</given-names>
            <surname>Bos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Baker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. S.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ghafouri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Menegali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Krikun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Lepikhin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Qin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Roberts</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bosma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.-C. Chang</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          <string-name>
            <surname>Krivokon</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Rusch</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Pickett</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Srinivasan</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Man</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Meier-Hellstern</surname>
            ,
            <given-names>M. R.</given-names>
          </string-name>
          <string-name>
            <surname>Morris</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Doshi</surname>
            ,
            <given-names>R. D.</given-names>
          </string-name>
          <string-name>
            <surname>Santos</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Duke</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Soraker</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Zevenbergen</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Prabhakaran</surname>
            ,
            <given-names>S.</given-names>
            Sang-aroonsiri, S. Kumar, S.
          </string-name>
          <string-name>
            <surname>Schweter</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Bharati</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Laud</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Gigant</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Kainuma</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Kusa</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Labrak</surname>
            ,
            <given-names>Y. S.</given-names>
          </string-name>
          <string-name>
            <surname>Bajaj</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Venkatraman</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          <string-name>
            <surname>Tan</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          <string-name>
            <surname>Xie</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          <string-name>
            <surname>Ye</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Bras</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Belkada</surname>
          </string-name>
          , T. Wolf,
          <article-title>Bloom: A 176b-parameter open-access multilingual language model</article-title>
          arXiv:
          <volume>2211</volume>
          .05100 (
          <year>2023</year>
          ). URL: https://arxiv.org/abs/2211.05100.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>T.</given-names>
            <surname>Wolf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Debut</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Sanh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chaumond</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Delangue</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Moi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Cistac</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Rault</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Louf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Funtowicz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Davison</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Shleifer</surname>
          </string-name>
          , P. von Platen, C. Ma,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Jernite</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Plu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. Le</given-names>
            <surname>Scao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gugger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Drame</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Lhoest</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rush</surname>
          </string-name>
          , Transformers:
          <article-title>State-of-the-art natural language processing</article-title>
          ,
          <source>in: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations</source>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Online,
          <year>2020</year>
          , pp.
          <fpage>38</fpage>
          -
          <lpage>45</lpage>
          . URL: https://aclanthology.org/
          <year>2020</year>
          .emnlp-demos.6. doi:
          <volume>10</volume>
          .18653/v1/
          <year>2020</year>
          .emnlp- demos.6.
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>P.</given-names>
            <surname>Liang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Bommasani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Tsipras</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Soylu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Yasunaga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Narayanan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Newman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Yan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Cosgrove</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Manning</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Ré</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Acosta-Navas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. A.</given-names>
            <surname>Hudson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Zelikman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Durmus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Ladhak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Rong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Ren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Santhanam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Orr</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Yuksekgonul</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Suzgun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Guha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Chatterji</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Khattab</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Henderson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Chi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. M.</given-names>
            <surname>Xie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Santurkar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ganguli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Hashimoto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Icard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Chaudhary</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Mai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , Y. Koreeda,
          <source>Holistic Evaluation of Language Models arXiv:2211.09110</source>
          (
          <year>2022</year>
          ). URL: https://arxiv.org/abs/2211.09110.
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Park</surname>
          </string-name>
          , G. T. LaFlair,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Attali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Runge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Goodwin</surname>
          </string-name>
          , Duolingo English Test: Interactive reading (drr-22
          <source>-02)</source>
          ,
          <year>2022</year>
          . URL: https://duolingo-papers.
          <year>s3</year>
          .amazonaws.com/other/ mpr-whitepaper.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>A.</given-names>
            <surname>Lewkowycz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Andreassen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dohan</surname>
          </string-name>
          , E. Dyer,
          <string-name>
            <given-names>H.</given-names>
            <surname>Michalewski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Ramasesh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Slone</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Anil</surname>
          </string-name>
          , I. Schlag,
          <string-name>
            <given-names>T.</given-names>
            <surname>Gutman-Solo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Neyshabur</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Gur-Ari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Misra</surname>
          </string-name>
          ,
          <article-title>Solving quantitative reasoning problems with language models</article-title>
          arXiv:
          <volume>2206</volume>
          .14858 (
          <year>2022</year>
          ). URL: https://arxiv.org/abs/2206.14858.
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [34]
          <string-name>
            <given-names>M.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ghazvininejad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mohamed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Levy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Stoyanov</surname>
          </string-name>
          , L. Zettlemoyer, BART:
          <article-title>Denoising sequence-to-sequence pre-training for natural language generation, translation, and comprehension</article-title>
          ,
          <source>in: Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics</source>
          ,
          <year>2020</year>
          . URL: https://aclanthology.org/
          <year>2020</year>
          . acl-main.
          <volume>703</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2020</year>
          .acl- main.703.
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>S.</given-names>
            <surname>Katsumata</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Komachi</surname>
          </string-name>
          ,
          <article-title>Stronger baselines for grammatical error correction using a pretrained encoder-decoder model, in: Proceedings of the 1st Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics and the 10th</article-title>
          <source>International Joint Conference on Natural Language Processing</source>
          , Association for Computational Linguistics, Suzhou, China,
          <year>2020</year>
          , pp.
          <fpage>827</fpage>
          -
          <lpage>832</lpage>
          . URL: https://aclanthology.org/
          <year>2020</year>
          .aacl-main.
          <volume>83</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [36]
          <string-name>
            <given-names>L.</given-names>
            <surname>Pan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Lei</surname>
          </string-name>
          , T.-S. Chua, M.-
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kan</surname>
          </string-name>
          ,
          <source>Recent advances in neural question generation</source>
          ,
          <year>2019</year>
          . arXiv:
          <year>1905</year>
          .08949.
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [37]
          <string-name>
            <given-names>V.</given-names>
            <surname>Raina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gales</surname>
          </string-name>
          ,
          <article-title>Multiple-choice question generation: Towards an automated assessment framework</article-title>
          ,
          <year>2022</year>
          . arXiv:
          <volume>2209</volume>
          .
          <fpage>11830</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [38]
          <string-name>
            <given-names>M.</given-names>
            <surname>Felice</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Taslimipoor</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Buttery</surname>
          </string-name>
          ,
          <article-title>Constructing open cloze tests using generation and discrimination capabilities of Transformers, in: Findings of the Association for Computational Linguistics: ACL</article-title>
          <year>2022</year>
          , Dublin, Ireland,
          <year>2022</year>
          . URL: https://aclanthology. org/
          <year>2022</year>
          .findings-acl.
          <volume>100</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2022</year>
          .findings- acl.100.
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [39]
          <string-name>
            <given-names>K.</given-names>
            <surname>Clark</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>T.</given-names>
            <surname>Luong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q. V.</given-names>
            <surname>Le</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Manning</surname>
          </string-name>
          , Electra:
          <article-title>Pre-training text encoders as discriminators rather than generators</article-title>
          ,
          <source>in: Proceedings of The International Conference on Learning Representations (ICLR)</source>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [40]
          <string-name>
            <surname>H.-L. Chung</surname>
            ,
            <given-names>Y.-H.</given-names>
          </string-name>
          <string-name>
            <surname>Chan</surname>
            ,
            <given-names>Y.-C.</given-names>
          </string-name>
          <string-name>
            <surname>Fan</surname>
          </string-name>
          ,
          <article-title>A BERT-based distractor generation scheme with multi-tasking and negative answer training strategies</article-title>
          .,
          <source>in: Findings of the Association for Computational Linguistics: EMNLP</source>
          <year>2020</year>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Online,
          <year>2020</year>
          , pp.
          <fpage>4390</fpage>
          -
          <lpage>4400</lpage>
          . URL: https://aclanthology.org/
          <year>2020</year>
          .findings-emnlp.
          <volume>393</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2020</year>
          .findings- emnlp.393.
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [41]
          <string-name>
            <given-names>S.-H.</given-names>
            <surname>Chiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.-C.</given-names>
            <surname>Wang</surname>
          </string-name>
          , Y.-C.
          <article-title>Fan, CDGP: Automatic cloze distractor generation based on pre-trained language model, in: Findings of the Association for Computational Linguistics: EMNLP 2022, Association for Computational Linguistics</article-title>
          , Abu Dhabi, United Arab Emirates,
          <year>2022</year>
          , pp.
          <fpage>5835</fpage>
          -
          <lpage>5840</lpage>
          . URL: https://aclanthology.org/
          <year>2022</year>
          .findings-emnlp.
          <volume>429</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [42]
          <string-name>
            <given-names>P.</given-names>
            <surname>Manakul</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Liusie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. J. F.</given-names>
            <surname>Gales</surname>
          </string-name>
          , MQAG:
          <article-title>Multiple-choice question answering and generation for assessing information consistency in summarization</article-title>
          ,
          <year>2023</year>
          . arXiv:
          <volume>2301</volume>
          .
          <fpage>12307</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [43]
          <string-name>
            <given-names>H.</given-names>
            <surname>Saggion</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Štajner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ferrés</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. C.</given-names>
            <surname>Sheang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Shardlow</surname>
          </string-name>
          , K. North, M. Zampieri,
          <article-title>Findings of the TSAR-2022 shared task on multilingual lexical simplification</article-title>
          ,
          <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>
          . URL: https://aclanthology.org/
          <year>2022</year>
          .tsar-
          <volume>1</volume>
          .
          <fpage>31</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          [44]
          <string-name>
            <given-names>D.</given-names>
            <surname>Aumiller</surname>
          </string-name>
          , M. Gertz, UniHD at TSAR
          <article-title>-2022 shared task: Is compute all we need for lexical simplification?</article-title>
          ,
          <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>
          . URL: https://aclanthology.org/
          <year>2022</year>
          .tsar-
          <volume>1</volume>
          .
          <fpage>28</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          [45]
          <string-name>
            <given-names>K.</given-names>
            <surname>Papineni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Roukos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Ward</surname>
          </string-name>
          , W.-J. Zhu,
          <article-title>Bleu: a method for automatic evaluation of machine translation</article-title>
          ,
          <source>in: Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics</source>
          , Philadelphia, Pennsylvania, USA,
          <year>2002</year>
          . URL: https:// aclanthology.org/P02-1040. doi:
          <volume>10</volume>
          .3115/1073083.1073135.
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          [46]
          <string-name>
            <surname>C.-Y. Lin</surname>
            ,
            <given-names>ROUGE:</given-names>
          </string-name>
          <article-title>A package for automatic evaluation of summaries</article-title>
          , in: Text Summarization Branches Out, Barcelona, Spain,
          <year>2004</year>
          . URL: https://aclanthology.org/W04-1013.
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          [47]
          <string-name>
            <given-names>S.</given-names>
            <surname>Banerjee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Lavie</surname>
          </string-name>
          ,
          <string-name>
            <surname>METEOR:</surname>
          </string-name>
          <article-title>An automatic metric for MT evaluation with improved correlation with human judgments</article-title>
          ,
          <source>in: Proceedings of the ACL Workshop on Intrinsic and Extrinsic Evaluation Measures for Machine Translation and/or Summarization</source>
          , Ann Arbor, Michigan,
          <year>2005</year>
          . URL: https://aclanthology.org/W05-0909.
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          [48]
          <string-name>
            <given-names>T.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Kishore</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. Q.</given-names>
            <surname>Weinberger</surname>
          </string-name>
          , Y. Artzi,
          <source>BERTScore: Evaluating text generation with BERT</source>
          ,
          <year>2020</year>
          . arXiv:
          <year>1904</year>
          .09675.
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          [49]
          <string-name>
            <given-names>R.</given-names>
            <surname>Lowe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Noseworthy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. V.</given-names>
            <surname>Serban</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Angelard-Gontier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bengio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Pineau</surname>
          </string-name>
          ,
          <article-title>Towards an automatic Turing Test: Learning to evaluate dialogue responses</article-title>
          ,
          <year>2018</year>
          . arXiv:
          <volume>1708</volume>
          .
          <fpage>07149</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref43">
        <mixed-citation>
          [50]
          <string-name>
            <given-names>H.</given-names>
            <surname>Shimanaka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Kajiwara</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Komachi, RUSE: Regressor using sentence embeddings for automatic machine translation evaluation</article-title>
          ,
          <source>in: Proceedings of the Third Conference on Machine Translation: Shared Task Papers</source>
          , Association for Computational Linguistics, Belgium, Brussels,
          <year>2018</year>
          , pp.
          <fpage>751</fpage>
          -
          <lpage>758</lpage>
          . URL: https://aclanthology.org/W18-6456. doi:
          <volume>10</volume>
          . 18653/v1/
          <fpage>W18</fpage>
          - 6456.
        </mixed-citation>
      </ref>
      <ref id="ref44">
        <mixed-citation>
          [51]
          <string-name>
            <given-names>G.</given-names>
            <surname>Lai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Xie</surname>
          </string-name>
          , H. Liu,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yang</surname>
          </string-name>
          , E. Hovy, RACE:
          <article-title>Large-scale ReAding comprehension dataset from examinations</article-title>
          ,
          <source>in: Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing</source>
          , Association for Computational Linguistics, Copenhagen, Denmark,
          <year>2017</year>
          , pp.
          <fpage>785</fpage>
          -
          <lpage>794</lpage>
          . URL: https://aclanthology.org/D17-1082. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>D17</fpage>
          - 1082.
        </mixed-citation>
      </ref>
      <ref id="ref45">
        <mixed-citation>
          [52]
          <string-name>
            <given-names>X.</given-names>
            <surname>Kong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Gangal</surname>
          </string-name>
          , E. Hovy, SCDE:
          <article-title>Sentence cloze dataset with high quality distractors from examinations</article-title>
          ,
          <year>2020</year>
          . arXiv:
          <year>2004</year>
          .12934.
        </mixed-citation>
      </ref>
      <ref id="ref46">
        <mixed-citation>
          [53]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Xie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Lai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Dai</surname>
          </string-name>
          , E. Hovy,
          <article-title>Large-scale cloze test dataset created by teachers</article-title>
          ,
          <source>in: Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing</source>
          , Association for Computational Linguistics, Brussels, Belgium,
          <year>2018</year>
          , pp.
          <fpage>2344</fpage>
          -
          <lpage>2356</lpage>
          . URL: https://aclanthology.org/D18-1257. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>D18</fpage>
          - 1257.
        </mixed-citation>
      </ref>
      <ref id="ref47">
        <mixed-citation>
          [54]
          <string-name>
            <given-names>M.</given-names>
            <surname>Felice</surname>
          </string-name>
          , S. Taslimipoor, Ø. E. Andersen, P. Buttery,
          <string-name>
            <surname>CEPOC</surname>
          </string-name>
          : The Cambridge exams publishing open cloze dataset,
          <source>in: Proceedings of the Thirteenth Language Resources and Evaluation Conference</source>
          , European Language Resources Association, Marseille, France,
          <year>2022</year>
          , pp.
          <fpage>4285</fpage>
          -
          <lpage>4290</lpage>
          . URL: https://aclanthology.org/
          <year>2022</year>
          .lrec-
          <volume>1</volume>
          .
          <fpage>456</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref48">
        <mixed-citation>
          [55]
          <string-name>
            <given-names>A.</given-names>
            <surname>Caines</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yannakoudakis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Allen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Pérez-Paredes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Byrne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Buttery</surname>
          </string-name>
          ,
          <article-title>The Teacher-Student Chatroom Corpus version 2: more lessons, new annotation, automatic detection of sequence shifts</article-title>
          ,
          <source>in: Proceedings of the 11th Workshop on NLP for Computer Assisted Language Learning</source>
          ,
          <article-title>Louvain-la-</article-title>
          <string-name>
            <surname>Neuve</surname>
          </string-name>
          , Belgium,
          <year>2022</year>
          . URL: https://aclanthology. org/
          <year>2022</year>
          .nlp4call-
          <fpage>1</fpage>
          .3.
        </mixed-citation>
      </ref>
      <ref id="ref49">
        <mixed-citation>
          [56]
          <string-name>
            <given-names>T.</given-names>
            <surname>Hosking</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Riedel</surname>
          </string-name>
          ,
          <article-title>Evaluating rewards for question generation models, in: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers), Association for Computational Linguistics</article-title>
          , Minneapolis, Minnesota,
          <year>2019</year>
          , pp.
          <fpage>2278</fpage>
          -
          <lpage>2283</lpage>
          . URL: https://aclanthology.org/N19-1237. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>N19</fpage>
          - 1237.
        </mixed-citation>
      </ref>
      <ref id="ref50">
        <mixed-citation>
          [57]
          <string-name>
            <given-names>L.</given-names>
            <surname>Ouyang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Almeida</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. L.</given-names>
            <surname>Wainwright</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Mishkin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , S. Agarwal,
          <string-name>
            <given-names>K.</given-names>
            <surname>Slama</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ray</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Schulman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Hilton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Kelton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Miller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Simens</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Askell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Welinder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Christiano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Leike</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Lowe</surname>
          </string-name>
          ,
          <article-title>Training language models to follow instructions with human feedback arXiv:2203</article-title>
          .02155 (
          <year>2022</year>
          ). URL: https://arxiv.org/abs/2203.02155.
        </mixed-citation>
      </ref>
      <ref id="ref51">
        <mixed-citation>
          [58]
          <string-name>
            <surname>D. M. Ziegler</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Stiennon</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Wu</surname>
          </string-name>
          , T. B.
          <string-name>
            <surname>Brown</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Radford</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Amodei</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Christiano</surname>
          </string-name>
          , G. Irving,
          <article-title>Fine-tuning language models from human preferences</article-title>
          ,
          <year>2020</year>
          . arXiv:
          <year>1909</year>
          .08593.
        </mixed-citation>
      </ref>
      <ref id="ref52">
        <mixed-citation>
          [59]
          <string-name>
            <given-names>N.</given-names>
            <surname>Stiennon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Ouyang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. M.</given-names>
            <surname>Ziegler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Lowe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Voss</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Amodei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Christiano</surname>
          </string-name>
          , Learning to summarize
          <source>from human feedback</source>
          ,
          <year>2022</year>
          . arXiv:
          <year>2009</year>
          .01325.
        </mixed-citation>
      </ref>
      <ref id="ref53">
        <mixed-citation>
          [60]
          <string-name>
            <given-names>R.</given-names>
            <surname>Watson</surname>
          </string-name>
          , E. Kochmar, Read &amp;
          <article-title>Improve: A novel reading tutoring system</article-title>
          ,
          <source>in: Proceedings of Educational Data Mining (EDM)</source>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref54">
        <mixed-citation>
          [61]
          <string-name>
            <given-names>L.</given-names>
            <surname>Benedetto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Cremonesi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Caines</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Buttery</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cappelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Giussani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Turrin</surname>
          </string-name>
          ,
          <article-title>A survey on recent approaches to question dificulty estimation from text</article-title>
          ,
          <source>ACM Computing Surveys</source>
          <volume>55</volume>
          (
          <year>2023</year>
          )
          <fpage>1</fpage>
          -
          <lpage>37</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref55">
        <mixed-citation>
          [62]
          <string-name>
            <given-names>S.</given-names>
            <surname>AlKhuzaey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Grasso</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. R.</given-names>
            <surname>Payne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Tamma</surname>
          </string-name>
          ,
          <article-title>A systematic review of data-driven approaches to item dificulty prediction</article-title>
          ,
          <source>in: International Conference on Artificial Intelligence in Education</source>
          , Springer,
          <year>2021</year>
          , pp.
          <fpage>29</fpage>
          -
          <lpage>41</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref56">
        <mixed-citation>
          [63]
          <string-name>
            <given-names>V.</given-names>
            <surname>Sanh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Debut</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chaumond</surname>
          </string-name>
          , T. Wolf,
          <article-title>DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter</article-title>
          ,
          <source>in: Proceedings of the 5th Workshop on Energy Eficient Machine Learning and Cognitive Computing</source>
          ,
          <year>2020</year>
          . URL: https://arxiv.org/abs/2210.02414.
        </mixed-citation>
      </ref>
      <ref id="ref57">
        <mixed-citation>
          [64]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>Tao, Multi-task bert for problem dificulty prediction</article-title>
          ,
          <source>in: 2020 International Conference on Communications, Information System and Computer</source>
          Engineering (CISCE), IEEE,
          <year>2020</year>
          , pp.
          <fpage>213</fpage>
          -
          <lpage>216</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref58">
        <mixed-citation>
          [65]
          <string-name>
            <given-names>L.</given-names>
            <surname>Benedetto</surname>
          </string-name>
          , G. Aradelli,
          <string-name>
            <given-names>P.</given-names>
            <surname>Cremonesi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cappelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Giussani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Turrin</surname>
          </string-name>
          ,
          <article-title>On the application of Transformers for estimating the dificulty of multiple-choice questions from text</article-title>
          ,
          <source>in: Proceedings of the 16th Workshop on Innovative Use of NLP for Building Educational Applications</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>147</fpage>
          -
          <lpage>157</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref59">
        <mixed-citation>
          [66]
          <string-name>
            <given-names>L.</given-names>
            <surname>Benedetto</surname>
          </string-name>
          ,
          <article-title>A quantitative study of nlp approaches to question dificulty estimation</article-title>
          ,
          <source>arXiv preprint arXiv:2305.10236</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref60">
        <mixed-citation>
          [67]
          <string-name>
            <given-names>E.</given-names>
            <surname>Loginova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Benedetto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Benoit</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Cremonesi</surname>
          </string-name>
          ,
          <article-title>Towards the application of calibrated Transformers to the unsupervised estimation of question dificulty from text</article-title>
          ,
          <source>in: RANLP</source>
          <year>2021</year>
          , INCOMA,
          <year>2021</year>
          , pp.
          <fpage>846</fpage>
          -
          <lpage>855</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref61">
        <mixed-citation>
          [68]
          <string-name>
            <given-names>L.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Zechner</surname>
          </string-name>
          , S.-Y. Yoon,
          <string-name>
            <given-names>K.</given-names>
            <surname>Evanini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Loukina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Davis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. M.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Mundkowsky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. W.</given-names>
            <surname>Leong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Gyawali</surname>
          </string-name>
          ,
          <article-title>Automated scoring of nonnative speech using the SpeechRaterSM v. 5.0 engine</article-title>
          ,
          <source>ETS Research Report Series</source>
          <year>2018</year>
          (
          <year>2018</year>
          )
          <fpage>1</fpage>
          -
          <lpage>31</lpage>
          . doi:https://doi.org/10.1002/ets2.
          <fpage>12198</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref62">
        <mixed-citation>
          [69]
          <string-name>
            <given-names>K.</given-names>
            <surname>Knill</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gales</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Kyriakopoulos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Malinin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ragni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Caines</surname>
          </string-name>
          ,
          <article-title>Impact of ASR performance on free speaking language assessment</article-title>
          ,
          <source>in: Interspeech</source>
          <year>2018</year>
          ,
          <year>2018</year>
          , pp.
          <fpage>1641</fpage>
          -
          <lpage>1645</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref63">
        <mixed-citation>
          [70]
          <string-name>
            <given-names>K.</given-names>
            <surname>Zechner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Evanini</surname>
          </string-name>
          , Automated Speaking Assessment:
          <article-title>Using Language Technologies to Score Spontaneous Speech</article-title>
          , Routledge,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref64">
        <mixed-citation>
          [71]
          <string-name>
            <given-names>H.</given-names>
            <surname>Craighead</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Caines</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Buttery</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yannakoudakis</surname>
          </string-name>
          ,
          <article-title>Investigating the efect of auxiliary objectives for the automated grading of learner English speech transcriptions</article-title>
          ,
          <source>in: Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics</source>
          ,
          <year>2020</year>
          . URL: https://aclanthology.org/
          <year>2020</year>
          .acl-main.
          <volume>206</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2020</year>
          . acl- main.206.
        </mixed-citation>
      </ref>
      <ref id="ref65">
        <mixed-citation>
          [72]
          <string-name>
            <given-names>J.</given-names>
            <surname>Burstein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chodorow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Leacock</surname>
          </string-name>
          ,
          <article-title>Automated essay evaluation: The Criterion online writing service</article-title>
          ,
          <source>AI</source>
          Magazine
          <volume>25</volume>
          (
          <year>2004</year>
          )
          <article-title>27</article-title>
          . URL: https://ojs.aaai.org/aimagazine/index. php/aimagazine/article/view/1774. doi:
          <volume>10</volume>
          .1609/aimag.v25i3.
          <fpage>1774</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref66">
        <mixed-citation>
          [73]
          <string-name>
            <surname>Ø</surname>
            . E. Andersen,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Yannakoudakis</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Barker</surname>
          </string-name>
          , T. Parish,
          <article-title>Developing and testing a selfassessment and tutoring system</article-title>
          ,
          <source>in: Proceedings of the Eighth Workshop on Innovative Use of NLP for Building Educational Applications</source>
          ,
          <year>2013</year>
          . URL: https://aclanthology.org/ W13-1704.
        </mixed-citation>
      </ref>
      <ref id="ref67">
        <mixed-citation>
          [74]
          <string-name>
            <given-names>D.</given-names>
            <surname>Alikaniotis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yannakoudakis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Rei</surname>
          </string-name>
          ,
          <article-title>Automatic text scoring using neural networks</article-title>
          ,
          <source>in: Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume</source>
          <volume>1</volume>
          :
          <string-name>
            <surname>Long</surname>
            <given-names>Papers)</given-names>
          </string-name>
          ,
          <year>2016</year>
          . URL: https://aclanthology.org/P16-1068. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>P16</fpage>
          - 1068.
        </mixed-citation>
      </ref>
      <ref id="ref68">
        <mixed-citation>
          [75]
          <string-name>
            <given-names>B.</given-names>
            <surname>Riordan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Horbach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cahill</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Zesch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. M.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <article-title>Investigating neural architectures for short answer scoring</article-title>
          ,
          <source>in: Proceedings of the 12th Workshop on Innovative Use of NLP for Building Educational Applications</source>
          ,
          <year>2017</year>
          . URL: https://aclanthology.org/W17-5017. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>W17</fpage>
          - 5017.
        </mixed-citation>
      </ref>
      <ref id="ref69">
        <mixed-citation>
          [76]
          <string-name>
            <surname>Ø. E. Andersen</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          <string-name>
            <surname>Yuan</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Watson</surname>
            ,
            <given-names>K. Y. F.</given-names>
          </string-name>
          <string-name>
            <surname>Cheung</surname>
          </string-name>
          ,
          <article-title>Benefits of alternative evaluation methods for automated essay scoring</article-title>
          ,
          <source>in: Proceedings of the 14th International Conference on Educational Data Mining (EDM</source>
          <year>2021</year>
          ), Paris, France,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref70">
        <mixed-citation>
          [77]
          <string-name>
            <given-names>H.</given-names>
            <surname>Yannakoudakis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Ø. E.</given-names>
            <surname>Andersen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Geranpayeh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Briscoe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Nicholls</surname>
          </string-name>
          ,
          <article-title>Developing an automated writing placement system for ESL learners</article-title>
          ,
          <source>Applied Measurement in Education</source>
          <volume>31</volume>
          (
          <year>2018</year>
          )
          <fpage>251</fpage>
          -
          <lpage>267</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref71">
        <mixed-citation>
          [78]
          <string-name>
            <given-names>J.</given-names>
            <surname>Jeon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <article-title>Large language models in education: A focus on the complementary relationship between human teachers and ChatGPT, Education</article-title>
          and Information
          <string-name>
            <surname>Technologies</surname>
          </string-name>
          (
          <year>2023</year>
          )
          <fpage>1</fpage>
          -
          <lpage>20</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref72">
        <mixed-citation>
          [79]
          <string-name>
            <given-names>A.</given-names>
            <surname>Mizumoto</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Eguchi, Exploring the potential of using an AI language model for automated essay scoring</article-title>
          ,
          <source>Research Methods in Applied Linguistics</source>
          <volume>2</volume>
          (
          <year>2023</year>
          )
          <fpage>100050</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref73">
        <mixed-citation>
          [80]
          <string-name>
            <given-names>D.</given-names>
            <surname>Blanchard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tetreault</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Higgins</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cahill</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Chodorow, TOEFL11: A corpus of non-native English</article-title>
          ,
          <source>ETS Research Report Series</source>
          <year>2013</year>
          (
          <year>2013</year>
          )
          <fpage>i</fpage>
          -
          <lpage>15</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref74">
        <mixed-citation>
          [81]
          <string-name>
            <given-names>P.</given-names>
            <surname>Lagakis</surname>
          </string-name>
          , S. Demetriadis, Automated essay scoring:
          <article-title>A review of the field</article-title>
          , in: 2021 International Conference on Computer,
          <source>Information and Telecommunication Systems (CITS)</source>
          , IEEE,
          <year>2021</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref75">
        <mixed-citation>
          [82]
          <string-name>
            <surname>European</surname>
            <given-names>Commission</given-names>
          </string-name>
          ,
          <source>Regulatory framework proposal on artificial intelligence</source>
          ,
          <year>2022</year>
          . URL: https://digital-strategy.ec.europa.eu/en/policies/regulatory-framework-ai.
        </mixed-citation>
      </ref>
      <ref id="ref76">
        <mixed-citation>
          [83]
          <string-name>
            <given-names>J.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Schuurmans</surname>
          </string-name>
          , M. Bosma, brian ichter,
          <string-name>
            <given-names>F.</given-names>
            <surname>Xia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. H.</given-names>
            <surname>Chi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q. V.</given-names>
            <surname>Le</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <article-title>Chain of thought prompting elicits reasoning in large language models</article-title>
          , in: A. H.
          <string-name>
            <surname>Oh</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Agarwal</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Belgrave</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          Cho (Eds.),
          <source>Advances in Neural Information Processing Systems</source>
          ,
          <year>2022</year>
          . URL: https://openreview.net/forum?id=_VjQlMeSB_J.
        </mixed-citation>
      </ref>
      <ref id="ref77">
        <mixed-citation>
          [84]
          <string-name>
            <given-names>H.</given-names>
            <surname>Yannakoudakis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Briscoe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Medlock</surname>
          </string-name>
          ,
          <article-title>A new dataset and method for automatically grading ESOL texts, in: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies</article-title>
          , Portland, Oregon, USA,
          <year>2011</year>
          . URL: https://aclanthology.org/P11-1019.
        </mixed-citation>
      </ref>
      <ref id="ref78">
        <mixed-citation>
          [85]
          <string-name>
            <given-names>A.</given-names>
            <surname>Boyd</surname>
          </string-name>
          ,
          <article-title>Using Wikipedia Edits in Low Resource Grammatical Error Correction</article-title>
          ,
          <source>in: Proceedings of the 2018 EMNLP Workshop W-NUT: The 4th Workshop on Noisy Usergenerated Text</source>
          , Brussels, Belgium,
          <year>2018</year>
          . URL: https://aclanthology.org/W18-6111. doi:
          <volume>10</volume>
          . 18653/v1/
          <fpage>W18</fpage>
          - 6111.
        </mixed-citation>
      </ref>
      <ref id="ref79">
        <mixed-citation>
          [86]
          <string-name>
            <given-names>J.</given-names>
            <surname>Náplava</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Straka</surname>
          </string-name>
          ,
          <article-title>Grammatical Error Correction in Low-Resource Scenarios</article-title>
          ,
          <source>in: Proceedings of the 5th Workshop</source>
          on Noisy User-generated
          <string-name>
            <surname>Text</surname>
          </string-name>
          (
          <article-title>W-NUT</article-title>
          <year>2019</year>
          ), Hong Kong, China,
          <year>2019</year>
          . URL: https://aclanthology.org/D19-5545. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>D19</fpage>
          - 5545.
        </mixed-citation>
      </ref>
      <ref id="ref80">
        <mixed-citation>
          [87]
          <string-name>
            <given-names>O.</given-names>
            <surname>Syvokon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Nahorna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Kuchmiichuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Osidach</surname>
          </string-name>
          , UA-GEC:
          <article-title>Grammatical error correction and fluency corpus for the Ukrainian language</article-title>
          ,
          <source>in: Proceedings of the Second Ukrainian Natural Language Processing Workshop</source>
          (UNLP), Dubrovnik, Croatia,
          <year>2023</year>
          . URL: https://aclanthology.org/
          <year>2023</year>
          .unlp-
          <volume>1</volume>
          .
          <fpage>12</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref81">
        <mixed-citation>
          [88]
          <string-name>
            <given-names>D.</given-names>
            <surname>Dahlmeier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. T.</given-names>
            <surname>Ng</surname>
          </string-name>
          ,
          <article-title>A beam-search decoder for grammatical error correction</article-title>
          ,
          <source>in: Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning</source>
          ,
          <year>2012</year>
          , pp.
          <fpage>568</fpage>
          -
          <lpage>578</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref82">
        <mixed-citation>
          [89]
          <string-name>
            <given-names>S.</given-names>
            <surname>Bell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yannakoudakis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Rei</surname>
          </string-name>
          ,
          <article-title>Context is key: Grammatical error detection with contextual word representations</article-title>
          ,
          <source>in: Proceedings of the Fourteenth Workshop on Innovative Use of NLP for Building Educational Applications</source>
          , Florence, Italy,
          <year>2019</year>
          . URL: https://aclanthology.org/W19-4410. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>W19</fpage>
          - 4410.
        </mixed-citation>
      </ref>
      <ref id="ref83">
        <mixed-citation>
          [90]
          <string-name>
            <given-names>A.</given-names>
            <surname>Caines</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Bentz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Knill</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Rei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Buttery</surname>
          </string-name>
          ,
          <article-title>Grammatical error detection in transcriptions of spoken English</article-title>
          ,
          <source>in: Proceedings of the 28th International Conference on Computational Linguistics</source>
          , Barcelona,
          <source>Spain (Online)</source>
          ,
          <year>2020</year>
          . URL: https: //aclanthology.org/
          <year>2020</year>
          .coling-main.
          <volume>195</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2020</year>
          .coling- main.195.
        </mixed-citation>
      </ref>
      <ref id="ref84">
        <mixed-citation>
          [91]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Taslimipoor</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Davis</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>Bryant, Multi-class grammatical error detection for correction: A tale of two systems</article-title>
          ,
          <source>in: Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing</source>
          , Online and
          <string-name>
            <given-names>Punta</given-names>
            <surname>Cana</surname>
          </string-name>
          , Dominican Republic,
          <year>2021</year>
          . URL: https://aclanthology.org/
          <year>2021</year>
          .emnlp-main.
          <volume>687</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2021</year>
          .emnlp- main.687.
        </mixed-citation>
      </ref>
      <ref id="ref85">
        <mixed-citation>
          [92]
          <string-name>
            <given-names>M.</given-names>
            <surname>Qorib</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.-H.</given-names>
            <surname>Na</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. T.</given-names>
            <surname>Ng</surname>
          </string-name>
          ,
          <article-title>Frustratingly easy system combination for grammatical error correction, in: Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</article-title>
          , Seattle, United States,
          <year>2022</year>
          . URL: https://aclanthology.org/
          <year>2022</year>
          .naacl-main.
          <volume>143</volume>
          . doi:
          <volume>10</volume>
          .18653/ v1/
          <year>2022</year>
          .naacl- main.143.
        </mixed-citation>
      </ref>
      <ref id="ref86">
        <mixed-citation>
          [93]
          <string-name>
            <given-names>H. T.</given-names>
            <surname>Ng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. M.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Hadiwinoto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tetreault</surname>
          </string-name>
          ,
          <article-title>The CoNLL-2013 shared task on grammatical error correction</article-title>
          ,
          <source>in: Proceedings of the Seventeenth Conference on Computational Natural Language Learning: Shared Task</source>
          , Sofia, Bulgaria,
          <year>2013</year>
          . URL: https://aclanthology.org/W13-3601.
        </mixed-citation>
      </ref>
      <ref id="ref87">
        <mixed-citation>
          [94]
          <string-name>
            <given-names>H. T.</given-names>
            <surname>Ng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. M.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Briscoe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Hadiwinoto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. H.</given-names>
            <surname>Susanto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Bryant</surname>
          </string-name>
          ,
          <article-title>The CoNLL2014 shared task on grammatical error correction</article-title>
          ,
          <source>in: Proceedings of the Eighteenth Conference on Computational Natural Language Learning: Shared Task</source>
          , Baltimore, Maryland,
          <year>2014</year>
          . URL: https://aclanthology.org/W14-1701. doi:
          <volume>10</volume>
          .3115/v1/
          <fpage>W14</fpage>
          - 1701.
        </mixed-citation>
      </ref>
      <ref id="ref88">
        <mixed-citation>
          [95]
          <string-name>
            <given-names>C.</given-names>
            <surname>Bryant</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Felice</surname>
          </string-name>
          , Ø. E. Andersen, T. Briscoe,
          <article-title>The BEA-2019 shared task on grammatical error correction</article-title>
          ,
          <source>in: Proceedings of the Fourteenth Workshop on Innovative Use of NLP for Building Educational Applications</source>
          , Florence, Italy,
          <year>2019</year>
          . URL: https://aclanthology. org/W19-4406. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>W19</fpage>
          - 4406.
        </mixed-citation>
      </ref>
      <ref id="ref89">
        <mixed-citation>
          [96]
          <string-name>
            <given-names>C.</given-names>
            <surname>Bryant</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. R.</given-names>
            <surname>Qorib</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. T.</given-names>
            <surname>Ng</surname>
          </string-name>
          , T. Briscoe,
          <article-title>Grammatical Error Correction: A Survey of the State of the Art</article-title>
          , Computational
          <string-name>
            <surname>Linguistics</surname>
          </string-name>
          (
          <year>2023</year>
          )
          <fpage>1</fpage>
          -
          <lpage>59</lpage>
          . URL: https: //doi.org/10.1162/coli_a_00478. doi:
          <volume>10</volume>
          .1162/coli_a_
          <fpage>00478</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref90">
        <mixed-citation>
          [97]
          <string-name>
            <given-names>H.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Jiao</surname>
          </string-name>
          , M. Lyu, ChatGPT or Grammarly?
          <article-title>Evaluating ChatGPT on grammatical error correction benchmark</article-title>
          arXiv:
          <volume>2303</volume>
          .13648 (
          <year>2023</year>
          ). URL: https://arxiv. org/abs/2303.13648.
        </mixed-citation>
      </ref>
      <ref id="ref91">
        <mixed-citation>
          [98]
          <string-name>
            <given-names>S.</given-names>
            <surname>Coyne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Sakaguchi</surname>
          </string-name>
          ,
          <article-title>An analysis of GPT-3's performance in grammatical error correction</article-title>
          arXiv:
          <volume>2303</volume>
          .14342 (
          <year>2023</year>
          ). URL: https://arxiv.org/abs/2303.14342.
        </mixed-citation>
      </ref>
      <ref id="ref92">
        <mixed-citation>
          [99]
          <string-name>
            <given-names>K.</given-names>
            <surname>Omelianchuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Atrasevych</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Chernodub</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Skurzhanskyi</surname>
          </string-name>
          ,
          <article-title>Gector-grammatical error correction: tag, not rewrite</article-title>
          , arXiv preprint arXiv:
          <year>2005</year>
          .
          <volume>12592</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref93">
        <mixed-citation>
          [100]
          <string-name>
            <given-names>M.</given-names>
            <surname>Yasunaga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Leskovec</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Liang</surname>
          </string-name>
          ,
          <article-title>Lm-critic: language models for unsupervised grammatical error correction</article-title>
          ,
          <source>arXiv preprint arXiv:2109.06822</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref94">
        <mixed-citation>
          [101]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Yi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Yang</surname>
          </string-name>
          , T.-S. Chua,
          <article-title>Neural quality estimation with multiple hypotheses for grammatical error correction</article-title>
          ,
          <source>arXiv preprint arXiv:2105.04443</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref95">
        <mixed-citation>
          [102]
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoles</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Sakaguchi</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Tetreault,</surname>
          </string-name>
          <article-title>JFLEG: A fluency corpus and benchmark for grammatical error correction</article-title>
          ,
          <source>in: Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume</source>
          <volume>2</volume>
          ,
          <string-name>
            <surname>Short</surname>
            <given-names>Papers</given-names>
          </string-name>
          , Valencia, Spain,
          <year>2017</year>
          . URL: https://aclanthology.org/E17-2037.
        </mixed-citation>
      </ref>
      <ref id="ref96">
        <mixed-citation>
          [103]
          <string-name>
            <given-names>D.</given-names>
            <surname>Nicholls</surname>
          </string-name>
          , The Cambridge Learner Corpus -
          <article-title>error coding and analysis for lexicography and ELT</article-title>
          ,
          <source>in: Proceedings of the Corpus Linguistics 2003 conference; UCREL technical paper number 16</source>
          ,
          <year>2003</year>
          . URL: https://ucrel.lancs.ac.uk/publications/cl2003/papers/nicholls. pdf.
        </mixed-citation>
      </ref>
      <ref id="ref97">
        <mixed-citation>
          [104]
          <string-name>
            <given-names>K.</given-names>
            <surname>Sakaguchi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoles</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Post</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tetreault</surname>
          </string-name>
          ,
          <article-title>Reassessing the goals of grammatical error correction: Fluency instead of grammaticality, Transactions of the Association for Computational Linguistics 4 (</article-title>
          <year>2016</year>
          ). URL: https://aclanthology.org/Q16-1013. doi:
          <volume>10</volume>
          . 1162/tacl_a_
          <fpage>00091</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref98">
        <mixed-citation>
          [105]
          <string-name>
            <given-names>R.</given-names>
            <surname>Nagata</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hagiwara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Hanawa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Mita</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Chernodub</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Nahorna</surname>
          </string-name>
          ,
          <article-title>Shared task on feedback comment generation for language learners</article-title>
          ,
          <source>in: Proceedings of the 14th International Conference on Natural Language Generation</source>
          , Aberdeen, Scotland, UK,
          <year>2021</year>
          . URL: https://aclanthology.org/
          <year>2021</year>
          .inlg-
          <volume>1</volume>
          .
          <fpage>35</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref99">
        <mixed-citation>
          [106]
          <string-name>
            <given-names>S.</given-names>
            <surname>Black</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Leahy</surname>
          </string-name>
          , S. Biderman, GPT-Neo:
          <article-title>Large scale autoregressive language modeling with Mesh-</article-title>
          <string-name>
            <surname>Tensorflow</surname>
          </string-name>
          ,
          <year>2021</year>
          . URL: https://doi.org/10.5281/zenodo. 5297715. doi:
          <volume>10</volume>
          .5281/zenodo.5297715.
        </mixed-citation>
      </ref>
      <ref id="ref100">
        <mixed-citation>
          [107]
          <string-name>
            <given-names>N.</given-names>
            <surname>Babakov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lysyuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Shvets</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Kazakova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Panchenko</surname>
          </string-name>
          ,
          <article-title>Error syntax aware augmentation of feedback comment generation dataset</article-title>
          ,
          <source>in: Proceedings of the 16th International Natural Language Generation Conference</source>
          ,
          <year>2023</year>
          . URL: https://arxiv.org/abs/ 2212.14293.
        </mixed-citation>
      </ref>
      <ref id="ref101">
        <mixed-citation>
          [108]
          <string-name>
            <given-names>S.</given-names>
            <surname>Coyne</surname>
          </string-name>
          ,
          <article-title>Template-guided grammatical error feedback comment generation</article-title>
          ,
          <source>in: Proceedings of the 17th Conference of the European Chapter of the Association for Computational Linguistics: Student Research Workshop</source>
          , Dubrovnik, Croatia,
          <year>2023</year>
          . URL: https://aclanthology.org/
          <year>2023</year>
          .eacl-srw.
          <volume>10</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref102">
        <mixed-citation>
          [109]
          <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>S.</given-names>
            <surname>Dreier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Gade</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. A.</given-names>
            <surname>Smith,</surname>
          </string-name>
          <article-title>Whose language counts as high quality? measuring language ideologies in text data selection</article-title>
          ,
          <source>in: Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing</source>
          , Abu Dhabi, United Arab Emirates,
          <year>2022</year>
          . URL: https: //aclanthology.org/
          <year>2022</year>
          .emnlp-main.
          <volume>165</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref103">
        <mixed-citation>
          [110]
          <string-name>
            <given-names>A.</given-names>
            <surname>Søgaard</surname>
          </string-name>
          ,
          <article-title>Should we ban English NLP for a year?</article-title>
          ,
          <source>in: Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing</source>
          , Abu Dhabi, United Arab Emirates,
          <year>2022</year>
          . URL: https://aclanthology.org/
          <year>2022</year>
          .emnlp-main.
          <volume>351</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref104">
        <mixed-citation>
          [111]
          <string-name>
            <given-names>K.</given-names>
            <surname>Ramesh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Sitaram</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Choudhury</surname>
          </string-name>
          ,
          <article-title>Fairness in language models beyond English: Gaps and challenges, in: Findings of the Association for Computational Linguistics: EACL 2023, Dubrovnik</article-title>
          , Croatia,
          <year>2023</year>
          . URL: https://aclanthology.org/
          <year>2023</year>
          .findings-eacl.
          <volume>157</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref105">
        <mixed-citation>
          [112]
          <string-name>
            <given-names>S.</given-names>
            <surname>Barocas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Crawford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Shapiro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wallach</surname>
          </string-name>
          ,
          <article-title>The problem with bias: from allocative to representational harms in machine learning</article-title>
          ,
          <source>in: Proceedings of the 9th Conference of the Special Interest Group for Computing, Information and Society (SIGCIS)</source>
          ,
          <year>2017</year>
          . URL: http://meetings.sigcis.org/uploads/6/3/6/8/6368912/program.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref106">
        <mixed-citation>
          [113]
          <string-name>
            <given-names>S. L.</given-names>
            <surname>Blodgett</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Barocas</surname>
          </string-name>
          , H.
          <string-name>
            <surname>Daumé</surname>
            <given-names>III</given-names>
          </string-name>
          , H. Wallach,
          <article-title>Language (technology) is power: A critical survey of “bias” in NLP</article-title>
          ,
          <source>in: Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics</source>
          ,
          <year>2020</year>
          . URL: https://aclanthology.org/
          <year>2020</year>
          . acl-main.
          <volume>485</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2020</year>
          .acl- main.485.
        </mixed-citation>
      </ref>
      <ref id="ref107">
        <mixed-citation>
          [114]
          <string-name>
            <given-names>E. M.</given-names>
            <surname>Bender</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Gebru</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>McMillan-Major</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Shmitchell</surname>
          </string-name>
          ,
          <article-title>On the dangers of stochastic parrots: Can language models be too big?</article-title>
          ,
          <source>in: Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency</source>
          ,
          <source>FAccT '21</source>
          ,
          <year>2021</year>
          , p.
          <fpage>610</fpage>
          -
          <lpage>623</lpage>
          . URL: https: //doi.org/10.1145/3442188.3445922. doi:
          <volume>10</volume>
          .1145/3442188.3445922.
        </mixed-citation>
      </ref>
      <ref id="ref108">
        <mixed-citation>
          [115]
          <string-name>
            <given-names>H.</given-names>
            <surname>Suresh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Guttag</surname>
          </string-name>
          ,
          <article-title>A framework for understanding sources of harm throughout the machine learning life cycle</article-title>
          , in: Equity and Access in Algorithms, Mechanisms, and
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>