{Anders S{\o}gaard Barbara Plank Chlo{\'e} Braud}

Abstract

We experiment with different ways of training LSTM networks to predict RST discourse trees. The main challenge for RST discourse parsing is the limited amounts of training data. We combat this by regularizing our models using task supervision from related tasks as well as alternative views on discourse structures. We show that a simple LSTM sequential discourse parser takes advantage of this multi-view and multi-task framework with 12-15{%} error reductions over our baseline (depending on the metric) and results that rival more complex state-of-the-art parsers.