The definition of this property of structures, called k-ill-nestedness, is more declarative than that of mildly ill-nestedness.
it is based on properties that are not local to projections or subtrees, and there is no evidence that k-ill-nested structures are parsable in polynomial time.