<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Unveiling influential factors in classifying domain entities into top-level ontology concepts: an analysis using GO and ChEBI ontologies</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Alcides Lopes</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Joel Luis Carbonera</string-name>
          <email>jlcarbonera@inf.ufrgs.br</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fabricio Rodrigues</string-name>
          <email>fabricio.rodrigues@inf.ufrgs.br</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Luan Fonseca Garcia</string-name>
          <email>lfgarcia@inf.ufrgs.br</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mara Abel</string-name>
          <email>marabel@inf.ufrgs.br</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Pontifícia Universidade Católica do Rio Grande do Sul</institution>
          ,
          <addr-line>Av. Ipiranga 6681, Porto Alegre</addr-line>
          ,
          <country country="BR">Brazil</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Universidade Federal do Rio Grande do Sul</institution>
          ,
          <addr-line>Av. Bento Gonçalves 9500, Porto Alegre, 15064</addr-line>
          ,
          <country country="BR">Brazil</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In the realm of ontology engineering, accurately classifying domain entities into top-level ontology concepts is a critical task, with significant implications in the time and efort required to build ontologies from scratch. This paper delves into the influential factors afecting the performance of using informal definitions to represent domain entities textually, Language Models to represent these definitions as embedding vectors, and the KNearest Neighbors (KNN) algorithm to classify these embeddings into top-level ontology concepts. Also, we particularly focused on the Gene Ontology (GO) and Chemical Entities of Biological Interest (ChEBI) ontologies. We hypothesize that the embedding representation of informal definitions of highly specialized domains may present diferent behaviors regarding their proximity with other informal definitions of other domains, influencing the predicted top-level ontology concept. To test our hypothesis, we conducted a series of experiments using variations on the number of GO and ChEBI domain entities in the training sample of our classifier. Our results indicate that the relation between the proximity of domain entities in the embedding space and the top-level ontology concept of these domain entities varies according to the domain specificity. Also, this result is strongly influenced by how ontology developers write the informal definitions in each domain. The findings underscore the potential of informal definitions in reflecting top-level ontology concepts and point toward using consolidated domain entities in a domain ontology during the training stage of the classifier.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Top-level ontology classification</kwd>
        <kwd>Informal definition</kwd>
        <kwd>Ontology learning</kwd>
        <kwd>Language Model</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        In ontology engineering, the accurate classification of domain entities into top-level ontology concepts
is a crucial task with significant implications for the time and efort required to build ontologies from
scratch. This task involves not only recognizing and extracting entities but also understanding the
theoretical foundations and implications of aligning these entities with appropriate top-level concepts.
Top-level ontologies, such as the Basic Formal Ontology (BFO) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] and the Descriptive Ontology for
Linguistic and Cognitive Engineering (DOLCE) [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], provide a foundational structure for categorizing
and organizing knowledge across various domains, serving as a common framework for the semantic
integration of domain ontologies. In this context, the process of classifying domain entities into top-level
ontology concepts is traditionally labor-intensive and requires expertise in both the target domain and
ontology engineering [
        <xref ref-type="bibr" rid="ref3 ref4 ref5">3, 4, 5</xref>
        ].
      </p>
      <p>
        This paper takes advantage of the classification pipelines proposed in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] and the BFO-based datasets
proposed in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] to investigate the influential factors afecting the performance of using informal
definitions to represent domain entities textually, language models to generate embedding vectors from
these definitions, and the KNN algorithm to classify these embeddings into top-level ontology concepts.
Our study focuses on the Gene Ontology (GO) and Chemical Entities of Biological Interest (ChEBI)
ontologies, which are widely used in academia and industry for representing biological and chemical
knowledge, respectively. We hypothesize that the embedding representation of informal definitions of
highly specialized domains may exhibit diferent behaviors regarding their proximity to other informal
definitions from diferent domains, influencing the predicted top-level ontology concept.
      </p>
      <p>To test our hypothesis, we conducted a series of experiments using variations in the number of
GO and ChEBI domain entities in the training sample of our classifier. Our results indicate that the
relationship between the proximity of domain entities in the embedding space and their top-level
ontology concepts varies according to domain specificity. Furthermore, this relationship is strongly
influenced by how ontology developers write the informal definitions in each domain. The findings
underscore the potential of informal definitions in reflecting top-level ontology concepts and point
toward the use of consolidated domain entities in a domain ontology during the classifier’s training
stage.</p>
      <p>The remainder of this paper is organized as follows: Section 2 reviews related work in ontology,
language models, and the use of informal definitions. Section 3 outlines the research questions and
objectives guiding our study. Section 4 describes the experimental setup and presents the results of our
experiments. Finally, Section 5 discusses the implications of our findings and concludes the paper with
suggestions for future research.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>In this section, we discuss the key aspects of ontologies, top-level ontologies, and informal definitions
in enhancing semantic interoperability and knowledge representation. We review the evolution from
the Distributional Hypothesis to modern transformer models like BERT and GPT in NLP. Finally,
we examine methods for automating domain entity classification into top-level concepts, including
using external resources, combining terms with informal definitions, and cross-domain classification
scenarios.</p>
      <sec id="sec-2-1">
        <title>2.1. BFO Ontologies and Informal Definitions</title>
        <p>The Basic Formal Ontology (BFO) is a top-level ontology designed to support data integration in scientific
