Authors
Katja Filippova, Enrique Alfonseca, Carlos Colmenares, Lukasz Kaiser, Oriol Vinyals
Publication date
2015
Description
Abstract We present an LSTM approach to deletion-based sentence compression where the
task is to translate a sentence into a sequence of zeros and ones, corresponding to token
deletion decisions. We demonstrate that even the most basic version of the system, which is
given no syntactic information (no PoS or NE tags, or dependencies) or desired
compression length, performs surprisingly well: around 30% of the compressions from a
large test set could be regenerated. We compare the LSTM system with a competitive ...
task is to translate a sentence into a sequence of zeros and ones, corresponding to token
deletion decisions. We demonstrate that even the most basic version of the system, which is
given no syntactic information (no PoS or NE tags, or dependencies) or desired
compression length, performs surprisingly well: around 30% of the compressions from a
large test set could be regenerated. We compare the LSTM system with a competitive ...
Total citations
Scholar articles
K Filippova, E Alfonseca, C Colmenares, L Kaiser… - 2015
Dates and citation counts are estimated and are determined automatically by a computer program.