Fast k-best Sentence Compression
Table 3: Results for the baseline and our two algorithms.
['[EMPTY]', '[ITALIC] F1-score', '[ITALIC] Compr.\xa0rate']
(Top-down + NSS is the extended variant described in Sec. The NSS version, which incorporates a prediction on the number of children to keep for each node, is slightly better than the original Top-down approach, but the results are not statistically significant.