In this paper we investigate the possibility of extracting predicate-argument relations from UD trees (and enhanced UD graphs). Concretely, we apply UD parsers on an English question answering/semantic-role labeling data set (FitzGerald et al., 2018) and check if the annotations reflect the relations in the resulting parse trees, using a small number of rules to extract this information. We find that 79.1% of the argument-predicate pairs can be found in this way, on the basis of Udify (Kondratyuk and Straka, 2019). Error analysis reveals that half of the error cases are attributable to shortcomings in the dataset. The remaining errors are mostly due to predicate-argument relations not being extractible algorithmically from the UD trees (requiring semantic reasoning to be resolved). The parser itself is only responsible for a small portion of errors. Our analysis suggests a number of improvements to the UD annotation schema: we propose to enhance the schema in four ways, in order to capture argument-predicate relations. Additionally, we propose improvements regarding data collection for question answering/semantic-role labeling data.
CITATION STYLE
Ek, A., Bernardy, J. P., & Chatzikyriakidis, S. (2021). Can predicate-argument relationships be extracted from UD trees? In LAW-DMR 2021 - Joint 15th Linguistic Annotation Workshop and 3rd Designing Meaning Representations Workshop, Proceedings (pp. 46–55). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2021.law-1.5
Mendeley helps you to discover research relevant for your work.