Probing Graph Decomposition for Argument Pair Extraction

Yang Sun, Bin Liang, Jianzhu Bao, Yice Zhang, Geng Tu, Min Yang, Ruifeng Xu


Abstract
Argument pair extraction (APE) aims to extract interactive argument pairs from two passages within a discussion. The key challenge of APE is to effectively capture the complex context-aware interactive relations of arguments between the two passages. In this paper, we elicit relational semantic knowledge from large-scale pre-trained language models (PLMs) via a probing technique. The induced sentence-level relational probing graph can help capture rich explicit interactive relations between argument pairs effectively. Since the relevance score of a sentence pair within a passage is generally larger than that of the sentence pair from different passages, each sentence would prefer to propagate information within the same passage and under-explore the interactive relations between two passages. To tackle this issue, we propose a graph decomposition method to decompose the probing graph into four sub-graphs from intra- and inter-passage perspectives, where the intra-passage graphs can help detect argument spans within each passage and the inter-passage graphs can help identify the argument pairs between the review and rebuttal passages. Experimental results on two benchmark datasets show that our method achieves substantial improvements over strong baselines for APE.
Anthology ID:
2023.findings-acl.827
Volume:
Findings of the Association for Computational Linguistics: ACL 2023
Month:
July
Year:
2023
Address:
Toronto, Canada
Editors:
Anna Rogers, Jordan Boyd-Graber, Naoaki Okazaki
Venue:
Findings
SIG:
Publisher:
Association for Computational Linguistics
Note:
Pages:
13075–13088
Language:
URL:
https://aclanthology.org/2023.findings-acl.827
DOI:
10.18653/v1/2023.findings-acl.827
Bibkey:
Cite (ACL):
Yang Sun, Bin Liang, Jianzhu Bao, Yice Zhang, Geng Tu, Min Yang, and Ruifeng Xu. 2023. Probing Graph Decomposition for Argument Pair Extraction. In Findings of the Association for Computational Linguistics: ACL 2023, pages 13075–13088, Toronto, Canada. Association for Computational Linguistics.
Cite (Informal):
Probing Graph Decomposition for Argument Pair Extraction (Sun et al., Findings 2023)
Copy Citation:
PDF:
https://aclanthology.org/2023.findings-acl.827.pdf