Evaluating Universal Dependency Parser Recovery of Predicate Argument Structure via CompChain Analysis

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F21%3A10441599" target="_blank" >RIV/00216208:11320/21:10441599 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.18653/v1/2021.starsem-1.11" target="_blank" >http://dx.doi.org/10.18653/v1/2021.starsem-1.11</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.18653/v1/2021.starsem-1.11" target="_blank" >10.18653/v1/2021.starsem-1.11</a>

Result language

angličtina

Original language name

Evaluating Universal Dependency Parser Recovery of Predicate Argument Structure via CompChain Analysis

Original language description

Accurate recovery of predicate-argument structure from a Universal Dependency (UD) parse is central to downstream tasks such as extraction of semantic roles or event representations. This study introduces compchains, a categorization of the hierarchy of predicate dependency relations present within a UD parse. Accuracy of compchain classification serves as a proxy for measuring accurate recovery of predicate-argument structure from sentences with embedding. We analyzed the distribution of compchains in three UD English treebanks, EWT, GUM and LinES, revealing that these treebanks are sparse with respect to sentences with predicate-argument structure that includes predicate-argument embedding. We evaluated the CoNLL 2018 Shared Task UDPipe (v1.2) baseline (dependency parsing) models as compchain classifiers for the EWT, GUMS and LinES UD treebanks. Our results indicate that these three baseline models exhibit poorer performance on sentences with predicate-argument structure with more than one level of embedding; we used compchains to characterize the errors made by these parsers and present examples of erroneous parses produced by the parser that were identified using compchains. We also analyzed the distribution of compchains in 58 non-English UD treebanks and then used compchains to evaluate the CoNLL&apos;18 Shared Task baseline model for each of these treebanks. Our analysis shows that performance with respect to compchain classification is only weakly correlated with the official evaluation metrics (LAS, MLAS and BLEX). We identify gaps in the distribution of compchains in several of the UD treebanks, thus providing a roadmap for how these treebanks may be supplemented. We conclude by discussing how compchains provide a new perspective on the sparsity of training data for UD parsers, as well as the accuracy of the resulting UD parses.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

—

Publication year

2021

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

10TH CONFERENCE ON LEXICAL AND COMPUTATIONAL SEMANTICS (SEM 2021)

ISBN

978-1-954085-77-0

ISSN

—

e-ISSN

—

Number of pages

13

Pages from-to

116-128

Publisher name

ASSOC COMPUTATIONAL LINGUISTICS-ACL

Place of publication

STROUDSBURG

Event location

Bangkok

Event date

Aug 5, 2021

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000685469200011