Our method is similar to Nomoto's, in that it uses two stages, one that chops the source dependency tree generating candidate compressions, and one that ranks the candidates.
we experimented with more elaborate ranking models, and our method does not employ any manually crafted rules.