domains by providing general concepts that can be reused across multiple domain ontologies, aiding in
the unification and categorization of information from diferent domains. The main subdivision in the
BFO structure regards Continuants and Occurrents. Continuants represent entities that persist through
time while retaining their identity, such as physical objects or substances. Occurrents encompass entities
that unfolds over time, encompassing processes and events that have temporal duration. Occurrents
include phenomena such as a biological process (e.g., cell division) or a historical event (e.g., a volcanic
eruption). Furthermore, Continuants can also subdivided into Independent Continuants, Specifically
Dependent Continuants, and Generically Dependent Continuants. Independent Continuants are entities
that exist independently of other entities, such as organisms, artifacts, or specific substances, e.g.,
a human or a rock. Specifically Dependent Continuants are entities that depends on one or more
Independent Continuants to exist, e.g., a biological function (like digestion) or qualities (like color).
Generically Dependent Continuants are entities that depends on Independent Continuants for their
existence, but unlike Specifically Dependent Continuants, they can exist in multiple instances or
locations. For example, a software program can be copied across diferent systems but still remains the
same entity. In addition, Occurrent entities can be subdivided into Processes, which are entities with
temporal parts that, at some time, involve a material entity as a participant.</p>
        <p>
          The BFO ontology serves as a backbone to several domain ontologies, such as The Gene Ontology
(GO) and The Chemical Entities of Biological Interest (ChEBI) ontologies. The GO ontology describes
knowledge in the biological domain through three subdomains: molecular functions, cellular
components, and biological processes. The ChEBI ontology, maintained by the European Bioinformatics
Institute, provides a controlled vocabulary for biochemical terminology across four subdomains:
Molecular Structure, Biological Role, Application, and Subatomic Particle, all mapped to conform with BFO.
A key aspect of GO and ChEBI ontologies is the use of clear and precise definitions. In ontologies,
definitions are designed to align terms with cognitive and linguistic requirements, enhancing inferential
competence and ensuring efective communication [
          <xref ref-type="bibr" rid="ref7 ref8">7, 8</xref>
          ]. Also, definitions convey the semantic value of
a term, delimiting its intention and extension, which adjusts the overall lexical competence of users. This
alignment is crucial for semantic interoperability, consistent knowledge representation, and integration
across diverse systems and applications. Following [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] proposal, we use informal definitions in the
form “X is a Y that Z", where the “X" is the term being defined, the “Y that Z" is the explanatory part
that provides the meaning of “X" in a specific context, and the “is" provides an equivalence relationship
between both parts.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Distributional Hypothesis and Language Models</title>
        <p>
          Harris formulated the Distributional Hypothesis in 1954 [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], asserting that words in similar contexts
share related meanings. This principle uses distributional patterns in texts to infer word semantics.
Harris emphasized context’s role in linguistic meaning, advocating for the analysis of word usage in
diferent settings. He prioritized empirical language analysis, creating a framework based on quantitative
data and moving away from introspective methods. This hypothesis shaped modern linguistic analysis
and influenced computational linguistics. Based on this idea, researchers developed word embeddings
[
          <xref ref-type="bibr" rid="ref10 ref11 ref12">10, 11, 12</xref>
          ] and language models [
          <xref ref-type="bibr" rid="ref13 ref14 ref15 ref16">13, 14, 15, 16</xref>
          ], representing words and sentences as vectors in
highdimensional spaces. In addition, these models advanced Natural Language Processing (NLP), enhancing
machines’ ability to understand and generate human language. Also, the Distributional Hypothesis
remains crucial, linking linguistic theory with practical NLP applications.
        </p>
        <p>
          Transformer-based models like BERT (Bidirectional Encoder Representations from Transformers)
[
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] and GPT (Generative Pre-trained Transformer) [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] significantly advanced NLP. These models
revolutionized NLP by employing attention mechanisms to understand the full context of a word
concerning all other words in a sentence or even across multiple sentences. BERT introduced a
paradigm shift by pre-training on a large corpus of text and then fine-tuning for specific tasks, achieving
unprecedented performance across various NLP benchmarks. The bidirectional nature of BERT allowed
it to understand the context from both the left and the right of each word in a sentence, providing a
more comprehensive understanding of language. In contrast, GPT and its successors, GPT-2, GPT-3,
and GPT-4, use a generative approach by predicting the next word in a sequence based on all previous
words, utilizing a left-to-right interpretation of a given sentence. In the same line, nowadays LLaMA
[
          <xref ref-type="bibr" rid="ref15 ref17">15, 17</xref>
          ], Mistral [18], and Gemma [19] represent the current state-of-the-art language models with
model weights available for free.
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Classification of domain entities into top-level concepts</title>
        <p>
          In recent years, significant strides have been made in automating the classification of domain entities
