In this paper we extend the work of <cite>(Owczarzak et al., 2007)</cite> in a different manner: we use an adapted version of the Malt parser (Nivre et al., 2006) to produce 1-best LFG dependencies and allow triple matches where the dependency labels are different.