<!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>On-Device Conversational Knowledge Capture with Large Language Models</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Tolga Çöplü</string-name>
          <email>tolga@haltia.ai</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Arto Bendiken</string-name>
          <email>arto@haltia.ai</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andrii Skomorokhov</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Eduard Bateiko</string-name>
          <email>eduard@haltia.ai</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Haltia</string-name>
          <email>andriy@haltia.ai</email>
          <email>steve@haltia.ai</email>
        </contrib>
      </contrib-group>
      <abstract>
        <p>Generative AI applications must integrate users' personal information into the response generation process to ofer an advanced user experience. One of the most efective methods for obtaining accurate and current user information is by capturing this data from AI interactions. This paper examines conversational knowledge capture using ontology and knowledge-graph approaches. We propose enhancing the large language model's (LLM) ability to capture precise and relevant information by training it with a subset of the KNOW ontology, which models personal knowledge. Our paper details the ontology-guided training process and evaluates the success of knowledge capture using a specially constructed dataset. Additionally, we emphasize the importance of privacy in handling personal information and investigate the implementation of knowledge capture with on-device language models. Our findings highlight the potential of on-device solutions to efectively capture personal knowledge while preserving user privacy.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>CEUR
ceur-ws.org</p>
    </sec>
    <sec id="sec-2">
      <title>1. Introduction</title>
      <p>Expectations for the quality and sophistication of human-AI interactions are steadily increasing.
Generative AI applications are now expected to recognize users, understand their
characteristics and preferences, and augment this information to enhance interactions. A fundamental
challenge in providing this level of user experience is capturing up-to-date knowledge about the
user through conversations. This process of identifying and recording personal knowledge and
preferences from user interactions is defined as conversational knowledge capture (CKC).</p>
      <p>
        CKC presents several critical challenges. Key issues include determining which knowledge
from conversations should be captured, how the captured knowledge should be represented,
whether the captured knowledge requires updating previous records, and whether the
knowledge is duplicate. Fortunately, the emergence of neurosymbolic approaches, which combine
large language models (LLMs) and symbolic AI, has provided researchers with new perspectives
to address these challenges [
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4">1, 2, 3, 4</xref>
        ]. LLMs’ capabilities in natural language processing can
be integrated with the knowledge representation and factual reasoning abilities of knowledge
graphs, enhanced by the structure, rules, and inference mechanisms ofered by an ontology.
      </p>
      <p>
        Another significant challenge related to CKC is ensuring the privacy of captured sensitive
