... change the set of configurations of the chart, but may further reduce the chart size. The overall runtime for the algorithm is O(n2S), whereS is the number of splits in Ch and n is the num-ber of ... f2, and C1any config-uration of G of the form C( f1( , f2( ), ))(where C is the context of the subterm). ThenC1can be R-rewritten into a tree C2 of the formC( f2( , f1( ), )) which ... complete for 56 % of the USRsin the data set. It is complete for 78 % of the USRswith fewer than e5= 148 configurations (64 % of the data set), and still complete for 66 % of the USRs with fewer...