Proceedings of the Fifth International Natural Language Generation Conference on - INLG '08 2008
DOI: 10.3115/1708322.1708329
|View full text |Cite
|
Sign up to set email alerts
|

Dependency tree based sentence compression

Abstract: We present a novel unsupervised method for sentence compression which relies on a dependency tree representation and shortens sentences by removing subtrees. An automatic evaluation shows that our method obtains result comparable or superior to the state of the art. We demonstrate that the choice of the parser affects the performance of the system. We also apply the method to German and report the results of an evaluation with humans.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
74
0
1

Year Published

2014
2014
2023
2023

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 98 publications
(85 citation statements)
references
References 12 publications
0
74
0
1
Order By: Relevance
“…Most recent approaches to sentence compression make use of syntactic analysis, either by operating directly on trees (Riezler et al, 2003;Nomoto, 2007;Filippova and Strube, 2008;Cohn and Lapata, 2008;Cohn and Lapata, 2009) or by incorporating syntactic information in their model (McDonald, 2006;Clarke and Lapata, 2008). Recently, however, Filippova et al (2015) presented an approach to sentence compression using LSTMs with word embeddings, but without syntactic features.…”
mentioning
confidence: 99%
“…Most recent approaches to sentence compression make use of syntactic analysis, either by operating directly on trees (Riezler et al, 2003;Nomoto, 2007;Filippova and Strube, 2008;Cohn and Lapata, 2008;Cohn and Lapata, 2009) or by incorporating syntactic information in their model (McDonald, 2006;Clarke and Lapata, 2008). Recently, however, Filippova et al (2015) presented an approach to sentence compression using LSTMs with word embeddings, but without syntactic features.…”
mentioning
confidence: 99%
“…P (l|h) is the conditional probability of label l given head h. Note that here we use the formula in (Filippova and Altun, 2013) for w inf o (e), which was shown to be more effective for sentence compression than the original formula in (Filippova and Strube, 2008). The optimization problem can be solved under the tree structure and length constraints by integer linear programming 1 .…”
Section: Dependency Tree Based Sentence Compressionmentioning
confidence: 99%
“…Due to space limit, we refer readers to (Filippova and Strube, 2008) for a detailed description of the baseline method.…”
Section: Dependency Tree Based Sentence Compressionmentioning
confidence: 99%
“…We allowed our model to extract a subtree that did not include the root word (See the sentence with an asterisk * in Figure 1). The method of Filippova and Strube (2008) allows the model to extract non-rooted subtrees in sentence compression tasks that compress a single sentence with a given compression ratio. However, it is not trivial to apply their method to text summarization because no compression ratio is given to sentences.…”
Section: Related Workmentioning
confidence: 99%