Challenge: Lack of consistency in preprocessing and evaluation poses challenges to fair comparison of results in literature.
Approach: They propose an improved evaluation protocol for implicit relation classification on PDTB 2.0 . they report strong baseline results from pretrained sentence encoders .
Outcome: The proposed evaluation protocol improves the existing framework and provides strong baseline results.

Similar Papers

Multi-Label Classification for Implicit Discourse Relation Recognition (2024.findings-acl)

Copied to clipboard

Challenge: Prior research in discourse relation recognition has treated these instances as separate examples during training, with a gold-standard prediction matching one of the labels considered correct at test time.
Approach: They propose to use multiple labels to annotate an example when multiple relations are believed to hold simultaneously.
Outcome: The proposed frameworks don't depress performance for single-label prediction.
Entity Enhancement for Implicit Discourse Relation Classification in the Biomedical Domain (2021.acl-short)

Copied to clipboard

Challenge: Discourse relation classification is a challenging task when the text domain is different from the standard Penn Discourse Treebank (PDTB) training corpus domain.
Approach: They propose to use the Biomedical Discourse Relation Bank to improve discourse relational argument representation by linking explicit instances of similar relations with a voting pipeline.
Outcome: The proposed model outperforms the pre-trained BioBERT model by 2% points.
Towards Identifying Alternative-Lexicalization Signals of Discourse Relations (2022.coling-1)

Copied to clipboard

Challenge: Existing shallow discourse parsing methods have been limited to identifying relations signaled by a discourse connective and those without a signal.
Approach: They propose to identify relations signalled by a discourse connective and those without . they compare a pattern-based approach and a sequence labeling model .
Outcome: The proposed approach is based on a pattern-based approach and a sequence labeling model.
Deep Enhanced Representation for Implicit Discourse Relation Recognition (C18-1)

Copied to clipboard

Challenge: Discourse parsing requires understanding of text spans and can't be easily derived from surface features from sentence pairs.
Approach: They propose a model augmented with different grained text representations to improve discourse relation recognition.
Outcome: The proposed model achieves state-of-the-art accuracy with greater than 48% in 11-way and F1 score greater than 50% in 4-way classifications for the first time according to our best knowledge.
What Causes the Failure of Explicit to Implicit Discourse Relation Recognition? (2024.naacl-long)

Copied to clipboard

Challenge: Prior work claimed that explicit classifiers perform poorly in implicit scenarios . a label shift occurs after connectives are removed, but no empirical evidence supports this claim .
Approach: They propose to prove that the discourse relations expressed by some explicit instances will change when connectives disappear.
Outcome: The proposed methods outperform strong baselines on PDTB 2.0, PDTT 3.0, and the GUM dataset.
Improving Implicit Discourse Relation Classification by Modeling Inter-dependencies of Discourse Units in a Paragraph (N18-1)

Copied to clipboard

Challenge: Existing methods for predicting implicit discourse relations ignore wider paragraph contexts beyond the two discourse units examined for a discourse relation prediction.
Approach: They propose a paragraph-level neural network that models inter-dependencies between discourse units and discourse relation continuity and patterns and predicts a sequence of discourse relations in a sentence.
Outcome: The proposed model outperforms state-of-the-art systems on the benchmark corpus of PDTB.
Annotation-Inspired Implicit Discourse Relation Classification with Auxiliary Discourse Connective Generation (2023.acl-long)

Copied to clipboard

Challenge: Discourse connectives are words or phrases that signal the presence of a discourse relation.
Approach: They propose a model that generates discourse connectives between arguments and predicts discourse relations based on the generated connectives.
Outcome: The proposed model outperforms baselines on three datasets and is highly accurate.
Employing the Correspondence of Relations and Connectives to Identify Implicit Discourse Relations via Label Embeddings (P19-1)

Copied to clipboard

Challenge: Existing models for implicit discourse relation recognition lack the ability to accurately map connectives into discourse relations.
Approach: They propose a multi-task learning framework where relations and connectives are simultaneously predicted and leveraged to transfer knowledge between the two prediction tasks.
Outcome: The proposed framework yields state-of-the-art performance on several settings of the Penn Discourse Treebank dataset.
Enhancing Reasoning Capabilities by Instruction Learning and Chain-of-Thoughts for Implicit Discourse Relation Recognition (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing models for implicit discourse relation recognition are based on generative models, but some studies suggest they do not perform as well as generic encoder-only models for NLU tasks.
Approach: They propose a classification method that is solely based on generative models and utilize Chain-of-Thoughts to partition the inference process into a sequence of three successive stages.
Outcome: The proposed model outperforms existing models on a natural language understanding task.
Adapting BERT to Implicit Discourse Relation Classification with a Focus on Discourse Connectives (2020.lrec-1)

Copied to clipboard

Challenge: Existing studies on the performance of BERT for implicit discourse relation classification have not been conducted.
Approach: They propose to apply BERT to implicit discourse relation classification by performing additional pre-training on text tailored to discourse relations.
Outcome: The proposed methods outperform previous state-of-the-art models in many tasks.

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