01/07/2020

How Much of Enhanced UD Is Contained in UD?

Adam Ek, Jean-Philippe Bernardy

Keywords:

Abstract Paper Similar Papers

Abstract: In this paper, we present the submission of team CLASP to the IWPT 2020 Shared Task on parsing enhanced universal dependencies. We develop a tree-to-graph transformation algorithm based on dependency patterns. This algorithm can transform gold UD trees to EUD graphs with an ELAS score of 81.55 and a EULAS score of 96.70. These results show that much of the information needed to construct EUD graphs from UD trees are present in the UD trees. Coupled with a standard UD parser, the method applies to the official test data and yields and ELAS score of 67.85 and a EULAS score is 80.18.

 0
 0
 0
 0
  Share    
This is an embedded video. Talk and the respective paper are published at ACL Workshops virtual conference. If you are one of the authors of the paper and want to manage your upload, see the question "My papertalk has been externally embedded..." in the FAQ section.

Comments

Post Comment
no comments yet
code of conduct: tbd Characters remaining: 140

Similar Papers

 0
 0
 0
 0
 7:40 
 0
 0
 0
 0
 7:31 
 0
 0
 0
 0
 8:09 
 0
 0
 0
 0
 10:28 
 0
 0
 0
 0
 15:32 
 0
 0
 0
 0
 12:44 
 0
 0
 0
 0
 25:11 
 0
 0
 0
 0
 6:47 
 0
 0
 0
 0
 7:05 
 0
 0
 0
 0
 16:10 
 0
 0
 0
 0
 10:03 
 0
 0
 0
 0
 18:52 
 0
 0
 0
 0
 12:26 
 0
 0
 0
 0
 10:14 
 0
 0
 0
 0
 15:10 
 0
 0
 0
 0
 7:52 
 0
 0
 0
 0
 10:25 
 0
 0
 0
 0
 11:02 
 0
 0
 0
 0
 11:31 
 0
 0
 0
 0
 17:58 
 0
 0
 0
 0
 16:17 
 0
 0
 0
 0
 14:53 
 0
 0
 0
 0
 7:37 
 0
 0
 0
 0
 13:57 
 0
 0
 0
 0
 12:02 
 0
 0
 0
 0
 13:53 
 0
 0
 0
 0
 14:40 
 0
 0
 0
 0
 14:47 
 0
 0
 0
 0
 14:06 
 0
 0
 0
 0
 20:09 
 0
 0
 0
 0
 14:38 
 0
 0
 0
 0
 6:46 
 0
 0
 0
 0
 2:57 
 0
 0
 0
 0
 10:52 
 0
 0
 0
 0
 10:03 
 0
 0
 0
 0
 3:19 
 0
 0
 0
 0
 13:59 
 0
 0
 0
 0
 13:12 
 0
 0
 0
 0
 14:38 
 0
 0
 0
 0
 13:41