DM Doppelgangers: Implicit Connectives as eRST Signals
Paper · 2026 · Lin Ai and Amir Zeldes
Summary
RST-style hierarchical discourse annotation and PDTB-style shallow annotation have mostly been studied separately. eRST now links RST relations to token-anchored signals such as explicit connectives, but it has no notion of an implicit connective, the unexpressed "but" or "so" that PDTB annotators insert between segments. This paper connects the two. The authors take the GUM corpus (v12), which carries eRST annotation, and its PDTB-style counterpart GDTB, which was semi-automatically converted from GUM and contains implicit relations. They design an alignment algorithm that does one of two things with each GDTB implicit connective:
- it attaches the connective as a new signal type on a compatible relation in the primary RST tree, or
- when no tree relation fits, it adds a tree-breaking secondary edge that the connective then signals.
The result is the first dataset of eRST relations aligned with implicit connectives, plus extra relations that PDTB covers but RST trees miss. The paper also gives a first analysis of how implicit connectives co-occur with other signal types. This matters because it brings deep and shallow discourse frameworks into one graph.
Key points
- Data: GUM Version 12, with 16 spoken and written English genres and over 290K tokens. It is described as the largest RST dataset annotated for both discourse markers and non-DM signals. All implicit connectives come from GDTB, whose implicit relations score about 0.94 F1 on argument spans and about 0.85 on exact PDTB labels.
- Alignment uses two devices to handle span mismatches between the frameworks:
- Strong Nuclearity, which lets a relation between spans also hold between their nuclei;
- conversion of multinuclear relations into right-to-left dependencies, following Li et al. 2014.
- Counts: an implicit connective marks 6,365 relations, while an explicit DM marks 8,300. Implicit connectives co-occur with non-DM signals in 57% of cases (3,627), against 26% (2,192) for explicit DMs.
- A chi-square test over seven signal categories is significant (χ²(6, N=5819)=301.46, p<.001, V=0.242). Implicit connectives come with reference signals more often and with morphological signals much less often.
- "then" and "in order" mostly attach to existing relations, while "in fact" more often produces new secondary edges. The eRST signaling toolkit (87.9% accurate) added non-DM signals to 30% of the new implicit secondary edges.
Interesting ideas
- I1. When an inferred connective does not fit the existing tree relation, the algorithm keeps the tree and adds a separate secondary edge for the local relation. This preserves both the global intent structure and local semantics without forcing a choice between them.
- I2. An implicit connective is a test: try inserting "but", "so" or "and" at a junction and see which one fits. This turns an abstract relation label into an explainable lexical paraphrase.
- I3. Candidate junctions for implicit relations are found from syntax trees: adjacent sentences in a paragraph, coordinated predications in one VP, and adverbial clauses without a conjunction.
- I4. Strong Nuclearity lets annotations with mismatched spans be aligned by comparing head nuclei instead of full spans. This is a general way to reconcile two segmentations of the same text.
- I5. Implicit relations rely more on reference cues (pronouns, demonstratives, comparatives), so anaphora is a strong hint that two segments are linked even without an overt marker.
For Mova
How these ideas could serve Mova, our small open language model — its files, stages and tests:
- I1 (world): Event-order and causal links in the text world could keep one primary narrative structure plus extra "local" causal or result edges whenever an implied connective suggests a relation the main structure contradicts.
- I2 (frames): The pragmatics layer could justify each inter-clause relation by naming the connective it would insert, making implicature between sentences inspectable.
- I3 (tree): The UD tree can mark these junction types deterministically (e.g. conj between verbs, advcl lacking a mark), feeding a discourse step with well-defined slots.
- I4 (learn): When several witness parsers or teacher tiers segment clauses differently, agreement can be scored on head units rather than exact spans before building silver data.
- I5 (frames): Coreference links between adjacent sentences could raise the prior that a discourse relation holds there and prompt the system to pick an implied connective.
Institutions
Fields, topics and concepts
📚 Shelves 5The field of science this work belongs to (OpenAlex fields).Computer Science · 16,667 worksArtificial Intelligence · 16,194 worksArts and Humanities · 16,039 worksLanguage and Linguistics · 15,891 worksPhilosophy · 284 works
🧭 Topics 1Research subjects and languages the work is about.Discourse analysis · 466 works
Cite
Cite as Lin Ai and Amir Zeldes. 2026. DM Doppelgangers: Implicit Connectives as eRST Signals. Proceedings of the 2nd Joint Workshop on Computational Approaches to Discourse, Context and Document-Level Inferences and Computational Models of Reference, Anaphora and Coreference (CODI-CRAC 2026).
@inproceedings{ai2026dm,
title = {{DM Doppelgangers: Implicit Connectives as eRST Signals}},
author = {Lin Ai and Amir Zeldes},
booktitle = {Proceedings of the 2nd Joint Workshop on Computational Approaches to Discourse, Context and Document-Level Inferences and Computational Models of Reference, Anaphora and Coreference (CODI-CRAC 2026)},
year = {2026},
doi = {10.18653/v1/2026.codi-1.6},
url = {https://doi.org/10.18653/v1/2026.codi-1.6}
}References
- Peter Bourgonje and Olha Zolotarenko. 2019. Toward cross-theory discourse relation annotation. In Proceedings of the Workshop on Discourse Relation Parsing and Treebanking 2019, pages 7–11, Minneapolis, MN. Association for Computational Linguistics. find
- Zhuoxuan Ju, Jingni Wu, Abhishek Purushothama, and Amir Zeldes. 2025. DeDisCo at the DISRPT 2025 shared task: A system for discourse relation classification. In Proceedings of the 4th Shared Task on Discourse Relation Parsing and Treebanking (DIS-RPT 2025), pages 48–62. find
- Chloé Braud, Amir Zeldes, Chuyuan Li, Yang Janet Liu, and Philippe Muller. 2025. find
- The DISRPT 2025 shared task on elementary discourse unit segmentation, connective detection, and relation classification. In Proceedings of the 4th Shared Task on Discourse Relation Parsing and Treebanking (DISRPT 2025), pages 1–20, Suzhou, China. Association for Computational Linguistics.
- Sujian Li, Liang Wang, Ziqiang Cao, and Wenjie Li. 2014. Text-level discourse dependency parsing. In Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 25–35, Baltimore, Maryland. Association for Computational Linguistics. ↗
- Chloé Braud, Amir Zeldes, Laura Rivière, Yang Janet Liu, Philippe Muller, Damien Sileo, and Tatsuya Aoyama. 2024. DISRPT: A multilingual, multi-domain, cross-framework benchmark for discourse processing. In Proceedings of the 2024 Joint International Conference on Computational Linguistics, Language Resources and Evaluation (LREC-COLING 2024), pages 4990–5005, Torino, Italia. ELRA and ICCL. ↗
- Yang Janet Liu, Tatsuya Aoyama, Wesley Scivetti, Yilun Zhu, Shabnam Behzad, Lauren Elizabeth Levine, Jessica Lin, Devika Tiwari, and Amir Zeldes. 2024. GDTB: Genre diverse data for English shallow discourse parsing across modalities, text types, and domains. In Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing, pages 12287–12303, Miami, Florida, USA. Association for Computational Linguistics. ↗
- Lynn Carlson, Daniel Marcu, and Mary Ellen Okurowski. 2003. Building a discourse-tagged corpus in the framework of Rhetorical Structure Theory. ↗
- William C. Mann and Sandra A. Thompson. 1988. Rhetorical Structure Theory: Toward a functional theory of text organization. Text, 8(3):243–281. ↗
- Daniel Marcu. 2000. The theory and practice of discourse parsing and summarization. MIT press. ↗
- Mitchell P. Marcus, Beatrice Santorini, and Mary Ann Marcinkiewicz. 1993. Building a large annotated corpus of English: The Penn Treebank. Computational Linguistics, 19(2):313–330. ↗
- Rashmi Prasad, Bonnie Webber, and Aravind Joshi. 2014. Reflections on the Penn Discourse Treebank, comparable corpora, and complementary annotation. Computational Linguistics, 40(4):921–950. ↗
- Manfred Stede. 2012. Discourse Processing. Synthesis Lectures on Human Language Technologies 4. Morgan & Claypool, [San Rafael, CA]. find
- Amir Zeldes. 2017. The GUM corpus: Creating multilayer resources in the classroom. Language Resources and Evaluation, 51(3):581–612. ↗
- Amir Zeldes, Tatsuya Aoyama, Yang Janet Liu, Siyao Peng, Debopam Das, and Luke Gessler. 2025. eRST: A signaled graph theory of discourse relations and organization. Computational Linguistics, 51(1):23– 72. ↗
Updated
This page in Markdown → https://md.research.elamur.ai/free/en/papers/ai-2026-dm-doppelgangers-implicit-connectives-as/