SOTAVerified

Towards Debate Automation: a Recurrent Model for Predicting Debate Winners

2017-09-01EMNLP 2017Unverified0· sign in to hype

Peter Potash, Anna Rumshisky

Unverified — Be the first to reproduce this paper.

Reproduce

Abstract

In this paper we introduce a practical first step towards the creation of an automated debate agent: a state-of-the-art recurrent predictive model for predicting debate winners. By having an accurate predictive model, we are able to objectively rate the quality of a statement made at a specific turn in a debate. The model is based on a recurrent neural network architecture with attention, which allows the model to effectively account for the entire debate when making its prediction. Our model achieves state-of-the-art accuracy on a dataset of debate transcripts annotated with audience favorability of the debate teams. Finally, we discuss how future work can leverage our proposed model for the creation of an automated debate agent. We accomplish this by determining the model input that will maximize audience favorability toward a given side of a debate at an arbitrary turn.

Tasks

Reproductions