RE-Matching: A Fine-Grained Semantic Matching Method for Zero-Shot Relation Extraction

30Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Semantic matching is a mainstream paradigm of zero-shot relation extraction, which matches a given input with a corresponding label description. The entities in the input should exactly match their hypernyms in the description, while the irrelevant contexts should be ignored when matching. However, general matching methods lack explicit modeling of the above matching pattern. In this work, we propose a fine-grained semantic matching method tailored for zero-shot relation extraction. Following the above matching pattern, we decompose the sentence-level similarity score into entity and context matching scores. Due to the lack of explicit annotations of the redundant components, we design a feature distillation module to adaptively identify the relation-irrelevant features and reduce their negative impact on context matching. Experimental results show that our method achieves higher matching F1 score and has an inference speed 10 times faster, when compared with the state-of-the-art methods.

Cite

CITATION STYLE

APA

Zhao, J., Zhan, W., Zhao, X., Zhang, Q., Gui, T., Wei, Z., … Sun, M. (2023). RE-Matching: A Fine-Grained Semantic Matching Method for Zero-Shot Relation Extraction. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (Vol. 1, pp. 6680–6691). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2023.acl-long.369

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free