<!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>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Marta C. Silva</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Daniel Faria</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pedro Cotovio</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lucas Ferraz</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Laura Balbi</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Catia Pesquita</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>1.1. State</institution>
          ,
          <addr-line>Purpose, General Statement</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>INESC-ID, Instituto Superior Técnico, Universidade de Lisboa</institution>
          ,
          <country country="PT">Portugal</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>LASIGE, Faculdade de Ciências, Universidade de Lisboa</institution>
          ,
          <country country="PT">Portugal</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2025</year>
      </pub-date>
      <abstract>
        <p>Matcha is an ontology matching system designed to tackle long-standing challenges such as complex and holistic ontology matching. It incorporates all of the key algorithms from AgreementmakerLight over a novel broader core architecture that includes several new algorithms. Matcha performed well overall, achieving the highest F-measure in ten out of 32 distinct OAEI tasks and ranking in the top three in twelve others. In the complex track, Matcha achieved the highest F-measure in seven tasks using the Graph Edit Distance and two using the Tree Edit Distance.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1.2. Specific Techniques Used</title>
    </sec>
    <sec id="sec-2">
      <title>1.3. Adaptations Made for the Evaluation</title>
      <p>
        The MELT [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] web-based package was implemented in Matcha for the required evaluation in OAEI.
Given two ontologies and a set of parameters, Matcha will generate a complete alignment between them
according to the type of entities to be matched. For local alignment tasks, where each entity in the test
      </p>
      <sec id="sec-2-1">
        <title>Matches classes based on overlapping individuals that instantiate them, computed through conservative instance matching algorithms</title>
      </sec>
      <sec id="sec-2-2">
        <title>Matches ontologies by finding literal full name matches between their lexicons. Weighs matches according to the provenance of the names</title>
      </sec>
      <sec id="sec-2-3">
        <title>Matches ontologies by computing the cosine similarity between the language model embeddings of their lexicons</title>
      </sec>
      <sec id="sec-2-4">
        <title>Matches ontologies by using cross-references and/or exact lexical matches between them and a third mediating ontology</title>
      </sec>
      <sec id="sec-2-5">
        <title>Matches ontologies by measuring the maximum string similarity, using one of the four available string similarity measures</title>
      </sec>
      <sec id="sec-2-6">
        <title>Matches ontologies by measuring the word similarity, using a weighted</title>
      </sec>
      <sec id="sec-2-7">
        <title>Jaccard index</title>
        <sec id="sec-2-7-1">
          <title>Instance Matching</title>
        </sec>
      </sec>
      <sec id="sec-2-8">
        <title>Matches individuals by finding literal matches between the values of their annotation and data properties</title>
      </sec>
      <sec id="sec-2-9">
        <title>Maps individuals by comparing their values through the ISub string similarity metric</title>
      </sec>
      <sec id="sec-2-10">
        <title>Maps individuals by comparing the lexicon entries of one with the values of the other using a combination of string and word matching algorithms</title>
      </sec>
      <sec id="sec-2-11">
        <title>Maps individuals by comparing sentence representations of the source and target labels, obtained with a LM trained in a multilingual setting</title>
        <p>set has a predetermined list of candidate matches, Matcha calculates scores for each candidate. These
candidates are then ranked based on the highest score obtained from the various matching algorithms.</p>
        <p>Matcha was packaged in a docker container for ease of sharing and running the evaluation, which
included, for example, the files necessary for some of the algorithms, such as background knowledge
ontologies used in some tracks and the scripts necessary to run the language models.
2. Results
Matcha’s results for OAEI are summarized in Table 2, with the exception of the results for the BioML
track, which are presented in Table 3, and the results for the complex track, which are presented in
Table 4. Matcha achieved the highest F-measure in ten out of 32 distinct OAEI tasks and ranking in the
top three in twelve others. In the complex track, Matcha achieved the highest F-measure in seven tasks
using the Graph Edit Distance and two using the Tree Edit Distance.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>2.1. Anatomy track</title>
      <p>With the same results as last year, Matcha placed first among all systems achieving scores higher than
