Graph Rewriting for Enhanced Universal Dependencies
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).
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Investigating Dominant Word Order on Universal Dependencies with Graph Rewriting
This paper details experiments we performed on the Universal Dependencies 2.7 corpora in order to investigate the dominant word order in the available languages. For this purpose, we used a graph rewriting tool, GREW, wh…
Hybrid Enhanced Universal Dependencies Parsing
This paper describes our system to predict enhanced dependencies for Universal Dependencies (UD) treebanks, which ranked 2nd in the Shared Task on Enhanced Dependency Parsing with an average ELAS of 82.60{\%}. Our system…
Dependency ParsingUniversal Dependencies for Punjabi
We introduce the first Universal Dependencies treebank for Punjabi (written in the Gurmukhi script) and discuss corpus design and linguistic phenomena encountered in annotation. The treebank covers a variety of genres an…
DiversityPOSEnhanced English Universal Dependencies: An Improved Representation for Natural Language Understanding Tasks
Many shallow natural language understanding tasks use dependency trees to extract relations between content words. However, strict surface-structure dependency trees tend to follow the linguistic structure of sentences t…
Implicit RelationsNatural Language UnderstandingKøpsala: Transition-Based Graph Parsing via Efficient Training and Effective Encoding
We present K{\o}psala, the Copenhagen-Uppsala system for the Enhanced Universal Dependencies Shared Task at IWPT 2020. Our system is a pipeline consisting of off-the-shelf models for everything but enhanced graph parsing…
Sentence