<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Matching using Textual Class Descriptions</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Yiwen Peng</string-name>
          <email>yiwen.peng@telecom-paris.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mehwish Alam</string-name>
          <email>mehwish.alam@telecom-paris.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Thomas Bonald</string-name>
          <email>thomas.bonald@telecom-paris.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Ontology Matching, Language Models, Textual Information</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Télécom Paris, Institut Polytechnique de Paris</institution>
          ,
          <country country="FR">France</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this paper, we propose TEXTO, a TEXT-based Ontology matching system. This matcher leverages the rich semantic information of classes available in most ontologies by a combination of a pre-trained word embedding model and a pre-trained language model. Its performance is evaluated on the datasets of the OAEI Common Knowledge Graphs Track, augmented with the description of each class, and a new dataset based on the refreshed alignment of Schema.org and Wikidata. Our results demonstrate that TEXTO outperforms all state-of-art matchers in terms of precision, recall and F1 score. In particular, we show that almost perfect class alignment can be achieved using textual content only, excluding any structural information like the graph of classes or the instances of each class.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>CEUR
ceur-ws.org</p>
    </sec>
    <sec id="sec-2">
      <title>1. Introduction</title>
      <p>
        Ontology matching [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] is the task of finding mappings between classes of two ontologies. The
CEUR
Workshop
Proceedings
Ontology matching methods can be broadly classified into two categories: instance-based
methods and schema-based methods. Instance-based methods leverage entity-level information,
such as the classes and properties of each entity [
        <xref ref-type="bibr" rid="ref3 ref4 ref5">3, 4, 5</xref>
        ]. The general principle is to match
