Sentence Level Discourse Parsing using Syntactic and Lexical Information
What it is about
The paper builds sentence-level RST discourse trees in two steps. First a probabilistic segmenter finds elementary discourse units inside a sentence, using syntactic and lexical features. Then a probabilistic parser builds the tree, using "dominance sets" taken from the Penn Treebank parse. The data are 385 WSJ articles with RST annotation, used with a training part of 5,809 sentence triples and a test part of 946. On the test set, boundary recall rises from 77.1% (the earlier decision-based segmenter) to 82.7%, and the discourse parser's F-score rises from 37.2% to 49.0% with 18 labels (an error reduction of 18.8%). Human agreement is 77.0%. With perfect syntax and perfect segmentation together, the F-score reaches 75.5%. The authors conclude that segmentation, not the parser, is the bottleneck.
Ideas
- I1. Start with a boundary baseline built on UD trees in
en/src/parse.rsoutput: put a clause boundary beforeadvcl,ccomp,csubjandconjsubtrees that carry a finite verb, and compare it with a comma-only baseline. Report precision and recall, recall first, as the paper does. - I2. Keep a deterministic dominance relation from the UD head–dependent structure (which span is the nucleus-like head, which is the satellite-like dependent) and count how often a rule agrees with the gold tree. Log each disagreement with its rule.
- I3. Report the segmenter's error by boundary type. The paper shows that recall is the weak point, so any Mova segmenter should show which boundary types it misses.
- I4. Measure the gap to the human ceiling on a small annotated set, not only the average, to see whether a rule set is "near human" on some sentence types.
For Mova
The chapter is languages/en/36-discourse-relations.md, and languages/en/24-coordination-subordination.md for the clause boundaries. No discourse module exists in the code yet, so check with grep first. The natural place is a new module in prag that reads the UD tree from en/src/parse.rs. The measure is boundary P/R/F1 on a held-out set. The RST corpus is licensed through its own distributor, so use it for evaluation only.
Cite
@inproceedings{soricut2003sentence,
title = {{Sentence Level Discourse Parsing using Syntactic and Lexical Information}},
author = {Soricut, Radu and Marcu, Daniel},
booktitle = {Proceedings of the 2003 Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics},
year = {2003},
doi = {10.3115/1073445.1073475},
url = {https://doi.org/10.3115/1073445.1073475}
}References
- E. Black, S. Abney, D. Flickinger, C. Gdaniec, R. Grishman, P. Harrison, D. Hindle, R. Ingria, F. Jelinek, J. Klavans, M. Liberman, M. Marcus, S. Roukos, B. Santorini, and T. Strzalkowski. 1991. A procedure for quantitatively comparing the syntactic coverage of English grammars. In Proceedings of Speech and Natural Language Workshop, pages 306–311, Pacific Groove, CA. DARPA. find
- L. Carlson, D. Marcu, and M. E. Okurowski. 2003. Building a discourse-tagged corpus in the framework of Rhetorical Structure Theory. In Jan van Kuppevelt and Ronnie Smith, editors, Current Directions in Discourse and Dialogue. Kluwer Academic Publishers. To appear. ↗ our card
- Eugene Charniak. 2000. A maximum-entropy-inspired parser. In Proceedings of the NAACL 2000, pages 132– 139, Seattle, Washington, April 29 – May 3. find our card
- Michael Collins. 2000. Discriminative reranking for natural language parsing. In Proceedings of ICML 2000, Stanford University, Palo Alto, CA, June 29–July 2. find our card
- C. J. Fillmore, C. F. Baker, and S. Hiroaki. 2002. The framenet database and software tools. In Proceedings of the LREC 2002, pages 1157–1160, LREC. find our card
- K. Forbes, E. Miltsakaki, R. Prasad, A. Sarkar, A. Joshi, and B. Webber. 2001. D-LTAG System: Discourse parsing with a lexicalized tree-adjoining grammar. In ESSLLI’2001 Workshop on Information Structure, Discourse Structure and Discourse Semantics. find
- Daniel Gildea and Daniel Jurafsky. 2002. Automatic labeling of semantic role. Computational Linguistics, 28(3):245–288. find
- Paul Kingsbury and Martha Palmer. 2002. From Treebank to Propbank. In Proceedings of the LREC 2002, Las Palmas, Canary Islands, Spain, May 28-June 3. find our card
- David M. Magerman. 1995. Statistical decision-tree models for parsing. In Proceedings of the ACL 1995, pages 276–283, Cambridge, Massachusetts, June 26-30. find
- William C. Mann and Sandra A. Thompson. 1988. Rhetorical Structure Theory: Toward a functional theory of text organization. Text, 8(3):243–281. ↗ our card
- Daniel Marcu. 2000. The Theory and Practice of Discourse Parsing and Summarization. The MIT Press, Cambridge, Massachusetts. ↗
- M. Marcus, B. Santorini, and M. Marcinkiewicz. 1993. Building a large annotated corpus of English: the Penn Treebank. Computational Linguistics, 19(2):313–330. ↗ our card
- Senko K. Maynard. 1998. Principles of Japanese Discourse: A Handbook. Cambridge University Press. ↗
- David D. Palmer and Marti A. Hearst. 1997. Adaptive multilingual sentence boundary disambiguation. Computational Linguistics, 23(2):241–269, June. ↗
- Adwait Ratnaparkhi. 1998. Maximum Entropy Models for Natural Language Ambiguity Resolution. Ph.D. thesis, University of Pennsylvania. find
- RST-DT. 2002. RST Discourse Treebank. Linguistic Data Consortium. http://www.ldc.upenn.edu/Catalog/CatalogEntry.jsp?catalogId=LDC2002T07. ↗
This page in Markdown → https://md.research.elamur.ai/free/en/papers/soricut-2003-sentence-level-discourse-parsing-syntactic/