In this article we begin by proposing a general system to solve the word ordering problem, which does not rely on constraints (which are typically task-specific).
we treat syntax-based word ordering as a structured prediction problem, for which the input is a multi-set (bag) of words and the output is an ordered sentence, together with its syntactic analysis (either CCG derivation or dependency tree, depending on the grammar formalism being used).