Graph Rewriting for Enhanced Universal Dependencies
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A90101%2F21%3A10440927" target="_blank" >RIV/00216208:90101/21:10440927 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Graph Rewriting for Enhanced Universal Dependencies
Original language description
This paper describes a system proposed for the IWPT 2021 Shared Task on Parsing into Enhanced Universal Dependencies (EUD). We propose a Graph Rewriting based system for computing Enhanced Universal Dependencies, given the Basic Universal Dependencies (UD).
Czech name
—
Czech description
—
Classification
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)
Result continuities
Project
—
Continuities
—
Others
Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
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
9
Pages from-to
175-183
Publisher name
ASSOC COMPUTATIONAL LINGUISTICS-ACL
Place of publication
STROUDSBURG
Event location
online
Event date
Aug 6, 2021
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000694723000018