Semi-Supervised Tri-Training for Explicit Discourse Argument Expansion (2020.lrec-1)
Copied to clipboard
| Challenge: | a novel application of semi-supervision for shallow discourse parsing is described . we focus on explicit discourse arguments, but we leave the sense selection aside . |
| Approach: | They propose a semi-supervised approach for shallow discourse parsing using sequence tagging. |
| Outcome: | The proposed approach improves performance by 2-10% in the first setting and by comparing the results with training relations. |
Similar Papers
Using active learning to expand training data for implicit discourse relation recognition (D18-1)
Copied to clipboard
| Challenge: | Existing methods to determine semantic relations between text spans are limited in the field of discourse-level relation recognition. |
| Approach: | They propose to expand the training data set using the corpus of explicitly-related arguments by arbitrarily dropping the overtly presented discourse connectives. |
| Outcome: | The proposed model expands the training data set using the corpus of explicitly-related arguments, by arbitrarily dropping the overtly presented discourse connectives. |
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. |
Out-of-Domain Discourse Dependency Parsing via Bootstrapping: An Empirical Analysis on Its Effectiveness and Limitation (2022.tacl-1)
Copied to clipboard
| Challenge: | Discourse parsing accuracy degrades significantly on out-of-domain text. |
| Approach: | They propose to use bootstrapping methods to adapt modern discourse dependency parsers to out-of-domain text without additional human supervision. |
| Outcome: | The proposed methods are significantly and consistently effective for unsupervised domain adaptation of discourse dependency parsing, but the low coverage of accurately predicted pseudo labels is a bottleneck for further improvement. |
Discourse Representation Parsing for Sentences and Documents (P19-1)
Copied to clipboard
| Challenge: | Experimental results show that our model outperforms competitive baselines by a wide margin. |
| Approach: | They propose a neural model which parses discourse structures of arbitrary length and granularity. |
| Outcome: | The proposed model outperforms baseline models on sentence- and document-level benchmarks. |
Unleashing the Power of Neural Discourse Parsers - A Context and Structure Aware Approach Using Large Scale Pretraining (2020.coling-main)
Copied to clipboard
| Challenge: | Discourse parsing is an important upstream task within the area of Natural Language Processing (NLP) . |
| Approach: | They propose a discourse parser that incorporates recent contextual language models to improve the performance of RST-based discourse parses. |
| Outcome: | The proposed parser outperforms existing models on two key RST datasets and on large-scale "silver-standard" discourse treebank MEGA-DT. |
Top-down Discourse Parsing via Sequence Labelling (2021.eacl-main)
Copied to clipboard
| Challenge: | Discourse analysis is a systematic way to understand how texts are segmented hierarchically into discourse units. |
| Approach: | They propose a top-down approach to discourse parsing that is conceptually simpler than its predecessors. |
| Outcome: | The proposed model eliminates the decoder and reduces the search space for splitting points. |
Adapting Unsupervised Syntactic Parsing Methodology for Discourse Dependency Parsing (2021.acl-long)
Copied to clipboard
| Challenge: | Discourse dependency parsing is a task that requires a large amount of training data, but there is little research on it. |
| Approach: | They propose to adapt unsupervised syntactic dependency parsing methods for unsupervised discourse dependency parses using unlabeled training data. |
| Outcome: | The proposed methods outperform existing methods in semi-supervised and supervised settings and outperformed existing methods. |
Simple Conversational Data Augmentation for Semi-supervised Abstractive Dialogue Summarization (2021.emnlp-main)
Copied to clipboard
| Challenge: | Abstractive conversation summarization models heavily rely on human-annotated summaries. |
| Approach: | They propose a set of Conversational Data Augmentation methods for semi-supervised abstractive conversation summarization that use random swapping/deletion to perturb the discourse relations inside conversations and dialogue-acts-guided insertion to interrupt the development of conversations. |
| Outcome: | The proposed methods over several state-of-the-art datasets show that they are more efficient than previous methods. |
A Deeper (Autoregressive) Approach to Non-Convergent Discourse Parsing (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing frameworks for dialogic discourse parsing are not suitable for contentious discussions . authors propose a model for non-convergent discourse paring that does not require label collocation . |
| Approach: | They propose a multi-label scheme for contentious dialog parsing that uses multiple labels . they propose combining embeddings of the utterance, context and the labels through GRN layers . |
| Outcome: | The proposed model achieves comparable results with SOTA without label collocation and without training a unique architecture/model for each label. |
Progressive Class Semantic Matching for Semi-supervised Text Classification (2022.naacl-main)
Copied to clipboard
| Challenge: | Recent semi-supervised learning methods have achieved impressive performance . semi-controlled learning can be used to reduce the annotation cost of text classifiers . |
| Approach: | They propose a semi-supervised learning process that builds a standard K-way classifier and a matching network for the input text and the Class Semantic Representation (CSR). |
| Outcome: | The proposed method improves baselines and overall is more stable. |