0.9 in all evaluation metrics (0.951 for precision, 0.931 for recall, 0.941 for F-measure).</p>
    </sec>
    <sec id="sec-4">
      <title>2.2. Archaeology Multilingual track</title>
      <p>There was an increase in participating systems from two last year to four this year (LogMap competes
with three variants). Matcha placed first in three out of ten tasks and failing to produce an alignment in
one of them (where only one system had any results), similarly to last year. The results are again very
heterogeneous, with precision raging from 0.17 to 1.0 (in the idai-pactols_de-de task) and recall from
0.06 to 0.75. Unsurprisingly the best results are mostly achieved in the single-language tasks.</p>
      <p>Due to some technical issues, the language model was changed from last year’s MLLM to
sentenceBERT, and it is interesting to note that the overall pattern of results were maintained despite this change.
One of the improvement points to consider for the next edition is the runtime, as Matcha takes close to
11 minutes while most systems take under a minute to achieve better or comparable results.</p>
    </sec>
    <sec id="sec-5">
      <title>2.3. Circular Economy track</title>
      <p>This year’s results in this track were lower than the previous year requiring some further exploration,
with Matcha placing last behind AgentOM and two LogMap variants. As mentioned by the track’s
organizers, Matcha finds a large number of false positives, mostly in situtations where entities share
the same name, which greatly impacts precision (0.158). Recall scores far higher with a 0.917, being the
second best value among all systems.</p>
    </sec>
    <sec id="sec-6">
      <title>2.4. Complex track</title>
      <p>Matcha’s complex matcher finds simultaneously simple equivalences, subsumption relationships, and
1:n complex equivalences. For the unpopulated conference task only complex mappings were evaluated
and Matcha was unable to find any true positives.</p>
      <p>Three new evaluations were debuted this year that evaluate mappings in the alignment based on
their content and structure. Matcha performed much better in the metrics that took into account simple
mappings (class evaluation and GED evaluation), since it actually outputted few complex mappings.
Further exploration is necessary in this track in order to produce more (and correct) complex mappings.</p>
      <p>Matcha competed as the only system in the new biomedical dataset achieving results that serve as a
good starting point between 0.465 and 0.554 in F-measure.</p>
    </sec>
    <sec id="sec-7">
      <title>2.5. Conference track</title>
      <p>Compared to last year, Matcha improved on precision but lowered recall resulting in an F-measure that
is 0.01 lower (0.63), placing third. Matcha outperforms both baselines.</p>
      <p>An additional evaluation was run to assess any diferences in results from sharp, discrete, and
continuous settings. From this assessment, it is noted that Matcha performs well in the sharp evaluation
in terms of precision (0.85), but in the discrete uncertain setting, while its precision drops, recall
improves to 0.77 and then remains at a 0.75 in the continuous evaluation, indicating that it is successful
at identifying uncertain matches.</p>
      <p>Regarding the evaluation performed based on logical reasoning, Matcha has 90 conservativity principle
violations and 115 consistency principle violations in an alignment of 21 mappings. which is an increase
from last year and requires further exploration. As the organizers note, conservativity principle
violations can be false positives.</p>
    </sec>
    <sec id="sec-8">
      <title>2.6. Digital Humanities track</title>
      <p>Matcha improved over last year’s results placing first in five tasks out of eight tasks. Futhermore,
overall it achieves the best average F1-score of 0.64 and the task that failed to produce an alignment in
the previous edition was successfully completed this year. The results are somewhat heterogeneous
with precision raging from 0.31 to 1.0 (in the arch1_defc-pactols) and recall from 0.23 to 1.0 (in the
arch2_idai-pactols). As in the previous year, recall is less variable with more values falling on the top
end of the scale (six out of eight are higher than 0.7).</p>
      <p>Similarly to the Archaeology Multilingual track, this track uses sentenceBERT as the new language
model for the translation module, which still requires further exploration and review.</p>
    </sec>
    <sec id="sec-9">
      <title>2.7. Knowledge Graph track</title>
      <p>Matcha places second to last overall, failing to produce an alignment for one of the tasks and producing
no property mappings. By not considering empty, erroneous, or not generated alignments, Matcha
improves on its results, with precision increasing from 0.54 to 0.68, recall from 0.71 to 0.88, and
consequently F-measure from 0.61 to 0.76.</p>
      <p>In aligning instances, Matcha finds far more mappings than other systems (29113 mappings when
the next system finds 6653) which will significantly decrease precision.</p>
      <p>When looking at each of the test cases, a pattern emerges where Matcha has lower precision and
higher recall when comparing all systems. However the precision values are low enough that they
cannot be compensated by the high recall, leading Matcha to rank very low.</p>
      <p>In this track, two main problems arise which need to be assessed and corrected: the lack of property
