<!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>LBAD: Demonstrating the Efectiveness of Com mercial Large Language Models for Anglicism Detection</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Alex Lyman</string-name>
          <email>alexlyman@byu.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Anglicisms, Large Language Models, Prompting</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Brigham Young University</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2025</year>
      </pub-date>
      <abstract>
        <p>We present LBAD, an LLM-Based Anglicism Detector, our submission to the ADoBo 2025 shared task at IberLEF 2025. We show that, with careful prompting, commercially available LLMs achieve state-of-theart performance on the task of Anglicism detection. We systematically evaluate the impact of model selection and prompting, including levels of instruction, chain-of-thought reasoning, few-shot learning, and self-refinement. Our experiments reveal that prompt specificity and model selection are critical, with F1 validation scores varying by up to 75 percentage points depending on these two factors. These ifndings highlight the practical efectiveness of commercial LLMs for lexical borrowing detection and provide a generalizable framework for leveraging LLMs in similar natural language processing tasks.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>CEUR
ISSN1613-0073</p>
    </sec>
    <sec id="sec-2">
      <title>1. Introduction</title>
      <p>
        Lexical borrowing, the process by which words from one language are incorporated into another,
is a pervasive linguistic phenomenon driven by cultural, social, and technological interactions
between linguistic communities [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ]. In recent times, the influence of English as a global
lingua franca has led to a significant influx of Anglicisms into many languages worldwide [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>
        The automatic detection of these borrowed terms, particularly unassimilated ones that retain
their original orthography and are not yet fully integrated into the recipient language’s lexicon,
presents a challenge for Natural Language Processing (NLP). Identifying such borrowings
is important for downstream applications, including lexicography, machine translation [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ],
text-to-speech synthesis, [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], and linguistic parsing [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <p>
        The ADoBo (Automatic Detection of Borrowings) shared task series aims to foster research
and development in this area. The second edition of the ADoBo shared task at IberLEF 2025 [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]
specifically focuses on retrieving Anglicisms from Spanish text [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Participants are tasked with
developing systems to identify spans of text in Spanish documents that correspond to words
recently imported from English, such as “running,” “smartwatch,” “fake news,” or “youtuber”
[
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
nEvelop-O
LGOBE
      </p>
      <p>
        The challenge of automatically detecting unassimilated borrowings, especially Anglicisms, in
Spanish has been approached from various perspectives. Early computational methods often
relied on dictionary lookups and rule-based systems [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], which, while useful, can struggle with
neologisms and context-dependent borrowings [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. More recent approaches have explored
machine learning techniques including Conditional Random Fields, language models, and other
neural sequence labeling systems [
        <xref ref-type="bibr" rid="ref12 ref13 ref14">12, 13, 14</xref>
        ].
      </p>
      <p>
        In the years since the first ADoBo challenge, Large Language Models (LLMs) have become
the de facto approach for a variety of research tasks across disciplines. Recent LLMs have
demonstrated human-level (or superhuman) performance on data coding [
        <xref ref-type="bibr" rid="ref15 ref16">15, 16</xref>
        ] and data
analysis [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], and are now being explored to replace research assistants altogether [
        <xref ref-type="bibr" rid="ref18 ref19">18, 19</xref>
        ].
      </p>
      <p>
        While computational NLP tasks have typically been somewhat inaccessible to the general
public, LLMs provide a powerful new tool for non-technical practitioners. LLMs are much more
accessible than traditional machine learning methods. [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]. “Programming” an LLM takes place
in the form of a prompt, as LLMs are typically explicitly trained to follow natural language
instructions [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. Additionally, commercial LLMs can be accessed by anyone with an internet
connection, which means prototyping can begin in a matter of minutes. LLMs have vast stores
of knowledge encompassing syntax, semantics, and commonsense world knowledge, usually
in several languages [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ]. When accessed through an API, querying these models is generally
cost efective, with a typical query for our experiments costing a fraction of a cent. We leverage
these strengths, guided by experimentation across prompts, to create our entry.
      </p>
      <p>Built on commercial LLMs, our submission to the ADoBo 2025 shared task achieves
state-ofthe-art results. We provide a detailed description of our prompt creation process, as well as
experiments across prompt variations and model sizes. While our main focus is on detailing
our approach to prompting LLMs for the task of Anglicism detection in Spanish, we hope to
provide a generalizable example of using commercial LLMs for NLP tasks.</p>
    </sec>
    <sec id="sec-3">
      <title>2. Experiments</title>
      <p>We perform experiments across models and prompt variations. Prompt variations include:
• Baseline prompting
• Prompt with detailed guidelines
• Chain-of-thought prompting
• Few Shot prompting (with a varying number of in-context examples)
• Self-refined prompt</p>
      <p>
        In order to measure the efect of model size, we test on a full sweep of OpenAI’s latest
generation of commercially available models, including reasoning models [
        <xref ref-type="bibr" rid="ref23 ref24">23, 24</xref>
        ]:
• GPT 4.1 nano
• GPT 4.1 mini
• GPT 4.1
• o4 mini
• o3
      </p>
      <p>The ADoBo-25 challenge has no oficial train set, only a development set and a final test set.
For testing purposes, we adapt the ADoBo-25 dev set into our own train, test, and validation sets,
which we call LBAD-train, LBAD-test, and LBAD-valid.1 We do this by randomly shufling
the ADoBo-25 development set and splitting it into thirds. We draw from LBAD-train to find
example Anglicisms for our prompts. Because prompt creation is an iterative process, we test
our prompts and iterate using the LBAD-test set. Finally, we report results on all experiments
in this paper are on LBAD-valid. Because some training and testing occurs on parts of the
ADoBo-25 dev set, we do not report results on the complete dev set. However, because
LBADvalid is randomly drawn from the ADoBo-25 dev set, we assert that results on LBAD-valid are
a reasonable proxy for results on the complete dev set.</p>
      <sec id="sec-3-1">
        <title>2.1. Prompt Variations</title>
        <sec id="sec-3-1-1">
          <title>2.1.1. Baseline Prompt</title>
          <p>All of the prompts in this experiment are built of of the following baseline prompt, adapted
from the ADoBo 2025 task description:</p>
          <p>Given the following Spanish sentence, identify all anglicisms.</p>
          <p>An anglicism is a word or multi-word expression borrowed specifically from
English that has recently been imported into the Spanish language and is
used without orthographic adaptation.</p>
          <p>Examples of anglicisms include 'running', 'smartwatch', 'influencer',
'country managers', 'marketing'.</p>
          <p>This is the sentence to evaluate:
{sentence}
Output only the identified anglicisms, separated by semicolons. If no
anglicisms are found, output 'None'.</p>
        </sec>
        <sec id="sec-3-1-2">
          <title>2.1.2. Detailed Guidelines</title>
          <p>Because modern LLMs are explicitly trained to follow natural language instructions, properly
formalizing and explaining the task is necessary to ensure peak performance.</p>
          <p>
            To create a set of comprehensive guidelines, we pass the entire lexical borrowing annotation
guidelines from the ADoBo 2021 challenge [
            <xref ref-type="bibr" rid="ref11">11</xref>
            ] to R1 1776 [
            <xref ref-type="bibr" rid="ref25">25</xref>
            ], a reasoning LLM fine-tuned from
DeepSeek R1 [
            <xref ref-type="bibr" rid="ref26">26</xref>
            ]. We instruct R1 to comb through the annotation guidelines and summarize
them into a step-by-step protocol for identifying Anglicisms in Spanish text. The full text
of these detailed guidelines can be found in the appendix. We insert the guidelines into the
baseline prompt before the sentence to evaluate.
1Replication materials are available at https://github.com/AlexMLyman/LBAD-ADoBo-2025
          </p>
        </sec>
        <sec id="sec-3-1-3">
          <title>2.1.3. Chain-of-Thought</title>
          <p>
            We perform experiments using Chain-of-thought prompting [
            <xref ref-type="bibr" rid="ref27">27</xref>
            ], a prompting technique that
encourages LLMs to think step-by-step before outputting a final answer. Chain-of-thought
prompting tends to increase model performance across a variety of domains, especially on
complex tasks. We append the following instructions to the end of the prompt to elicit
chain-ofthought reasoning:
          </p>
          <p>First, think step-by-step about which words/phrases might be anglicisms and
why.</p>
          <p>
            After thinking things through, on a new line, output only the identified
anglicisms, separated by semicolons. If no anglicisms are found, output
'None'.
2.1.4. Few-Shot
Language models are capable of in-context learning [
            <xref ref-type="bibr" rid="ref22">22</xref>
            ], (ICL) where the model is able to
perform a task which is demonstrated in the prompt. Because models can learn from a few
examples, this is sometimes referred to as few-shot learning. In-context learning can require
variation in number and type of examples [
            <xref ref-type="bibr" rid="ref28">28</xref>
            ].
          </p>
          <p>We test prompt variations with five, ten, and twenty-five ICL examples. ICL examples were
selected from the LBAD-train dataset using R1 1776, which was instructed to reason through the
entire LBAD-train dataset and select the five, ten, or twenty-five most representative examples
of Anglicism detection. Examples were added to the baseline prompt with the following addition
(right before the sentence to evaluate):</p>
          <p>Here are some example sentences, with the correct output on the line
following the sentences:</p>
        </sec>
        <sec id="sec-3-1-4">
          <title>2.1.5. Self-Refinement</title>
          <p>
            LLMs are capable of refining their own outputs, as well as those of other LLMs. Several
self-refinement frameworks allow LLMs to recursively refine their own prompts [
            <xref ref-type="bibr" rid="ref29 ref30">29, 30</xref>
            ].
          </p>
          <p>Inspired by these frameworks, we begin by testing GPT 4.1 using the prompt with detailed
guidelines on the LBAD-test dataset. We then pass those answers and the ground truth to
R1 1776, and instruct it to classify GPT 4.1’s failure modes and then write a series of helpful
reminders which can be added to the prompt before validation. These reminders are added
to the prompt after the detailed guidelines. The full text of the reminders can be found in the
appendix.</p>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>2.2. Model Selection</title>
        <p>
          LLM performance can vary wildly depending on the size of the model, with smaller models
tending to perform worse than models with more trainable parameters [
          <xref ref-type="bibr" rid="ref31">31</xref>
          ]. To quantify this
efect, we performed all of the above experiments using all three sizes of GPT 4.1 models (nano,
mini, and standard).
        </p>
        <p>
          Reasoning models [
          <xref ref-type="bibr" rid="ref32">32</xref>
          ] are a recent development. These models are explicitly trained to think
through a reasoning process in a manner similar to chain-of-thought reasoning. We test both of
OpenAI’s reasoning models, o4-mini and o3 on our baseline prompt, prompt with instructions,
and our prompt with instructions and reminders.
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>3. Results</title>
      <p>We report F1 scores on LBAD-valid for all experiments. Following the convention from the
task leaderboard, we round all scores to the nearest whole percent. To facilitate comparison
with other entries, we also report precision, accuracy, and F1 scores on the ADoBo 2025 test set
for our best performing prompt/model combination. Tables of all scores, including precision,
recall, and F1 can be found in the appendix.</p>
      <p>An examination of the detailed score breakdown tells us something about commercial LLMs’
strengths. Across all models and prompts, recall scores are high. Most variation in F1 scores
is due to poor precision. In other words, LBAD tends to find almost all anglicisms, but often
misidentifies non-anglicism spans.</p>
      <p>We see a gap in F1 scores between LBAD-valid and the ADoBo-2025 test set, with LBAD-valid
scores being lower. This is attributable to the fact that roughly half of LBAD-valid contains no
anglicisms, but the ADoBo-2025 test set is unbalanced in favor of sentences with Anglicisms.
As a result, the ADoBo-2025 test set is more in line with LBAD’s strengths.</p>
      <sec id="sec-4-1">
        <title>3.1. Qualitative Analysis of Failure Modes</title>
        <p>Qualitative analysis of the best performance on ADoBo-2025 reveals where even the
topperforming model struggles. The o3 model with Guidelines and Reminders fails 25 times. These
failures comprise two main failure modes.</p>
        <sec id="sec-4-1-1">
          <title>3.1.1. Multi-Word Spans</title>
          <p>Several of the failures result from the model misidentifying a multi-word span as two single
word spans, or identifying two single-word spans as one multi-word span. For example in the
sentence "Casual Looks" con bufanda y guantes para triunfar esta temporada the
model is supposed to identify Casual Looks as the Anglicism, but the model identifies Casual
and Looks separately. Seven of the 25 errors (28%) have to do with incorrectly parsing span
boundaries.</p>
        </sec>
        <sec id="sec-4-1-2">
          <title>3.1.2. Confusing Spanish and English words.</title>
          <p>Many words in this set are orthographically identical in English and Spanish. (e.g. normal,
total, error) In these cases, the model will misidentify one or more Anglicisms as Spanish
words. As an example, given the sentence Durante su carrera profesional, también ha
sido socio y director general de Ikea, global director de Apple y director
de Comunicación de Basket Market. the model incorrectly guesses no Anglicisms are
present, though the ground truth is global director. Because global and director are
orthographically the same in Spanish and English, the model fails to detect this Anglicism
although the syntax (global before director is English syntax) provides a clue that this is an
Anglicism. Seventeen of the 25 errors (68%) are partial or complete misidentifications of words
that share cross-lingual orthography.</p>
          <p>These two failure modes explain almost all of LBAD’s errors on the ADoBo-25 test set. It
is likely that additional rounds of prompt refinement could help the model avoid these failure
modes in the future.</p>
        </sec>
      </sec>
      <sec id="sec-4-2">
        <title>3.2. Results by Prompting Technique</title>
        <sec id="sec-4-2-1">
          <title>3.2.1. Detailed Guidelines</title>
          <p>Anglicism detection is a challenging task with many particulars and precise rules. The baseline
prompt relies heavily on models’ inherent knowledge of Anglicisms, since it provides only
an outline of the task. We see evidence of this in the fact that baseline performance tends to
increase with larger models. Larger models have more parameters in which to store information
about the world. Consequently, they have more world knowledge across many topics. This
world knowledge likely includes information about NLP and Anglicisms.</p>
          <p>We find that an in-depth task description, provided in the form of detailed guidelines, is the
best way to teach the task to all LLMs tested. Across models, detailed guidelines tended to cause
an increase in performance between 10 and 45 percentage points over the baseline prompt. This
increase was larger for larger models, which are better able to think through the Anglicism
identification process.
By far, the most important prompt variation for improving performance was chain-of-thought
reasoning. Whether prompt-based or (in the case of reasoning models) explicitly trained, models
utilizing chain-of-thought reasoning performed best. This approach worked best in conjunction
with detailed guidelines, as the detailed guidelines provided a prototype for model reasoning,
and the chain-of-thought helped the models think through the process.
3.2.3. Few-Shot
Few-shot learning was less efective than chain-of-thought reasoning, regardless of the number
of ICL examples. More examples were not necessarily better. Because Anglicism detection
involves many subtleties, it is dificult to learn all of the rules from examples. We note that
ICL examples do not appear to provide additional information when combined with detailed
guidelines. To the contrary, ICL examples when combined with the detailed guidelines often
caused a drop in performance as opposed to the baseline prompt with guidelines, probably by
“confusing” the LLM.</p>
        </sec>
        <sec id="sec-4-2-2">
          <title>3.2.4. Self-Refinement</title>
          <p>Self-Refinement through the form of helpful reminders often increases performance across
models, though the gains are modest. Three of the models improve with reminders, one achieves
the same score, and one decreases by one percentage point. This may be due to a ceiling efect,
as models with worse initial performance gain more from the reminders. These modest results
should not discourage practitioners from trying iterative prompt refinement with LLMs. It
is probable that additional human-based refinement of the reminders would result in greater
performance gains, but that is beyond the scope of our experiments.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>4. Conclusion</title>
      <p>LBAD was the best performing system on the ADoBo-2025 challenge, and was built entirely of
of commercial LLMs. Language models were used not only as the method of evaluation, but also
to summarize the task guidelines, to analyze failure modes, and to select in-context examples.
While LLMs are demonstrably capable of achieving state-of-the-art results, we emphasize that
this capability depends heavily on model and prompt selection. In our experiments, F1 scores
on LBAD-valid ranged from 12 to 90 simply by varying prompt and model choice. This 78
percentage point spread highlights the importance of testing prompts and iterating when using
LLMs for research. The fact that a carefully prompted LLM can achieve SOTA performance on
this task should encourage researchers to consider using LLMs for NLP.</p>
    </sec>
    <sec id="sec-6">
      <title>5. Declaration on Generative AI</title>
      <p>The topic of this work is Generative AI (LLMs) and explores LLM capabilities in the context of
Anglicism Detection. The only use of generative AI on this project was the LLM-based pipeline
described in the paper. AI tools were not used in the drafting or editing of this manuscript.</p>
    </sec>
    <sec id="sec-7">
      <title>A. Full Text of Prompts</title>
      <sec id="sec-7-1">
        <title>A.1. System Prompt</title>
        <p>You are an expert evaluator.</p>
      </sec>
      <sec id="sec-7-2">
        <title>A.2. Rules for Anglicism Identification</title>
        <p>The following rules provide a robust, step-by-step protocol for identifying
emergent, unassimilated English lexical borrowings (anglicisms) in Spanish
text.
1. Initial Identification
- Determine if the word or multiword expression is of English origin or
mimics English word formation.</p>
        <p>- If the word is not of English origin, do not consider it an anglicism.
- If it mimics English formation but does not exist in English
(pseudoanglicism, e.g., balconing), consider it an anglicism.
2. Exclusion of Proper Names and Code-Mixed Inclusions
- If the word is a proper noun (person, organization, product, location,
event, etc.) or a direct code-mixed quotation, do not consider it an
anglicism.
- Borrowings embedded within proper nouns or named entities do not count,
unless the proper noun is part of a multiword borrowing used grammatically
as in English (e.g., Google cooking is annotated).
3. Graphophonological Compliance
- If the word's spelling and pronunciation conform to Spanish
graphophonological rules (e.g., bar, club), proceed to dictionary checks.
- If not (e.g., show, look), generally consider it an anglicism unless it
is a long-registered realia word (see Rule 5).
4. Adaptation and Assimilation Status
- If the word has been morphologically or orthographically adapted to
Spanish (e.g., fútbol, tuit, líder), do not consider it an anglicism.
- If the word remains unadapted, continue to dictionary checks.
5. Dictionary Verification
- If the unadapted word is registered in the Diccionario de la Lengua
Española (DLE):
- If it appears in italics, consider it an anglicism.</p>
        <p>- If it appears without italics and with the relevant meaning, do not
consider it an anglicism (it is considered assimilated).</p>
        <p>- If it is not registered or not with the relevant meaning, consider it
an anglicism.
- For multi-sense words (e.g., top), only consider them an anglicism when
used with unregistered meanings.
6. Realia and Long-Registered Borrowings
- If the word is a long-registered realia borrowing (cultural terms like
jazz, pizza, whisky, club), do not consider it an anglicism, even if
unadapted.
- If the word is a recent or emergent realia borrowing not yet registered,
consider it an anglicism.
7. Multiword Borrowings
- Do consider multiword expressions borrowed as a unit from English (e.g.,
reality show, best seller).
- For adjacent borrowings not forming a fixed English phrase (e.g., look
sporty), select each word separately.
8. Exclusions and Special Cases
- Do not consider an anglicism:</p>
        <p>- Latinisms, scientific units, species names, acronyms (unless part of a
multiword borrowing), or digits in isolation.</p>
        <p>- Metalinguistic usages, literal quotations, or code-switched expressions
not integrated into the sentence.</p>
        <p>- Names of peoples or languages, and words derived transparently from
proper nouns (e.g., un iPhone, un whatsapp).
- Do consider an anglicism:</p>
        <p>- Pseudoanglicisms (Spanish-coined words mimicking English, e.g.,
footing, balconing).</p>
        <p>- Unadapted names of fictitious creatures (e.g., hobbit, troll).
- Borrowings embedded in compounds or prefixed forms, if the borrowed
element retains independence (e.g., ex influencer, nano influencers).</p>
        <p>Because these rules refer to the DLE and dictionary checks, we add the following line to
prevent model confusion:</p>
        <p>The rules refer to dictionary checks. You don't have access to a
dictionary, so do the best you can.</p>
      </sec>
      <sec id="sec-7-3">
        <title>A.3. Additional Reminders From Self Refinement</title>
        <p>Examples of words that are NOT anglicisms include:
- Words fully adapted to Spanish orthography (e.g., 'fútbol', 'líder',
'tuit')
- Long-established borrowings (e.g., 'bar', 'club', 'jazz', 'whisky')
- Proper names of people, places, or companies (e.g., 'Twitter' as a
company name)
- Scientific terminology with Latin or Greek roots
Special rules for digital media and technology:
1. Names of online platforms (e.g., 'Facebook', 'Twitter') are NOT
anglicisms when used as proper nouns to refer to the specific company or
service.
2. However, these names ARE anglicisms when used generically (e.g., "Hizo
un twitter" to mean "He made a tweet").
3. Generic terms related to digital culture ARE anglicisms when they
maintain English form (e.g., 'post', 'blog', 'meme', 'podcast',
'streaming').
4. Terms for social media actions in their English form ARE anglicisms
(e.g., 'like', 'share', 'tweet').</p>
        <p>For multi-word expressions:
1. Analyze whether the entire expression functions as a unified borrowing
from English.
2. Examples of multi-word anglicisms: 'fast food', 'big data', 'home
office', 'fake news'.
3. Do NOT count individual English words that appear adjacent to each other
but do not form a standard expression in English.
4. When in doubt about whether multiple words form a single anglicism,
consider them separately.</p>
        <p>For business, finance, and technical terminology:
1. Recent business terms that maintain English spelling ARE anglicisms
(e.g., 'CEO', 'manager', 'marketing', 'branding', 'broker').
2. Technical computing terms that maintain English spelling ARE anglicisms
(e.g., 'hardware', 'software', 'online', 'web').
3. Industry-specific English jargon ARE anglicisms (e.g., 'blockchain',
'big data', 'know-how').
4. International brand names and trademarks are NOT anglicisms unless used
generically.</p>
        <p>Follow this step-by-step process for identifying anglicisms:
1. First, identify all words and phrases that appear to have English origin.
2. For each candidate term, apply the exclusion criteria (proper names,
adapted words, etc.).
3. For remaining terms, verify they maintain English spelling/pronunciation
patterns.
4. Group related words that form a single expression in English.
5. Verify each term against the specific rules for digital media, business
terms, etc.</p>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>B. Model Details</title>
      <p>All models tested are April checkpoints of OpenAI models.
• gpt-4.1-nano-2025-04-14
• gpt-4.1-mini-2025-04-14
• gpt-4.1-2025-04-14
• o4-mini-2025-04-16
• o3-2025-04-16</p>
    </sec>
    <sec id="sec-9">
      <title>C. Complete Score Reports</title>
      <p>Scores reported in this section are rounded to the nearest whole number.
37
57
51
39
68
67
38
46
42
55
39
47
Baseline
Baseline + Guidelines
Baseline + Guidelines + Reminders</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>E.</given-names>
            <surname>Haugen</surname>
          </string-name>
          ,
          <article-title>The analysis of linguistic borrowing</article-title>
          ,
          <source>Language</source>
          <volume>26</volume>
          (
          <year>1950</year>
          )
          <fpage>210</fpage>
          -
          <lpage>231</lpage>
          . doi:
          <volume>10</volume>
          . 2307/410058.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Poplack</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Sankof</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Miller</surname>
          </string-name>
          ,
          <article-title>The social correlates and linguistic processes of lexical borrowing and assimilation</article-title>
          ,
          <source>Linguistics</source>
          <volume>26</volume>
          (
          <year>1988</year>
          )
          <fpage>47</fpage>
          -
          <lpage>104</lpage>
          . doi:
          <volume>10</volume>
          .1515/ling.
          <year>1988</year>
          .
          <volume>26</volume>
          .1. 47.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>C.</given-names>
            <surname>Furiassi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Pulcini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Rodríguez González</surname>
          </string-name>
          (Eds.),
          <source>The Anglicization of European Lexis</source>
          , John Benjamins Publishing,
          <year>2012</year>
          . doi:
          <volume>10</volume>
          .1075/z.174.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Tsvetkov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Dyer</surname>
          </string-name>
          ,
          <article-title>Cross-lingual bridges with models of lexical borrowing</article-title>
          ,
          <source>Journal of Artificial Intelligence Research</source>
          <volume>55</volume>
          (
          <year>2016</year>
          )
          <fpage>63</fpage>
          -
          <lpage>93</lpage>
          . doi:
          <volume>10</volume>
          .1613/jair.4786.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S.</given-names>
            <surname>Leidig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Schlippe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Schultz</surname>
          </string-name>
          ,
          <article-title>Automatic detection of anglicisms for the pronunciation dictionary generation: A case study on our german it corpus</article-title>
          ,
          <source>in: The 4th Workshop on Spoken Language Technologies for Under-resourced Languages, St. Petersburg, Russia</source>
          ,
          <year>2014</year>
          . URL: https://www.isca-archive.org/sltu_2014/leidig14_sltu.html, sLTU
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>B.</given-names>
            <surname>Alex</surname>
          </string-name>
          ,
          <article-title>Automatic Detection of English Inclusions in Mixed-Lingual Data with an Application to Parsing</article-title>
          ,
          <source>Ph.D. thesis</source>
          , University of Edinburgh,
          <year>2008</year>
          . URL: https://homepages.inf. ed.ac.uk/balex/publications/thesis.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>J.</given-names>
            <surname>Á</surname>
          </string-name>
          .
          <string-name>
            <surname>González-Barba</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Chiruzzo</surname>
            ,
            <given-names>S. M.</given-names>
          </string-name>
          <string-name>
            <surname>Jiménez-Zafra</surname>
          </string-name>
          ,
          <article-title>Overview of IberLEF 2025: Natural Language Processing Challenges for Spanish and other Iberian Languages, in: Proceedings of the Iberian Languages Evaluation Forum (IberLEF 2025), co-located with the 41st Conference of the Spanish Society for Natural Language Processing (SEPLN 2025), CEURWS</article-title>
          . org,
          <year>2025</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>E.</given-names>
            <surname>Álvarez-Mellado</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Porta-Zamorano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Lignos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gonzalo</surname>
          </string-name>
          , Overview of ADoBo at IberLEF 2025:
          <article-title>Automatic Detection of Anglicisms in Spanish</article-title>
          ,
          <source>Procesamiento del Lenguaje Natural</source>
          <volume>75</volume>
          (
          <year>2025</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>ADoBo</given-names>
            <surname>Task</surname>
          </string-name>
          <string-name>
            <surname>Organizers</surname>
          </string-name>
          , ADoBo - Automatic Detection of Borrowings, https://adobo-task. github.io/, n.d.
          <source>Accessed: June 4</source>
          ,
          <year>2025</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J. R. L.</given-names>
            <surname>Serigos</surname>
          </string-name>
          ,
          <article-title>Applying corpus and computational methods to loanword research: new approaches to Anglicisms in Spanish</article-title>
          ,
          <source>Ph.D. thesis</source>
          , The University of Texas at Austin,
          <year>2017</year>
          . URL: http://hdl.handle.net/2152/63064.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>E.</given-names>
            <surname>Álvarez</surname>
          </string-name>
          <string-name>
            <surname>Mellado</surname>
          </string-name>
          ,
          <article-title>Annotation guidelines for lexical borrowings</article-title>
          , https://adobo-task. github.io/docs/guidelines.pdf,
          <year>2021</year>
          . ADoBo shared task at
          <source>IberLEF</source>
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>S.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Cui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Fu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Xiang</surname>
          </string-name>
          , BERT4EVER at ADoBo 2021:
          <article-title>Detection of Borrowings in the Spanish Language Using Pseudo-label Technology</article-title>
          , in: A.
          <string-name>
            <surname>Montoyo</surname>
          </string-name>
          , S. C. E. de la ingeniería, S. E. p. e.
          <source>P. del Lenguaje Natural (Eds.)</source>
          ,
          <source>Proceedings of the IberLEF</source>
          <year>2021</year>
          , volume
          <volume>2943</volume>
          <source>of CEUR Workshop Proceedings, CEUR-WS.org</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>278</fpage>
          -
          <lpage>283</lpage>
          . URL: http: //ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2943</volume>
          /adobo_paper1.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>J. de la Rosa</surname>
          </string-name>
          ,
          <source>ADoBo</source>
          <year>2021</year>
          :
          <article-title>The futility of STILTs for the classification of lexical borrowings in Spanish</article-title>
          , in: A.
          <string-name>
            <surname>Montoyo</surname>
          </string-name>
          , S. C. E. de la ingeniería, S. E. p. e.
          <source>P. del Lenguaje Natural (Eds.)</source>
          ,
          <source>Proceedings of the IberLEF</source>
          <year>2021</year>
          , volume
          <volume>2943</volume>
          <source>of CEUR Workshop Proceedings, CEUR-WS.org</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>284</fpage>
          -
          <lpage>292</lpage>
          . URL: http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2943</volume>
          /adobo_paper2.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>E.</given-names>
            <surname>Álvarez-Mellado</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Lignos</surname>
          </string-name>
          ,
          <article-title>Detecting unassimilated borrowings in Spanish: An annotated corpus and approaches to modeling</article-title>
          , in: S. Muresan,
          <string-name>
            <given-names>P.</given-names>
            <surname>Nakov</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Villavicencio (Eds.),
          <source>Proceedings of the 60th 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>
          ,
          <source>Association for Computational Linguistics</source>
          , Dublin, Ireland,
          <year>2022</year>
          , pp.
          <fpage>3868</fpage>
          -
          <lpage>3888</lpage>
          . URL: https://aclanthology.org/
          <year>2022</year>
          .
          <article-title>acl-long</article-title>
          .
          <volume>268</volume>
          /. doi:
          <volume>10</volume>
          . 18653/v1/
          <year>2022</year>
          .
          <article-title>acl-long</article-title>
          .
          <volume>268</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>P.</given-names>
            <surname>Törnberg</surname>
          </string-name>
          ,
          <article-title>Large language models outperform expert coders and supervised classifiers at annotating political social media messages</article-title>
          ,
          <source>Social Science Computer Review</source>
          <volume>0</volume>
          (
          <issue>0</issue>
          )
          <fpage>08944393241286471</fpage>
          . doi:
          <volume>10</volume>
          .1177/08944393241286471.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>M.</given-names>
            <surname>Heseltine</surname>
          </string-name>
          ,
          <string-name>
            <surname>B. C.</surname>
          </string-name>
          von Hohenberg,
          <article-title>Large language models as a substitute for human experts in annotating political text</article-title>
          ,
          <source>Research &amp; Politics</source>
          <volume>11</volume>
          (
          <year>2024</year>
          )
          <article-title>20531680241236239</article-title>
          . doi:
          <volume>10</volume>
          .1177/20531680241236239.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>B. E.</given-names>
            <surname>Perron</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Luan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. G.</given-names>
            <surname>Victor</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Hiltz-Perron</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Ryan</surname>
          </string-name>
          ,
          <article-title>Moving beyond chatgpt: Local large language models (llms) and the secure analysis of confidential unstructured text data in social work research</article-title>
          ,
          <source>Research on Social Work Practice</source>
          (
          <year>2024</year>
          ). URL: https: //doi.org/10.1177/10497315241280686. doi:
          <volume>10</volume>
          .1177/10497315241280686.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>S.</given-names>
            <surname>Schmidgall</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Su</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          , E. Barsoum, Agent laboratory:
          <article-title>Using llm agents as research assistants</article-title>
          ,
          <year>2025</year>
          . URL: https://arxiv.org/abs/2501. 04227. arXiv:
          <volume>2501</volume>
          .
          <fpage>04227</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>S.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Sahu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Puri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. H.</given-names>
            <surname>Laradji</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. D.</given-names>
            <surname>Dvijotham</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Stanley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Charlin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Pal</surname>
          </string-name>
          ,
          <article-title>Litllms, llms for literature review: Are we there yet</article-title>
          ?,
          <year>2025</year>
          . URL: https://arxiv.org/abs/2412. 15249. arXiv:
          <volume>2412</volume>
          .
          <fpage>15249</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>L. P.</given-names>
            <surname>Argyle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. C.</given-names>
            <surname>Busby</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. R.</given-names>
            <surname>Gubler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Hepner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Lyman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Wingate</surname>
          </string-name>
          , Arti-”
          <article-title>fickle” intelligence: Using llms as a tool for inference in the political</article-title>
          and
          <source>social sciences</source>
          ,
          <year>2025</year>
          . URL: https://arxiv.org/abs/2504.03822. arXiv:
          <volume>2504</volume>
          .
          <fpage>03822</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <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, 2022</article-title>
          . URL: https://arxiv.org/abs/2203.02155. arXiv:
          <volume>2203</volume>
          .
          <fpage>02155</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <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>
            <surname>I. Sutskever</surname>
          </string-name>
          ,
          <article-title>Language models are unsupervised multitask learners</article-title>
          ,
          <year>2020</year>
          . URL: https://storage.prod.researchhub.com/uploads/ papers/2020/06/01/language-models.
          <source>pdf.</source>
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <surname>OpenAI</surname>
          </string-name>
          , Gpt-
          <volume>4</volume>
          .1, https://openai.com/index/gpt-4-1/,
          <year>2025</year>
          .
          <article-title>Large language model with 1M token context window</article-title>
          ,
          <source>released April 14</source>
          ,
          <year>2025</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <surname>OpenAI</surname>
          </string-name>
          ,
          <article-title>Introducing openai o3 and o4-mini</article-title>
          , https://openai.com/index/ introducing-o3
          <string-name>
            <surname>-</surname>
          </string-name>
          and
          <string-name>
            <surname>-</surname>
          </string-name>
          o4-mini/,
          <year>2025</year>
          . Accessed:
          <fpage>2025</fpage>
          -05-14.
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <surname>P. AI</surname>
          </string-name>
          , R1
          <volume>1776</volume>
          :
          <article-title>An uncensored version of deepseek-r1</article-title>
          , https://huggingface.co/perplexity-ai
          <source>/ r1-1776</source>
          ,
          <year>2025</year>
          .
          <article-title>Open-source language model post-trained to remove censorship constraints</article-title>
          .
          <source>Accessed June</source>
          <year>2025</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <surname>DeepSeek-AI</surname>
          </string-name>
          , et al.,
          <string-name>
            <surname>Deepseek-</surname>
          </string-name>
          r1:
          <article-title>Incentivizing reasoning capability in llms via reinforcement learning</article-title>
          ,
          <source>arXiv:2501.12948</source>
          (
          <year>2025</year>
          ). URL: https://arxiv.org/abs/2501.12948.
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <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>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bosma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Ichter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Xia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Chi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</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>
          ,
          <year>2023</year>
          . URL: https: //arxiv.org/abs/2201.11903. arXiv:
          <volume>2201</volume>
          .
          <fpage>11903</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Dong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zheng</surname>
          </string-name>
          , J. Ma,
          <string-name>
            <given-names>R.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Xia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Sui</surname>
          </string-name>
          ,
          <article-title>A survey on in-context learning</article-title>
          , in: Y.
          <string-name>
            <surname>Al-Onaizan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Bansal</surname>
            ,
            <given-names>Y.-N.</given-names>
          </string-name>
          <string-name>
            <surname>Chen</surname>
          </string-name>
          (Eds.),
          <source>Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing</source>
          , Association for Computational Linguistics, Miami, Florida, USA,
          <year>2024</year>
          , pp.
          <fpage>1107</fpage>
          -
          <lpage>1128</lpage>
          . URL: https://aclanthology.org/
          <year>2024</year>
          .emnlp-main.
          <volume>64</volume>
          /. doi:
          <volume>10</volume>
          .18653/v1/
          <year>2024</year>
          .emnlp- main.64.
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yuan</surname>
          </string-name>
          , A. C.-C. Yao,
          <article-title>Meta prompting for ai systems</article-title>
          ,
          <year>2025</year>
          . URL: https://arxiv. org/abs/2311.11482. arXiv:
          <volume>2311</volume>
          .
          <fpage>11482</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>A.</given-names>
            <surname>Madaan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Tandon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Gupta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Hallinan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wiegrefe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>U.</given-names>
            <surname>Alon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Dziri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Prabhumoye</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gupta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. P.</given-names>
            <surname>Majumder</surname>
          </string-name>
          , K. Hermann,
          <string-name>
            <given-names>S.</given-names>
            <surname>Welleck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Yazdanbakhsh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Clark</surname>
          </string-name>
          ,
          <article-title>Self-refine: Iterative refinement with self-feedback</article-title>
          ,
          <year>2023</year>
          . URL: https://arxiv.org/abs/2303.17651. arXiv:
          <volume>2303</volume>
          .
          <fpage>17651</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>J.</given-names>
            <surname>Kaplan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>McCandlish</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Henighan</surname>
          </string-name>
          , T. B.
          <string-name>
            <surname>Brown</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Chess</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Child</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Gray</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Radford</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Amodei</surname>
          </string-name>
          ,
          <article-title>Scaling laws for neural language models</article-title>
          ,
          <year>2020</year>
          . URL: https://arxiv.org/ abs/
          <year>2001</year>
          .08361. arXiv:
          <year>2001</year>
          .08361.
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>M.</given-names>
            <surname>Besta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Barth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Schreiber</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kubicek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Catarino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Gerstenberger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Nyczyk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>If</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Houliston</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Sternal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Copik</surname>
          </string-name>
          , G. Kwaśniewski,
          <string-name>
            <given-names>J.</given-names>
            <surname>Müller</surname>
          </string-name>
          , Łukasz Flis,
          <string-name>
            <given-names>H.</given-names>
            <surname>Eberhard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Niewiadomski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Hoefler</surname>
          </string-name>
          ,
          <source>Reasoning language models: A blueprint</source>
          ,
          <year>2025</year>
          . URL: https://arxiv.org/abs/2501.11223. arXiv:
          <volume>2501</volume>
          .
          <fpage>11223</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>