This shows that inside and outside HRGs with d r = 5 cover 99% of the sentences in the data set.
when we do so, we soon realize that there is a gap in computational complexity between the two cases, because of the structural differences between non-crossing trees and general graphs.