RE-Matching: A Fine-Grained Semantic Matching Method for Zero-Shot Relation Extraction
Zhao, Jun, Zhan, Wenyu, Zhao, Xin, Zhang, Qi, Gui, Tao, Wei, Zhongyu, Wang, Junzhe, Peng, Minlong, Sun, Mingming
–arXiv.org Artificial Intelligence
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 $F_1$ score and has an inference speed 10 times faster, when compared with the state-of-the-art methods.
arXiv.org Artificial Intelligence
Jun-8-2023
- Country:
- South America > Brazil (0.04)
- Africa > South Africa (0.04)
- North America
- Dominican Republic (0.04)
- United States
- California (0.04)
- New York > New York County
- New York City (0.05)
- New Mexico > Santa Fe County
- Santa Fe (0.04)
- Minnesota > Hennepin County
- Minneapolis (0.14)
- Canada > British Columbia
- Europe
- Italy > Tuscany
- Florence (0.04)
- Ireland > Leinster
- County Dublin > Dublin (0.04)
- France > Hauts-de-France
- Belgium > Brussels-Capital Region
- Brussels (0.04)
- Italy > Tuscany
- Asia
- Middle East > Jordan (0.04)
- China > Shanghai
- Shanghai (0.04)
- Genre:
- Research Report > New Finding (0.34)
- Technology: