Challenge: Existing work on hierarchical discourse parsing in English is based on the RST-style one.
Approach: They propose a Chinese discourse parser that integrates pre-trained text encoder and employs novel training strategies to improve rhetorical relation recognition.
Outcome: The proposed system achieves state-of-the-art performance in Chinese discourse parsing.

Similar Papers

A Unified RvNN Framework for End-to-End Chinese Discourse Parsing (C18-2)

Copied to clipboard

Challenge: Existing work on Chinese discourse parser relies on external packages to extract linguistic features from free text.
Approach: They propose an end-to-end Chinese discourse parser based on recursive neural network to jointly model the subtasks including elementary discourse unit segmentation, tree structure construction, center labeling, and sense labeling.
Outcome: The proposed framework achieves state-of-the-art in the Chinese Discourse Treebank dataset.
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.
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.
Dynamic Oracles for Top-Down and In-Order Shift-Reduce Constituent Parsing (D18-1)

Copied to clipboard

Challenge: Top-down and in-order shift-reduce constituent parsers are the most accurate known shift-reducing algorithms for constituent paring.
Approach: They propose to use dynamic oracles to train two of the most accurate shift-reduce algorithms for constituent parsing.
Outcome: The proposed top-down and in-order shift-reduce parsers improve on the WSJ benchmark.
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.
A Dynamic Oracle for Linear-Time 2-Planar Dependency Parsing (N18-2)

Copied to clipboard

Challenge: Existing dynamic oracles for greedy parsers can handle non-projective syntax, but none are available for these types of training.
Approach: They propose an efficient dynamic oracle for training the 2-Planar transition-based parser with over 99% coverage on non-projective syntactic corpora.
Outcome: The proposed model outperforms the static training strategy in the vast majority of languages tested and scored better on most datasets than the arc-hybrid parser enhanced with the Swap transition.
Modeling discourse cohesion for discourse parsing via memory network (P18-2)

Copied to clipboard

Challenge: Existing approaches to discourse parsing focus on studying the semantic and syntactic aspects of EDU pairs, but they do not address long span dependencies.
Approach: They propose a new transition-based discourse parser that takes discourse cohesion into account by using memory networks.
Outcome: The proposed method outperforms traditional features and improves performance on the RST discourse treebank.
Llamipa: An Incremental Discourse Parser (2024.findings-emnlp)

Copied to clipboard

Challenge: Discourse parsing is a task of predicting relationships between utterances and their semantic content . lack of surface cues in discourse graphs forces parsers to rely on deep, semantic information . a large language model (LLM) can significantly improve discourse parser performance .
Approach: They propose a large language model (LLM) that leverages discourse context to parse a discourse . this model provides local, context-sensitive representations of discourse units .
Outcome: The proposed model can provide local, context-sensitive representations of discourse units . it can process discourse data incrementally, which is essential for later use of discourse information .
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.
Discourse Parsing Enhanced by Discourse Dependence Perception (2022.aacl-main)

Copied to clipboard

Challenge: Top-down neural models still suffer from the top-down error propagation issue . previous studies gradually switch from feature-based machine learning methods to deep neural models .
Approach: They propose a top-down framework that learns from discourse dependency and constituency parsing through one shared encoder and two independent decoders.
Outcome: The proposed framework learns from discourse dependency and constituency parsing through one shared encoder and two independent decoders on a Chinese discourse corpus.

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