classes sharing a similar set of instances. In contrast, schema-based approaches use the ontology
schema only, like the labels of classes and the links between classes. For example, LsMatch uses
string similarity and synonyms to match classes based on the labels [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], while Matcha exploits
both lexical and structural information [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Logic-aware strategies, such as LogMap [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], use
lexical indexing and disjointness-based reasoning. With the success of large language models,
text-enhancement techniques have grown in popularity. For instance, MEDTO system [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]
applies SBERT to initiate the vector representation for each node of a graph neural network for
matching medical ontologies. AMD [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] applies a knowledge graph embedding technique for
ifltering the candidates generated by a language model. Another matcher [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], similar to ours,
uses a pre-trained SBERT model for encoding labels. However, it was designed for the Anatomy
and Conference Track of OAEI and does not leverage the description of the classes. Finally, a
number of other methods exploit both the schema and the instances, the latter being typically
used in the final step to filter candidates generated by the analysis of the schema [
3. TEXT-based Ontology matching (TEXTO)
The overview of TEXTO is shown in Figure 1. The objective is to map two ontologies, whose
classes are respectively indexed by  and  . Observe that the two ontologies might have diferent
numbers of classes. The pipeline consists of five steps, as described below.
      </p>
      <sec id="sec-2-1">
        <title>Class</title>
      </sec>
      <sec id="sec-2-2">
        <title>Class</title>
        <p>String
Matching</p>
        <p>No</p>
        <p>Text
Embedding</p>
        <p>Candidate
Selection</p>
        <p>MaxWeight
Matching</p>
        <p>Confidence
Threshold</p>
        <p>Yes
Similarity
matrix
  = 1
  &lt; 1
Class pairs

1 ↔  1

2 ↔  2
…</p>
        <p>
          Step 1: String Matching. In the first step, the label of each class is preprocessed through
tokenization (white space and camel case tokenization, splitting of multi-word expressions such
as televisionnetwork) and stop word removal. After text preprocessing, any class pair ,  sharing
exactly the same labels is assigned a similarity score of 1; the other classes are passed to Step 2.
Step 2: Text Embedding. In Step 2, a similarity score in [
          <xref ref-type="bibr" rid="ref1">−1, 1</xref>
          ] is computed for each class pair
,  whose labels do not match exactly (cf. Step 1). First, a vector representation of the label of
each class ,  is generated by the GloVe model3, using the average of the vectors obtained for
        </p>
        <sec id="sec-2-2-1">
          <title>3https://huggingface.co/fse/glove-wiki-gigaword-300</title>
          <p>each word of the label (mean pooling). Second, a vector representation of the class description
is obtained through Sentence-BERT (SBERT), a language model trained by contrastive learning
for Semantic Textual Similarity tasks. Here, the pre-trained model all-MPNet-base-v24 is used,
which provides the best quality among all SBERT models available on Hugging Face5.</p>
          <p>
            Denoting by   label,   label the vector representations of the labels of classes ,  , and   desc,   desc
the vector representations of the descriptions of classes ,  , the similarity score between  and  is
computed as the weighted sum:
  =  cos(  label,   label) + (1 − ) cos(  desc,   desc)
(1)
where  ∈ [
            <xref ref-type="bibr" rid="ref1">0, 1</xref>
            ] is some hyper-parameter.
          </p>
          <p>
            Step 3: Candidate Selection. In this step, top- candidates are selected in terms of similarity.
Specifically, a class pair ,  is selected as a candidate either if  ranks among the top- classes
for matching  or if  ranks among the top- classes for matching  . The similarity scores of the
selected candidates remain unchanged, while the others are set to 0 (see Figure 1).
Step 4: Max-Weight Matching. The new similarity matrix, after Step 3, is used to match the
class pairs by Max-Weight Matching (MWM). Specifically, MWM finds a one-to-one mapping
that maximizes the total similarity [
            <xref ref-type="bibr" rid="ref14">14</xref>
            ]. When the two ontologies have diferent numbers of
classes, say  and  , MWM returns min(, ) pairs.
          </p>
          <p>Step 5: Confidence Threshold. After Step 4, some class pairs might have low similarity due
to the one-to-one mapping constraint. To solve this, a confidence threshold  is applied so that
any matched class pair ,  with a similarity score   less than  is removed from the prediction.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>4. Datasets and Evaluation</title>
      <p>
        Datasets. TEXTO is evaluated on two benchmarks of the OAEI Common Knowledge Graphs
Track6. The first benchmark NELL-DBpedia has been annotated by humans and verified by
experts. Note that the alignment is partial, not every class of an ontology has an equivalent
class in the other. The second benchmark YAGO-Wikidata was originally created from the
mapping between Schema.org and Wikidata7 used in YAGO [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
      </p>
      <p>The textual descriptions of the classes are absent in both datasets. For the NELL-DBpedia
dataset, the missing descriptions of DBpedia classes are completed with those of the equivalent
Wikidata classes. For the YAGO-Wikidata dataset, the descriptions are directly extracted from
the corresponding databases, Schema.org and Wikidata.</p>
      <p>In addition to these two reference datasets, a new dataset is proposed called
SchemaWikidata, based on the refreshed alignment of Schema.org and Wikidata. Note that the
alignment proposed in the benchmark YAGO-Wikidata dates back to 2017. Some class URIs
are deprecated. Our dataset is based on the SPARQL query on Wikidata using the
owl:equivalentClass predicate (property P1706). The new dataset consists of 343 class pairs, 39 more
than those available in the YAGO-Wikidata dataset. The new dataset is available in the OAEI</p>
      <sec id="sec-3-1">
        <title>4https://huggingface.co/sentence-transformers/all-mpnet-base-v2</title>
        <p>5https://www.sbert.net/docs/pretrained_models.html
6http://oaei.ontologymatching.org/2022/commonKG/index.html
7https://github.com/okfn-brasil/schemaOrg-Wikidata-Map
standard8 on the GitHub repository of the paper. The statistics of the considered datasets are
shown in Table 1.
Results. TEXTO is implemented in Python using Pytorch and Owlready29. Our evaluation is
completed in under 5 minutes on a Linux machine with 62 GB of RAM and 8 CPUs (3.47GHz)
processors. For both the NELL-DBpedia and Schema-Wikidata datasets, the hyper-parameter 
weighting label and description similarities is set to 0.5; for the YAGO-Wikidata dataset, it is set
to 0.4. For all datasets, the parameter  for candidate selection is set to 5, and the confidence
threshold  is set to 0.4. Table 2 reports the results of the experiments in terms of precision,
recall and F1-score, for the two benchmarks of the OAEI, for which results of the state-of-the-art
methods are available. For the dataset NELL-DBpedia, where the alignment is partial, any
prediction involving both classes that are not mapped in the gold standard is ignored.
Ablation study. We now present an ablation study of TEXTO on the three datasets, focusing
on the processing of textual information and the impact of MWM. The results are shown in
Table 3. For methods without MWM, the top-1 candidate with positive similarity is selected.
The methods with MWM component also include candidate selection (Step 3) and confidence
threshold (Step 5).</p>
      </sec>
      <sec id="sec-3-2">
        <title>8https://moex.gitlabpages.inria.fr/alignapi/format.html 9https://owlready2.readthedocs.io/en/latest/</title>
        <p>The ablation study reveals that leveraging the textual information contained in class
descriptions increases both precision and recall, a trend prominently observed in the YAGO-Wikidata
and Schema-Wikidata datasets. In the case of NELL-DBpedia, the addition of class
descriptions does not improve recall. A potential explanation is the limited number of classes in this
dataset, making pure label information suficient for ontology matching. Finally, replacing
GloVe by SBERT for embedding the labels tends to decrease performance, suggesting that a
word embedding model is more appropriate than a language model for encoding labels.
Discussion. In the benchmarks used in the literature for common KGs, the set of available
classes is restricted to the set of classes for which the gold mapping is available (or slightly
larger, cf. Table 1). In reality, the number of classes to match is much higher (there are more than
2M classes in Wikidata, for instance) and these classes have a complex, hierarchical structure
that makes matching much more dificult. This raises the following question:</p>
        <p>What is the efectiveness of existing methods beyond the benchmarks of the literature?
To this end, further experiments have been conducted on expanded versions of the
YAGOWikidata and Schema-Wikidata datasets. Specifically, we have added all 1,360 classes of
Schema.org instead of only those for which the gold standard is known. These additional
classes could be sub-classes, super-classes, or siblings of the original classes. The results of
TEXTO on these extended datasets are presented in Table 4.</p>
        <p>We observe that TEXTO still achieves good performance in these more realistic scenarios,
although the alignment is no longer perfect. This suggests that richer benchmarks should be
considered for ontology matching, to make the task more challenging.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>5. Conclusion</title>
      <p>In this paper, we have introduced an ontology matching system called TEXTO, which leverages
both the label and the textual description of each class. This matcher combines the vector
representations obtained from the GloVe word embedding model for the label and from the
SBERT language model for the description. The resulting similarity scores are then used to
derive the best mapping.</p>
      <p>Our system has been tested on the OAEI benchmarks, enriched with the description of each
class, and on a new dataset matching Schema.org and Wikidata. The results show that TEXTO
achieves almost perfect alignment, using textual information only. This calls for the publication
of new benchmarks with more classes, most likely without complete alignment, to make the task
more challenging. In such more realistic scenarios, the question of the respective importance of
textual content and structural information for ontology matching remains open.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J.</given-names>
            <surname>Euzenat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Shvaiko</surname>
          </string-name>
          , Ontology matching, 2nd ed., Springer-Verlag, Heidelberg (DE),
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>O.</given-names>
            <surname>Fallatah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Hopfgartner</surname>
          </string-name>
          ,
          <article-title>A gold standard dataset for large knowledge graphs matching</article-title>
          ,
          <source>in: OM@ISWC</source>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>H.</given-names>
            <surname>Belhadi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Akli-Astouati</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Djenouri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. C.-W.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <article-title>Data mining-based approach for ontology matching problem</article-title>
          ,
          <source>Applied Intelligence</source>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>O.</given-names>
            <surname>Fallatah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Hopfgartner</surname>
          </string-name>
          ,
          <article-title>The impact of imbalanced class distribution on knowledge graphs matching</article-title>
          ,
          <source>in: OM@ISWC</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>D.</given-names>
            <surname>Ayala</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Hernández</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ruiz</surname>
          </string-name>
          , E. Rahm,
          <article-title>Towards the smart use of embedding and instance features for property matching</article-title>
          ,
          <source>in: ICDE</source>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A.</given-names>
            <surname>Sharma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Patel</surname>
          </string-name>
          , S. Jain,
          <article-title>LSMatch and LSMatch-Multilingual results for OAEI</article-title>
          , in: OM@ISWC,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>D.</given-names>
            <surname>Faria</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. C.</given-names>
            <surname>Silva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Cotovio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Eugénio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Pesquita</surname>
          </string-name>
          ,
          <article-title>Matcha and Matcha-DL results for OAEI 2022</article-title>
          , in: OM@ISWC,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>E.</given-names>
            <surname>Jiménez-Ruiz</surname>
          </string-name>
          ,
          <article-title>LogMap family participation in the OAEI 2022</article-title>
          , in: OM@ISWC,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Hao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Lei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Efthymiou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Quamar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Özcan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Wang</surname>
          </string-name>
          , Medto:
          <article-title>Medical data to ontology matching using hybrid graph neural networks</article-title>
          ,
          <source>in: KDD</source>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <source>AMD results for OAEI</source>
          <year>2022</year>
          , in: OM@ISWC,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>D.</given-names>
            <surname>Kossack</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Borg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Knorr</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Portisch,</surname>
          </string-name>
          <article-title>TOM matcher results for OAEI 2021</article-title>
          , in: OM@ISWC,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>S.</given-names>
            <surname>Hertling</surname>
          </string-name>
          , H. Paulheim,
          <article-title>ATBox results for OAEI 2022</article-title>
          , in: OM@ISWC,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>J.</given-names>
            <surname>Portisch</surname>
          </string-name>
          , H. Paulheim,
          <article-title>Alod2vec matcher results for OAEI 2021</article-title>
          , in: OM@ISWC,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>R.</given-names>
            <surname>Jonker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Volgenant</surname>
          </string-name>
          ,
          <article-title>A shortest augmenting path algorithm for dense and sparse linear assignment problems</article-title>
          , in: DGOR/NSOR,
          <year>1988</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>T. Pellissier</given-names>
            <surname>Tanon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Weikum</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Suchanek</surname>
          </string-name>
          ,
          <article-title>Yago 4: A reason-able knowledge base</article-title>
          ,
          <source>in: ESWC</source>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>