Entity Enhancement for Implicit Discourse Relation Classification in the Biomedical Domain
Implicit discourse relation classification is a challenging task, in particular when the text domain is different from the standard Penn Discourse Treebank (PDTB; Prasad et al., 2008) training corpus domain (Wall Street Journal in 1990s). We here tackle the task of implicit discourse relation classification on the biomedical domain, for which the Biomedical Discourse Relation Bank (BioDRB; Prasad et al., 2011) is available. We show that entity information can be used to improve discourse relational argument representation. In a first step, we show that explicitly marked instances that are content-wise similar to the target relations can be used to achieve good performance in the cross-domain setting using a simple unsupervised voting pipeline. As a further step, we show that with the linked entity information from the first step, a transformer which is augmented with entity-related information (KBERT; Liu et al., 2020) sets the new state of the art performance on the dataset, outperforming the large pre-trained BioBERT (Lee et al., 2020) model by 2{\%} points.
Code (0)
등록된 구현이 없습니다.
Tasks
Implicit Discourse Relation ClassificationRelationRelation ClassificationSimilar Papers 제목 키워드 기반
One Vector is Not Enough: Entity-Augmented Distributed Semantics for Discourse Relations
Discourse relations bind smaller linguistic units into coherent texts. Automatically identifying discourse relations is difficult, because it requires understanding the semantics of the linked arguments. A more subtle ch…
Question AnsweringRelationSentiment AnalysisEntity-Augmented Distributional Semantics for Discourse Relations
Discourse relations bind smaller linguistic elements into coherent texts. However, automatically identifying discourse relations is difficult, because it requires understanding the semantics of the linked sentences. A mo…
RelationSentenceOne Vector is Not Enough: Entity-Augmented Distributional Semantics for Discourse Relations
Discourse relations bind smaller linguistic units into coherent texts. However, automatically identifying discourse relations is difficult, because it requires understanding the semantics of the linked arguments. A more …
RelationLearning 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+2Implicit Discourse Relation Classification via Multi-Task Neural Networks
Without discourse connectives, classifying implicit discourse relations is a challenging task and a bottleneck for building a practical discourse parser. Previous research usually makes use of one kind of discourse frame…
ClassificationGeneral ClassificationImplicit Discourse Relation ClassificationMulti-Task Learning+2