Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Let's be explicit about that: Distant supervision for implicit discourse relation classification via connective prediction (2106.03192v1)

Published 6 Jun 2021 in cs.CL

Abstract: In implicit discourse relation classification, we want to predict the relation between adjacent sentences in the absence of any overt discourse connectives. This is challenging even for humans, leading to shortage of annotated data, a fact that makes the task even more difficult for supervised machine learning approaches. In the current study, we perform implicit discourse relation classification without relying on any labeled implicit relation. We sidestep the lack of data through explicitation of implicit relations to reduce the task to two sub-problems: LLMing and explicit discourse relation classification, a much easier problem. Our experimental results show that this method can even marginally outperform the state-of-the-art, in spite of being much simpler than alternative models of comparable performance. Moreover, we show that the achieved performance is robust across domains as suggested by the zero-shot experiments on a completely different domain. This indicates that recent advances in LLMing have made LLMs sufficiently good at capturing inter-sentence relations without the help of explicit discourse markers.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Murathan Kurfalı (10 papers)
  2. Robert Östling (13 papers)
Citations (18)

Summary

We haven't generated a summary for this paper yet.