knowledge. Personal data, which is entirely owned by the user, should be considered vulnerable
CEUR
Workshop
Proceedings
if it is sent to the cloud. On-device AI solutions, which do not require any data to leave the user’s
device, provide the most appropriate response to privacy needs [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Capturing knowledge with
the support of a local language model running on the device, securely storing this information
in a local knowledge base, and utilizing it on the device when needed, provides a suitable
environment for maintaining the privacy of personal knowledge. However, on-device language
models come with their own limitations. The size, capabilities, and power consumption of
language models running on personal devices such as smartphones, tablets, and computers
must be carefully considered [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Fortunately, remarkable developments are emerging every
day. Thanks to R&amp;D eforts, LLMs with fewer parameters are now ofering faster responses and
improved performance compared with older large models.
      </p>
      <p>In this paper, we explore the feasibility of generating personal knowledge graphs on-device
through conversational interaction. Our approach focuses on ontology-guided knowledge
extraction from prompts in the form of subject-predicate-object triples1. We have investigated
various methods to enable the underlying language model to comprehend a predefined ontology,
ensuring efective personal knowledge-graph generation. Subsequently, we selected the most
suitable method based on the requirements of on-device execution. Utilizing a specially designed
dataset, we evaluate the efectiveness of this method, emphasizing its strengths and identifying
potential areas for improvement.</p>
      <p>The structure of this paper is as follows: Section 2 discusses various approaches, including
in-context learning and fine-tuning for ontology-guided knowledge capture, and focuses on
the fine-tuning approach due to its suitability for on-device execution. Section 3 describes
the experimental setup, presenting the development framework, language model selection,
and the ontology and dataset creation process. Section 4 outlines our performance evaluation
framework and the test results. Finally, Section 5 concludes the paper and suggests future
directions.</p>
    </sec>
    <sec id="sec-3">
      <title>2. Ontology-Guided Symbolic Knowledge Capture</title>
      <p>
        In the literature, language models have demonstrated their capability to transform unstructured
text into knowledge graphs [
        <xref ref-type="bibr" rid="ref10 ref11 ref7 ref8 ref9">7, 8, 9, 10, 11</xref>
        ]. However, the process of populating a knowledge
graph from user prompts in alignment with a predefined ontology has been explored only
marginally [
        <xref ref-type="bibr" rid="ref12 ref13 ref14 ref15 ref16 ref17">12, 13, 14, 15, 16, 17</xref>
        ]. Except for [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], these studies have enjoyed unconstrained
processing and memory capacity. Large models with large context windows have enabled
incontext learning methods relying on prompt engineering. However, on-device conversational
knowledge capture is not similarly unconstrained. Given current context-window capacities,
embedding an entire personal ontology into the system prompt would be unrealistic.
Additionally, considering the inference speed of language models running on personal devices, the high
token overhead introduced by this would present a barrier to eficient system operation.
      </p>
      <p>An alternative to in-context learning involves training a language model with a predefined
ontology so that the model internalizes it. There are two strategies to consider: pretraining
the LLM on the ontology or fine-tuning it. This paper does not explore pretraining due to its
extensive data, computational resource, energy, and time requirements. Additionally, pretraining
1https://www.w3.org/TR/rdf12-concepts/
does not ofer a flexible response to ongoing changes or expansions in the ontology. Therefore,
this paper focuses on fine-tuning as a method to train language models on personal ontologies,
highlighting its advantages in feasibility and maintainability.</p>
      <p>Fine-tuning is a process whereby a pretrained language model is further trained on a specific
dataset to tailor its capabilities to a particular task. In our study, the language model is expected
to understand the ontology classes and their properties, and use them to populate a knowledge
graph from user prompts. The first step involves preparing a fine-tuning dataset, which includes
user prompts, system prompts, and expected model responses for each concept in the ontology.
This dataset is used to fine-tune the language model, which is then evaluated by testing it with
new prompts to assess the efectiveness of the CKC process.</p>
      <p>The following points highlight the key aspects of ontology fine-tuning:
• The training dataset’s coverage and diversity are vital for successful fine-tuning. These
characteristics greatly influence the LLM’s ability to capture knowledge efectively. Details
about the dataset and how it is constructed are discussed in Section 3.4.
• The training dataset must include a variety of examples for the predefined ontology.</p>
      <p>Research related to the structure of the examples prepared for ontology concepts is
detailed in Section 4.
• If the language model encounters a user prompt that is not relevant to the predefined
ontology concepts, it should not attempt to capture knowledge. Therefore, the dataset
should also contain suficient out-of-context samples to enable the language model to
distinguish between relevant and irrelevant information for capture.</p>
    </sec>
    <sec id="sec-4">
      <title>3. Experimental Setup</title>
      <sec id="sec-4-1">
        <title>3.1. Development Framework</title>
        <p>
          The methods suggested in this paper have been implemented using the Apple MLX framework
[
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]. MLX is a specialized array framework designed for machine learning applications, akin to
NumPy, PyTorch, or JAX, with the distinction of being exclusive to Apple silicon.
        </p>
        <p>
          Ontology fine-tuning has been conducted using the parameter-eficient QLoRA adapters
[
          <xref ref-type="bibr" rid="ref19">19</xref>
          ] on our custom dataset, comprising randomly selected, non-overlapping sets of training,
validation, and test samples.
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>3.2. Language Model</title>
        <p>
          Due to the constraint of on-device execution, our study does not use state-of-the-art
largeparameter cloud-based language models. Instead, we opted for a relatively low-parameter model
with proven efectiveness across diverse domains. Based on its performance in the Hugging
Face Open LLM Leaderboard [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] and its robust ecosystem, we selected Mistral-7B-Instruct-v0.2
[
          <xref ref-type="bibr" rid="ref21">21</xref>
          ], which is based on the Llama 2 [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ] architecture. The MLX 4-bit quantized version, with a
disk size of 4.26 GB, stands out as a suitable model for many personal computers, tablets, and
even new-generation smartphones.
        </p>
      </sec>
      <sec id="sec-4-3">
        <title>3.3. Applied Ontology</title>
        <p>
          Our study is inspired by KNOW[
          <xref ref-type="bibr" rid="ref23">23</xref>
          ]—the Knowledge Navigator Ontology for the World—and
utilizes it for representing personal information. KNOW was introduced as a pioneering
framework designed to capture everyday knowledge to enhance language models in real-world
generative AI applications such as personal AI assistants. The ontology focuses on human
life, encompassing everyday concerns and significant milestones, and limits its initial scope
to established human universals, including spacetime (places, events) and social dimensions
(people, groups, organizations). This pragmatic approach emphasizes universality and utility,
contrasting with previous works like Schema.org[
          <xref ref-type="bibr" rid="ref24">24</xref>
          ] and Cyc[
          <xref ref-type="bibr" rid="ref25">25</xref>
          ] by building on language
models’ inherent encoding of salient commonsense knowledge.
        </p>
        <p>Because of the requirement that each element in the ontology be associated with a diverse set
of prompt and response samples within the training dataset, our research focuses on a specific
subset of the KNOW ontology. This subset concentrates on core family relationships with four
ontology classes, eleven object properties, and one data property. A visual depiction of this
subset is presented in Figure 1.</p>
        <p>spouse child parent partner knows sister mother sibling brother father
{&lt;partner{}} {&lt;knows{}} {&lt;knows{}} {&lt;knows{}} {&lt;sibling{}} {&lt;parent{}} {&lt;knows{}} {&lt;sibling{}} {&lt;parent{}}</p>
        <p>Person
Thing
name:string</p>
        <p>sex</p>
        <p>Sex
=Female{} or Male{}</p>
        <p>mother
=sex{} value Female{}</p>
        <p>father
=sex{} value Male{}</p>
        <p>sister
=sex{} value Female{}</p>
        <p>brother
=sex{} value Male{}</p>
        <p>Female</p>
        <p>Male</p>
      </sec>
      <sec id="sec-4-4">
        <title>3.4. Dataset</title>
        <p>For a language model to efectively learn a predefined ontology and use it to perform knowledge
extraction and capture, a robust and diverse training dataset is essential. Our paper focuses
on a subset of the KNOW ontology that includes the concepts of ‘person’, ‘name’, ‘sex’, ‘child’,
‘father’, ‘mother’, ‘sibling’, ‘sister’, ‘brother’, ‘spouse’, ‘partner’, and ‘knows’. We created 145
manually crafted user prompts along with their respective ontology responses for training.
Additionally, to manage inputs that fall outside these ontology concepts, we included 32 generic
user prompts in the dataset. The composition of this training dataset, which consists of 177
user prompts, is illustrated in Figure 2. Concepts not associated with the ontology are labeled
as the ‘none’ in the figure. Since each sample prompt usually includes multiple concepts, the
chart shows more concept occurrences than prompts.</p>
        <p>For the test set to be used in the evaluation, we generated 100 manual test prompts and their
expected responses about family relations based on the television series ‘The Waltons’. The
Waltons is a classic American television series that aired from 1972 to 1981, depicting the life
and challenges of a close-knit family in rural Virginia during the Great Depression and World
War II. The show focuses on the daily experiences, values, and growth of the Walton family,
emphasizing themes of love, perseverance, and community. The composition of this test dataset,
which consists of 100 user prompts, is illustrated in Figure 2.</p>
        <p>Occurrences of Ontology Concepts in the Training and Test Datasets</p>
        <p>The Turtle format was chosen for serializing the ontology population in our research because
of its straightforward structure, readability, and prevalent use in existing pretraining datasets
for LLMs.</p>
        <p>Person</p>
        <p>Name</p>
        <p>Sex</p>
        <p>Child
Brother</p>
        <p>Sister
Sibling
Mother
Father
Spouse
Partner
Knows</p>
        <p>None
0
100</p>
        <p>200</p>
        <sec id="sec-4-4-1">
          <title>Number of Occurrences</title>
          <p>Training
Test
300</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>4. Performance Evaluation</title>
      <p>Our research focuses on fine-tuning an on-device language model with predefined ontology
concepts and capturing knowledge from user prompts that fit the ontology. This section will
detail the fine-tuning approaches and the relevant performance evaluations.</p>
      <p>One of our main objectives is to comprehend the training dynamics of ontology-guided
knowledge capture. Consequently, we will not emphasize the optimization of fine-tuning
hyperparameters. For a fair performance evaluation, all tests in this section were conducted using
the default QLoRA hyperparameters specified in the MLX framework. To ensure consistency in
the test results, each training session was configured to run for 18 epochs.</p>
      <p>Firstly, we investigated whether training data associated with each ontology concept is
necessary for the successful fine-tuning process. For instance, we evaluated the ability of a
language model, trained with only one of two semantically related concepts (e.g., ‘brother’),
to capture knowledge related to the concept that was not included in the training data (e.g.,
‘sister’). During the evaluations, the generated prompt responses were processed triple by triple
and compared against the ground truth established for the test set. The findings are presented
in Figure 3.</p>
      <sec id="sec-5-1">
        <title>Performance of 'Sister' Relation vs. Two CKC Adapters</title>
        <p>Precision</p>
        <p>As illustrated in Figure 3, a CKC QLoRA adapter trained exclusively on the ‘brother’ concept
shows a significant decline in performance when tested with the ‘sister’ relation prompts. In
contrast, an adapter trained on both the ‘brother’ and ‘sister’ concepts demonstrates excellent
performance on the same test set. Although the language model’s pretraining is suficient to
distinguish between the ‘brother’ and ‘sister’ concepts, our tests reveal that this is inadequate
for efective knowledge capture.</p>
        <p>The second issue we examined was whether it is necessary for each concept to be used in
conjunction with other concepts in the fine-tuning dataset. To provide a concrete example,
we assessed the performance of fine-tuning using samples that included only the ‘brother’ or
only the ‘sister’ relationship when prompted with contexts where both the ‘brother’ and ‘sister’
concepts co-occur. We compared the performance of a knowledge capture adapter fine-tuned
with samples containing only the ‘brother’ and ‘sister’ concepts against another adapter trained
with the same data set, with extra samples where both ‘brother’ and ‘sister’ concepts appear
together. The results of this comparison are presented below in Figure 4.</p>
        <p>Performance of 'Brother-Sister' Relation vs. Two CKC Adapters</p>
        <p>Precision Recall F1-Score
1.00
0.75
0.50
0.25
0.00
0.75
0.50
0.25</p>
        <p>Performance 'Father-Son' &amp; 'Mother-Daughter' Relation vs. Two Knowledge</p>
        <p>Capture Adapters</p>
        <p>Precision Recall F1-Score
CKC adapter trained with separate
'father-daughter' and 'mother-son'
relation prompts</p>
        <p>CKC adapter trained with all
'fatherdaughter', 'father-son',
'motherdaughter', and 'mother-son'
0.75
0.50
0.25</p>
        <p>Similarly, in Figure 5, we presented the knowledge capture performance of two diferent
adapters, one trained with only ‘father-daughter’ and ‘mother-son’ prompts and the other
trained with all ‘father-daughter’, ‘father-son’, ‘mother-daughter’, and ‘mother-son’ prompts.
Both Figure 4 and Figure 5 demonstrate that having cross relations between ontology concepts in
the training set increases knowledge capture performance. In the future, we aim to repeat these
tests with various ontologies and language models to obtain more general results regarding this
approach.</p>
        <p>Performance of 'Brother', 'Sister', and 'Brother-Sister' Relations vs.</p>
        <p>Two CKC Adapters</p>
        <p>Precision Recall F1-Score
CKC adapter trained solely with
'fatherdaughter', 'father-son',
'motherdaughter', and 'mother-son'</p>
        <p>CKC adapter trained with the whole
core-family ontology prompts
Figure 7: CKC performance (precision, recall, and f1-score) of ‘father-daughter’, ‘father-son’,
‘motherdaughter’, and ‘mother-son’ relation prompts for two diferently fine-tuned QLoRA adapters
CKC adapter trained solely with 'brother',
'sister', and 'brother-sister' relation
prompts</p>
        <p>CKC adapter trained with the whole
core-family ontology prompts</p>
        <p>Another aspect we researched in our study was the impact of the ontology size used in
training on knowledge capture performance. In our previous tests, we trained the language
model on specific ontology concepts and then examined the knowledge capture performance
of the resulting adapter. At this stage, we compared the performance of a knowledge capture
adapter trained solely on the ontology concepts present in the test set with an adapter trained on
the entire core-family ontology. Our objective was to investigate whether adapters experience
any degradation in performance as they are trained on more ontology concepts. In other words,
we observed the scalability of ontology learning for the on-device language model we used.
The results for the two diferent groups are presented in Figures 6 and 7. As seen from the
ifgures, as the number of concepts in ontology training increases, there is a slight decrease in
the performance of the knowledge capture adapter. However, the observed degradation within
the scope of the tests does not appear to lead to a major scalability problem.</p>
        <p>In the subsequent phase, we explored the optimal number of training epochs required to
achieve maximum performance for the training set. For this analysis, we continued using the
default MLX QLoRA hyperparameters, but trained the QLoRA adapter over various epoch
lengths. We then conducted evaluations on the test set using each trained adapter, and the
ifndings are presented in Figure 8.</p>
      </sec>
      <sec id="sec-5-2">
        <title>Test Set Performance vs. Training Epochs</title>
        <p>Precision</p>
        <p>Recall</p>
        <p>F1-Score
1.00
0.75
0.50
0.25
0.00
9
18</p>
        <p>27
Training epochs
36</p>
        <p>As depicted in Figure 8, the success rate of the ontology population increases with longer
training. However, considering the resource usage and energy consumption, we observe that
18 epochs is suficient for fine-tuning.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>5. Conclusion</title>
      <p>In this paper, we first explored on-device ontology-guided conversational knowledge capture
and its importance in the generative AI domain. We then discussed the ontology approach and
how to train an on-device LLM with ontology concepts. The language model was fine-tuned
using a custom dataset focused on core family relationships, and we evaluated the model’s
ability to learn personal ontology concepts.</p>
      <p>Our findings indicate that fine-tuning is particularly efective for training an on-device
language model with ontology concepts for conversational knowledge capture. In our future work,
we aim to integrate the generated knowledge graph with the language model for knowledge
utilization, combining the strengths of the neural and symbolic AI approaches.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Sheth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Roy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gaur</surname>
          </string-name>
          ,
          <string-name>
            <surname>Neurosymbolic</surname>
            <given-names>AI</given-names>
          </string-name>
          - Why, What, and
          <string-name>
            <surname>How</surname>
          </string-name>
          ,
          <year>2023</year>
          . URL: http: //arxiv.org/abs/2305.00813, arXiv:
          <fpage>2305</fpage>
          .00813 [cs].
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>L. N. DeLong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. F.</given-names>
            <surname>Mir</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. D.</given-names>
            <surname>Fleuriot</surname>
          </string-name>
          ,
          <source>Neurosymbolic AI for Reasoning over Knowledge Graphs: A Survey</source>
          ,
          <year>2024</year>
          . URL: http://arxiv.org/abs/2302.07200, arXiv:
          <fpage>2302</fpage>
          .07200 [cs, stat].
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>F. J.</given-names>
            <surname>Ekaputra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Llugiqi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sabou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ekelhart</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Paulheim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Breit</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Revenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Waltersdorfer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. E.</given-names>
            <surname>Farfar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Auer</surname>
          </string-name>
          ,
          <source>Describing and Organizing Semantic Web and Machine Learning Systems in the SWeMLS-KG</source>
          ,
          <year>2023</year>
          . URL: http://arxiv.org/abs/2303.15113, arXiv:
          <fpage>2303</fpage>
          .15113 [cs].
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>L.-P.</given-names>
            <surname>Meyer</surname>
          </string-name>
          , C. Stadler,
          <string-name>
            <given-names>J.</given-names>
            <surname>Frey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Radtke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Junghanns</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Meissner</surname>
          </string-name>
          , G. Dziwis,
          <string-name>
            <given-names>K.</given-names>
            <surname>Bulert</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Martin, LLM-assisted Knowledge Graph Engineering: Experiments with ChatGPT, 2023</article-title>
          . URL: http://arxiv.org/abs/2307.06917, arXiv:
          <fpage>2307</fpage>
          .06917 [cs].
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>E.</given-names>
            <surname>Marin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Perino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. Di</given-names>
            <surname>Pietro</surname>
          </string-name>
          , Serverless Computing:
          <string-name>
            <given-names>A Security</given-names>
            <surname>Perspective</surname>
          </string-name>
          ,
          <year>2022</year>
          . URL: http://arxiv.org/abs/2107.03832. doi:
          <volume>10</volume>
          .48550/arXiv.2107.03832, arXiv:
          <fpage>2107</fpage>
          .03832 [cs].
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>T.</given-names>
            <surname>Çöplü</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Loedi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bendiken</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Makohin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. J.</given-names>
            <surname>Bouw</surname>
          </string-name>
          ,
          <string-name>
            <surname>S. Cobb,</surname>
          </string-name>
          <article-title>A Performance Evaluation of a Quantized Large Language Model on Various Smartphones</article-title>
          ,
          <year>2023</year>
          . URL: https://arxiv. org/abs/2312.12472. arXiv:
          <volume>2312</volume>
          .
          <fpage>12472</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Jin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Qiu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Wipf</surname>
          </string-name>
          ,
          <string-name>
            <surname>Z. Zhang,</surname>
          </string-name>
          <article-title>CycleGT: Unsupervised Graph-to-Text and</article-title>
          <string-name>
            <surname>Text-</surname>
          </string-name>
          to-
          <source>Graph Generation via Cycle Training</source>
          ,
          <year>2020</year>
          . URL: http://arxiv.org/abs/
          <year>2006</year>
          . 04702. doi:
          <volume>10</volume>
          .48550/arXiv.
          <year>2006</year>
          .
          <volume>04702</volume>
          , arXiv:
          <year>2006</year>
          .04702 [cs].
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Yin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>Entity-Relation Extraction as Multi-Turn Question Answering</article-title>
          ,
          <year>2019</year>
          . URL: http://arxiv.org/abs/
          <year>1905</year>
          .05529. doi:
          <volume>10</volume>
          . 48550/arXiv.
          <year>1905</year>
          .
          <volume>05529</volume>
          , arXiv:
          <year>1905</year>
          .05529 [cs].
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Fu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Qi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <surname>INFINITY</surname>
          </string-name>
          :
          <string-name>
            <given-names>A Simple</given-names>
            <surname>Yet Efective Unsupervised Framework for Graph-Text Mutual</surname>
          </string-name>
          <string-name>
            <surname>Conversion</surname>
          </string-name>
          ,
          <year>2022</year>
          . URL: http://arxiv.org/abs/2209.10754. doi:
          <volume>10</volume>
          .48550/arXiv.2209.10754, arXiv:
          <fpage>2209</fpage>
          .10754 [cs].
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>R.</given-names>
            <surname>Anantharangachar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ramani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Rajagopalan</surname>
          </string-name>
          , Ontology Guided Information Extraction from Unstructured Text,
          <source>International journal of Web &amp; Semantic Technology</source>
          <volume>4</volume>
          (
          <year>2013</year>
          )
          <fpage>19</fpage>
          -
          <lpage>36</lpage>
          . URL: http://arxiv.org/abs/1302.1335. doi:
          <volume>10</volume>
          .5121/ijwest.
          <year>2013</year>
          .
          <volume>4102</volume>
          , arXiv:
          <fpage>1302</fpage>
          .1335 [cs].
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>T.</given-names>
            <surname>Çöplü</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bendiken</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Skomorokhov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Bateiko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Cobb</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. J.</given-names>
            <surname>Bouw</surname>
          </string-name>
          ,
          <string-name>
            <surname>Prompt-Time Symbolic Knowledge Capture with Large Language Models</surname>
          </string-name>
          ,
          <year>2024</year>
          . URL: http://arxiv.org/ abs/2402.00414. doi:
          <volume>10</volume>
          .48550/arXiv.2402.00414, arXiv:
          <fpage>2402</fpage>
          .00414 [cs].
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>H. B. Giglou</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. D'Souza</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Auer</surname>
          </string-name>
          ,
          <source>LLMs4OL: Large Language Models for Ontology Learning</source>
          ,
          <year>2023</year>
          . URL: http://arxiv.org/abs/2307.16648. doi:
          <volume>10</volume>
          .48550/arXiv.2307.16648, arXiv:
          <fpage>2307</fpage>
          .16648 [cs, math].
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>P.</given-names>
            <surname>Mateiu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Groza</surname>
          </string-name>
          ,
          <source>Ontology engineering with Large Language Models</source>
          ,
          <year>2023</year>
          . URL: http://arxiv.org/abs/2307.16699, arXiv:
          <fpage>2307</fpage>
          .16699 [cs].
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>K.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Pan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <source>PIVOINE: Instruction Tuning for Openworld Information Extraction</source>
          ,
          <year>2023</year>
          . URL: http://arxiv.org/abs/2305.14898. doi:
          <volume>10</volume>
          .48550/ arXiv.2305.14898, arXiv:
          <fpage>2305</fpage>
          .14898 [cs].
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <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</article-title>
          ,
          <year>2023</year>
          . URL: http://arxiv.org/ abs/2308.02357. doi:
          <volume>10</volume>
          .48550/arXiv.2308.02357, arXiv:
          <fpage>2308</fpage>
          .02357 [cs].
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>M.</given-names>
            <surname>Funk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Hosemann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. C.</given-names>
            <surname>Jung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Lutz</surname>
          </string-name>
          ,
          <source>Towards Ontology Construction with Language Models</source>
          ,
          <year>2023</year>
          . URL: http://arxiv.org/abs/2309.09898. doi:
          <volume>10</volume>
          .48550/arXiv.2309.09898, arXiv:
          <fpage>2309</fpage>
          .09898 [cs].
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>T.</given-names>
            <surname>Çöplü</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bendiken</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Skomorokhov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Bateiko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Cobb</surname>
          </string-name>
          ,
          <string-name>
            <surname>Prompt-Time OntologyDriven Symbolic Knowledge Capture with Large Language Models</surname>
          </string-name>
          ,
          <year>2024</year>
          . URL: https: //arxiv.org/abs/2405.14012. arXiv:
          <volume>2405</volume>
          .
          <fpage>14012</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>A.</given-names>
            <surname>Hannun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Digani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Katharopoulos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Collobert</surname>
          </string-name>
          , MLX:
          <article-title>Eficient and flexible machine learning on Apple silicon</article-title>
          , https://github.com/ml-explore,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>T.</given-names>
            <surname>Dettmers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Pagnoni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Holtzman</surname>
          </string-name>
          , L. Zettlemoyer, QLoRA: Eficient Finetuning of Quantized LLMs,
          <year>2023</year>
          . URL: http://arxiv.org/abs/2305.14314. doi:
          <volume>10</volume>
          .48550/arXiv.2305. 14314, arXiv:
          <fpage>2305</fpage>
          .14314 [cs].
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>E.</given-names>
            <surname>Beeching</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Fourrier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Habib</surname>
          </string-name>
          , S. Han,
          <string-name>
            <given-names>N.</given-names>
            <surname>Lambert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Rajani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Sanseviero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Tunstall</surname>
          </string-name>
          , T. Wolf, Open LLM Leaderboard, https://huggingface.co/spaces/HuggingFaceH4/open_ llm_leaderboard,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <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. d. l. 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,
          <year>2023</year>
          . URL: http://arxiv.org/abs/2310.06825. doi:
          <volume>10</volume>
          .48550/arXiv.2310.06825, arXiv:
          <fpage>2310</fpage>
          .06825 [cs].
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <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>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Bikel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Blecher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. C.</given-names>
            <surname>Ferrer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Cucurull</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Esiobu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Fernandes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Fu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Fu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Fuller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Goswami</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Hartshorn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Hosseini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Hou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Inan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kardas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Kerkez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Khabsa</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Kloumann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Korenev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. S.</given-names>
            <surname>Koura</surname>
          </string-name>
          , M.
          <article-title>-</article-title>
          <string-name>
            <surname>A. Lachaux</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Lavril</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Liskovich</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Lu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Mao</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          <string-name>
            <surname>Martinet</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Mihaylov</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Mishra</surname>
            , I. Molybog,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Nie</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Poulton</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Reizenstein</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Rungta</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Saladi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Schelten</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Silva</surname>
            ,
            <given-names>E. M.</given-names>
          </string-name>
          <string-name>
            <surname>Smith</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Subramanian</surname>
            ,
            <given-names>X. E.</given-names>
          </string-name>
          <string-name>
            <surname>Tan</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Tang</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Taylor</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Williams</surname>
            ,
            <given-names>J. X.</given-names>
          </string-name>
          <string-name>
            <surname>Kuan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          <string-name>
            <surname>Yan</surname>
            , I. Zarov,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Fan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Kambadur</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Narang</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Rodriguez</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Stojnic</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Edunov</surname>
          </string-name>
          ,
          <source>T. Scialom, Llama</source>
          <volume>2</volume>
          :
          <article-title>Open foundation and fine-tuned chat models</article-title>
          ,
          <year>2023</year>
          . arXiv:
          <volume>2307</volume>
          .
          <fpage>09288</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>A.</given-names>
            <surname>Bendiken</surname>
          </string-name>
          ,
          <article-title>KNOW: A Real-World Ontology for Knowledge Capture with Large Language Models</article-title>
          ,
          <year>2024</year>
          . URL: https://arxiv.org/abs/2405.19877. arXiv:
          <volume>2405</volume>
          .
          <fpage>19877</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>R. V.</given-names>
            <surname>Guha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Brickley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Macbeth</surname>
          </string-name>
          , Schema.org:
          <article-title>evolution of structured data on the web</article-title>
          ,
          <source>Communications of the ACM</source>
          <volume>59</volume>
          (
          <year>2016</year>
          )
          <fpage>44</fpage>
          -
          <lpage>51</lpage>
          . URL: https://doi.org/10.1145/2844544. doi:
          <volume>10</volume>
          .1145/2844544.
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <surname>D. B. Lenat</surname>
            ,
            <given-names>R. V.</given-names>
          </string-name>
          <string-name>
            <surname>Guha</surname>
          </string-name>
          ,
          <source>Building Large Knowledge-Based Systems; Representation and Inference in the Cyc Project</source>
          , 1st ed.,
          <string-name>
            <surname>Addison-Wesley Longman</surname>
          </string-name>
          Publishing Co., Inc., USA,
          <year>1989</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>