On the one hand, the greedy algorithm is far quicker computationally (O(n) vs. O(n 2 ) for the Chu-Liu-Edmonds algorithm and O(n 3 ) for Eisner's algorithm).
it may be prone to error propagation when early incorrect decisions negatively influence the parser at later stages.