The second approach-approximation on the parsing algorithm-consists of an approximate search for the most probable parse.
as an example, in Figure 2a word w1 should shift and swap many times to get to word w5 in order to construct constituent C. a Lazy oracle would postpone swapping until constituent B is built so that only one swap operation over node B would be enough for word w1 to get to word w5.