Command Palette
Search for a command to run...
{Sujian Li Houfeng Wang Yizhong Wang}

Abstract
Previous work introduced transition-based algorithms to form a unified architecture of parsing rhetorical structures (including span, nuclearity and relation), but did not achieve satisfactory performance. In this paper, we propose that transition-based model is more appropriate for parsing the naked discourse tree (i.e., identifying span and nuclearity) due to data sparsity. At the same time, we argue that relation labeling can benefit from naked tree structure and should be treated elaborately with consideration of three kinds of relations including within-sentence, across-sentence and across-paragraph relations. Thus, we design a pipelined two-stage parsing method for generating an RST tree from text. Experimental results show that our method achieves state-of-the-art performance, especially on span and nuclearity identification.
Benchmarks
| Benchmark | Methodology | Metrics |
|---|---|---|
| discourse-parsing-on-rst-dt | Two-stage Parser | RST-Parseval (Nuclearity): 72.4 RST-Parseval (Relation): 59.7 RST-Parseval (Span): 86.0 |
Build AI with AI
From idea to launch — accelerate your AI development with free AI co-coding, out-of-the-box environment and best price of GPUs.