into top-level ontological concepts. For instance, [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] introduced a deep learning approach combining a
feed-forward neural network with a bi-directional recurrent neural network utilizing long short-term
memory units to process word embeddings and informal definitions of domain terms. This novel
architecture, trained on a dataset extracted from the OntoWordNet ontology (an alignment between
WordNet synsets and DOLCE-lite-plus top-level ontology), showed that their model efectively manages
polysemy and enhances classification accuracy and robustness by considering more instances during
training.
        </p>
        <p>Building on these advancements, [20] proposed a systematic Foundational Ontology (FO) probing
methodology. As opposed in using informal definitions, this methodology uses pairs of words and their
example sentences to test language models’ ability to classify words into FO categories, achieving around
90% accuracy in FO classification tasks with Transformer-based models like BERT and RoBERTa. This
high accuracy demonstrates that these models can naturally encode fundamental ontological concepts,
improving semantic understanding and reasoning in natural language processing applications.</p>
        <p>
          Further expanding the domain, [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] presented a method that combines domain entities’ terms with
their informal definitions into single-text sentences, eliminating the need for external resources. This
approach, tested on datasets derived from the OntoWordNet ontology aligned with DOLCE-Lite and
DOLCE-Lite-Plus top-level ontologies, achieved a micro F1-score of 94% in classifying domain entities.
Subsequent studies, such as [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ], explored cross-domain classification using terms and definitions from
81 domain ontologies across 12 knowledge domains of BFO-based ontologies. The study highlighted the
efectiveness of fine-tuning BERT models in a cross-domain context, achieving an average macro F-score
of 62%. Additionally, [21] evaluated ChatGPT’s performance in this task, revealing its potential to ofer
complementary ontological perspectives despite limitations in handling finer distinctions. Lastly, [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]
proposed an automated approach leveraging state-of-the-art language models and informal definitions,
demonstrating promising results with a K-Nearest Neighbor method using embeddings from the Mistral
large language model. This research underscores the potential for developing automated tools to assist
ontology engineers in classifying domain entities.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Research Questions</title>
      <p>
        The classification pipeline we previously proposed in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] uses informal definitions to represent domain
entities textually, language models to encode these informal definitions into embedding vectors, and
the K-Nearest Neighbor algorithm (KNN) to classify new domain entities under top-level ontology
concepts. We initially applied this approach to the DOLCE-Lite-Plus top-level ontology, demonstrating
promising results. In this work, we extend our approach to assess its versatility and robustness with
other top-level ontologies, particularly the Basic Formal Ontology (BFO), and also using specific domain
ontologies such as the Gene Ontology (GO) and Chemical Entities of Biological Interest (ChEBI). The
datasets, as shown in Table 1, include various counts of entities classified under BFO concepts such as
“Independent Continuant," “Specifically Dependent Continuant," “Generically Dependent Continuant,"
and “Process." From that, we proposed 4 research questions to be answered throughout this work aiming
to identify potential challenges, limitations, and necessary enhancements to improve the classification
efectiveness in diverse and complex scenarios. These research questions are described below:
1. How does the approach perform with the Basic Formal Ontology (BFO) top-level
concepts?
Motivation: This research question is motivated by the need to assess the versatility and
robustness of classifying domain entities into top-level ontology concepts using informal definitions and
language models beyond its initial application to the DOLCE-Lite-Plus top-level ontology. In this
context, BFO is another top-level ontology that provides a high-level framework for structuring
knowledge across a wide range of domains, and it is widely adopted in fields such as biology,
medicine, and geology.
      </p>
      <p>
        Objective: The objective of this research question is to determine whether the approach proposed
in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] can accurately and efectively map the domain entities contained in the OBO Foundry
domain ontologies to their respective BFO’s top-level concepts. Additionally, the research aims to
explore potential challenges and limitations when applying the approach to a diferent ontological
structure and highly specific informal definitions to identify any necessary adjustments or
enhancements to improve the approach’s generalizability. This involves creating a benchmark
dataset containing domain entities mapped to “Independent Continuant", “Specifically Dependent
Continuant", “Generically Dependent Continuant", and “Process". The choice for these concepts
is that the domain entities of all OBO Foundry domain ontologies that adhere to BFO specify at
least one of these concepts.
      </p>
      <p>
        Scope and limitations: The scope of this research includes the assessment of the classification
approach proposed in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] using domain entities from the OBO Foundry ontologies, specifically
focusing on BFO’s top-level concepts such as “Independent Continuant," “Specifically Dependent
Continuant," “Generically Dependent Continuant," and “Process." Also, this research question
encompasses all possible variations and complexities of domain entities and informal definitions
found in all domain ontologies provided in OBO Foundry that adhere to BFO. However, this
research question may not represent real-world scenarios where we need to develop a domain
ontology from scratch since in this experiment we can have entities from the same domain
ontology in the training and test datasets.
2. How does the approach perform with entities from a domain ontology out of the training
sample?
Motivation: From the limitations of Research Question 1, this research question is motivated by
the need to evaluate the performance of the classification approach proposed by [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] in classifying
entities when applied to new and previously unseen domain ontologies for the classifier. In this
context, we selected specific datasets from the Gene Ontology (GO) and Chemical Entities of
Biological Interest (ChEBI) in order to carefully analyze why the classifier is right or wrong and
which other domain ontologies contained in the OBO Foundry are responsible for these right or
wrong classifications.
      </p>
      <p>
        Objective: The objective of this research question is to assess the overall performance of the