mappings and the excessive amount of instance mappings produced, which directly influence the
system’s precision.</p>
    </sec>
    <sec id="sec-10">
      <title>2.8. Multifarm track</title>
      <p>Matcha placed second overall by F-measure in this track. Both precision and recall are low and almost
equal at 0.26 and 0.25, respectively. Despite other systems having a higher precision, lower recall values
decrease the F-measure significantly. The runtime is still a necessary point of improvement as it takes
significantly longer than other systems.</p>
    </sec>
    <sec id="sec-11">
      <title>2.9. Bio-ML track</title>
      <p>This year, Matcha maintained consistent performance without any major system updates, which is a
positive outcome given the participation of four new machine learning–based systems. While Matcha’s
Bio-ML rankings based on F-score were moderate compared to the other participating models, it
demonstrated a stronger relative performance in terms of Mean Reciprocal Rank (MRR), particularly
in the unsupervised setting. The middle-range F-scores mainly reflected high precision paired with
comparatively low recall, a pattern also observed among most other participating systems, highlighting
that the challenge of improving recall without compromising precision remains an open issue. Overall,
key Matcha results in the Bio-ML track include: a top-3 MRR ranking in four of the five tasks in the
unsupervised setting; first and second places in MRR ranking in the unsupervised and supervised
settings of the SNOMED–FMA task, respectively; and a second place in the SNOMED–NCIT (pharm)
task.
3. Conclusions
Matcha achieved the highest F-measure in ten out of the 32 distinct OAEI tasks and ranked in the top
three in twelve others. Overall, results stayed mostly the same compared to the previous edition. It is
interesting to note that changes in the language model of the translation module had limited impact in
the archaeology-multilingual and digital humanities tracks. The new results in the complex track are
interesting to note, as they combine diferent types of mappings and were evaluated following new
strategies. Some issues failed to be resolved from last year, such as the the ones linked to the knowledge
graph track, meaning Matcha still requires some further review.</p>
      <p>Acknowledgements
This work was supported by FCT through fellowships https://doi.org/10.54499/2022.11895.BD (Marta
Silva), https://doi.org/10.54499/2022.10557.BD (Pedro Cotovio), https://doi.org/10.54499/2025.04034.BD
(Lucas Ferraz) and https://doi.org/10.54499/2024.01208.BD (Laura Balbi), and through LASIGE Research
Unit, ref. UID/408/2025. It was partially supported by the KATY project which has received funding
from the European Union’s Horizon 2020 research and innovation program under grant agreement
No 101017453, by the CancerScan project by the EU’s HORIZON Europe research and innovation
programme under grant agreement No 101186829, and by project 41, HfPT: Health from Portugal,
funded by the Portuguese Plano de Recuperação e Resiliência.</p>
      <p>Declaration on Generative AI
The authors have not employed any Generative AI tools.</p>
      <p>Mouse-Human
idai-pactols_de-de
idai-pactols_de-en
idai-pactols_de-fr
idai-pactols_de-it
idai-pactols_en-en
idai-pactols_en-fr
idai-pactols_en-it
idai-pactols_fr-fr
idai-pactols_fr-it
idai-pactols_it-it</p>
      <sec id="sec-11-1">
        <title>CEON-BiOnto</title>
      </sec>
      <sec id="sec-11-2">
        <title>CEON-MATONTO</title>
        <p>OntoFarm (rar2-M3)
arch1_defc-pactols
arch2_idai-pactols
arch3_ironagedanube-pactols
arch4_pactols-parthenos
cult1_idai-parthenos
cult2_oeai-parthenos
dhcs1_dha-unesco
dhcs2_tadirah-unesco</p>
      </sec>
      <sec id="sec-11-3">
        <title>Aggregated (overall and non-empty)</title>
      </sec>
      <sec id="sec-11-4">
        <title>Aggregated</title>
        <sec id="sec-11-4-1">
          <title>Rank * Table 3</title>
        </sec>
        <sec id="sec-11-4-2">
          <title>Recall/</title>
          <p>Coverage
