<!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>Towards LLM-driven Natural Language Generation based on SPARQL Queries and RDF Knowledge Graphs</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Aleksandr Perevalov</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andreas Both</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>DATEV eG</institution>
          ,
          <addr-line>Nuremberg</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Leipzig University of Applied Sciences (HTWK Leipzig)</institution>
          ,
          <addr-line>Karl-Liebknecht-Straße 132, 04277 Leipzig</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>Generating natural language based on structured data has been utilized in many use cases such as data augmentation, explainability, and education. In particular, when speaking about Knowledge Graphs, one may generate natural language representation of triples (i.e., facts) or “verbalize” SPARQL queries. The latter can be treated as a reverse semantic parsing task and, for instance, can be used by non-experts to better understand the meaning of SPARQL queries, and conduct data augmentation for question answering benchmarking datasets. In this paper, we make a first attempt to utilize Large Language Models for verbalizing SPARQL queries, i.e., converting them to natural language. The experimental setup uses both commercial and open-source models and benefits from multiple prompting techniques. We evaluate our approach on the well-known question answering datasets QALD-9-plus and QALD-10 while working with three languages: English, German, and Russian. For measuring the quality, we use machine translation metrics and human evaluation (survey) together. Even though we have observed such error classes as question overspecification, language and semantic mismatch, the results of this work suggest that Large Language Models (LLMs) are a good fit for the task of converting SPARQL queries to natural language.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;SPARQL to Natural Language</kwd>
        <kwd>SPARQL verbalization</kwd>
        <kwd>RDF2NL</kwd>
        <kwd>Text Generation</kwd>
        <kwd>Large Language Models</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        An increasing number of applications depend on RDF data and utilize the W3C SPARQL
