Baselines

Organiser-run baseline systems for both competitions, published before the evaluation window. These are organiser baselines — participant submissions are not added to these tables. Participant results live on the CodaBench leaderboards and appear on the results page now that the window is open (since 12 July 2026).

Track 1 · Subtrack 1 — global equivalence alignment

Repaired coherence-aware P/R/F1

Macro-averaged over the three pairs (NCIT–DOID, SNOMED–FMA, SNOMED–NCIT); sorted by the headline column. See evaluation metrics.

System F1 (repaired)P (repaired)R (repaired)
LogMapLt 0.625 0.628 0.635
AML 0.535 0.451 0.766
LogMap 0.523 0.392 0.803
BERTMap 0.516 0.821 0.401
BERTMapLt 0.508 0.785 0.403

Track 1 · Subtrack 2 — local equivalence ranking

MRR and Hits@k (standard reference)

Macro-averaged over the three pairs (NCIT–DOID, SNOMED–FMA, SNOMED–NCIT); sorted by the headline column. See evaluation metrics.

System MRRHits@1Hits@5Hits@10
Lexical-Baseline* 0.731 0.656 0.814 0.863
SapBERT 0.716 0.638 0.809 0.850
BERTMapLt 0.583 0.524 0.636 0.692
BERTMap-ss 0.496 0.463 0.510 0.539
BERTMap 0.445 0.421 0.447 0.470

About these baselines

Organiser baselines (macro over the three pairs). Global = semi-supervised test-slice (option a): repaired coherence-aware F1 headline. Local ranking is scored against the standard reference — coherence repair applies to the global task only. Participant results appear on the CodaBench leaderboards. The global-alignment headline is the repaired coherence-aware F1; local ranking is headlined by MRR against the standard (unrepaired) reference. Full data: leaderboard.json. Participant results appear on the results page, fed by the CodaBench leaderboards. How long each baseline took, and the machine it ran on, are in wall-clock times below. Lexical-Baseline is a character tri-gram similarity matcher, not an exact-string baseline.

Baseline coherence

Baseline coherence — the alignments the systems produce

Alongside P/R/F1, each global alignment is checked with a reasoner: does the system's own alignment leave the merged ontology satisfiable? Each baseline's submitted mappings are merged with both ontologies and classified, giving the number of unsatisfiable named classes and the incoherence degree (that count over the merged named-class signature, in parentheses). Lower is better; 0 is coherent. Rows are in the same order as the P/R/F1 table above, so the two can be read across.

System NCIT–DOIDSNOMED–FMASNOMED–NCIT
ELKHermiTELKELK
LogMapLt 37,944 (16.4%)37,946 (16.4%)534,393 (89.4%)
AML 64,366 (27.8%)64,371 (27.8%)13,494 (2.26%)
LogMap 8 (0.00346%)8 (0.00346%)97,408 (19.9%)448 (0.0749%)
BERTMap 14 (0.00605%)14 (0.00605%)76,300 (15.5%)9,801 (1.64%)
BERTMapLt 10,444 (4.51%)10,535 (4.55%)127,556 (26.0%)77,844 (13.0%)

Counted in the merged ontology (Osrc ∪ Otgt ∪ M), where M is the system's own alignment. Every ELK figure is a sound lower bound; HermiT is exact but only terminates on NCIT–DOID at this scale, so the SNOMED pairs carry ELK bounds only. As with the reference figures below, correspondences involving owl:deprecated classes are excluded as out-of-task, so the two tables are on the same basis. Two cells are genuinely unavailable (—): AML and LogMapLt on SNOMED–FMA did not produce a result. Coherence is not a quality ranking and does not track F1 — a system that maps very little scores well here, and LogMap and AML repair internally by design. Machine-readable data: baseline_coherence.json.

Reference coherence

Reference coherence — before vs after repair

The Task-1 reference alignment is grounded in UMLS/Mondo and can be logically incoherent; the repair procedure removes or weakens the incoherence-inducing correspondences. This table reports the coherence of each pair's reference before and after repair — the number of unsatisfiable named classes in the merged ontology and the corresponding incoherence degree. All three repaired references are coherent (0 unsatisfiable classes).

Pair Unsat. (before) Incoherence degree (before) Unsat. (after) Incoherence degree (after)
NCIT–DOID 17,850† 7.7% 0 0%
SNOMED–FMA 0 0%
SNOMED–NCIT 466,306† 78% 0 0%

