Furthermore, if the list of k language model states are sorted from the lowest cost to the highest cost, we can assume the best combinations will still be among the combinations of the top items from each list, although the incorporation of n-gram features breaks the monotonic property of the underlying semi-ring.
because our higher-order dependency parsing algorithm is based the Eisner algorithm, it is currently limited to produce projective trees only.