In our experiments, a greedy parser performs as accurately as a parser that uses beam search for about 64% of time.
it is preferred if the beam size is not fixed but proportional to the number of low confidence predictions that a greedy parser makes, in which case, fewer transition sequences need to be explored to produce the same or similar parse output.