This paper presents a three-step transition-based system for labelled non-projective dependency parsing. The three steps include one classical method for projective dependency parsing and two inverse methods predicting separately the right and left non-projective dependencies. Splitting the parsing allows to increase the scores on non-projective dependencies compared to state-of- the-art non-projective dependency parsing. Moreover, each step is performed in linear time.