Skip to content
conftrace_
2021 ACL ACL 2021

Graph Rewriting for Enhanced Universal Dependencies

Abstract

AbstractThis 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).

Authors

Bruno Guillaume, Guy Perrier

Topics

Natural Language Processing > Understanding > Parsing

Keywords

dependency parsing graph rewriting enhanced universal dependencies
Download PDF

More from ACL 2021

All ACL 2021 papers →
From Raw Text to Enhanced Universal Dependencies: The Parsing Shared Task at IWPT 2021
COMBO: A New Module for EUD Parsing
Splitting EUD Graphs into Trees: A Quick and Clatty Approach
Biaffine Dependency and Semantic Graph Parsing for EnhancedUniversal Dependencies
Enhanced Universal Dependency Parsing with Automated Concatenation of Embeddings
RobertNLP at the IWPT 2021 Shared Task: Simple Enhanced UD Parsing for 17 Languages