This paper explores the idea that non-projective dependency parsing can be conceived as the outcome of two interleaved processes,
one that sorts the words of a sentence into a canonical order, and one that performs strictly projective dependency parsing
on the sorted input. Based on this idea, a parsing algorithm is constructed by combining an online sorting algorithm with
an arc-standard transition system for projective dependency parsing.
Keywords parsing - sorting - non-projective dependency parsing