KNN classification approach proposed by [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] when applied to entities from the Gene Ontology
(GO) and Chemical Entities of Biological Interest (ChEBI), which were not included in the training
sample. From that, we analyze the classification results to determine the accuracy and errors
in the classification of GO and ChEBI entities, distinguishing between correctly and incorrectly
classified instances and extracting the 5-nearest neighbors of each one. Based on the neighbors, we
examine which domain ontologies within the OBO Foundry are most influential in contributing
to both correct and incorrect classifications.
      </p>
      <p>
        Scope and limitations: In this research question, we performed a quantitative assessment of
the classifier’s accuracy and error rates when applied to GO and ChEBI entities. From that, the
study focuses on only these two domain ontologies, which, while representative, do not cover
the full diversity of domain ontologies. Results may vary with other ontologies not included in
this analysis. Additionally, the study focuses on quantitative analysis and may not delve deeply
into the underlying semantic and contextual nuances of the domain entities.
3. How does the approach perform with a small ratio of entities of a domain ontology
inside the training sample?
Motivation: The motivation behind this research question arises from the necessity to understand
the classifier’s performance proposed by [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] when a domain ontology is only sparsely represented
in the training sample. The previous research questions highlighted the importance of diverse and
representative training data or training data without the domain entities of a specific ontology.
However, in some scenarios, we develop a domain ontology based on previously existing. From
that, this research question seeks to evaluate how the classifier performs in a scenario with a small
ratio of entities from specific domain ontologies like GO and ChEBI within the training sample.
By examining this aspect, we aim to uncover potential weaknesses and areas for improvement in
the classifier’s ability to generalize from limited information of a specific domain ontology in
training data.
      </p>
      <p>Objectives: The objective of this research is to evaluate the classifier’s performance when faced
with a small ratio of entities from specific domain ontologies, such as GO and ChEBI, within the
training sample. Based on this, we examine the classification results to assess the accuracy and
errors in categorizing GO and ChEBI entities. We diferentiate between correctly and incorrectly
classified instances and identify the 5-nearest neighbors for each instance. By analyzing these
neighbors, we determine which domain ontologies within the OBO Foundry have the most
significant influence on both the correct and incorrect classifications.</p>
      <p>
        Scope and limitations: This research is scoped to evaluate the performance of the classifier
specifically with GO and ChEBI entities when they are sparsely represented in the training sample.
The study includes a detailed quantitative analysis of classification metrics and an investigation
into the influence of other domain ontologies. Also, the limitations of this study are the same as
the Research Question 2.
4. How does the approach perform with highly specialized informal definitions?
Motivation: The motivation for this research question stems from the need to understand how the
classification approach proposed by [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] performs with highly specialized informal definitions, as
opposed to general informal definitions such as those found in WordNet and Wikipedia. Previous
research has focused on the classifier’s ability to handle general definitions efectively, but there
is a gap in knowledge regarding its performance with definitions that are more specialized and
potentially more complex. This research seeks to evaluate whether the classifier can accurately
interpret and classify entities based on these highly specialized informal definitions.
Objectives: Based on the results of the previous research questions, the main objective of this
research question is a general analysis of the diferences between the results presented in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]
work with more general informal definitions from WordNet and Wikipedia, contrasting with
the results using BFO domain ontologies with highly specialized informal definitions using the
same classifier. From that, we aim to answer that although the combination of the embedding
representation of informal definitions and the distance between them in the embedding space is a
good candidate for the task of classifying domain entities into top-level concepts, the nature of
the informal definitions and the domain from which comes impacts on the performance of this
approach.
      </p>
      <p>
        Scope and limitations: The scope of this research includes evaluating the performance of
the classification approach proposed by [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] using highly specialized informal definitions and
comparing it with its performance using more general informal definitions from sources like
WordNet and Wikipedia. However, several limitations must be acknowledged. Firstly, the research
ifndings may be specific to the selected specialized definitions and might not generalize to all types
of specialized ontologies or domains. The variability in structure, terminology, and complexity of
specialized definitions could introduce challenges that are not present with general definitions,
potentially afecting the classifier’s performance. Additionally, while the study provides insights
into the impact of definition type on classification accuracy, further validation with a broader
range of specialized definitions and contexts would be necessary to confirm the generalizability
of the results.
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. Experiments</title>
      <sec id="sec-4-1">
        <title>4.1. Baseline Setup</title>
        <p>
          The baseline setup1 for our experiments to answer the research questions presented in Section 3