—— Complex (GED evaluation) ——
0.526 0.365 0.431
0.529 0.327 0.404
0.587 0.595 0.591
0.500 0.064 0.113
0.645 0.507 0.568
0.372 0.062 0.106
0.421 0.303 0.353
0.048 0.688 0.091
0.287 0.467 0.355
0.245 0.391 0.301
0.465 0.465 0.465
0.529 0.529 0.529
0.554 0.554 0.554</p>
        </sec>
        <sec id="sec-11-4-3">
          <title>Correct</title>
        </sec>
        <sec id="sec-11-4-4">
          <title>Contains</title>
          <p>reference</p>
        </sec>
        <sec id="sec-11-4-5">
          <title>Contained in</title>
          <p>reference
Overlap Incorrect
cmt-conference
cmt-ekaw
conference-ekaw
cree-swo
hydro3-swo
hydrOntology_native-swo
hydrontology_translated-swo
enslaved-wikidata
gbo-gmo
popgbo-popgmo
hp
mp
wbp</p>
        </sec>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>É.</given-names>
            <surname>Thiéblin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Haemmerlé</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Hernandez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Trojahn</surname>
          </string-name>
          , Survey on complex ontology matching,
          <source>Semantic Web</source>
          <volume>11</volume>
          (
          <year>2020</year>
          )
          <fpage>689</fpage>
          -
          <lpage>727</lpage>
          . URL: https://doi.org/10.3233/SW-190366. doi:
          <volume>10</volume>
          .3233/SW-190366.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>I.</given-names>
            <surname>Megdiche</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Teste</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Trojahn</surname>
          </string-name>
          ,
          <article-title>An extensible linear approach for holistic ontology matching</article-title>
          , in: International Semantic Web Conference, Springer,
          <year>2016</year>
          , pp.
          <fpage>393</fpage>
          -
          <lpage>410</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
            <surname>Faria</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Santos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. S.</given-names>
            <surname>Balasubramani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. C.</given-names>
            <surname>Silva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Couto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Pesquita</surname>
          </string-name>
          , Agreementmakerlight, Semantic
          <string-name>
            <surname>Web</surname>
          </string-name>
          (
          <year>2023</year>
          )
          <fpage>1</fpage>
          -
          <lpage>13</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>D.</given-names>
            <surname>Faria</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Pesquita</surname>
          </string-name>
          , E. Santos,
          <string-name>
            <given-names>M.</given-names>
            <surname>Palmonari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. F.</given-names>
            <surname>Cruz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Couto</surname>
          </string-name>
          ,
          <article-title>The AgreementMakerLight Ontology Matching System</article-title>
          ,
          <source>in: OTM Conferences - ODBASE</source>
          ,
          <year>2013</year>
          , pp.
          <fpage>527</fpage>
          -
          <lpage>541</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>D.</given-names>
            <surname>Faria</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Pesquita</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Santos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. F.</given-names>
            <surname>Cruz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Couto</surname>
          </string-name>
          ,
          <article-title>Automatic Background Knowledge Selection for Matching Biomedical Ontologies</article-title>
          ,
          <source>PLoS One</source>
          <volume>9</volume>
          (
          <year>2014</year>
          )
          <article-title>e111226</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>N.</given-names>
            <surname>Reimers</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Gurevych</surname>
          </string-name>
          ,
          <article-title>Sentence-bert: Sentence embeddings using siamese bert-networks</article-title>
          , arXiv preprint arXiv:
          <year>1908</year>
          .
          <volume>10084</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M. C.</given-names>
            <surname>Silva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Faria</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Pesquita</surname>
          </string-name>
          ,
          <article-title>Complex multi-ontology alignment through geometric operations on language embeddings</article-title>
          .,
          <source>in: ECAI</source>
          ,
          <year>2024</year>
          , pp.
          <fpage>1333</fpage>
          -
          <lpage>1340</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S.</given-names>
            <surname>Hertling</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Portisch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Paulheim</surname>
          </string-name>
          , MELT
          <article-title>- matching evaluation toolkit</article-title>
          ,
          <source>in: Semantic Systems. The Power of AI and Knowledge Graphs - 15th International Conference, SEMANTiCS</source>
          <year>2019</year>
          , Karlsruhe, Germany, September 9-
          <issue>12</issue>
          ,
          <year>2019</year>
          , Proceedings,
          <year>2019</year>
          , pp.
          <fpage>231</fpage>
          -
          <lpage>245</lpage>
          . URL: https://doi.org/10.1007/ 978-3-
          <fpage>030</fpage>
          -33220-4_
          <fpage>17</fpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -33220-4\_
          <fpage>17</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>