None of these treebanks contain structures that are strongly ill-nested for their gap degree.
in any of these treebanks, the MG k parser can parse every sentence with gap degree at most k. We have defined a parsing algorithm for wellnested dependency structures with bounded gap degree.