In all 21 cases where only the baseline finds a complete solution, k = 4 finds a partial solution.
the search space (following a chart realization algorithm, e. g. (Kay, 1996;Cahill and van Genabith, 2006;Carroll and Oepen, 2005)) traverses collections of partial sentences (edges).