Abstract
We present a contrastive study of argument sharing across three graph-based meaning representation frameworks, where semantically shared arguments manifest as reentrant graph nodes. For a state-of-the-art graph parser, we observe how parser performance – in terms of output quality – covaries with overall graph complexity, on the one hand, and presence of different types of reentrancies, on the other hand. We identify common linguistic phenomena that give rise to shared arguments, and therefore node reentrancies, through a small-case and partially automated annotation study and parallel error anaylsis of actual parser outputs. Our results provide new insights into the distribution of different types of reentrancies in meaning representation graphs for three distinct frameworks, as well as on the effects that these structures have on parser performance, thus suggesting both novel cross-framework generalisations as well as avenues for focussed parser development.- Anthology ID:
- 2024.dmr-1.9
- Volume:
- Proceedings of the Fifth International Workshop on Designing Meaning Representations @ LREC-COLING 2024
- Month:
- May
- Year:
- 2024
- Address:
- Torino, Italia
- Editors:
- Claire Bonial, Julia Bonn, Jena D. Hwang
- Venues:
- DMR | WS
- SIG:
- Publisher:
- ELRA and ICCL
- Note:
- Pages:
- 77–87
- Language:
- URL:
- https://aclanthology.org/2024.dmr-1.9
- DOI:
- Cite (ACL):
- Maja Buljan, Stephan Oepen, and Lilja Øvrelid. 2024. Argument Sharing in Meaning Representation Parsing. In Proceedings of the Fifth International Workshop on Designing Meaning Representations @ LREC-COLING 2024, pages 77–87, Torino, Italia. ELRA and ICCL.
- Cite (Informal):
- Argument Sharing in Meaning Representation Parsing (Buljan et al., DMR-WS 2024)
- PDF:
- https://preview.aclanthology.org/landing_page/2024.dmr-1.9.pdf