<!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>HybridOM: Ontology Matching using Hybrid Search</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Marius-Hora t</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>iu Totoian</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anca Marginean</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Philipp Blohm</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mir Nawab Hussain</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Technical University of Cluj-Napoca</institution>
          ,
          <addr-line>Cluj-Napoca, 400391</addr-line>
          ,
          <country country="RO">Romania</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>msg systems ag</institution>
          ,
          <addr-line>Ismaning (Munich), DE-85737</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Ontology matching targets identical concepts from diferent ontologies with the final purpose of interoperability and ontologies merging. The matching task is not restricted to ontologies, it is also relevant for knowledge graphs. Ontology matching solutions based on transformer-based embeddings, textual similarity, logical mapping, or Large Language Models (LLMs) are still facing problems, mainly due to the lack of uniform information about the concepts and lack of homogeneous semantic granularity along diferent ontologies. In this work, we present a framework that combines vector-based similarity and string-based similarity through hybrid searches. LLMs are used to generate descriptions for ontology concepts, hence the concepts' representation is enriched and the alignment process can benefit from both the knowledge captured by the initial ontologies and the extended LLM-generated textual descriptions. The proposed system, HybridOM, is an unsupervised approach independent of the ontologies' domain. HybridOM is evaluated within Bio-ML 2024 track for the task of concept matching. It achieves the highest values for F1-score and Recall for most of the ontology pairs while maintaining a balance between precision and recall. The proposed method has been adapted for industrial usage in a human capital management product called msg.ProfileMap.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Ontology matching</kwd>
        <kwd>hybrid search</kwd>
        <kwd>Large Language Model</kwd>
        <kwd>verbalization</kwd>
        <kwd>vector database</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1.1. General Statement</title>
      <p>Despite the long-standing goal of ontologies to provide a structured representation of domain knowledge,
matching two ontologies from the same domain is not a straightforward task. The primary challenges
in ontology matching arise from dificulties in creating comprehensive, exhaustive, and standardized
representations of meaning.</p>
      <p>Since ontologies are diverse, either in the naming schema, the granularity of properties and
taxonomical structure, or the level of detailed textual descriptions, we combine diferent sources for meaning
and diferent meaning representations can help the ontology matching. The considered sources for the
meaning are: i) asserted axiom-based descriptions, ii) knowledge derived through symbolic reasoning,
iii) textual descriptions from the ontology, and iv) textual descriptions generated with LLMs. The
considered meaning representations are: i) axioms in the ontology, ii) plain text used in labels or concept
descriptions, iii) text embeddings. The result is a solution for ontology mapping that is domain-agnostic.</p>
      <p>In this work, we give a detailed description of our method together with the evaluation results obtained
in 2024 BioML task, part of Ontology Alignment Evaluation Initiative. Elements of the current method
were also tested in the context of msg.ProfileMap. msg.ProfileMap is a human capital management
product that uses an ontology containing competences, job roles, and certificates. New entities can
be entered into the ontology automatically by importing existing vocabularies of customers or by
extracting them from CVs or job descriptions. Duplicates in the ontology would create problems when
searching for employees or during statistical analyses. HybridOM’s method supports these processes by
identifying the corresponding ontology entities if existing and thus ensuring the quality of the ontology.</p>
    </sec>
    <sec id="sec-2">
      <title>1.2. Solution</title>
      <p>
        Most of the ontology matching systems, such as OLaLa [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] and LLMs4OM [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], are using the retrieval
methods to get the top-k candidates and then LLM to select the best one from the retrieved candidates.
Diferently, HybridOM finds the best candidate as a result of the retrieval step, while it uses LLM as an
auxiliary method to generate descriptions involved in the retrieval step. The key elements of HybridOM
are: the augmentation of the text-based descriptions of concepts in the ontology and ensembles of
hybrid searches. The augmentation sources are the ontology axioms and LLM-generated text.
      </p>
      <p>Hybrid search is a special case of search that combines multiple semantic searches and string-based
searches and matches the results into a single ranking output. HybridOM uses hybrid search to extract
the best candidates for matching an external concept to concepts in the ontology. Using OpenSearch as
a vector database, the data about concepts are stored as string-based and vector embedding fields.</p>
      <p>
        HybridOM architecture consists of a pipeline (Figure 1). The first step is data preprocessing which i)