Unsatisfiable classes are counted in the merged ontology (Osrc ∪ Otgt ∪ R) under the ELK reasoner; the incoherence degree is that count over the merged named-class signature. † denotes an ELK lower bound (a sound under-approximation; the exact figure is pending). The all-equivalence standard SNOMED–FMA merge does not classify under ELK even at a 128 GB heap, so its before-repair figure is unavailable (—). Machine-readable data: reference_coherence.json.

Runtime

Wall-clock times — and the machine that produced them

How long each baseline actually took, per pair and over all three. The Subtrack-1 figures cover the matching phase that produced the system's global alignment; the Subtrack-2 figures cover the ranking run behind the MRR / Hits@k above. Every run was on the one workstation specified below.

Subtrack 1 — global equivalence alignment

matching: producing each system's global alignment over the two full ontologies

System NCIT–DOIDSNOMED–FMASNOMED–NCIT All three Ran on
LogMapLt 39 s24 s59 s 2.0 min CPU, 256 GB heap
AML 78 s13.7 min12.8 min 27.8 min CPU, 256 GB heap
LogMap 7.2 min24.1 h2.6 h 26.8 h CPU, 256 GB heap
BERTMap 3.8 h18.2 h24.9 h 46.9 h 1 GPU, 64 GB heap
BERTMapLt 4.3 min2.7 h1.7 h 4.5 h CPU, 128 GB heap

LogMap: The 24-hour SNOMED–FMA cell is the outlier; the other two pairs finish in minutes to hours. BERTMap: Includes the in-run BERT fine-tune on each pair's own ontology synonyms.

Measured as: AML / LogMap / LogMapLt: per-cell wall-clock recorded, cells match, write and score. BERTMap / BERTMapLt: perform end-of-matching, excludes the ranking.

Subtrack 2 — local equivalence ranking

ranking: scoring every candidate list in the test split

System NCIT–DOIDSNOMED–FMASNOMED–NCIT All three Ran on
Lexical-Baseline 17 s26 s80 s 2.0 min CPU
SapBERT 3.5 min6.8 min24.6 min 34.9 min 1 GPU
BERTMapLt 2.8 min13.2 min24.4 min 40.4 min CPU, 64 GB heap
BERTMap-ss 64.2 min7.9 h8.9 h 17.9 h 1 GPU, 64 GB heap
BERTMap 4.8 min10.9 min24.1 min 39.7 min 1 GPU, 48 GB heap

BERTMap-ss: Fine-tunes fresh on the public train+valid maps for every split — the fine-tune must not be shared across splits. BERTMap: Reuses the fine-tuned checkpoint from its Subtrack-1 run, so the fine-tuning cost is counted in the matching table above and not here.

Measured as: Per-cell wall-clock recorded by the baseline runner for the ranking-only runs that produced the published MRR / Hits@k.

Hardware

Every baseline runs locally on a machine with the following specifications.

CPUAMD Ryzen Threadripper PRO 9965WX — 24 cores / 48 threads, boost to 5.49 GHz, 128 MB L3
Memory768 GB DDR5 ECC RDIMM
GPU2 × NVIDIA RTX PRO 6000 Blackwell Max-Q Workstation Edition, 96 GB, 300 W
StoragePCIe Gen5 NVMe SSD 1 TB system volume, 4 TB working volume
OSUbuntu 24.04 LTS
JVMOpenJDK 21 — heap 256 GB for AML / LogMap / LogMapLt, 48–128 GB for the BERTMap family
PythonCPython 3.12
ReasonerELK, for BERTMap's internal mapping repair

Every figure is a single run, measured values should be considered as follows: the BERTMap-family ranking runs were launched in pairs, one per GPU; a second matcher process was sharing the host's CPU and memory bandwidth throughout. The reasoner coherence checks reported above are separate steps that are not counted here. Measured June 2026. Machine-readable data: baseline_runtime.json.

Editions

Baselines and results by edition

OAEI Bio-ML 2026 is the current edition. As the track matures, each edition's final baselines and participant results will be archived here, and changes between editions are recorded in the changelog.

EditionStatusBaselinesMachine-readable snapshot
2026 current — evaluation & leaderboard open since 12 July 2026 this page leaderboard.json