Adam Ek author Jean-Philippe Bernardy author 2020-jul text Association for Computational Linguistics Online conference publication 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. ek-bernardy-2020-much https://www.aclweb.org/anthology/2020.iwpt-1.23 2020-jul 221 226