identifies the essential raw data that can be used from ontology and ii) generates descriptions using
LLM for each concept based on its medical domain. The ontology axioms are integrated through their
verbalization based on the algorithm described in [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Once the textual information for each concept is
prepared, embeddings are generated for specific fields within a subset of this text-based information
using a language model. All the string and vector fields are ingested in OpenSearch. The last step is
using hybrid searches that are customized based on i) the included fields and ii) their associated scores.
In the end, a sorted list of the best candidates is retrieved. The best concept for matching is the first
retrieved candidate. Each concept is mapped independently of the other concepts.
      </p>
      <sec id="sec-2-1">
        <title>1.2.1. Data preprocessing</title>
        <p>
          For preprocessing of ontology data, python package DeepOnto [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] is used to parse the ontology
structure and retrieve useful information about concepts. DeepOnto provides an implementation for
the verbalization algorithm [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] and HybridOM uses it for building concept’s verbalization. Additionally,
a biomedical description is generated for each concept in the ontologies by prompting LLaMa3 [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
1.2.1.1. Raw Data extraction The most significant fields to be stored in the database are: label,
description, and synonyms. Because not every concept has a description or synonyms, other fields are
used to ensure a non-empty value. For some ontologies multiple properties can be used to describe
or to create synonyms, in which case these fields are concatenated. Table 1 shows the HybridOM
configuration of every field based on each ontology’s properties. This step is done with the DeepOnto.
1.2.1.2. Verbalization Ontology axioms ofer important information about the taxonomy of the
ontology, but also a mathematical representation of the relations and properties between concepts.
BioML ontologies provide two most important axioms that HybridOM uses in verbalization composition:
SubClassOf and EquivalentClasses. The article [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] describes an algorithm of translation from ontology
axiom to a human-readable verbalization for LLM prompting. Using the mentioned algorithm, we build
the verbalizations according to Table 2.
        </p>
        <p>In case EquivalentClasses axiom is missing, the verbalization is represented just by the subclass axiom
or parent concepts extracted using reasoning. In the case of no SubClassOf axiom, the verbalization
is formed by parents found using the Elk reasoner. In case the reasoner does not find any parent, a
hardcoded generic parent is used. The verbalizer and the reasoner are provided by DeepOnto package.
⟨⟩ It is a type of ⟨ _1⟩, ⟨ _2⟩ . . .</p>
        <p>It is an equivalent of ⟨ _1⟩, ⟨ _2⟩ . . .
⟨⟩ It is a type of ⟨ 1⟩, ⟨ 2⟩, . . .</p>
        <p>⟨⟩ It is a type of General Bio Medical Entity.
1.2.1.3. Generating description using LLaMa In most cases, the ontologies do not include a
meaningful textual description for each concept. String-based matching can’t provide enough context to
distinguish between similar concepts but with diferent names, such as Alcohol and Ethanol. We assume
that the existence of a description could help in reducing ambiguity. Inspired by the way LLMs are
used in RAG approaches, HybridOM proposes the usage of LLM-generated descriptions as a means to
improve the ontology matching by providing useful information that might even extend the ontology’s
properties. The possible negative impact of using LLM-generated description is limited since hybrid
searches combines the generated meaning with the one existing in the ontologies. In case the concept
is sensitive (e.g. substance drug related), LLaMa doesn’t generate a valid description. HybridOM detects
this based on the text length and replaces the result with label.</p>
        <p>
          LLaMa3 is an open-source large language model with impressive results that exceed GPT-3 in various
benchmarks [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. In order to balance the quality with the generation time we chose LLaMa3 8. 1.
        </p>
        <p>
          Because the medical domain of all ontologies is known, HybridOM uses specific prompts that generate
simple definitions, chemical structures, symptoms, anatomy, etc. The medical domains were extracted
from [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. Since Disease and Neoplas categories are very similar, the prompt from  is used also
for the ontology from Neoplas category. All used prompts are shown in Table 3.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>1.2.2. Ingestion</title>
        <p>
          The next step in the pipeline is the embedding generation for textual data extracted or generated from
ontology. The fields to be embedded are: verbalization, description, and LLM generated description. While
HybridOM can use any language model for the embeddings, gtr-t5-large2 and BioLord-2023 [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] are
used for Bio-ML task. BioLord-2023 is a language model trained using LLM for generating definitions
in the training set and it is state-of-the-art among biomedical models regarding STS (Semantic Textual
Similarity) [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. Once the embeddings are built for each ontology, an index is created in OpenSearch for
each ontology and the data is ingested in the database.
1https://ollama.com/library/llama3
2https://huggingface.co/sentence-transformers/gtr-t5-large
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>1.2.3. Hybrid Search</title>
        <p>Hybrid Search is the integration of semantic searches using Approximate k-NN search and keyword
searches using BM25 algorithm The search uses multiple keyword/vector similarity searches that run
in parallel. The concepts from the source ontology () are searched in all the concepts from the
destination ontology () based on the existing fields in the database. In the case of NCIT-DOID dataset,
the  is NCIT and the  is DOID. All concepts are stored in OpenSearch indexes, one index per
ontology. Based on a search configuration, for each search in hybrid search a score is set and the sum
of all scores must be equal to 1.</p>
        <p>Figure 2 shows the way we use the hybrid search. For keyword/semantic search, one field from  is
searched in multiple fields from . Based on the concept’s id and the field names used in the keyword
and semantic search, the concept is identified in the database and its fields’ values are retrieved. These
values are searched in several fields from .</p>
        <p>In the given example (Figure 2) the  keyword field is label and the  semantic search field is
description_llm_emb (embedding of LLM generated description). Two  values are retrieved based
on the concept’s id by the Data Module: the string Ethanol and the stored embedding of the LLM
description. Based on the given search configuration, the string ℎ is searched in the  fields
label and synonyms, and two k-NN searches are running in parallel for pairs: description_llm_emb
(SO) - description_emb (DO) and description_llm_emb (SO) - verbalization_emb (DO). In the end
the final score is a weighted score based on the configured weights for each search.</p>
        <p>The final ranking is calculated by running multiple hybrid searches. The score for ontology matching
is the sum of all scores returned by hybrid searches divided by the number of searches.
1.2.3.1. Keyword search Lucene Engine from OpenSearch is used for the keyword search. HybridOM
search configuration defines one field from  (keyword_field ) whose value is to be searched in one
or more  fields ( keyword_fields_search ) (Figure 3). Only one search is executed and if the searched
value is found in multiple  fields the score increases. In the search configuration, it can also be
configured the importance of finding a searched value in a certain  keyword field (Figure 3).</p>
        <p>
          For the keyword search, OpenSearch returns a score that is not limit-bounded. Consequently,
HybridOM uses a custom [
          <xref ref-type="bibr" rid="ref1">0, 1</xref>
          ] normalization implemented with OpenSearch sigmoid function.
1.2.3.2. Approximate k-NN search OpenSearch uses an approximate k-NN search for retrieving the
most relevant vectors using cosine similarity as a metric. The default value of k is 100. The configuration
template for the fields and weights of a semantic search is given in the right part of Figure 3.
1.2.3.3. Normalization A simple hybrid search aggregates the results from each search and computes
the final score based on the weights from the configuration. Each search retrieves a fixed number
of candidates (configured). The usage of normalization in this context transforms each score for the
retrieved candidate using min_max normalization method. The best candidate will have the score 1 and
the diference in ranking will be stronger marked among candidates by the normalization process.
1.2.3.4. Dual hybrid search The current flow uses hybrid searches to find the concepts from  in
. To reverse the search, after the candidates for a concept are retrieved, a predefined number of
candidates are searched backward to discover their matching candidates from . The same search
configuration is used for the backward searching (  to ). In the case of the second searching flow,
the mapping concept is known (the one from ) and if it is found on the reverse search, the score will
be taken into consideration too. The final score of the matching is calculated by both flow-directional
hybrid searches, both of them having an equal contribution. Table 8 presents the increase in performance
obtained by using both flow-directional searches.
        </p>
        <sec id="sec-2-3-1">
          <title>2. Results</title>
          <p>
            HybridOM is evaluated on all datasets from Bio-ML track for unsupervised tasks (Table 4). For a fair
evaluation, each dataset was evaluated using the same configuration. The system can be adapted
by changing its parameters per track to obtain better results. The best HybridOM configuration
uses BioLord-2023 [
            <xref ref-type="bibr" rid="ref7">7</xref>
            ] as an embedding language model, dual hybrid search, and normalization. The
assignation of a higher weight is made for the pair source_field - destination_field with the same name
(Table 5). The weights were chosen empirically, providing a general configuration of weights for each
hybrid search, the diference is manifested by which pair receives a higher score (Table 5). For the final
configuration, the number of retrieved candidates per search is 10, and only the first 5 candidates found
for each concept are used in the backward search for the dual hybrid search process. All evaluations
are made only for the concepts that have field use_in_alignment set to true.
          </p>
          <p>According to the values for Hits@K metric from Table 4, the HybridOM system seems to be struggling
to discover the true matching concept between the first two candidates in ranking. For the Hits@K
and MRR metrics a system should provide for each list of possible candidates, a ranking or a score for
each candidate. The HybridOM provides a matching ranking but with a variable length of concepts
based on the search result. Some candidates used for evaluation of Hits@K and MRR metrics are not
present in the HybridOM final ranking, as a result, the score for them will be 0.0. If the ground truth
candidate is not found in the final HybridOM ranking (does not appear on any rank), the concept will
have a value of -1.0 such that we are still able to build the evaluation file. This value is assigned with
awareness of the ground truth, but with the scope of not increasing the metrics score; the candidate will
have the lowest score among the possible candidates from the file. HybridOM returns a ranking of top
candidates for ontology matching, and concepts that are not present in the ranking will be considered
automated with a score 0.0 for matching.</p>
          <p>The benefits of using BioLord-2023 as the main embedding model, compared to a general domain
language model, are outlined in Table 6. The only exception is the dataset SNOMED-NCIT Pharm, where
the performance is higher using the GTR model.</p>
          <p>Normalization has an important role in hybrid search performance in comparison with a simple
approach (Table 7). It increases the score distance between candidates in the local search ranking. The
combined local rankings facilitate the creation of a more realistic final matching ranking of candidates,
achieving better results for all datasets.</p>
          <p>Nevertheless, the backward hybrid search for the retrieved candidate provides a double checking
for the initial matching and it increases the performance (Table 8). For some cases, the one-direction
hybrid search exceeds the dual hybrid search, but the diference is insignificant.</p>
        </sec>
        <sec id="sec-2-3-2">
          <title>3. General Comments</title>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3.1. Impact of results</title>
      <p>The results obtained of HybridOM in unsupervised Bio-ML track 2024 stand out especially for Recall
and F-score metrics. Taking three 1st places and two 2nd places for F-score metric and three 1st places,
one 2nd place and one 3rd place for Recall metric according to unsupervised track on all datasets.</p>
      <p>
        In comparison with other models, HybridOM has a weaker precision score among all datasets. For the
SNOMED-FMA, BERTMap [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] exceeds the HybridOM on the precision metric with a large diference,
but when it comes to F-score, both models have the same score taking the first place in ranking. A
crucial fact about HybridOM is that the scores of the three metrics (P, R, F-score) in each dataset are
very similar and the diference is not large. In the OMIM-ORDO dataset the large discrepancy between
precision and recall scores can be seen in competition ranking with a diference of at least 0.15 on all
participants, while the HybridOM all three metrics have close scores, with a diference at most of 0.012.
      </p>
      <p>Using simple semantic and keyword searches, HybridOM achieves consistency among the scores
for all metrics (P, R, F-score). The proposed method has a simple yet efective approach of integrating
multiple searches such that the limitation of one search is alleviated by the strengths of the others.
Integration of LLM for generating description, the usage of the verbalizations from ontology’s axioms,
and raw data from ontology are the core data used by HybridOM.</p>
    </sec>
    <sec id="sec-4">
      <title>3.2. Improvements</title>
      <p>HybridOM can be further developed by adopting new methods for extracting or generating data for
ontology concepts. Diferent prompts can be applied along with other LLMs to provide more
domainspecific information. The usage of diferent embedding models can increase the retrieval performance.
New ways of combining diferent kinds of searches besides keyword or semantic-based should ofer a
large perspective for ontology matching. Enriching the verbalization semantics using other axioms
and relations might also be beneficial. An automated way of calculating the search weights based
on ontology data, searching fields, or statistics, might be a key improvement for developing a highly
adaptable and reusable ontology matching system agnostic to ontology data variance and domain.</p>
      <sec id="sec-4-1">
        <title>4. Conclusion</title>
        <p>HybridOM proposes a domain-agnostic solution for ontology matching. It tackles the diversity of
ontologies with a diversity of meaning sources, meaning representation, and a combination of hybrid
searches. Explicit structured knowledge captured in the ontology is combined with text-based
description generated by LLM. The role of LLM is not decisive since no decision is taken based only on LLM,
yet, LLM generated descriptions extend the meaning associated to each concept. The impact of wrongly
generated descriptions is reduced in HybridOM due to the way hybrid searches are configured.</p>
        <p>HybridOM obtained very good and balanced values for precision and recall for all the ontology pairs
in the unsupervised 2024 Bio-ML track: for three of them, it obtained the best F1 scores, respectively
second best for two of them.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>S.</given-names>
            <surname>Hertling</surname>
          </string-name>
          , H. Paulheim,
          <article-title>OLaLa: Ontology Matching with Large Language Models</article-title>
          ,
          <source>in: Proceedings of the 12th Knowledge Capture Conference</source>
          <year>2023</year>
          , K-CAP '
          <fpage>23</fpage>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          ,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>H. B.</given-names>
            <surname>Giglou</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. D'Souza</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Engel</surname>
          </string-name>
          , S. Auer,
          <article-title>Llms4om: Matching ontologies with large language models</article-title>
          ,
          <year>2024</year>
          . URL: https://arxiv.org/abs/2404.10317. arXiv:
          <volume>2404</volume>
          .
          <fpage>10317</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Y.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Jimenez-Ruiz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Dong</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Horrocks</surname>
          </string-name>
          ,
          <article-title>Language model analysis for ontology subsumption inference</article-title>
          , in: A.
          <string-name>
            <surname>Rogers</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Boyd-Graber</surname>
          </string-name>
          , N. Okazaki (Eds.),
          <source>Findings of the Association for Computational Linguistics: ACL</source>
          <year>2023</year>
          , ACL, Toronto, Canada,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Y.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Dong</surname>
          </string-name>
          , I. Horrocks,
          <string-name>
            <given-names>C.</given-names>
            <surname>Allocca</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <surname>B. Sapkota,</surname>
          </string-name>
          <article-title>DeepOnto: A Python package for ontology engineering with deep learning</article-title>
          ,
          <source>Semantic Web</source>
          <volume>15</volume>
          (
          <year>2024</year>
          )
          <fpage>1991</fpage>
          -
          <lpage>2004</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>H.</given-names>
            <surname>Touvron</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Lavril</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Izacard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Martinet</surname>
          </string-name>
          , M.
          <article-title>-</article-title>
          <string-name>
            <surname>A. Lachaux</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Lacroix</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Rozière</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Goyal</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Hambro</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Azhar</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Rodriguez</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Joulin</surname>
            , E. Grave, G. Lample, LLaMA: Open and
            <given-names>Eficient</given-names>
          </string-name>
          <string-name>
            <surname>Foundation Language Models</surname>
          </string-name>
          ,
          <year>2023</year>
          . arXiv:
          <volume>2302</volume>
          .
          <fpage>13971</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Y.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Dong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Jiménez-Ruiz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Hadian</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Horrocks,</surname>
          </string-name>
          <article-title>Machine learning-friendly biomedical datasets for equivalence and subsumption ontology matching</article-title>
          , in: International Semantic Web Conference, Springer,
          <year>2022</year>
          , pp.
          <fpage>575</fpage>
          -
          <lpage>591</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>F.</given-names>
            <surname>Remy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Demuynck</surname>
          </string-name>
          , T. Demeester, BioLORD-2023:
          <article-title>semantic textual representations fusing large language models and clinical knowledge graph insights</article-title>
          ,
          <source>Journal of the American Medical Informatics Association</source>
          <volume>31</volume>
          (
          <year>2024</year>
          )
          <fpage>1844</fpage>
          -
          <lpage>1855</lpage>
          . URL: http://dx.doi.org/10.1093/jamia/ocae029.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Y.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Antonyrajah</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Horrocks</surname>
          </string-name>
          ,
          <article-title>BERTMap: A BERT-based Ontology Alignment System</article-title>
          ,
          <source>in: Proceedings of 36th AAAI Conference on Artificial Intelligence</source>
          <year>2022</year>
          (AAAI
          <year>2022</year>
          ),
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>