In this paper, we extend the evaluation of <cite>Rimell et al. (2009)</cite> to two dependency parsers, MSTParser (McDonald, 2006) and MaltParser (Nivre et al., 2006a) , trained on data from the PTB, converted to Stanford typed dependencies (de Marneffe et al., 2006) , and combined with a simple post-processor to extract unbounded dependencies from the basic dependency tree.