<!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>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Conversion: A Methodology to Enhance Digital Education</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Miquel Canal-Esteve</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Educational Material to Knowledge Graph Conversion, Large Language Models, Automated Knowledge</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Doctoral Symposium on Natural Language Processing</institution>
          ,
          <addr-line>26</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Alicante</institution>
          ,
          <addr-line>Carretera de San Vicente del Raspeig, s/n, San Vicente del Raspeig, Alicante</addr-line>
          ,
          <country>España</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper aims to present a line of research focused on the automatization of structuring digital educational content as knowledge graphs (KGs) to enhance natural language processing tasks. Unlike traditional repositories like Moodle, KGs ofer a more flexible representation of relationships between concepts, facilitating intuitive navigation and discovery of connections. By integrating efectively with Large Language Models, KGs can improve personalized explanations, answers, and recommendations. This research will explore and develop technologies for creating and editing educational data (both text and multimedia) and technologies that enable students and teachers to utilize this structured knowledge efectively.</p>
      </abstract>
      <kwd-group>
        <kwd>Digital</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>CEUR
ceur-ws.org</p>
    </sec>
    <sec id="sec-2">
      <title>1. Research Justification</title>
      <p>
        Knowledge graphs (KGs) structure complex information into nodes and relationships, allowing
an intuitive and manipulable representation of knowledge. This structure facilitates the
integration of information from diverse sources, improves the ability to perform precise semantic
searches, and enhances the inference of new knowledge from existing data [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ]. Given these
capabilities, KGs have shown significant potential across various domains, including education
[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>
        In the educational environment, KGs can transform how educational information is organized
and accessed. They integrate data from multiple sources, such as textbooks, research articles,
and online resources, to link key concepts, theories, and relevant authors [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. For example, In
molecular biology, a KG can illustrate the connections between ”DNA”, ”transcription” and
”protein synthesis” with references to videos, book chapters, and other resources.
      </p>
      <p>
        Integration with Large Language Models (LLMs) can enhance this approach, enabling detailed
explanations and accurate answers [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. This approach facilitates the search for specific
information for students and educators and helps identify hidden relationships between diferent
topics, promoting deeper, interdisciplinary learning [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>
        Although many KGs have been proposed in the literature, due to their complexity, they are
often limited to small environments [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. The construction of KGs has traditionally required
laborious data extraction and linking processes based on natural language processing (NLP)
and data mining techniques [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. However, in recent years, LLMs have revolutionized the field
of NLP, demonstrating a remarkable ability to understand and generate natural language and
programming. The potential of LLMs for automatic KG generation is an emerging area of
research [
        <xref ref-type="bibr" rid="ref7 ref8">7, 8</xref>
        ].
      </p>
      <p>This research address the problem of converting educational materials into KGs for improved
content structuring, navigation, and personalization through LLMs.</p>
    </sec>
    <sec id="sec-3">
      <title>2. Background and Related Work</title>
      <sec id="sec-3-1">
        <title>2.1. Knowledge Graphs in the Educational Environment</title>
        <sec id="sec-3-1-1">
          <title>2.1.1. Representation and Eficient Access to Knowledge</title>
          <p>
            According to Dang et al. [
            <xref ref-type="bibr" rid="ref4">4</xref>
            ], eficient access to knowledge is crucial in KGs applied in education.
These graphs organize large amounts of information, facilitating understanding and retrieval.
Abu-Salih and Alotaibi [
            <xref ref-type="bibr" rid="ref5">5</xref>
            ] note that KGs enhance semantic searchability, allowing quick access
to specific information.
          </p>
          <p>
            Abu-Salih and Alotaibi [
            <xref ref-type="bibr" rid="ref5">5</xref>
            ] also state that KGs are transforming education by enabling
personalized learning and improved curriculum planning. However, challenges include lack of
standardized formats, limited interoperability, incomplete data, and scalability. Future research
should address these limitations and explore advanced language models and multidomain KGs.
          </p>
        </sec>
        <sec id="sec-3-1-2">
          <title>2.1.2. Enhancement of Learning and Discovery of Connections</title>
          <p>
            According to Ain et al. [
            <xref ref-type="bibr" rid="ref3">3</xref>
            ], KGs enable dynamic representation of concepts, helping students
understand connections between topics, improving retention and contextualized learning.
          </p>
          <p>
            KGs also enhance educational systems’ ability to provide personalized recommendations.
Chicaiza and Valdiviezo-Diaz [
            <xref ref-type="bibr" rid="ref9">9</xref>
            ] show that mapping relationships between concepts and
resources optimizes learning by aligning with students’ progress and interests, revealing new
connections in a non-linear learning environment.
          </p>
          <p>
            Stancin et al. [
            <xref ref-type="bibr" rid="ref10">10</xref>
            ] highlight the role of ontologies in structuring knowledge and managing
curricula. Combining various methodologies, researchers have increasingly used ontologies in
education, showing their importance and potential.
          </p>
        </sec>
        <sec id="sec-3-1-3">
          <title>2.1.3. Personalization and Integration with LLMs</title>
          <p>
            Research by Li et al. [
            <xref ref-type="bibr" rid="ref11">11</xref>
            ] shows KGs improve content organization and personalization in online
learning platforms, ofering recommendations based on learner progress and interests.
          </p>
          <p>
            KGs are also crucial in intelligent tutoring systems. Li and Wang [
            <xref ref-type="bibr" rid="ref12">12</xref>
            ] state that KGs enable
virtual tutors to provide tailored explanations.
          </p>
          <p>
            Khoiruddin et al. [
            <xref ref-type="bibr" rid="ref13">13</xref>
            ] reviews the development of e-learning ontologies, emphasizing
methodologies like NeON and METHONTOLOGY and metrics like Relationship Richness to assess
quality. Proper application of these methods can enhance e-learning systems.
          </p>
          <p>
            Chen et al. [
            <xref ref-type="bibr" rid="ref14">14</xref>
            ] describe KnowEDu, a system that constructs KGs using pedagogical and
assessment data via NLP algorithms, providing a foundation for implementing educational KGs.
This method is relevant to Section 4.
          </p>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>2.2. Text-to-Knowledge graph conversion models</title>
        <p>
          The first step to convert educational material to KG is to convert text to KG, often using a
LLM [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ]. Many integrations exist between LLMs and KGs, but these cover only part of the
text-to-knowledge graph process, as seen in the review [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. Below is an analysis of models that
perform the complete task of moving from text to KG.
        </p>
        <p>Common features and diferences are noted in these models. They are evaluated in Zero-Shot,
One-Shot, and Few-Shot scenarios, measuring datasets’ accuracy and semantic relatedness.
Diferences lie in the base LLMs, fine-tuning techniques, and specific architectures used. Results
show improvements in some configurations, but there is still room to optimize the accuracy
and eficiency of KG generation.</p>
        <p>
          For instance, in the study by Giglou et al. [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] several models are evaluated on the text to
OWL conversion task in Zero-Shot, including BERT-Large [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ], PubMedBERT [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ],
BARTLarge [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ], Flan-T5-Large [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ], Flan-T5-XL [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ], BLOOM-1b7 [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ], BLOOM-3b [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ], GPT-3 [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ],
GPT-3.5 [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ], LLaMA [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ] and GPT-4 [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ]. These models were tested on the term typing task
using diferent datasets: WordNet [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ], GeoNames [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ], NCI [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ], SNOMEDCT_US [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ] and
MEDCIN [
          <xref ref-type="bibr" rid="ref30">30</xref>
          ]. The best results were 91.7 for WordNet [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ], but significantly lower for the
other datasets, with scores of 43.3, 16.1, 37.7 and 29.8, respectively, evidencing considerable
room for improvement in the models’ ability for this task. They were also evaluated in the
entity classification task with the GeoNames [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ], UMLS [
          <xref ref-type="bibr" rid="ref31">31</xref>
          ], and schema.org datasets, showing
scores of 67.8, 78.1 and 74.4, again suggesting considerable room for improvement. Finally, in
the relationship recognition task with the UMLS [
          <xref ref-type="bibr" rid="ref31">31</xref>
          ] dataset, a result of 49.5 was obtained,
reflecting once again the need for improvement.
        </p>
        <p>
          Moreover, the same article presents two tuned models: Flan-T5-Large [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] and Flan-T5-XL
[
          <xref ref-type="bibr" rid="ref20">20</xref>
          ], which show remarkable improvements in several datasets of the evaluated tasks. For
example, for the datasets of the first task, the results were improved to 32.8, 43.4 and 51.8.
The results improved to 79.3 and 91.7 in the entity classification task, and in the relationship
recognition task, 53.1 was achieved.
        </p>
        <p>
          Similarly, in the study by Mihindukulasooriya et al. [
          <xref ref-type="bibr" rid="ref32">32</xref>
          ] Vicuna-13B [
          <xref ref-type="bibr" rid="ref33">33</xref>
          ] and
Alpaca-LoRA13B [34, 35] are evaluated in Zero-Shot on the Fact Extraction task using the F1 metric for
diferent subsets of the Wikidata-TekGen [ 36] and DBpedia-WebNLG [37] datasets. The best
result for the Wikidata dataset [36] is 0.38 for Vicuna [
          <xref ref-type="bibr" rid="ref33">33</xref>
          ] and 0.28 for Alpaca [34, 35] and for
the DBpedia dataset [37] it is 0.3 for Vicuna [
          <xref ref-type="bibr" rid="ref33">33</xref>
          ] and 0.25 for Alpaca [34, 35]. As in the previous
case, it is evident that there is much room for improvement.
        </p>
        <p>
          Furthermore, in the study by Zhu et al. [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ], a comprehensive evaluation of Extended
Language Models (LLMs) such as GPT-4 [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ] and ChatGPT[
          <xref ref-type="bibr" rid="ref23">23</xref>
          ] in KG construction and reasoning
tasks is performed by experiments on eight datasets and four representative tasks: entity and
relationship extraction, event extraction, link prediction, and question and answer. The results
show that, although GPT-4 achieves an F1 score of 31.03 in relation extraction on DuIE2.0 [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]
on zero-shot and 41.91 on one-shot, as well as an F1 score of 34.2 on MAVEN [38] for event
extraction on zero-shot, and a hits@1 of 32.0 on FB15K-237 [39] for link prediction on zero-shot,
these results are improbable.
        </p>
        <p>
          The paper by Melnyk et al. [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] presents an innovative approach for generating KGs from
text in multiple stages. This approach is divided into two main phases: first, the generation of
nodes using the pre-trained language model T5-large [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] and then the construction of edges
using the information from the generated nodes. This method seeks to overcome the limitations
of traditional graph linearization approaches by breaking the process into manageable and
separately optimizable steps. The model was evaluated on three datasets: WebNLG 2020 [40],
TEKGEN [41] and New York Times [42], obtaining F1 scores of 0.722, 0.707 and 0.918 respectively,
demonstrating its efectiveness. However, it highlights the need for further improvement,
especially in edge generation, to optimize the system’s performance in various applications.
        </p>
        <p>
          Finally, in the study by Ain et al. [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ], embeddings-based methods, such as SIFRank [43] and
SIFRankplus, which is an extension made by the authors, enhanced with SqueezeBERT [44],
achieved an F1-score of 40.38% in keyphrase extraction. In concept weighting, the SBERT-based
[45] strategy achieved an accuracy of 13.9% and an F1-score of 20.6% for the top ten ranked
concepts, superior results to the benchmark models with which they were purchased. Despite
these advances, the results highlight the need to improve the accuracy and performance of the
techniques to ensure the efective construction of KGs.
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>3. Hypothesis and Objectives</title>
      <p>The main hypothesis of the research is that it is feasible to research and develop technologies
that convert teaching materials into KGs and integrate these with large-scale language models.
This integration aims to enhance various education-related natural language processing tasks.</p>
      <p>The main objective of the research is to design and implement these technologies, focusing
on the automatic transformation of teaching materials into KGs and their integration with
language models. This will address tasks in education-related natural language processing. To
achieve this objective, the following specific goals are proposed:
• To study the state of the art to identify the most relevant existing solution alternatives in
the domain and the main evaluation resources.
• To investigate and develop technologies that allow the creation of advanced tools based on
language models, designed to language models, designed to convert texts from multiple
disciplines into KGs. This approach will have particular applications in the educational
environment, facilitating eficient capture and organization of knowledge.
• Research and develop technologies that allow the integration of large-scale language
models with previously developed tools to enrich and expand KGs, in addition to and
expand KGs, as well as generate personalized text and answers based on the information
contained in the graphs.</p>
    </sec>
    <sec id="sec-5">
      <title>4. Methodology</title>
      <p>This section presents an innovative methodology for automatically using an LLM to generate KGs
from educational materials. Existing models like BERT-Large, GPT-4, Vicuna-13B, PubMedBERT,
BART-Large, Flan-T5, BLOOM, GPT-3, GPT-3.5, LLaMA, and Alpaca-LoRA-13B have shown
progress in converting text to KGs but still have significant limitations, as seen in the previous
section. For example, in term typing tasks, scores were 43.3 for GeoNames, 16.1 for NCI, 37.7 for
SNOMEDCT_US, and 29.8 for MEDCIN, compared to 91.7 for WordNet. In entity classification,
the highest scores were 78.1 for UMLS and 74.4 for schema.org. Fact extraction tasks showed
Vicuna-13B scoring 0.38 and Alpaca-LoRA-13B scoring 0.28 on Wikidata-TekGen. These results
highlight the need for new strategies to improve model performance in text-to-KG conversion
in general and particularly in education.</p>
      <p>To address these limitations, it proposes a methodology based on creating an expert model in
natural language and KGs, refined to convert learning materials to KGs following a structured
learning object for a guided teaching experience with multimedia content. This includes two
phases: continual pre-training with a large dataset of KGs in OWL, RDF, and similar formats,
and specific fine-tuning with didactic materials. In pre-training, a varied dataset of KGs from
various disciplines trains the model using masking and self-supervised learning, enhancing
its understanding of semantic relationships and hierarchical structures in KGs, improving its
ability to generate coherent and accurate graphs.</p>
      <p>Continual pre-training allows the model to become more expert in the domain in which
it is pre-trained [46]; in this case, it is believed that it would involve improved semantic
understanding, training on structured data, flexibility and generalization, reduction of biases,
and leveraging of existing resources.</p>
      <p>
        In the fine-tuning phase, diverse educational materials will be gathered, and their
corresponding KGs will be created manually or semi-automatically. This process will require defining a
KG scheme or reusing one already described in the literature that fits the proposed use case.
For this phase, the schemes, and methodologies described in the studies [47] and [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
      </p>
      <p>Although KGs are not used in [47], it becomes clear that a small amount of domain-specific
data, such as slides and lecture transcripts, can be extremely valuable for building
knowledgebased and generative educational chatbots. Slides are enriched with semantic annotations,
identifying entities such as definitions, quotes, and examples. This enables knowledge-based to
provide accurate and relevant responses by mining directly from this structured data.</p>
      <p>
        Chen et al. [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] describes a system developed to build educational KGs using pedagogical
and learning assessment data automatically. The methods used in this study for extracting
instructional concepts and identifying meaningful educational relationships will provide a solid
foundation for the proposed KG scheme. Integrating these methodologies is expected to improve
the system’s efectiveness in automatically generating KGs from educational materials.
      </p>
    </sec>
    <sec id="sec-6">
      <title>5. Research Issues to Discuss</title>
      <p>In the first phase of the research we are currently in, continual pretraining will be performed
on LLaMA3-8b. A dataset with public KGs ranging from 10 to 50GB is being prepared. This
dataset is being characterized based on the themes of the KG and other semantic KG such as the
number of classes, the depth of the KG, the density of relationships, etc., as well as linguistic
metrics like the number of tokens.</p>
      <p>Once continual pretraining is completed, the model’s ability to complete OWL code and
perform other NLP tasks, such as those mentioned in the Background and Related Work, will
be evaluated to ensure it has not forgotten natural language. Subsequently, a second phase
of fine-tuning will be conducted for specific semantic tasks such as link prediction, entity
recognition, and KG completion.</p>
      <p>After the model has been trained and evaluated on these tasks, it will be instructed to perform
the task of converting educational material into a KG. This will require defining a reference KG
and manually (or semi-automatically) populating it with several examples so that the model
can learn to perform this task during the instruction phase.</p>
      <p>Key issues to discuss in this phase include:
1. Dataset Preparation: Ensuring the dataset is diverse and representative of various
domains to avoid bias and enhance the model’s generalization capabilities.
2. Evaluation Metrics: Deciding on appropriate metrics for evaluating the model’s
performance in OWL code completion and NLP tasks, ensuring comprehensive assessment.
3. Knowledge Graph Definition and Population : Developing a robust and flexible
reference KG and strategies for its manual or semi-automatic population.
4. Instruction Phase Design: Designing an efective instruction phase to train the model
on converting educational materials to KGs, including selecting examples and defining
evaluation criteria.</p>
      <p>These discussions will guide the research process, ensuring methodological rigor and the
development of an efective system for converting educational materials into KGs integrated
with large-scale language models.
[34] R. Taori, I. Gulrajani, T. Zhang, Y. Dubois, X. Li, C. Guestrin, P. Liang, T. B. Hashimoto,
Stanford Alpaca: An instruction-following LLaMA model, 2023. URL: https://github.com/
tatsu-lab/stanford_alpaca, accessed: 2023-05-21.
[35] E. J. Hu, Y. Shen, P. Wallis, Z. Allen-Zhu, Y. Li, S. Wang, L. Wang, W. Chen, LoRA:
Lowrank adaptation of large language models, 2022. URL: https://openreview.net/forum?id=
nZeVKeeFYf9, accessed: 2023-05-21.
[36] D. Vrandečić, M. Krötzsch, Wikidata: a free collaborative knowledgebase, Commun. ACM
57 (2014) 78–85. URL: https://doi.org/10.1145/2629489. doi:10.1145/2629489.
[37] C. Gardent, A. Shimorina, S. Narayan, L. Perez-Beltrachini, Creating training corpora
for NLG micro-planners (2017) 179–188. URL: https://aclanthology.org/P17-1017. doi:10.
18653/v1/P17-1017.
[38] X. Wang, Z. Wang, X. Han, W. Jiang, R. Han, Z. Liu, J. Li, P. Li, Y. Lin, J. Zhou, MAVEN:
A Massive General Domain Event Detection Dataset (2020) 1652–1671. URL: https://
aclanthology.org/2020.emnlp-main.129. doi:10.18653/v1/2020.emnlp-main.129.
[39] K. Toutanova, D. Chen, P. Pantel, H. Poon, P. Choudhury, M. Gamon, Representing text for
joint embedding of text and knowledge bases (2015) 1499–1509. URL: https://aclanthology.
org/D15-1174. doi:10.18653/v1/D15-1174.
[40] T. Castro Ferreira, C. Gardent, N. Ilinykh, C. van der Lee, S. Mille, D. Moussallem, A.
Shimorina, The 2020 bilingual, bi-directional WebNLG+ shared task: Overview and evaluation
results (WebNLG+ 2020) (2020) 55–76. URL: https://aclanthology.org/2020.webnlg-1.7.
[41] O. Agarwal, H. Ge, S. Shakeri, R. Al-Rfou, Knowledge graph based synthetic corpus
generation for knowledge-enhanced language model pre-training (2021) 3554–3565. URL:
https://aclanthology.org/2021.naacl-main.278. doi:10.18653/v1/2021.naacl-main.278.
[42] S. Riedel, L. Yao, A. McCallum, Modeling relations and their mentions without labeled text,
Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2010. Lecture
Notes in Computer Science 6323 (2010). doi:10.1007/978-3-642-15939-8_10.
[43] Y. Sun, H. Qiu, Y. Zheng, Z. Wang, C. Zhang, Sifrank: A new baseline for
unsupervised keyphrase extraction based on pre-trained language model, IEEE Access 8 (2020)
10896–10906. doi:10.1109/ACCESS.2020.2965087.
[44] F. Iandola, A. Shaw, R. Krishna, K. Keutzer, SqueezeBERT: What can computer vision teach
NLP about eficient neural networks? (2020) 124–135. URL: https://aclanthology.org/2020.
sustainlp-1.17. doi:10.18653/v1/2020.sustainlp-1.17.
[45] N. Reimers, I. Gurevych, Sentence-BERT: Sentence embeddings using Siamese
BERTnetworks (2019) 3982–3992. URL: https://aclanthology.org/D19-1410. doi:10.18653/v1/
D19-1410.
[46] T. Wu, L. Luo, Y.-F. Li, S. Pan, T.-T. Vu, G. Hafari, Continual Learning for Large Language
Models: A Survey, arXiv e-prints (2024) arXiv:2402.01364. doi:10.48550/arXiv.2402.
01364. arXiv:2402.01364.
[47] M. Wölfel, M. B. Shirzad, A. Reich, K. Anderer, Knowledge-based and generative-ai-driven
pedagogical conversational agents: A comparative study of grice’s cooperative principles
and trust, Big Data and Cognitive Computing 8 (2024). URL: https://www.mdpi.com/
2504-2289/8/1/2. doi:10.3390/bdcc8010002.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M.</given-names>
            <surname>Kejriwal</surname>
          </string-name>
          ,
          <article-title>Knowledge graphs: A practical review of the research landscape</article-title>
          ,
          <source>Information</source>
          <volume>13</volume>
          (
          <year>2022</year>
          )
          <article-title>161</article-title>
          . URL: https://www.mdpi.com/2078-2489/13/4/161. doi:
          <volume>10</volume>
          .3390/ info13040161.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Qiao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Deng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <surname>N. Zhang,</surname>
          </string-name>
          <article-title>LLMs for Knowledge Graph Construction and Reasoning: Recent Capabilities and Future Opportunities</article-title>
          , arXiv e-prints (
          <year>2023</year>
          ) arXiv:
          <fpage>2305</fpage>
          .13168. doi:
          <volume>10</volume>
          .48550/arXiv.2305.13168. arXiv:
          <volume>2305</volume>
          .
          <fpage>13168</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Q. U.</given-names>
            <surname>Ain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Chatti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. G. C.</given-names>
            <surname>Bakar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Joarder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Alatrash</surname>
          </string-name>
          ,
          <article-title>Automatic construction of educational knowledge graphs: A word embedding-based approach</article-title>
          ,
          <source>Information</source>
          <volume>14</volume>
          (
          <year>2023</year>
          )
          <article-title>526</article-title>
          . URL: https://www.mdpi.com/2078-2489/14/10/526. doi:
          <volume>10</volume>
          .3390/info14100526.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>F.-R.</given-names>
            <surname>Dang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-T.</given-names>
            <surname>Tang</surname>
          </string-name>
          , K.-Y. Pang,
          <string-name>
            <given-names>T.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.-S.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>Constructing an educational knowledge graph with concepts linked to wikipedia</article-title>
          ,
          <source>Journal of Computer Science and Technology</source>
          <volume>36</volume>
          (
          <year>2021</year>
          )
          <fpage>1200</fpage>
          -
          <lpage>1211</lpage>
          . doi:https://doi.org/10.1007/s11390-020-0328-2.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>B.</given-names>
            <surname>Abu-Salih</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Alotaibi</surname>
          </string-name>
          ,
          <article-title>A systematic literature review of knowledge graph construction and application in education</article-title>
          ,
          <source>Heliyon</source>
          <volume>10</volume>
          (
          <year>2024</year>
          )
          <article-title>e25383</article-title>
          . doi:
          <volume>10</volume>
          .1016/j.heliyon.
          <year>2024</year>
          . e25383.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>X.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <article-title>Semantic-enhanced knowledge graph completion</article-title>
          ,
          <source>Mathematics</source>
          <volume>12</volume>
          (
          <year>2024</year>
          ). URL: https://www.mdpi.com/2227-7390/ 12/3/450. doi:
          <volume>10</volume>
          .3390/math12030450.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>S.</given-names>
            <surname>Pan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <article-title>Unifying Large Language Models and Knowledge Graphs: A Roadmap, arXiv e-prints (</article-title>
          <year>2023</year>
          ) arXiv:
          <fpage>2306</fpage>
          .08302. doi:
          <volume>10</volume>
          .48550/ arXiv.2306.08302. arXiv:
          <volume>2306</volume>
          .
          <fpage>08302</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>I.</given-names>
            <surname>Melnyk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Dognin</surname>
          </string-name>
          ,
          <string-name>
            <surname>P. Das</surname>
          </string-name>
          ,
          <article-title>Knowledge Graph Generation From Text</article-title>
          , arXiv e-prints (
          <year>2022</year>
          ) arXiv:
          <fpage>2211</fpage>
          .10511. doi:
          <volume>10</volume>
          .48550/arXiv.2211.10511. arXiv:
          <volume>2211</volume>
          .
          <fpage>10511</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Chicaiza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Valdiviezo-Diaz</surname>
          </string-name>
          ,
          <article-title>A comprehensive survey of knowledge graph-based recommender systems: Technologies, development, and contributions</article-title>
          ,
          <source>Information</source>
          <volume>12</volume>
          (
          <year>2021</year>
          )
          <article-title>232</article-title>
          . URL: https://www.mdpi.com/2078-2489/12/6/232. doi:
          <volume>10</volume>
          .3390/info12060232.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>K.</given-names>
            <surname>Stancin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Poscic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Jaksic</surname>
          </string-name>
          ,
          <article-title>Ontologies in education - state of the art</article-title>
          ,
          <source>Education and Information Technologies</source>
          <volume>25</volume>
          (
          <year>2020</year>
          )
          <fpage>5301</fpage>
          -
          <lpage>5320</lpage>
          . doi:
          <volume>10</volume>
          .1007/s10639-020-10226-z.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>S.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zan</surname>
          </string-name>
          ,
          <article-title>Duie: A large-scale chinese dataset for information extraction</article-title>
          ,
          <source>Natural Language Processing and Chinese Computing</source>
          <volume>11839</volume>
          (
          <year>2019</year>
          ). doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -32236-6_
          <fpage>72</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>L.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <source>Knowledge Graph Enhanced Intelligent Tutoring System Based on Exercise Representativeness and Informativeness</source>
          , arXiv e-prints (
          <year>2023</year>
          ) arXiv:
          <fpage>2307</fpage>
          .15076. doi:
          <volume>10</volume>
          . 48550/arXiv.2307.15076. arXiv:
          <volume>2307</volume>
          .
          <fpage>15076</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>M.</given-names>
            <surname>Khoiruddin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kusumawardani</surname>
          </string-name>
          , I. Hidayah,
          <string-name>
            <given-names>S.</given-names>
            <surname>Fauziati</surname>
          </string-name>
          ,
          <article-title>A review of ontology development in the e-learning domain: Methods, roles</article-title>
          , evaluation, 2023 International Conference on Computer, Control,
          <source>Informatics and its Applications (IC3INA)</source>
          (
          <year>2023</year>
          ).
          <source>doi:10.1109/IC3INA60834</source>
          .
          <year>2023</year>
          .
          <volume>10285789</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>P.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. W.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <article-title>Knowedu: A system to construct knowledge graph for education</article-title>
          ,
          <source>IEEE Access 6</source>
          (
          <year>2018</year>
          )
          <fpage>31553</fpage>
          -
          <lpage>31563</lpage>
          . doi:
          <volume>10</volume>
          .1109/ACCESS.
          <year>2018</year>
          .
          <volume>2839607</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>M.</given-names>
            <surname>Trajanoska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Stojanov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Trajanov</surname>
          </string-name>
          ,
          <article-title>Enhancing knowledge graph construction using large language models</article-title>
          ,
          <source>ArXiv abs/2305</source>
          .04676 (
          <year>2023</year>
          ). URL: https://api.semanticscholar.org/ CorpusID:258557103.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>H.</given-names>
            <surname>Giglou</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. D'Souza</surname>
            ,
            <given-names>S. Auer,</given-names>
          </string-name>
          <article-title>LLMs4OL: Large Language Models for Ontology Learning</article-title>
          , arXiv e-prints (
          <year>2023</year>
          ) arXiv:
          <fpage>2307</fpage>
          .16648. doi:
          <volume>10</volume>
          .48550/arXiv.2307.16648. arXiv:
          <volume>2307</volume>
          .
          <fpage>16648</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , BERT:
          <article-title>Pre-training of deep bidirectional transformers for language understanding (</article-title>
          <year>2019</year>
          )
          <fpage>4171</fpage>
          -
          <lpage>4186</lpage>
          . URL: https://aclanthology.org/ N19-1423. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>N19</fpage>
          -1423.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Tinn</surname>
          </string-name>
          , H. Cheng, M. Lucas,
          <string-name>
            <given-names>N.</given-names>
            <surname>Usuyama</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Naumann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Poon</surname>
          </string-name>
          ,
          <article-title>Domain-specific language model pretraining for biomedical natural language processing</article-title>
          ,
          <source>ACM Trans. Comput. Healthcare</source>
          <volume>3</volume>
          (
          <year>2021</year>
          ). URL: https://doi.org/10.1145/3458754. doi:
          <volume>10</volume>
          . 1145/3458754.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <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>
          <year>2020</year>
          )
          <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="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>H. W.</given-names>
            <surname>Chung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Hou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Longpre</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Zoph</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Tay</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Fedus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dehghani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Brahma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Webson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. S.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Suzgun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Chowdhery</surname>
          </string-name>
          , A. CastroRos, M. Pellat,
          <string-name>
            <given-names>K.</given-names>
            <surname>Robinson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Valter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Narang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Mishra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Petrov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. H.</given-names>
            <surname>Chi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Dean</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Roberts</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q. V.</given-names>
            <surname>Le</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wei</surname>
          </string-name>
          , Scaling
          <string-name>
            <surname>Instruction-Finetuned Language</surname>
            <given-names>Models</given-names>
          </string-name>
          , arXiv e-prints (
          <year>2022</year>
          ) arXiv:
          <fpage>2210</fpage>
          .11416. doi:
          <volume>10</volume>
          .48550/arXiv.2210.11416. arXiv:
          <volume>2210</volume>
          .
          <fpage>11416</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>B.</given-names>
            <surname>Workshop</surname>
          </string-name>
          , T. Le
          <string-name>
            <surname>Scao</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Fan</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Akiki</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Pavlick</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Ilić</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Hesslow</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Castagné</surname>
            ,
            <given-names>A. Sasha</given-names>
          </string-name>
          <string-name>
            <surname>Luccioni</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Yvon</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Gallé</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Tow</surname>
            ,
            <given-names>A. M.</given-names>
          </string-name>
          <string-name>
            <surname>Rush</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Biderman</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Webson</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Sasanka Ammanamanchi</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Sagot</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Muennighof</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Villanova del Moral</surname>
          </string-name>
          , et al.,
          <article-title>BLOOM: A 176B-Parameter Open-Access Multilingual Language Model</article-title>
          , arXiv e-prints (
          <year>2022</year>
          ) arXiv:
          <fpage>2211</fpage>
          .05100. doi:
          <volume>10</volume>
          .48550/arXiv.2211.05100. arXiv:
          <volume>2211</volume>
          .
          <fpage>05100</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>T. B. Brown</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Mann</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Ryder</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Subbiah</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Kaplan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Dhariwal</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Neelakantan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Shyam</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Sastry</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Askell</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Agarwal</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Herbert-Voss</surname>
            , G. Krueger,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Henighan</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Child</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Ramesh</surname>
            ,
            <given-names>D. M.</given-names>
          </string-name>
          <string-name>
            <surname>Ziegler</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Winter</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Hesse</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Chen</surname>
            , E. Sigler,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Litwin</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Gray</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Chess</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Clark</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Berner</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>McCandlish</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Radford</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          <string-name>
            <surname>Sutskever</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Amodei</surname>
          </string-name>
          , Language Models are
          <string-name>
            <surname>Few-Shot</surname>
            <given-names>Learners</given-names>
          </string-name>
          , arXiv e-prints (
          <year>2020</year>
          ) arXiv:
          <year>2005</year>
          .14165. doi:
          <volume>10</volume>
          . 48550/arXiv.
          <year>2005</year>
          .
          <volume>14165</volume>
          . arXiv:
          <year>2005</year>
          .14165.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23] OpenAI, ChatGPT: Language Model,
          <year>2023</year>
          . URL: https://www.openai.com/chatgpt, accessed:
          <fpage>2024</fpage>
          -05-21.
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>H.</given-names>
            <surname>Touvron</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Lavril</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Izacard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Martinet</surname>
          </string-name>
          , M.
          <article-title>-</article-title>
          <string-name>
            <surname>A. Lachaux</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Lacroix</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Rozière</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Goyal</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Hambro</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Azhar</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Rodriguez</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Joulin</surname>
            , E. Grave, G. Lample, LLaMA: Open and
            <given-names>Eficient</given-names>
          </string-name>
          <string-name>
            <surname>Foundation Language Models</surname>
          </string-name>
          , arXiv e-prints (
          <year>2023</year>
          ) arXiv:
          <fpage>2302</fpage>
          .13971. doi:
          <volume>10</volume>
          .48550/arXiv.2302.13971. arXiv:
          <volume>2302</volume>
          .
          <fpage>13971</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <surname>OpenAI</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Achiam</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Adler</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Agarwal</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Ahmad</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          <string-name>
            <surname>Akkaya</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Leoni Aleman</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Almeida</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Altenschmidt</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Altman</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Anadkat</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Avila</surname>
            , I. Babuschkin,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Balaji</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Balcom</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Baltescu</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Bao</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Bavarian</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Belgum</surname>
            ,
            <given-names>I. Bello</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Berdine</surname>
          </string-name>
          , et al.,
          <source>GPT-4 Technical Report</source>
          , arXiv e-prints (
          <year>2023</year>
          ) arXiv:
          <fpage>2303</fpage>
          .08774. doi:
          <volume>10</volume>
          .48550/arXiv.2303.08774. arXiv:
          <volume>2303</volume>
          .
          <fpage>08774</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>G. A.</given-names>
            <surname>Miller</surname>
          </string-name>
          ,
          <article-title>Wordnet: a lexical database for english</article-title>
          ,
          <source>Commun. ACM</source>
          <volume>38</volume>
          (
          <year>1995</year>
          )
          <fpage>39</fpage>
          -
          <lpage>41</lpage>
          . URL: https://doi.org/10.1145/219717.219748. doi:
          <volume>10</volume>
          .1145/219717.219748.
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>T.</given-names>
            <surname>Rebele</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Suchanek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Hofart</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Biega</surname>
          </string-name>
          , E. Kuzey, G. Weikum,
          <article-title>Yago: A multilingual knowledge base from wikipedia, wordnet, and geonames</article-title>
          ,
          <source>International Semantic Web Conference</source>
          (
          <year>2016</year>
          )
          <fpage>177</fpage>
          -
          <lpage>185</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>319</fpage>
          -46547-0_
          <fpage>19</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>National</given-names>
            <surname>Cancer</surname>
          </string-name>
          <string-name>
            <surname>Institute</surname>
          </string-name>
          ,
          <source>National Institutes of Health, NCI Thesaurus</source>
          ,
          <year>2022</year>
          . URL: http: //ncit.nci.nih.gov, accessed:
          <fpage>2024</fpage>
          -05-21.
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>SNOMED</given-names>
            <surname>International</surname>
          </string-name>
          ,
          <source>US Edition of SNOMED CT</source>
          ,
          <year>2023</year>
          . URL: https://www.nlm.nih.gov/ healthit/snomedct/us_edition.html, accessed:
          <fpage>2024</fpage>
          -05-21.
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <surname>Medicomp</surname>
            <given-names>Systems</given-names>
          </string-name>
          , MEDCIN,
          <year>2023</year>
          . URL: https://medicomp.com, accessed:
          <fpage>2024</fpage>
          -05-21.
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>O.</given-names>
            <surname>Bodenreider</surname>
          </string-name>
          ,
          <article-title>The unified medical language system (umls): integrating biomedical terminology</article-title>
          ,
          <source>Nucleic acids research</source>
          <volume>32</volume>
          (
          <year>2004</year>
          )
          <fpage>D267</fpage>
          -
          <lpage>D270</lpage>
          . doi:https://doi.org/10. 1093/nar/gkh061.
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>N.</given-names>
            <surname>Mihindukulasooriya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Tiwari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. F.</given-names>
            <surname>Enguix</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lata</surname>
          </string-name>
          ,
          <article-title>Text2KGBench: A Benchmark for Ontology-Driven Knowledge Graph Generation from Text, arXiv e-prints (</article-title>
          <year>2023</year>
          ) arXiv:
          <fpage>2308</fpage>
          .02357. doi:
          <volume>10</volume>
          .48550/arXiv.2308.02357. arXiv:
          <volume>2308</volume>
          .
          <fpage>02357</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <surname>Chiang</surname>
          </string-name>
          ,
          <article-title>Wei-Lin and Li, Zhuohan and Lin, Zi and Sheng, Ying and Wu, Zhanghao</article-title>
          and Zhang, Hao and Zheng, Lianmin and Zhuang, Siyuan and Zhuang, Yonghao and Gonzalez, Joseph E. and
          <string-name>
            <surname>Stoica</surname>
            , Ion and Xing,
            <given-names>Eric P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vicuna</surname>
          </string-name>
          :
          <article-title>An open-source chatbot impressing GPT-4 with 90% ChatGPT quality</article-title>
          ,
          <year>2023</year>
          . URL: https://vicuna.lmsys.org, accessed:
          <fpage>2024</fpage>
          -05- 21.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>