None of the treebanks for nine different languages 10 contain structures that are strongly ill-nested for their gap degree (Table 1).
in any of these treebanks, the MG k parser can parse every sentence with gap degree at most k in time O(n 3k+4 ).