English

Learning Recursive Segments for Discourse Parsing

Computation and Language 2010-03-30 v1

Abstract

Automatically detecting discourse segments is an important preliminary step towards full discourse parsing. Previous research on discourse segmentation have relied on the assumption that elementary discourse units (EDUs) in a document always form a linear sequence (i.e., they can never be nested). Unfortunately, this assumption turns out to be too strong, for some theories of discourse like SDRT allows for nested discourse units. In this paper, we present a simple approach to discourse segmentation that is able to produce nested EDUs. Our approach builds on standard multi-class classification techniques combined with a simple repairing heuristic that enforces global coherence. Our system was developed and evaluated on the first round of annotations provided by the French Annodis project (an ongoing effort to create a discourse bank for French). Cross-validated on only 47 documents (1,445 EDUs), our system achieves encouraging performance results with an F-score of 73% for finding EDUs.

Keywords

Cite

@article{arxiv.1003.5372,
  title  = {Learning Recursive Segments for Discourse Parsing},
  author = {Stergos Afantenos and Pascal Denis and Philippe Muller and Laurence Danlos},
  journal= {arXiv preprint arXiv:1003.5372},
  year   = {2010}
}

Comments

published at LREC 2010

R2 v1 2026-06-21T15:03:32.961Z