Implicit Discourse Relation Classification: We Need to Talk about Evaluation
Implicit relation classification on Penn Discourse TreeBank (PDTB) 2.0 is a common benchmark task for evaluating the understanding of discourse relations. However, the lack of consistency in preprocessing and evaluation poses challenges to fair comparison of results in the literature. In this work, we highlight these inconsistencies and propose an improved evaluation protocol. Paired with this protocol, we report strong baseline results from pretrained sentence encoders, which set the new state-of-the-art for PDTB 2.0. Furthermore, this work is the first to explore fine-grained relation classification on PDTB 3.0. We expect our work to serve as a point of comparison for future work, and also as an initiative to discuss models of larger context and possible data augmentations for downstream transferability.
Code (0)
등록된 구현이 없습니다.
Tasks
ClassificationGeneral ClassificationImplicit Discourse Relation ClassificationRelationRelation ClassificationSentenceSimilar Papers 제목 키워드 기반
Non-Topical Coherence in Social Talk: A Call for Dialogue Model Enrichment
Current models of dialogue mainly focus on utterances within a topically coherent discourse segment, rather than new-topic utterances (NTUs), which begin a new topic not correlating with the content of prior discourse. A…
General ClassificationOn the Need of Cross Validation for Discourse Relation Classification
The task of implicit discourse relation classification has received increased attention in recent years, including two CoNNL shared tasks on the topic. Existing machine learning models for the task train on sections 2-21…
ClassificationGeneral ClassificationImplicit Discourse Relation ClassificationLanguage Modeling+5A Knowledge-Augmented Neural Network Model for Implicit Discourse Relation Classification
Identifying discourse relations that are not overtly marked with discourse connectives remains a challenging problem. The absence of explicit clues indicates a need for the combination of world knowledge and weak context…
General ClassificationImplicit Discourse Relation ClassificationMachine TranslationRelation+3Learning to Explicitate Connectives with Seq2Seq Network for Implicit Discourse Relation Classification
Implicit discourse relation classification is one of the most difficult steps in discourse parsing. The difficulty stems from the fact that the coherence relation must be inferred based on the content of the discourse re…
ClassificationDiscourse ParsingGeneral ClassificationImplicit Discourse Relation Classification+2Towards Actionable Pedagogical Feedback: A Multi-Perspective Analysis of Mathematics Teaching and Tutoring Dialogue
Effective feedback is essential for refining instructional practices in mathematics education, and researchers often turn to advanced natural language processing (NLP) models to analyze classroom dialogues from multiple …
TAG