Graph Rewriting for Enhanced Universal Dependencies
Abstract
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).
Domains
Computation and Language [cs.CL]
Origin : Files produced by the author(s)