standard to query that data. Although SPARQL is a potent instrument for those with the
required technical (and domain) expertise, it continues to be challenging for novice or
nontechnical users to comprehend the query semantics. This challenge is partially covered by
semantic parsing-based Question Answering over Knowledge Graphs (KGQA) – such systems
convert a natural-language (NL) question to a SPARQL query to retrieve the answer of the
user’s information need [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. A user of a KGQA system is not required to know SPARQL at all,
however, such systems have limited abilities in terms of answer quality and mostly fail to cover
very complex information needs (e.g., involving aggregation, sub-queries, non-trivial property
paths) [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Another way to address the challenge of better understanding of SPARQL is to make
the process of writing queries more transparent by converting a written query back to a NL, i.e.,
verbalizing it. Such an approach is highly relevant when it comes to explainability: a SPARQL
user may get a better understanding of what is query is intended to return when working with
its NL verbalization.
      </p>
      <p>
        In this work, we present an approach for converting SPARQL queries to NL. The ultimate goal
of our approach is to provide the end users with better explainability and transparency when
working with SPARQL queries. In contrast to previous studies, we focus on leveraging Large
Language Models (LLMs) for NL generation and use knowledge injection method [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Speaking
specifically about SPARQL query verbalizations, we derive the following types: high-level and
low-level. The low-level verbalizations are aimed at users with proficiency in SPARQL and used
for deep technical understanding of a query with the means of NL and use technical terms (URI,
subclass of, modifier, etc.). In its turn, the high-level verbalizations are aimed at users that have
no or very few knowledge about SPARQL and are represented with general-domain NL having
no or very few technical terms. Our approach is aimed at creating the high-level verbalizations,
which also can be referred to as reverse semantic parsing task. In our study, we assessed our
method using the renowned KGQA datasets, QALD-9-plus [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and QALD-10 [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], focusing on
three languages: English, German, and Russian. To gauge the quality of our approach, we
combined machine translation metrics (e.g., sentence BLEU and NIST, Rouge L, Levenshtein
distance) and human assessments through survey. Although we encountered various types of
errors, the findings from our research indicate that LLMs combined with knowledge injection
are well-suited for the job of transforming SPARQL queries into NL.
      </p>
      <p>This paper aims to answer the following research questions:
RQ1 Is it possible to generate SPARQL query verbalizations using LLMs and knowledge
injection?
RQ2 How to measure the quality of the generated verbalizations?
RQ3 What error classes are contained in the generated results?</p>
      <p>This paper is structured as follows. In Section 2, we summarize related work on converting
SPARQL to NL. Thereafter, in Section 3, we present an overview of the approach proposed by us.
The experimental setup is described in Section 4, which is followed by the analysis in Section
5. Finally, we discuss and conclude our work in Section 6. For the sake of reproducibility, we
publish our code and data online1.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        The previous work on the topic of conversion of SPARQL queries to NL was mostly based on
grammar rules and relatively small language models (LMs). The paper by Ngonga Ngomo et al.
[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] presents an approach called “SPARQL2NL”. The approach involves a preliminary step that
standardizes the query and identifies the types of data it contains, followed by a stage where a
1https://anonymous.4open.science/r/SPARQL-to-NL-F3B3
universal form of the query is created. Afterward, a refining phase employs simplification and
substitution principles to enhance the clarity of the expression. Lastly, the process concludes
with a production phase that formulates the ultimate version of the query in NL.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] more general objectives of verbalizing OWL and RDF vocabularies in addition to
SPARQL are targeted. The proposed approach is called “LD2NL” and also follows a
sequential process, which contains lexicalization, single triples realization, clustering, ordering, and
grouping operations such that the resulting text looks like a full-fledged NL. The quality of the
generated text was measured through a survey that included both experts and non-experts in
the Semantic Web field.
      </p>
      <p>
        The paper by Moussallem et al. [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] focuses on a similar task as the LD2NL approach. However,
the implementation here is based on an encoder-decoder architecture, which uses an encoder
inspired by Graph Attention Networks (GANs) and a Transformer as decoder. The proposed
approach is called NABU. The authors conduct their experiments in German, Russian, and
English, and evaluate the quality using the BLEU score.
      </p>
      <p>
        The work by Lecorvé et al. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] concentrates on creating NL questions from SPARQL queries,
with a particular interest in conversational applications such as follow-up question-and-answer
interactions. The authors used the pre-trained T5 [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] and BART [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] LMs with no-context
and full-context prompts (cf [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]). The resulting questions’ quality was measured automatically
with METEOR [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] and BERTScore [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] as well as using manual evaluation. The findings from
both automated metrics and assessments by people indicate that while simple inquiries and
common SPARQL query patterns are typically well managed, more intricate queries and aspects
of dialogue, such as coreferences and ellipses, continue to pose challenges.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. LLM-driven Natural Language Generation based on SPARQL queries</title>
      <p>In this section, we describe our approach for NL generation for SPARQL queries. The general
idea of the approach is to enable LLMs to (1) “comprehend” the initial information need, which
is encapsulated within a SPARQL query, and (2) to formulate the information need as a NL
question. To achieve this, we propose the instruction-tuned LLMs by designing prompts that
follow the knowledge injection pattern. In particular, the knowledge injection is implemented
as the integration of human-readable representations of URIs mentioned in a SPARQL query to
a prompt. This is needed to make sure that a LLM is not dealing with unseen “anonymous” URIs
(e.g., http://www.wikidata.org/entity/Q567). In addition, we distinguish between “of-the-shelf”
and fine-tuned LLMs. In our approach, we fine-tune the models based on the same prompts with
an addition of the gold-standard NL at the end.</p>
      <p>Figure 1 demonstrates a “big picture” of our approach. Here, we first use prompt preparation
that (1) parses a given SPARQL query from a dataset, (2) utilizes a knowledge graph (KG) for
fetching the URI to label mappings (e.g., Wikidata), and (3) generates the final prompt following
a pre-defined template. Thereafter, the generated prompt is passed to a LLM, which produces a
NL question intended to represent the semantics of the SPARQL query. The generated question
is then compared to a gold standard with a particular metric, which has to measure the semantic
meaning of both texts. In the next section, we present a detailed experimental setup for our
URI to</p>
      <p>Label
mapping</p>
      <p>Prompt Preparation</p>
      <p>Generated prompt
with knowledge
injection</p>
      <p>Having a SPARQL query: {query} Where:
wd:Q22686 has human-readable name 'Donald Trump'
wdt:P40 has human-readable name 'child'
Transform the SPARQL query to a natural language question.</p>
      <p>Output just the transformed question
Large Language Model Generated</p>
      <p>Question</p>
      <p>List URIs of children of</p>
      <p>Donald Trump
off-the-shelf
fine-tuned</p>
      <p>Similarity
metric</p>
      <p>XX%
SELECT ?uri WHERE {</p>
      <p>wd:Q22686 wdt:P40 ?uri
}</p>
      <p>SPARQL
Query</p>
      <p>Dataset</p>
      <p>Gold
Standard
Question</p>
      <p>Give me children of</p>
      <p>Donald Trump</p>
    </sec>
    <sec id="sec-4">
      <title>4. Experimental Setup</title>
      <p>In this section, we describe datasets, methods, and tools that we use to conduct our experiments.</p>
      <sec id="sec-4-1">
        <title>4.1. Datasets</title>
        <p>
          In our work, we used two datasets for evaluation, namely, QALD-9-plus [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] and QALD-10 [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
Both datasets contain NL questions in multiple languages and SPARQL queries that answer the
respective information needs.
        </p>
        <p>
          The QALD-9-plus dataset is based on QALD-9 [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ], which contains 558 questions and initially
covers only DBpedia. It improves and extends its translations to eight languages (English,
German, French, Russian, Ukrainian, Lithuanian, Belarusian, Bashkir, and Armenian), and also
added the SPARQL queries for the Wikidata KG2. The translations and their validation were
done using the crowd-sourcing approach, where the participating crowd-workers were native
speakers of the respective languages. The dataset also follows the QALD JSON structure3.
        </p>
        <p>
          The QALD-10 dataset [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] introduces 402 new questions in English, Chinese, German, and
Russian. The questions and SPARQL queries were written by native speakers and domain
experts. The dataset also follows the QALD JSON structure.
2https://www.wikidata.org/
3https://github.com/dice-group/gerbil/wiki/Question-Answering#web-service-interface
{
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Prompt Construction</title>
        <p>In our experiments, the prompts are created based on templates for each of the considered
languages. In terms of prompts engineering, we use two diferent settings, zero-shot and
oneshot. The prompt templates for both settings contain common parts such as “head”, “list”, and
“tail” (see Figures 2a and 2b). While the “head” introduces a SPARQL query and the “tail” defines
the instruction, the “list” contains the knowledge injection part. In particular, there were present
mappings between all the mentioned URIs in a query to a human-readable representation. As
all the SPARQL queries that we use for evaluation are for Wikidata, we utilize rdfs:label for
retrieving the corresponding human-readable representations and putting them to the prompt.
Hence, the “list” part of the prompt is repeated for each of the URIs in a SPARQL query.</p>
        <p>The one-shot setting contains an additional part, which is called “shot” (see Figure 2b). The
“shot” is fulfilled recursively through the zero-shot template. However, for the “shot” also the
gold-standard question is appended as an example. All the prompt parts for both settings are
concatenated together in one string, following the same order as in the templates.</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Access to Large Language Models</title>
        <p>
          Mistral-7B [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] is a 7–billion-parameter LLM. It demonstrates that a carefully designed language
model is able, firstly, to deliver high performance while maintaining an eficient inference and,
secondly, compress knowledge more than what was previously thought. It outperforms the
previous best 13B model, LLaMA 2 [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ], across all tested benchmarks. For our experiments,
we use the oficial Mistral-7B-Instruct-v0.24 loaded in 4-bit setting. In our
experimental setup, we fine-tune the Mistral-7B model (Mistral-7B FT) on the training subset of the
QALD-9-plus dataset. For this purpose, we use the aforementioned prompt templates that are
4https://huggingface.co/mistralai/Mistral-7B-Instruct-v0.2
complemented with a gold-standard NL at the end. The following parameters were used for the
ifne tuning: EPOCHS=2, BATCH_SIZE=8, WARMUP_STEPS=0.03, LEARNING_RATE=2E-4. The
ifne-tuning process was done following the PEFT method[
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] with the following parameters:
LORA_ALPHA=16, LORA_DROPOUT=0.1, TASK_TYPE=CASUAL_LM.
        </p>
        <p>
          The GPT-3 model [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] is a 175-billion-parameter, autoregressive LLM. For all tasks, it is
applied without fine-tuning, with tasks and few-shot demonstrations specified purely via text
interaction with the model. GPT-3 (evolved to GPT-3.5 [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ]) showed strong performance on
many NLP tasks and benchmarks in the zero-shot, one-shot, and few-shot settings.
        </p>
        <p>
          The GPT-4 model released in 2023 [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] represents a large multimodal language model capable
of processing image and text inputs and producing text outputs. Similarly to its previous
versions, this is a transformer-based model pre-trained to predict the next token in a document.
        </p>
      </sec>
      <sec id="sec-4-4">
        <title>4.4. Evaluation and Metrics</title>
        <p>In this section, we describe the evaluation process and metrics that we use in our experiments.
Every NL question generated by a LLM is compared to a gold-standard question, which is
provided in the used datasets.</p>
        <sec id="sec-4-4-1">
          <title>4.4.1. Automatic Metrics</title>
          <p>
            For the automatic evaluation of our approach, we use machine translation metrics, namely,
Sentence BLEU [
            <xref ref-type="bibr" rid="ref21">21</xref>
            ], NIST [
            <xref ref-type="bibr" rid="ref22">22</xref>
            ] (implementation via NLTK5), Rouge L [
            <xref ref-type="bibr" rid="ref23">23</xref>
            ] (implementation via
Python Rouge6), and Levenshtein Distance [
            <xref ref-type="bibr" rid="ref24">24</xref>
            ] (implementation via Python Levenshtein7). The
aforementioned metrics are used to quantify the performance of algorithms in tasks such as
translation, summarization, and other language processing applications that require comparison
between generated text and reference text, therefore, they fit to our task as well.
          </p>
        </sec>
        <sec id="sec-4-4-2">
          <title>4.4.2. Human Semantic Evaluation</title>
          <p>The manual human evaluation is defined as follows, we randomly selected 100 NL questions
from the QALD-9-plus test split for each of the following parameter combination: model (e.g.,
Mistral-7B) and prompt type (e.g., zero-shot). Thereafter, each of the paper authors manually
compared the generated NL with the gold standard. Therefore, the human decision is binary. It
is worth mentioning that due to limited resources within this work, we conducted the human
evaluation only for the English language.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Analysis</title>
      <sec id="sec-5-1">
        <title>5.1. Performance of LLMs Measured with Automatic Metrics</title>
        <p>Based on the values obtained with the automatic metrics, we compared diferent experimental
settings of our approach. In particular, what is the quality diference between zero-shot and
one5https://www.nltk.org/
6https://pypi.org/project/rouge/
7https://pypi.org/project/python-Levenshtein/
2.5
shot settings, and how well the considered models perform on diferent languages. Regarding
the Mistral-7B model, we also compared the efect of the fine-tuning process on the quality.</p>
        <p>Figure 3 clearly demonstrates the positive efect of using one-shot prompts in comparison
to the zero-shot setting. For the models except Mistral-7B, the one-shot setting demonstrates
a significant quality improvement measured by the automatic metrics. The worse Mistral-7B
performance w.r.t. the one-shot may be caused by its limited capabilities in comparison to the
GPT models.</p>
        <p>Figure 4 highlights the performance of the models while looking at diferent languages that
we considered in our experiments. As we naturally assumed, the NL generation of English
questions leads to a better quality than the German ones. The worst quality was achieved on
the Russian questions, which may happen due to its lower presence in the NLP community as
well as the diferent language families and used alphabet.</p>
        <p>
          As both Figures 3 and 4 suggest, the GPT-4 model outperforms the other LLMs regarding the
NL generation quality. In turn, the worst generation quality is demonstrated by the Mistral-7B
model. This is partially caused by the significant size diference between the considered models.
Although the number of parameters for the GPT-3.5 and GPT-4 models is not public, the previous
model, GPT-3, was reported as a 175 billion parameter model [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ]. Hence, this is 25 times larger
than the Mistral-7B model. Surprisingly, the fine-tuning of the Mistral-7B model resulted to
a quality decrease. In the following section, we will refer to this situation with a qualitative
analysis of the Mistral-7B FT outputs.
        </p>
      </sec>
      <sec id="sec-5-2">
        <title>5.2. Human Semantic Evaluation</title>
        <p>The human evaluation results correspond to the fact that the given percentage of generated
NL questions semantically correspond to the original gold-standard questions. In Table 1 we
demonstrate the human evaluation results per model and prompt type.</p>
        <p>The values confirm the previous findings from the automated metrics regarding the model
performance (GPT-4 – best quality, Mistral-7B– worst). In addition, the human evaluation
scores also confirm the quality increase when using a one-shot setting for the GPT models and
a reverse efect for the Mistral-7B. While manually investigating the quality decrease when
applying fine-tuning procedure to the Mistral-7B model, we have identified that the fine-tuned
model produces much more “heavy” hallucinations i.e., when the output is not even partially
represents the gold-standard semantics. On the other hand, the surface form of the generated
NL questions that appeared to be semantically correct was very close to the gold-standard i.e.,
the paraphrasing efect was minimal.</p>
        <p>Despite the human evaluation results confirming the findings obtained on the automatic
metrics, we calculated the correlation between these two diferent evaluation techniques. While
considering the values from Table 2 one may observe that the correlation coeficients between
the automatic metrics and human evaluation difer among the LLMs. This fact may correspond
to the diferent language generation patterns of the LLMs, which from one side are captured by
the human evaluation and are not captured by the automatic metrics.</p>
      </sec>
      <sec id="sec-5-3">
        <title>5.3. Error Analysis</title>
        <p>While conducting the human evaluation we discovered and summarized the following error
classes in the NL generation process: (1) overspecification, (2) language mismatch, and (3)
semantic mismatch. An example for each of the error classes is given in Figure 5.</p>
        <sec id="sec-5-3-1">
          <title>5.3.1. Overspecification</title>
          <p>This error class represents the NL questions that contain the following drawbacks. Firstly,
patterns, are directly copied from a query (e.g., “child of a child” instead of “grandchild”).
Secondly, occurrence specific terminology, e.g., “instance of”, “list all URIs”, etc. Finally, usage
of a KG identifier in a generated NL representation, e.g., “Q1234”.</p>
        </sec>
        <sec id="sec-5-3-2">
          <title>5.3.2. Language Mismatch</title>
          <p>This error class denotes the cases when the generated NL is in a language other than the initial
prompt. For instance, prompting in German or Russian to the Mistral-7B model often leads to
the results in English. Another case is when such English NL questions contain named entity
labels in the original language.</p>
          <p>(a) An example of the overspecification error class
Prompt (Mistral-7B zero-shot):
Gegeben ist die SPARQL-Anfrage:
SELECT DISTINCT ?res WHERE { wd:Q1163227 wdt:P50 ?res. }
Dabei gilt:
Die Bezeichnung von wd:Q1163227 ist "Die Säulen der Erde"
Die Bezeichnung von wdt:P50 ist "Autor"
Transformiere die SPARQL-Anfrage in eine Frage in natürlicher Sprache.
Gib nur die transformierte Frage aus.</p>
          <p>Generated NL:
What are the distinct authors of "Die Säulen der Erde" (wd:Q1163227)?
Gold Standard NL:
Wer schrieb die Säulen der Welt?</p>
          <p>(b) An example of the language mismatch error class
Prompt (GPT-4 zero-shot):
Having a SPARQL query:
SELECT DISTINCT ?uri ?institute
WHERE { wd:Q76 wdt:P26/wdt:P69/wdt:P361* ?uri .
?uri wdt:P31*/wdt:P279* wd:Q3918 . }
Where:
wd:Q76 has human-readable name "Barack Obama"
wdt:P26 has human-readable name "spouse"
wdt:P69 has human-readable name "educated at"
wdt:P361 has human-readable name "part of"
wdt:P31 has human-readable name "instance of"
wdt:P279 has human-readable name "subclass of"
wd:Q3918 has human-readable name "university"
Transform the SPARQL query to a natural language question.</p>
          <p>Output just the transformed question
Generated NL:
Which universities are either attended by Barack Obama or his spouse,
or are part of an institution that they attended?
Gold Standard NL:
What is the name of the university where Obama's wife studied?
(c) An example of the semantic mismatch error class</p>
        </sec>
        <sec id="sec-5-3-3">
          <title>5.3.3. Semantic Mismatch</title>
          <p>This error class covers the generated questions that from one side look as full-fledged NL,
however, either make no sense (i.e., hallucinated) or slightly change the original semantics,
which leads to a diferent information need.</p>
        </sec>
      </sec>
      <sec id="sec-5-4">
        <title>5.4. Analysis of SPARQL Structure and Performance</title>
        <p>While dealing with SPARQL queries, we analyzed how their diferent features afect the NL
generation quality. In particular, we considered the following SPARQL query features: (a)
presence of PREFIX, (b) query type (SELECT or ASK), (c) number of triples, (d) presence of
ORDER BY, (e) presence of LIMIT and OFFSET, and (f) presence of HAVING statement. All the
listed query features are binary except the number of triples, however, there the maximal value
is four. Therefore, we were able to analyze the automatic metrics’ values while diferentiating
between diferent values of a given query feature.</p>
        <p>Based on Pearson’s correlation coeficient (  ), we identified the linear relationship between
the query features and the quality metrics. The correlation analysis demonstrated that there is
a very weak relationship between the SPARQL features and automatic quality metrics, i.e., the 
does not exceed the absolute value of 0.14 (for Rouge-L and presence of LIMIT and OFFSET
statements). However, the aforementioned correlation coeficient represents only a linear
relationship. Therefore, we decided to visualize how the quality scores difer when comparing
the respective values of the query features. We identified the most significant diference when
considering the (c) number of triples and (f) presence of HAVING statement. We present the
corresponding visualization in Figure 6).</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Discussion and Conclusion</title>
      <p>In this paper, we addressed the task of explaining/verbalizing SPARQL queries. Using our
approach, it is possible to create natural-language representations for public or private Knowledge
0.5
0.4
0.3
0.2
0.1
0.0
2.5
2.0
1.5
1.0
False
having_presence 0.5</p>
      <p>False
True 0.0
True
Graphs while providing the labels of resources. Hence, there are low prerequisites for applying
our approach in practice.</p>
      <p>While answering RQ1, we refer to Section 5.1 and 5.2. According to the evaluation values,
which demonstrated high-quality NL generation results, we confirm it is possible to generate
SPARQL query verbalizations using LLMs and knowledge injection technique.</p>
      <p>
        To answer RQ2, we also refer to Section 5.3. Naturally, human evaluation serves as the most
suitable method for measuring the quality of the generated verbalizations. As this process is
expensive in every sense, one may utilize MT metrics instead. The drawback of such metrics is
that they have a doubtful correlation (from very weak to moderate) with the human evaluation.
Considering the error analysis, such metrics also do not recognize the listed error classes
properly. Hence, there is obviously a research gap in creating such a metric that measures
semantic aspects of two NL texts (cf. BERTScore [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]).
      </p>
      <p>Finally, while answering RQ3, we also refer to Section 5.3. In particular, we have identified and
demonstrated three error classes (1) overspecification, (2) language mismatch, and (3) semantic
mismatch, which have to be considered when doing further research in this direction.</p>
      <p>Despite our approach demonstrating a successful result when applying LLMs for converting
SPARQL queries to NL, it has several limitations. In particular, our approach fully depends on
labels of a target KG. Moreover, each resource in a KG may have more than one label, which
makes it non-trivial to decide which one to use (not always the preferred label is a perfect
choice). The human evaluation in this work is limited only to the English language and was
done only by the authors. This obviously biases the results towards the domain-expert users.</p>
      <p>For future work, we will cover the aforementioned limitations and will focus on introducing
better metrics for measuring the semantic meaning of a NL text generated based on a SPARQL
query. Specifically, such a metric has to prove a better correlation with human decisions.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Perevalov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Both</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.-C. N.</given-names>
            <surname>Ngomo</surname>
          </string-name>
          ,
          <article-title>Multilingual question answering systems for knowledge graphs-a survey (</article-title>
          <year>2024</year>
          ). URL: https://www.semantic
          <article-title>-web-journal</article-title>
          .net/system/ ifles/swj3633.pdf, under review.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Perevalov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Yan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Kovriguina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Both</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Usbeck</surname>
          </string-name>
          ,
          <article-title>Knowledge graph question answering leaderboard: A community resource to prevent a replication crisis</article-title>
          , in: N.
          <string-name>
            <surname>Calzolari</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Béchet</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Blache</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Choukri</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Cieri</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Declerck</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Goggi</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Isahara</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Maegaard</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Mariani</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Mazo</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Odijk</surname>
          </string-name>
          , S. Piperidis (Eds.),
          <source>Proceedings of the Thirteenth Language Resources and Evaluation Conference</source>
          , European Language Resources Association, Marseille, France,
          <year>2022</year>
          , pp.
          <fpage>2998</fpage>
          -
          <lpage>3007</lpage>
          . URL: https://aclanthology.org/
          <year>2022</year>
          .lrec-
          <volume>1</volume>
          .
          <fpage>321</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Martino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Iannelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Truong</surname>
          </string-name>
          ,
          <article-title>Knowledge injection to counter large language model (llm) hallucination</article-title>
          , in: C. Pesquita,
          <string-name>
            <given-names>H.</given-names>
            <surname>Skaf-Molli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Efthymiou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kirrane</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ngonga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Collarana</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Cerqueira</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Alam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Trojahn</surname>
          </string-name>
          , S. Hertling (Eds.),
          <source>The Semantic Web: ESWC 2023 Satellite Events</source>
          , Springer Nature Switzerland, Cham,
          <year>2023</year>
          , pp.
          <fpage>182</fpage>
          -
          <lpage>185</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Perevalov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Diefenbach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Usbeck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Both</surname>
          </string-name>
          , QALD-9
          <article-title>-plus: A multilingual dataset for question answering over DBpedia and Wikidata translated by native speakers</article-title>
          ,
          <source>in: International Conference on Semantic Computing (ICSC)</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>R.</given-names>
            <surname>Usbeck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Yan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Perevalov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Schulz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kraft</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Möller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Reineke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.-C. N.</given-names>
            <surname>Ngomo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Saleem</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Both</surname>
          </string-name>
          , QALD-10
          <source>- The 10th Challenge on Question Answering over Linked Data, Semantic Web Journal</source>
          (
          <year>2023</year>
          ). URL: https: //www.semantic
          <article-title>-web-journal</article-title>
          .net/system/files/swj3357.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>A.-C. Ngonga Ngomo</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Bühmann</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Unger</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Lehmann</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Gerber</surname>
          </string-name>
          ,
          <article-title>Sorry, I don't speak SPARQL: translating SPARQL queries into natural language</article-title>
          ,
          <source>in: Proceedings of the 22nd international conference on World Wide Web</source>
          ,
          <year>2013</year>
          , pp.
          <fpage>977</fpage>
          -
          <lpage>988</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>A.-C. Ngonga Ngomo</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Moussallem</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Bühmann</surname>
          </string-name>
          ,
          <article-title>A holistic natural language generation framework for the semantic web</article-title>
          , in: R. Mitkov, G. Angelova (Eds.),
          <source>Proceedings of the International Conference on Recent Advances in Natural Language Processing (RANLP</source>
          <year>2019</year>
          ), INCOMA Ltd.,
          <string-name>
            <surname>Varna</surname>
          </string-name>
          , Bulgaria,
          <year>2019</year>
          , pp.
          <fpage>819</fpage>
          -
          <lpage>828</lpage>
          . URL: https://aclanthology.org/ R19-1095. doi:
          <volume>10</volume>
          .26615/
          <fpage>978</fpage>
          -954-452-056-4\_
          <fpage>095</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>D.</given-names>
            <surname>Moussallem</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Gnaneshwar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. Castro</given-names>
            <surname>Ferreira</surname>
          </string-name>
          , A.-C.
          <article-title>Ngonga Ngomo, NABUmultilingual graph-based neural RDF verbalizer</article-title>
          , in: International Semantic Web Conference, Springer,
          <year>2020</year>
          , pp.
          <fpage>420</fpage>
          -
          <lpage>437</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>G.</given-names>
            <surname>Lecorvé</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Veyret</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Brabant</surname>
          </string-name>
          ,
          <string-name>
            <surname>L. M.</surname>
          </string-name>
          <article-title>Rojas Barahona, SPARQL-to-text question generation for knowledge-based conversational applications</article-title>
          , in: Y. He,
          <string-name>
            <given-names>H.</given-names>
            <surname>Ji</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.-H. Chang</surname>
          </string-name>
          (Eds.),
          <source>Proceedings of the 2nd Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics and the 12th International Joint Conference on Natural Language Processing</source>
          (Volume
          <volume>1</volume>
          :
          <string-name>
            <surname>Long</surname>
            <given-names>Papers)</given-names>
          </string-name>
          ,
          <source>Association for Computational Linguistics</source>
          , Online only,
          <year>2022</year>
          , pp.
          <fpage>131</fpage>
          -
          <lpage>147</lpage>
          . URL: https://aclanthology.org/
          <year>2022</year>
          .aacl-main.
          <volume>11</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>M.</given-names>
            <surname>Kale</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rastogi</surname>
          </string-name>
          ,
          <article-title>Text-to-text pre-training for data-to-text tasks</article-title>
          , in: B.
          <string-name>
            <surname>Davis</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Graham</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Kelleher</surname>
          </string-name>
          , Y. Sripada (Eds.),
          <source>Proceedings of the 13th International Conference on Natural Language Generation</source>
          , Association for Computational Linguistics, Dublin, Ireland,
          <year>2020</year>
          , pp.
          <fpage>97</fpage>
          -
          <lpage>102</lpage>
          . URL: https://aclanthology.org/
          <year>2020</year>
          .inlg-
          <volume>1</volume>
          .14. doi:
          <volume>10</volume>
          .18653/v1/
          <year>2020</year>
          .inlg-
          <volume>1</volume>
          .
          <fpage>14</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <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>
          , in: D.
          <string-name>
            <surname>Jurafsky</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Chai</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Schluter</surname>
          </string-name>
          , J. Tetreault (Eds.),
          <article-title>Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, Association for Computational Linguistics</article-title>
          , Online,
          <year>2020</year>
          , pp.
          <fpage>7871</fpage>
          -
          <lpage>7880</lpage>
          . URL: https://aclanthology.org/
          <year>2020</year>
          .acl-main.
          <volume>703</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2020</year>
          .acl-main.
          <volume>703</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <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>
          , in: J.
          <string-name>
            <surname>Goldstein</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Lavie</surname>
            ,
            <given-names>C.-Y.</given-names>
          </string-name>
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          Voss (Eds.),
          <source>Proceedings of the ACL Workshop</source>
          on Intrinsic and
          <article-title>Extrinsic Evaluation Measures for Machine Translation and/or Summarization, Association for Computational Linguistics</article-title>
          , Ann Arbor, Michigan,
          <year>2005</year>
          , pp.
          <fpage>65</fpage>
          -
          <lpage>72</lpage>
          . URL: https://aclanthology.org/W05-0909.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <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>
          ,
          <string-name>
            <surname>Y. Artzi,</surname>
          </string-name>
          <article-title>BERTScore: Evaluating text generation with Bert</article-title>
          , arXiv preprint arXiv:
          <year>1904</year>
          .
          <volume>09675</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>R.</given-names>
            <surname>Usbeck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. H.</given-names>
            <surname>Gusmita</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.-C. N.</given-names>
            <surname>Ngomo</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Saleem, 9th challenge on question answering over linked data (QALD-9)</article-title>
          , in: Semdeep/NLIWoD@ISWC,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>A. Q.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sablayrolles</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mensch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Bamford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. S.</given-names>
            <surname>Chaplot</surname>
          </string-name>
          , D. de las Casas,
          <string-name>
            <given-names>F.</given-names>
            <surname>Bressand</surname>
          </string-name>
          , G. Lengyel,
          <string-name>
            <given-names>G.</given-names>
            <surname>Lample</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Saulnier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. R.</given-names>
            <surname>Lavaud</surname>
          </string-name>
          , M.
          <article-title>-</article-title>
          <string-name>
            <surname>A. Lachaux</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Stock</surname>
            ,
            <given-names>T. L.</given-names>
          </string-name>
          <string-name>
            <surname>Scao</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Lavril</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Lacroix</surname>
            ,
            <given-names>W. E.</given-names>
          </string-name>
          <string-name>
            <surname>Sayed</surname>
          </string-name>
          , Mistral 7B,
          <source>arXiv preprint arXiv:2310.06825</source>
          (
          <year>2023</year>
          ). doi:
          <volume>10</volume>
          .48550/arXiv.2310.06825. arXiv:
          <volume>2310</volume>
          .
          <fpage>06825</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>H.</given-names>
            <surname>Touvron</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Martin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Stone</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Albert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Almahairi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Babaei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Bashlykov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Batra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bhargava</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bhosale</surname>
          </string-name>
          , et al.,
          <source>LLaMA</source>
          <volume>2</volume>
          :
          <article-title>Open foundation and fine-tuned chat models</article-title>
          ,
          <source>arXiv preprint arXiv:2307.09288</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>S.</given-names>
            <surname>Mangrulkar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gugger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Debut</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Belkada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Paul</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Bossan</surname>
          </string-name>
          , PEFT:
          <article-title>State-of-the-art parameter-eficient fine-tuning methods</article-title>
          , https://github.com/huggingface/peft,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <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>
          , et al.,
          <article-title>Language models are few-shot learners</article-title>
          ,
          <source>Advances in neural information processing systems</source>
          <volume>33</volume>
          (
          <year>2020</year>
          )
          <fpage>1877</fpage>
          -
          <lpage>1901</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>J.</given-names>
            <surname>Ye</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Shao</surname>
          </string-name>
          , S. Liu,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Cui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Gong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Shen</surname>
          </string-name>
          , et al.,
          <article-title>A comprehensive capability analysis of GPT-3 and GPT-3.5 series models</article-title>
          ,
          <source>arXiv preprint arXiv:2303.10420</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>J.</given-names>
            <surname>Achiam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Adler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Ahmad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Akkaya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. L.</given-names>
            <surname>Aleman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Almeida</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Altenschmidt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Altman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Anadkat</surname>
          </string-name>
          , et al.,
          <source>GPT-4 technical report, arXiv preprint arXiv:2303.08774</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <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>
          ,
          <year>2002</year>
          , pp.
          <fpage>311</fpage>
          -
          <lpage>318</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>G.</given-names>
            <surname>Doddington</surname>
          </string-name>
          ,
          <article-title>Automatic evaluation of machine translation quality using n-gram cooccurrence statistics</article-title>
          ,
          <source>in: Proceedings of the second international conference on Human Language Technology Research</source>
          ,
          <year>2002</year>
          , pp.
          <fpage>138</fpage>
          -
          <lpage>145</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <surname>C.-Y. Lin</surname>
          </string-name>
          ,
          <article-title>Rouge: A package for automatic evaluation of summaries</article-title>
          , in: Text summarization branches out,
          <year>2004</year>
          , pp.
          <fpage>74</fpage>
          -
          <lpage>81</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>V. I.</given-names>
            <surname>Levenshtein</surname>
          </string-name>
          , et al.,
          <article-title>Binary codes capable of correcting deletions, insertions, and reversals</article-title>
          ,
          <source>in: Soviet physics doklady</source>
          , volume
          <volume>10</volume>
          ,
          <string-name>
            <surname>Soviet</surname>
            <given-names>Union</given-names>
          </string-name>
          ,
          <year>1966</year>
          , pp.
          <fpage>707</fpage>
          -
          <lpage>710</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>M.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Cambronero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gulwani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Le</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Negreanu</surname>
          </string-name>
          , G. Verbruggen,
          <article-title>CodeFusion: A pre-trained difusion model for code generation</article-title>
          , in: H.
          <string-name>
            <surname>Bouamor</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Pino</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          Bali (Eds.),
          <source>Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing</source>
          , Association for Computational Linguistics, Singapore,
          <year>2023</year>
          , pp.
          <fpage>11697</fpage>
          -
          <lpage>11708</lpage>
          . URL: https: //aclanthology.org/
          <year>2023</year>
          .emnlp-main.
          <volume>716</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2023</year>
          .emnlp-main.
          <volume>716</volume>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>