Challenge: Argument pair extraction (APE) aims to extract interactive argument pairs from two separate passages.
Approach: They propose to tackle the lexical and semantic relevance of arguments with a pre-trained Rouge-guided Transformer (ROT) by using a word graph and a gating mechanism to fuse two graphs.
Outcome: The proposed approach achieves state-of-the-art on F1 score and significantly improves on existing best alternative.

Similar Papers

Argument Pair Extraction with Mutual Guidance and Inter-sentence Relation Graph (2021.emnlp-main)

Copied to clipboard

Challenge: Existing studies on argumentation mining focus on monological argumentation and dialogical argumentation.
Approach: They propose a mutual guidance framework that could guide arguments in one passage . they propose an inter-sentence relation graph to effectively model the inter-relations between two sentences .
Outcome: The proposed method outperforms the current state-of-the-art model.
Argument Pair Extraction via Attention-guided Multi-Layer Multi-Cross Encoding (2021.acl-long)

Copied to clipboard

Challenge: Argument pair extraction (APE) is a research task for extracting arguments from two passages and identifying potential argument pairs.
Approach: They propose a novel attention-guided multi-layer multi-cross encoding scheme that processes two passages with two individual sequence encoders and updates their representations using each other’s attention.
Outcome: The proposed model significantly improves the performance over several alternatives.
Probing Graph Decomposition for Argument Pair Extraction (2023.findings-acl)

Copied to clipboard

Challenge: Argument pair extraction (APE) aims to extract interactive argument pairs from two passages within a discussion.
Approach: They propose a method to extract interactive argument pairs from two passages . they propose to decompose the probing graph into four sub-graphs based on inter- and intra-passage perspectives .
Outcome: The proposed method improves on strong baselines on two benchmark datasets.
Have my arguments been replied to? Argument Pair Extraction as Machine Reading Comprehension (2022.acl-short)

Copied to clipboard

Challenge: Existing studies identify argument pairs indirectly by predicting sentence-level relations between two documents, neglecting the holistic argument-level interactions.
Approach: They propose to use machine reading comprehension to extract argument pairs from two documents . they propose to employ an AM query to identify all arguments in two documents, then an APE query to extract its paired arguments from another document.
Outcome: The proposed method outperforms the state-of-the-art method by 7.11% in F1 score.
APE: Argument Pair Extraction from Peer Review and Rebuttal via Multi-task Learning (2020.emnlp-main)

Copied to clipboard

Challenge: Argument mining is an important research field that attracts growing attention in recent years.
Approach: They propose a new task to extract argument pairs from peer review and rebuttal . they use an open review platform to analyze the contents, structure and connections .
Outcome: The proposed task is based on a dataset of 4,764 fully annotated review-rebuttal passage pairs . it is able to detect argumentative propositions and extract argument pairs from the corpus .
Leveraging Argumentation Knowledge Graph for Interactive Argument Pair Identification (2021.findings-acl)

Copied to clipboard

Challenge: Existing researches focus on sentence matching but the interaction of opinions requires reasoning of knowledge, which is beyond textual information.
Approach: They propose to leverage external knowledge to enhance the identification of interactive argument pairs by analyzing the discussion thread of the target topic in an online forum.
Outcome: The proposed model achieves state-of-the-art in the benchmark dataset.
Graph Transformer Networks with Syntactic and Semantic Structures for Event Argument Extraction (2020.findings-emnlp)

Copied to clipboard

Challenge: Existing models for Event Argument Extraction fail to exploit semantic structures of sentences to induce effective representations for EAE.
Approach: They propose a novel model that exploits syntactic and semantic structures of sentences to learn more effective sentence structures for EAE.
Outcome: The proposed model improves the performance of the existing models on standard datasets.
Graph Enhanced Dual Attention Network for Document-Level Relation Extraction (2020.coling-main)

Copied to clipboard

Challenge: Document-level relation extraction requires inter-sentence reasoning capabilities to capture local and global contextual information for multiple relation facts.
Approach: They propose to characterize the interaction between sentences and potential relation instances via a Graph Enhanced Dual Attention network (GEDA) . they also propose a simple yet effective regularizer based on the natural duality of the S2R and R2S attentions, whose weights are also supervised by the supporting evidence of relation instances during training.
Outcome: The proposed model achieves competitive performance on an existing large-scale dataset while the predictions can be interpretable and easily observed.
A Semantic Mention Graph Augmented Model for Document-Level Event Argument Extraction (2024.lrec-main)

Copied to clipboard

Challenge: Document-level Event Argument Extraction (DEAE) aims to identify arguments and their specific roles from unstructured document.
Approach: They propose a document-prompt-based method for document-level event argument extraction that uses a semantic mention graph to capture relations between documents and prompts.
Outcome: The proposed method surpasses baseline methods and achieves state-of-the-art performance on RAMS and WikiEvents datasets.
Uncovering Implicit Inferences for Improved Relational Argument Mining (2023.eacl-main)

Copied to clipboard

Challenge: Argument mining attempts to extract arguments and their structure from unstructured texts.
Approach: They propose a generative neuro-symbolic approach to finding inference chains that connect argument pairs by using the Commonsense Transformer.
Outcome: The proposed approach outperforms the state-of-the-art by 2-5% in F1 score on three datasets.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations