Challenge: Multi-level implicit discourse relation recognition (MIDRR) aims at identifying hierarchical discourse relations among arguments.
Approach: They propose a prompt-based multi-level implicit discourse relation recognition framework that leverages parameter-efficient prompt tuning to drive inputted arguments to match the pre-trained space.
Outcome: The proposed framework achieves comparable results on PDTB 2.0 and 3.0 using about 0.1% trainable parameters compared with baselines.

Similar Papers

Global and Local Hierarchical Prompt Tuning Framework for Multi-level Implicit Discourse Relation Recognition (2024.lrec-main)

Copied to clipboard

Challenge: Recent methods to recognize hierarchical discourse relations without explicit connectives are inefficient and ignore the utilization of the output probability distribution information of the verbalizer.
Approach: They propose a global and local hierarchical prompt tuning framework which leverages top-up propagated probability as the global hierarchy to inject it into multi-level verbalizer.
Outcome: The proposed framework achieves competitive results on two benchmacks.
DiscoPrompt: Path Prediction Prompt Tuning for Implicit Discourse Relation Recognition (2023.findings-acl)

Copied to clipboard

Challenge: Existing works on implicit discourse relation recognition focus on syntax features and lack of connectives.
Approach: They propose a prompt-based path prediction method that integrates the interactive information and intrinsic senses among the hierarchy in IDRR.
Outcome: The proposed method shows significant improvement against competitive baselines.
Prompt-based Logical Semantics Enhancement for Implicit Discourse Relation Recognition (2023.emnlp-main)

Copied to clipboard

Challenge: Existing methods for identifying discourse relations without explicit connectives are limited by the availability of annotated data.
Approach: They propose a method that injects knowledge relevant to discourse relation into pre-trained language models through prompt-based connective prediction.
Outcome: The proposed method achieves outstanding performance against the current state-of-the-art models.
NER-guided Comprehensive Hierarchy-aware Prompt Tuning for Hierarchical Text Classification (2024.lrec-main)

Copied to clipboard

Challenge: Hierarchical text classification (HTC) is a challenging task in natural language processing due to its complex taxonomic label hierarchy.
Approach: They propose to use prompts to model hierarchical text classification (HTC) they propose to introduce conditional random fields and Global Pointer to establish hierarchic dependencies .
Outcome: The proposed approach achieves state-of-the-art (SoTA) performance on three public datasets.
Generative Prompt Tuning for Relation Classification (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing prompt tuning methods for RC are limited by label spaces and rigid prompt restrictions.
Approach: They propose a generative prompt tuning method to reformulate relation classification as an infilling problem by adding cloze-style phrases to masked language modeling problems.
Outcome: The proposed method exploits rich semantics of entity and relation types and can predict label verbalizations with varying lengths at multiple predicted positions.
Prompt-based Connective Prediction Method for Fine-grained Implicit Discourse Relation Recognition (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing methods to aid implicit discourse relation recognition (IDRR) lack explicit connectives and are difficult to implement on fine-grained IDRR.
Approach: They propose a Prompt-based Connective Prediction method that instructs large-scale pre-trained models to use knowledge relevant to discourse relation and utilizes strong correlation between connectives and discourse relation to help the model recognize implicit discourse relations.
Outcome: The proposed method surpasses the state-of-the-art model and achieves significant improvements on those fine-grained few-shot discourse relation classes.
ConnPrompt: Connective-cloze Prompt Learning for Implicit Discourse Relation Recognition (2022.coling-1)

Copied to clipboard

Challenge: Existing paradigms for Implicit Discourse Relation Recognition (IDRR) do not exploit linguistic evidence embedded in the pre-training process.
Approach: They propose a new paradigm to detect and classify relation sense between two text segments without an explicit connective.
Outcome: The proposed method significantly outperforms the state-of-the-art algorithms even with fewer training data.
Global and Local Hierarchy-aware Contrastive Framework for Implicit Discourse Relation Recognition (2023.findings-acl)

Copied to clipboard

Challenge: Existing methods to integrate whole hierarchical information of senses into discourse relation representations for multi-level sense recognition ignore static hierarchic structure containing all senses and ignore hierarchically sense label sequence corresponding to each instance.
Approach: They propose to use a GlObal and Local Hierarchy-aware Contrastive Framework to model two kinds of hierarchies with the aid of multi-task learning and contrastive learning to learn better representations of discourse relation relationships.
Outcome: The proposed method outperforms current state-of-the-art models at all hierarchical levels on PDTB 2.0 and PDTP 3.0 datasets.
TEPrompt: Task Enlightenment Prompt Learning for Implicit Discourse Relation Recognition (2023.findings-acl)

Copied to clipboard

Challenge: Existing prompt learning models for IDRR use multiple-prompt decisions from three different yet much similar connective prediction templates.
Approach: They propose to fuse three related tasks to fuse the learned features of auxiliary tasks to create a prompt learning model that can be used to boost the main task.
Outcome: The proposed model outperforms the ConnPrompt in the training phase and in the testing phase.
Using Subtext to Enhance Generative IDRR (2025.acl-short)

Copied to clipboard

Challenge: Arguments contain subtexts, but they are connotative and need prompts to be recognized . a lightweight subtext generator is helpful when the prompt doesn't raise a complex CoT.
Approach: They leverage LLaMA to generate subtexts for argument pairs and verify their effectiveness . they construct a baseline IDRR using the decoder-only backbone LLama .
Outcome: The proposed approach achieves higher F1 scores on two benchmarks than previous models.

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