Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
80 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
7 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

QADiscourse -- Discourse Relations as QA Pairs: Representation, Crowdsourcing and Baselines (2010.02815v1)

Published 6 Oct 2020 in cs.CL

Abstract: Discourse relations describe how two propositions relate to one another, and identifying them automatically is an integral part of natural language understanding. However, annotating discourse relations typically requires expert annotators. Recently, different semantic aspects of a sentence have been represented and crowd-sourced via question-and-answer (QA) pairs. This paper proposes a novel representation of discourse relations as QA pairs, which in turn allows us to crowd-source wide-coverage data annotated with discourse relations, via an intuitively appealing interface for composing such questions and answers. Based on our proposed representation, we collect a novel and wide-coverage QADiscourse dataset, and present baseline algorithms for predicting QADiscourse relations.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Valentina Pyatkin (34 papers)
  2. Ayal Klein (7 papers)
  3. Reut Tsarfaty (54 papers)
  4. Ido Dagan (72 papers)
Citations (50)