This paper describes the runs submitted to EPE 2017 by Universitat Pompeu Fabra. The three outputs correspond to three different levels of linguistic abstraction: (i) a surface-syntactic tree, (ii) a deep-syntactic tree, and (iii) a predicateargument graph. The surface-syntactic tree is obtained with an off-the-shelf parser trained on the CoNLL’09 Penn Treebank, and the deeper representations by running a sequence of graph transduction grammars on the output of the parser.