Potter, A., & Lindsey, C. (2025). Breaking ties: Some methods for refactoring rst convergences. In M. Alam, A. Tchechmedjiev, J. Gracia, D. Gromann, M. P. d. Buono, J. Monti, & M. Ionov (Eds.), Proceedings of the 5th Conference on Language, Data and Knowledge (pp. 233–242). Naples, italy.
Among the set of schemata specified by Rhetorical Structure Theory is a pattern known variously as the request schema, satellite tie, multisatellite nucleus, or convergence. The essential feature of this schema is that it permits multiple satellites to attach to a single nucleus. Although the schema has long been considered fundamental to RST, it has never been subjected to detailed evaluation. This paper provides such an assessment. Close examination shows that it results in structures that are ambiguous, disjoint, incomplete, and sometimes incoherent. Fortunately, however, further examination shows it to be unnecessary. This paper describes the difficulties with convergences and presents methods for refactoring them as explicit specifications of text structure. The study shows that convergences can be more clearly rendered not as flat relational conjunctions, but rather as organized expressions of cumulative rhetorical moves, wherein each move asserts an identifiable structural integrity and the expressions conform to specifiable scoping rules.
Run rp2rs3driver.py Refactored RST files will be saved in the refactored/ folder You can select the files you want to refactor by editing rstlist.py
The code makes some assumptions about directory (folder) structure. Use the structure provided here.
The code was developed and tested on a Mac, with a little testing on Windows. It has not yet been tested on any other systems.