Splitting EUD graphs into trees: A quick and clatty approach

Result code in IS VaVaI

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

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Splitting EUD graphs into trees: A quick and clatty approach

Original language description

We present the system submission from the FASTPARSE team for the EUD Shared Task at IWPT 2021. We engaged in the task last year by focusing on efficiency. This year we have focused on experimenting with new ideas on a limited time budget. Our system is based on splitting the EUD graph into several trees, based on linguistic criteria. We predict these trees using a sequence-labelling parser and combine them into an EUD graph. The results were relatively poor, although not a total disaster and could probably be improved with some polishing of the system&apos;s rough edges.

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

IWPT 2021: THE 17TH INTERNATIONAL CONFERENCE ON PARSING TECHNOLOGIES: PROCEEDINGS OF THE CONFERENCE (INCLUDING THE IWPT 2021 SHARED TASK)

ISBN

978-1-954085-80-0

ISSN

—

e-ISSN

—

Number of pages

8

Pages from-to

167-174

Publisher name

ASSOC COMPUTATIONAL LINGUISTICS-ACL

Place of publication

STROUDSBURG

Event location

Bangkok

Event date

Aug 6, 2021

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000694723000017