Zhang Zhang, Ying Liu, Ruifang Liu, Daichi Guo, Ge Bai, Chenji Lu, Shilong Li, Yong Sun
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Predicting unseen relations that cannot be observed during the training phase is a challenging task in relation extraction. Previous works have made progress by matching the semantics between input instances and label descriptions. However, fine-grained matching often requires laborious manual annotation, and rich interactions between instances and label descriptions come with significant computational overhead. In this work, we propose an efficient multigrained matching approach that uses virtual entity matching to reduce manual annotation cost, and fuses coarse-grained recall and finegrained classification for rich interactions with guaranteed inference speed. Experimental results show that our approach outperforms the previous State Of The Art (SOTA) methods, and achieves a balance between inference efficiency and prediction accuracy in zero-shot relation extraction tasks. Our code is available at https://github.com/longls777/EMMA.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2406.11429")
get_code_for_paper("2406.11429")
have("2406.11429")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2406.11429.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2406.11429)
Connect an agent — have() is free.