follows the BERT+KNN classifier proposed in [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], which utilized the BERT language model to generate
embeddings from informal definitions and a K-Nearest Neighbors (KNN) algorithm to classify them
into top-level ontology concepts. We employed the KNN algorithm in our experiments due to its robust
performance in this task and the explainable results since KNN classifies a data point based on the
majority class among its k-nearest neighbors in the feature space. This proximity-based decision-making
process makes it straightforward to identify which instances influenced a particular classification, as
each prediction is directly linked to the nearest training examples and their associated labels. From
1We conducted the study cases and experiments on a machine equipped with an Intel i7-10700 CPU (4.8GHz), 32 GB of RAM,
and a GeForce RTX 3060 GPU with 12GB of VRAM.
that, we aim to replicate and extend the approach proposed in [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] for the Basic Formal Ontology (BFO)
top-level ontology.
        </p>
        <p>
          The BFO data used in our experiments are provided in [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]2, which extracted entities from 82
ontologies of 12 diferent domains contained in the OBO Foundry repository. The final BFO dataset is
described in Table 1. Also, this dataset presents instances for the 4 top-level concepts covered in this
work: “Independent Continuant", “Specifically Dependent Continuant", “Generically Dependent
Continuant", and “Process". In addition, we used datasets for specific domain ontologies, such as the Gene
Ontology (GO) and the Chemical Entities of Biological Interest (ChEBI), with instances for “Independent
Continuant" and “Process", and “Independent Continuant" and “Specifically Dependent Continuant",
respectively.
        </p>
        <p>We evaluated the results of all experiments in terms of accuracy (Equation 1):</p>
        <p>+  
Accuracy = (1)</p>
        <p>+   +   +  
where   is the number of true positives,   is the number of true negatives,   is the number of
false positives, and   is the number of false negatives.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Research Question 1 - How does the approach perform with the Basic Formal</title>
      </sec>
      <sec id="sec-4-3">
        <title>Ontology (BFO) top-level concepts?</title>
        <p>(a) Confusion matrix for the DLP dataset.
(b) Confusion matrix for the BFO dataset.</p>
        <p>
          In this experiment, we compared the results achieved using datasets from diferent top-level ontologies.
In this context, we used the DOLCE-Lite-Plus datasets from [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] work, and selected the top-level concepts
“Abstract", “Endurant", “Perdurant", and “Quality". The choice for these top-level concepts is because
they are at the same level of abstraction according to the selected BFO top-level concepts. Also, in this
experiment, for each dataset, we randomly selected 80% of the samples for training the BERT+KNN
classifier, and 20% to test the classifier. In addition, each sample was stratified to ensure that all top-level
concepts were appropriately represented in both the training and test sets.
        </p>
        <p>Figure 1 presents the confusion matrices of the experiment according to each top-level ontology
dataset. The confusion matrix for the BFO dataset (Figure 1b) demonstrates that the classifier performs
exceptionally well with the “Independent continuant" and “Process" to-level concepts, achieving 98% and
96% of accuracy, respectively. Although the accuracy results for “Specifically Dependent Continuant"
2The source code, datasets, and all experiments performed are available at https://github.com/BDI-UFRGS/
Alcides-ONTOBRAS-2024</p>
        <p>(a) Correct classifications using ChEBI dataset.
(b) Incorrect classifications using ChEBI dataset.
(c) Correct classifications using GO dataset.
(d) Incorrect classifications using GO dataset.
and “Generically Dependent Continuant" are slightly worse, with, respectively, 87% and 89% accuracy,
the overall BERT+KNN classifier performance using the BFO dataset is equally comparable with the
results achieved using the DLP dataset (Figure 1a), indicating a promising capability to accurately
classify domain entities into top-level ontology concepts in diferent top-level ontologies.</p>
        <p>In addition to the BFO dataset, we investigated how the GO and ChEBI ontologies performed in
this experiment. Figure 2 presents the confusion matrices of the experiment according to ChEBI
and GO datasets. The confusion matrix for ChEBI reveals that the model performs excellently with
“Independent continuant" entities, achieving a remarkable 99% accuracy. However, the “Specifically
dependent continuant" concept exhibits significant challenges, with an accuracy rate of only 62%. On the
other hand, the confusion matrix for the GO dataset (Figure 2b) shows high accuracy for “Independent
Continuant" and “Process" top-level concepts, with 90% and 98% of accuracy, respectively.</p>
        <p>Figure 3 presents the other domain ontologies inside the BFO dataset which most contribute to the
right and wrong classifications for both GO and ChEBI datasets. By analyzing Figure 3a and Figure 3c,
we can see that the main domain entities that contributed to the BERT+KNN classifier making correct
classifications were entities of the same domain ontology. Although this result is interesting to analyze,
it can be a disadvantage if no ontology domain entities exist in the classifier training set.</p>
      </sec>
      <sec id="sec-4-4">
        <title>4.3. Research Question 2 - How does the approach perform with entities from a domain ontology out of the training sample?</title>
        <p>(a) Confusion matrix for the ChEBI dataset.
(b) Confusion matrix for the GO dataset.</p>
        <p>In this experiment, we investigate the performance of the BERT+KNN classifier for classifying
domain entities, particularly focusing on entities from domain ontologies that were not part of the
training sample. In this context, the results are presented through confusion matrices (Figure 4) and bar
charts (Figure 5), comparing the classifications for two domain ontologies: ChEBI (Chemical Entities of
Biological Interest) and GO (Gene Ontology). These visualizations provide insights into how well the
model generalizes to unseen data and the efectiveness of the classification approach.</p>
        <p>Figure 4a shows the confusion matrix for the ChEBI dataset, indicating that the majority of entities,
specifically “Independent Continuants", were misclassified as “Processes", suggesting a high rate of
misclassification in this domain. Also, for the “Specifically Dependent Continuant" top-level concept, the
accuracy rate is low, with a significant number of false positives for “Processes". These results indicate
that the model struggles to accurately classify entities from the ChEBI ontology, particularly due to
“Process" entities in other domain ontologies. In contrast, the GO confusion matrix (Figure 4b) shows
a diferent pattern. Here, “Independent Continuant" have a higher accuracy rate, with a substantial
number of entities correctly classified. However, there are still significant misclassifications, with
“Process" entities often being confused with “Independent Continuant" entities. This suggests that while
the model performs better with GO entities compared to ChEBI, there are still challenges in correctly
classifying processes.</p>
        <p>Figure 5 presents the bar charts representing the percentage of examples in the 5-nearest neighbors
of the classified domain entities. For ChEBI, the wrong prediction chart indicates a dominant presence
of GO ontology, suggesting this ontology has a significant influence on incorrect classifications. This
result fits exactly with the confusion matrix in Figure 4a, where most of the misclassifications are due to
(c) Correct classifications using GO dataset.
(d) Incorrect classifications using GO dataset.
“Process" entities and GO is the domain ontology with most of the “Process" entities in the BFO dataset.
In contrast, for GO, the wrong prediction chart shows a strong influence of ChEBI entities. This suggests
that although ChEBI and GO are diferent ontologies in diferent domains, the top-level concepts of their
entities overlap in the embedding space because they have similar embedding representations of their
informal definitions but the informal definition represents entities with diferent top-level concepts.</p>
      </sec>
      <sec id="sec-4-5">
        <title>4.4. Research Question 3 - How does the approach perform with a small ratio of entities of a domain ontology inside the training sample?</title>
        <p>As opposed to the previous experiments, here we investigate the performance of the BERT+KNN
classifier for classifying domain entities into top-level concepts by considering a small ratio of the
domain ontology entities in the training sample. As in the previous experiment, the focus was on two
domain ontologies, ChEBI and GO. For each of these ontologies, we used 10% of the entities in the
training sample. The results are summarized in confusion matrices (Figure 6) and bar charts showing
the distribution of examples in the 5-Nearest Neighbors (5-NN) (Figure 7) for each ontology. These
visualizations provide insights into how well the model generalizes with a small number of data of the
domain ontology dataset used to test the classifier.</p>
        <p>The confusion matrix for ChEBI (Figure 6a) demonstrates high accuracy for “Independent Continuant,"
with 96% of accuracy, but lower performance for “Specifically Dependent Continuant," where only 48%
of accuracy. For the GO ontology, the confusion matrix (Figure 6b) reveals a diferent pattern. The
model shows 85% accuracy for “Independent Continuant" and 71% for “Process," indicating reasonably
good performance in these categories. These accuracy ratios that although the model uses a small
amount of the entities of the domain ontology evaluated, the BERT+KNN classifier performs well in
comparison with the results of the previous experiments.</p>
        <p>The bar chart for the right classified examples for the ChEBI dataset (Figure 7a) shows that almost
100% of this classification result is due to domain entities of own ChEBI. This same result is also reflected</p>
        <p>(a) Correct classifications using ChEBI dataset.
(b) Incorrect classifications using ChEBI dataset.
(c) Correct classifications using GO dataset.
(d) Incorrect classifications using GO dataset.
for GO (Figure 7c), where GO was the domain ontology that most influenced the correct classifications.
In terms of incorrect classifications, we can see the same pattern as the previous experiment, where GO
influences ChEBI entities to be misclassified, and vice versa.</p>
      </sec>
      <sec id="sec-4-6">
        <title>4.5. Overall Analysis</title>
        <p>The experiments conducted in this section answer the Research Questions 1, 2, and 3. These
