For any SCFG rule, if there exists a recursive partition of child nonterminals which enables tabular parsing of an input sentence w in time O(|w| k ), then there exists a recursive binary partition whose corresponding parser is also O(|w| k ).
the results on binarizability of hand-aligned data for the three language pairs are summarized in table 1.