Models for sentence compression often compose text from units that are larger than individual tokens, such as n-grams which describe a token sequence or syntactic relations which comprise a dependency tree.
our approach is specifically motivated by the perspective that both these representations of a sentence-a sequence of tokens and a tree of dependency relations-are equally meaningful when considering its underlying fluency and integrity.