experiments also reveal several critical insights regarding the performance of the approach with highly
specialized informal definitions (Research Question 4). The role of definitions in the classification
process is to provide textual representations of domain entities, which are then encoded into
embeddings used by the classifier. According to the experiments, the quality, structure, and specificity of
these definitions significantly impacted classification accuracy, with specialized definitions leading to
challenges in correctly mapping entities to top-level ontology concepts. From that, the BERT+KNN
classifier demonstrated variable performance, significantly influenced by the specificity and domain of
the informal definitions used. For instance, while the classifier performed well in top-level concepts
like “Independent Continuant" and “Process" for the Gene Ontology (GO) and Chemical Entities of
Biological Interest (ChEBI) ontologies, it showed lower accuracy in categories such as “Specifically
Dependent Continuant." This variability underscores the challenge of accurately classifying specialized
entities. In this context, compared to the performance with more general informal definitions from
sources like WordNet and Wikipedia, the classifier faced new challenges with specialized definitions.
General definitions tend to be more uniformly distributed in the embedding space, leading to higher
classification accuracy. Also, this study highlighted that the way ontology developers write informal
definitions in specialized domains has a substantial efect on classification performance. Definitions
that are clear, precise, and consistent within a domain tend to result in better classification accuracy.
Specifically, informal definitions following a structured format, such as “X is a Y that Z,” were more
likely to be accurately classified. This structure helps maintain consistency and clarity, crucial for
embedding models to capture the correct semantic meaning. However, specialized denfiitions, though
rich in domain-specific context, introduce complexity requiring more sophisticated handling by the
classifier.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>The research presented in this study delves into the intricate task of classifying domain entities into
top-level ontology concepts using informal definitions, language models for embedding vectors, and
the K-Nearest Neighbors (KNN) algorithm as a classifier. The focus on the Gene Ontology (GO) and
Chemical Entities of Biological Interest (ChEBI) ontologies has provided valuable insights into the
influential factors afecting this classification process. Our experiments revealed that the relationship
between the proximity of domain entities in the embedding space and their corresponding top-level
ontology concepts varies significantly according to domain specificity. This variation underscores
the critical influence of how ontology developers write informal definitions in each domain. This
highlights the importance of maintaining consistency and clarity in definitions to enhance the semantic
representation captured by language models. Furthermore, the results demonstrated the classifier’s
robustness and versatility when applied to diferent top-level ontologies, such as the Basic Formal
Ontology (BFO) and DOLCE-Lite-Plus (DLP). The analysis also highlighted the classifier’s performance
when faced with entities from domain ontologies not included in the training sample, as well as scenarios
with a small ratio of entities from a specific domain ontology. These findings revealed that while the
classifier can generalize reasonably well, the presence of diverse and representative training data is
crucial for optimal performance. In conclusion, this study emphasizes the potential of using informal
definitions and language models to classify domain entities into top-level ontology concepts. The results
advocate for the incorporation of consolidated domain entities during the training stage of classifiers to
improve accuracy and robustness. Future research should explore the integration of more sophisticated
techniques to handle highly specialized definitions and further validate the approach across a broader
range of ontologies and domains.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>Research supported by Higher Education Personnel Improvement Coordination (CAPES), code 0001,
Brazilian National Council for Scientific and Technological Development (CNPq), and Petrobras.
S. Narang, A. Rodriguez, R. Stojnic, S. Edunov, T. Scialom, Llama 2: Open foundation and fine-tuned
chat models, 2023. arXiv:2307.09288.
[18] A. Q. Jiang, A. Sablayrolles, A. Mensch, C. Bamford, D. S. Chaplot, D. de las Casas, F. Bressand,
G. Lengyel, G. Lample, L. Saulnier, L. R. Lavaud, M.-A. Lachaux, P. Stock, T. L. Scao, T. Lavril,
T. Wang, T. Lacroix, W. E. Sayed, Mistral 7b, 2023. arXiv:2310.06825.
[19] G. Team, T. Mesnard, C. Hardin, R. Dadashi, S. Bhupatiraju, S. Pathak, L. Sifre, M. Rivière, M. S.</p>
      <p>Kale, J. Love, et al., Gemma: Open models based on gemini research and technology, arXiv preprint
