The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Semantic matching
Abstract
We think of match as an operator that takes two graph-like structures (e.g. database schemas or ontologies) and produces a mapping between elements of the two graphs that correspond semantically to each other. The goal of this paper is to propose a new approach to matching, called semantic matching . As its name indicates, in semantic matching the key intuition is to exploit the model-theoretic information, which is codified in the nodes and the structure of graphs. The contributions of this paper are (i) a rational reconstruction of the major matching problems and their articulation in terms of the more generic problem of matching graphs, (ii) the identification of semantic matching as a new approach for performing generic matching and (iii) a proposal for implementing semantic matching by testing propositional satisfiability.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
WordNet: a lexical database for English
Miller, G. A. (1995) · Communications of the ACM · doi:10.1145/219717.219748 · Cited by 14,015
Cited by
Semantic integration: a survey of ontology-based approaches
Noy, N. F. (2004) · ACM SIGMOD Record · doi:10.1145/1041410.1041421 · Cited by 1,019
S-Match: an Algorithm and an Implementation of Semantic Matching
Giunchiglia, F., Shvaiko, P., & Yatskevich, M. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-25956-5_5 · Cited by 473
Self-citationSemantic Matching: Algorithms and Implementation
Giunchiglia, F., Yatskevich, M., & Shvaiko, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74987-5_1 · Cited by 259
Self-citationContrastive Learning Models for Sentence Representations
Xu, L., Xie, H., Li, Z., Wang, F. L., Wang, W., & Li, Q. (2023) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3593590 · Cited by 50
Metadata
- Authors
- GIUNCHIGLIA, F., & SHVAIKO, P.
- Venue
- The Knowledge Engineering Review
- Publisher
- Maximum Academic Press
- Published
- 2003-09
- Volume
- 18
- Issue
- 3
- Pages
- 265-280
- ISSN
- 0269-8889 (ISSN-L)
- 1469-8005
- OpenAlex
- W2914271914
- Cited by
- 321
- References
- 1
- FWCI
- 30.04
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Semantic matching. https://app.cochat.ai/papers/10.1017/s0269888904000074
- The paper
- GIUNCHIGLIA, F., & SHVAIKO, P. (2003). Semantic matching. The Knowledge Engineering Review. https://doi.org/10.1017/s0269888904000074
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