arXiv:2403.08295 (2024).
[20] M. Jullien, M. Valentino, A. Freitas, Do transformers encode a foundational ontology?
probing abstract classes in natural language, 2022. URL: https://arxiv.org/abs/2201.10262.
arXiv:2201.10262.
[21] F. H. Rodrigues, A. G. Lopes, N. O. dos Santos, L. F. Garcia, J. L. Carbonera, M. Abel, On the use of
chatgpt for classifying domain terms according to upper ontologies, in: International Conference
on Conceptual Modeling, Springer, 2023, pp. 249–258.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J. N.</given-names>
            <surname>Otte</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Beverley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ruttenberg</surname>
          </string-name>
          , Bfo: Basic formal ontology,
          <source>Applied ontology 17</source>
          (
          <year>2022</year>
          )
          <fpage>17</fpage>
          -
          <lpage>43</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Borgo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ferrario</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gangemi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Guarino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Masolo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Porello</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. M.</given-names>
            <surname>Sanfilippo</surname>
          </string-name>
          , L. Vieu,
          <article-title>Dolce: A descriptive ontology for linguistic and cognitive engineering</article-title>
          , Applied ontology
          <volume>17</volume>
          (
          <year>2022</year>
          )
          <fpage>45</fpage>
          -
          <lpage>69</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Lopes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. L.</given-names>
            <surname>Carbonera</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Schmidt</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Abel, Predicting the top-level ontological concepts of domain entities using word embeddings, informal definitions, and deep learning</article-title>
          ,
          <source>Expert Systems with Applications</source>
          <volume>203</volume>
          (
          <year>2022</year>
          )
          <fpage>117291</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Lopes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Carbonera</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Schmidt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Garcia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Rodrigues</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Abel</surname>
          </string-name>
          ,
          <article-title>Using terms and informal definitions to classify domain entities into top-level ontology concepts: An approach based on language models</article-title>
          ,
          <source>Knowledge-Based Systems</source>
          <volume>265</volume>
          (
          <year>2023</year>
          )
          <fpage>110385</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>A.</given-names>
            <surname>Lopes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Carbonera</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Rodrigues</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Garcia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Abel</surname>
          </string-name>
          ,
          <article-title>How to classify domain entities into top-level ontology concepts using large language models</article-title>
          , Applied Ontology (
          <year>2024</year>
          )
          <fpage>1</fpage>
          -
          <lpage>29</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A.</given-names>
            <surname>Lopes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Carbonera</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Santos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Rodrigues</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Garcia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Abel</surname>
          </string-name>
          ,
          <article-title>Cross-domain classification of domain entities into top-level ontology concepts using bert: A study case on the bfo domain ontologies</article-title>
          ,
          <source>in: Proceedings of the 26th International Conference on Enterprise Information Systems - Volume 2: ICEIS</source>
          , INSTICC, SciTePress,
          <year>2024</year>
          , pp.
          <fpage>141</fpage>
          -
          <lpage>148</lpage>
          . doi:
          <volume>10</volume>
          .5220/0012557600003690.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>S.</given-names>
            <surname>Seppälä</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ruttenberg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Schreiber</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Smith</surname>
          </string-name>
          , Definitions in ontologies,
          <source>Cahiers de Lexicologie</source>
          <year>2016</year>
          (
          <year>2016</year>
          )
          <fpage>173</fpage>
          -
          <lpage>205</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S.</given-names>
            <surname>Seppälä</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ruttenberg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Smith,</surname>
          </string-name>
          <article-title>The functions of definitions in ontologies</article-title>
          , in: R.
          <string-name>
            <surname>Ferrario</surname>
          </string-name>
          , W. Kuhn (Eds.),
          <source>Formal Ontology in Information Systems. Proceedings of the Ninth International Conference (FOIS</source>
          <year>2016</year>
          ),
          <source>IOS Pres</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>37</fpage>
          -
          <lpage>50</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Z. S.</given-names>
            <surname>Harris</surname>
          </string-name>
          , Distributional structure,
          <source>Word</source>
          <volume>10</volume>
          (
          <year>1954</year>
          )
          <fpage>146</fpage>
          -
          <lpage>162</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>T.</given-names>
            <surname>Mikolov</surname>
          </string-name>
          , I. Sutskever,
          <string-name>
            <given-names>K.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. S.</given-names>
            <surname>Corrado</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Dean</surname>
          </string-name>
          ,
          <article-title>Distributed representations of words and phrases and their compositionality</article-title>
          ,
          <source>in: Advances in neural information processing systems</source>
          ,
          <year>2013</year>
          , pp.
          <fpage>3111</fpage>
          -
          <lpage>3119</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>T.</given-names>
            <surname>Mikolov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Chen</surname>
          </string-name>
          , G. Corrado,
          <string-name>
            <given-names>J.</given-names>
            <surname>Dean</surname>
          </string-name>
          ,
          <article-title>Eficient estimation of word representations in vector space</article-title>
          ,
          <source>in: Proceedings of the International Conference on Learning Representations (ICLR)</source>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>J.</given-names>
            <surname>Pennington</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Socher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Manning</surname>
          </string-name>
          , Glove:
          <article-title>Global vectors for word representation</article-title>
          ,
          <source>in: Proceedings of the 2014 conference on empirical methods in natural language processing (EMNLP)</source>
          ,
          <year>2014</year>
          , pp.
          <fpage>1532</fpage>
          -
          <lpage>1543</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Narasimhan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Salimans</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Sutskever</surname>
          </string-name>
          ,
          <article-title>Improving language understanding by generative pre-training, URL https://s3-us-west-2.amazonaws.com/openai-assets/researchcovers/language-unsupervised/language understanding paper</article-title>
          .
          <source>pdf</source>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <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>
          , arXiv preprint arXiv:
          <year>1810</year>
          .
          <volume>04805</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <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>
          </string-name>
          , E. Grave, G. Lample,
          <article-title>Llama: Open and eficient foundation language models</article-title>
          ,
          <year>2023</year>
          . arXiv:
          <volume>2302</volume>
          .
          <fpage>13971</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <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>Roux</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mensch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Savary</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Bamford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. S.</given-names>
            <surname>Chaplot</surname>
          </string-name>
          , D. de las Casas,
          <string-name>
            <given-names>E. B.</given-names>
            <surname>Hanna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Bressand</surname>
          </string-name>
          , G. Lengyel, G. Bour,
          <string-name>
            <given-names>G.</given-names>
            <surname>Lample</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. R.</given-names>
            <surname>Lavaud</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Saulnier</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>S.</given-names>
          </string-name>
          <string-name>
            <surname>Subramanian</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Antoniak</surname>
            ,
            <given-names>T. L.</given-names>
          </string-name>
          <string-name>
            <surname>Scao</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Gervet</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>
          , Mixtral of experts,
          <year>2024</year>
          . arXiv:
          <volume>2401</volume>
          .
          <fpage>04088</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <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>
          </string-name>
          , M. Kambadur,
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>