research-article

Free access

Dependency tree based sentence compression

Authors:

Katja Filippova,

Michael StrubeAuthors Info & Claims

INLG '08: Proceedings of the Fifth International Natural Language Generation Conference

Pages 25 - 32

Published: 12 June 2008 Publication History

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.

References

[1]

Briscoe, Edward, John Carroll & Rebecca Watson (2006). The second release of the RASP system. In Proceedings of the COLING-ACL Interactive Presentation Session, Sydney, Australia, 2006, pp. 77--80.

Digital Library

[2]

Clarke, James & Mirella Lapata (2006). Models for sentence compression: A comparison across domains, training requirements and evaluation measures. In Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, Sydney, Australia, 17--21 July 2006, pp. 377--385.

Digital Library

[3]

Clarke, James & Mirella Lapata (2008). Global inference for sentence compression: An integer linear programming approach. Journal of Artificial Intelligence Research, 31:399--429.

[4]

de Marneffe, Marie-Catherine, Bill MacCartney & Christopher D. Manning (2006). Generating typed dependency parses from phrase structure parses. In Proceedings of the 5th International Conference on Language Resources and Evaluation, Genoa, Italy, 22--28 May 2006, pp. 449--454.

[5]

Filippova, Katja & Michael Strube (2007). Generating constituent order in German clauses. In Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics, Prague, Czech Republic, 23--30 June 2007, pp. 320--327.

[6]

Foth, Kilian & Wolfgang Menzel (2006). Hybrid parsing: Using probabilistic models as predictors for a symbolic parser. In Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, Sydney, Australia, 17--21 July 2006, pp. 321--327.

Digital Library

[7]

Gagnon, Michel & Lyne Da Sylva (2005). Text summarization by sentence extraction and syntactic pruning. In Proceedings of Computational Linguistics in the North East, Gatineau, Québec, Canada, 26 August 2005.

[8]

Galley, Michel & Kathleen R. McKeown (2007). Lexicalized Markov grammars for sentence compression. In Proceedings of Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics, Rochester, N. Y., 22--27 April 2007, pp. 180--187.

[9]

Hori, Chiori & Sadaoki Furui (2004). Speech summarization: An approach through word extraction and a method for evaluation. IEEE Transactions on Information and Systems, E87-D(1):15--25.

[10]

Hori, Chiori, Sadaoki Furui, Rob Malkin, Hua Yu & Alex Waibel (2003). A statistical approach to automatic speech summarization. EURASIP Journal on Applied Signal Processing, 2:128--139.

Digital Library

[11]

Jing, Hongyan (2001). Cut-and-Paste Text Summarization, (Ph.D. thesis). Computer Science Department, Columbia University, New York, N.Y.

Digital Library

[12]

Klein, Dan & Christopher D. Manning (2003). Accurate unlexicalized parsing. In Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics, Sapporo, Japan, 7--12 July 2003, pp. 423--430.

Digital Library

[13]

Knight, Kevin & Daniel Marcu (2002). Summarization beyond sentence extraction: A probabilistic approach to sentence compression. Artificial Intelligence, 139(1):91--107.

Digital Library

[14]

McDonald, Ryan (2006). Discriminative sentence compression with soft syntactic evidence. In Proceedings of the 11th Conference of the European Chapter of the Association for Computational Linguistics, Trento, Italy, 3--7 April 2006, pp. 297--304.

[15]

Riezler, Stefan, Tracy H. King, Richard Crouch & Annie Zaenen (2003). Statistical sentence condensation using ambiguity packing and stochastic disambiguation methods for Lexical-Functional Grammar. In Proceedings of the Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics, Edmonton, Alberta, Canada, 27 May -1 June 2003, pp. 118--125.

Digital Library

[16]

Ringger, Eric, Michael Gamon, Robert C. Moore, David Rojas, Martine Smets & Simon Corston-Oliver (2004). Linguistically informed statistical models of constituent structure for ordering in sentence realization. In Proceedings of the 20th International Conference on Computational Linguistics, Geneva, Switzerland, 23--27 August 2004, pp. 673--679.

Digital Library

[17]

Telljohann, Heike, Erhard W. Hinrichs & Sandra Küübler (2003). Stylebook for the Tübingen treebank of written German (TüBa-D/Z). Technical Report: Seminar für Sprachwissenschaft, Universität Tübingen, Tübingen, Germany.

[18]

Turner, Jenine & Eugene Charniak (2005). Supervised and unsupervised learning for sentence compression. In Proceedings of the 43rd Annual Meeting of the Association for Computational Linguistics, Ann Arbor, Mich., 25--30 June 2005, pp. 290--297.

Digital Library

[19]

Versley, Yannick (2005). Parser evaluation across text types. In Proceedings of the 4th Workshop on Treebanks and Linguistic Theories, Barcelona, Spain, 9--10 December 2005.

Cited By

Gu ZArawjo ILi KKummerfeld JGlassman E(2024)An AI-Resilient Text Rendering Technique for Reading and Skimming DocumentsProceedings of the 2024 CHI Conference on Human Factors in Computing Systems10.1145/3613904.3642699(1-22)Online publication date: 11-May-2024
https://dl.acm.org/doi/10.1145/3613904.3642699
Žabokrtský ZZeman DŠevčíková M(2021)Sentence Meaning Representations Across LanguagesComputational Linguistics10.1162/coli_a_0038546:3(605-665)Online publication date: 25-Feb-2021
https://dl.acm.org/doi/10.1162/coli_a_00385
Kawashima TTakagi T(2019)Sentence Simplification from Non-Parallel Corpus with Adversarial LearningIEEE/WIC/ACM International Conference on Web Intelligence10.1145/3350546.3352499(43-50)Online publication date: 14-Oct-2019
https://dl.acm.org/doi/10.1145/3350546.3352499
Show More Cited By

Recommendations

Phrase dependency machine translation with quasi-synchronous tree-to-tree features

Recent research has shown clear improvement in translation quality by exploiting linguistic syntax for either the source or target language. However, when using syntax for both languages "tree-to-tree" translation, there is evidence that syntactic ...
Sentence compression as tree transduction

This paper presents a tree-to-tree transduction method for sentence compression. Our model is based on synchronous tree substitution grammar, a formalism that allows local distortion of the tree topology and can thus naturally capture structural ...
Sub-sentence division for tree-based machine translation
ACLShort '09: Proceedings of the ACL-IJCNLP 2009 Conference Short Papers

Tree-based statistical machine translation models have made significant progress in recent years, especially when replacing 1-best trees with packed forests. However, as the parsing accuracy usually goes down dramatically with the increase of sentence ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image DL Hosted proceedings

INLG '08: Proceedings of the Fifth International Natural Language Generation Conference

June 2008

246 pages

Program Chairs:
Michael White
The Ohio State University
,
Crystal Nakatsu
The Ohio State University
,
David McDonald
BBN Technologies

Publisher

Association for Computational Linguistics

United States

Publication History

Published: 12 June 2008

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
641
Total Downloads

Downloads (Last 12 months)55
Downloads (Last 6 weeks)12

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Gu ZArawjo ILi KKummerfeld JGlassman E(2024)An AI-Resilient Text Rendering Technique for Reading and Skimming DocumentsProceedings of the 2024 CHI Conference on Human Factors in Computing Systems10.1145/3613904.3642699(1-22)Online publication date: 11-May-2024
https://dl.acm.org/doi/10.1145/3613904.3642699
Žabokrtský ZZeman DŠevčíková M(2021)Sentence Meaning Representations Across LanguagesComputational Linguistics10.1162/coli_a_0038546:3(605-665)Online publication date: 25-Feb-2021
https://dl.acm.org/doi/10.1162/coli_a_00385
Kawashima TTakagi T(2019)Sentence Simplification from Non-Parallel Corpus with Adversarial LearningIEEE/WIC/ACM International Conference on Web Intelligence10.1145/3350546.3352499(43-50)Online publication date: 14-Oct-2019
https://dl.acm.org/doi/10.1145/3350546.3352499
Sun FJiang PSun HPei COu WWang XCuzzocrea AAllan JPaton NSrivastava DAgrawal RBroder AZaki MCandan SLabrinidis ASchuster AWang H(2018)Multi-Source Pointer Network for Product Title SummarizationProceedings of the 27th ACM International Conference on Information and Knowledge Management10.1145/3269206.3271722(7-16)Online publication date: 17-Oct-2018
https://dl.acm.org/doi/10.1145/3269206.3271722
Yao JWan XSingh SMarkovitch S(2017)Greedy flipping for constrained word deletionProceedings of the Thirty-First AAAI Conference on Artificial Intelligence10.5555/3298023.3298079(3518-3524)Online publication date: 4-Feb-2017
https://dl.acm.org/doi/10.5555/3298023.3298079
Nguyen DTran TThang HHu ZBui MSikdar BIDE IBinh HEngchuan WSang DOanh N(2017)Phrasal Graph-based Method for Abstractive Vietnamese Paragraph CompressionProceedings of the 8th International Symposium on Information and Communication Technology10.1145/3155133.3155177(143-150)Online publication date: 7-Dec-2017
https://dl.acm.org/doi/10.1145/3155133.3155177
Tran NLuong VNguyen NNghiem MHung NThang HDe Raedt LDeville YBui MLinh TSang DPhuong NOanh N(2016)Effective attention-based neural architectures for sentence compression with bidirectional long short-term memoryProceedings of the 7th Symposium on Information and Communication Technology10.1145/3011077.3011111(123-130)Online publication date: 8-Dec-2016
https://dl.acm.org/doi/10.1145/3011077.3011111
Wang MLu ZLi HLiu Q(2015)Syntax-based deep matching of short textsProceedings of the 24th International Conference on Artificial Intelligence10.5555/2832415.2832438(1354-1361)Online publication date: 25-Jul-2015
https://dl.acm.org/doi/10.5555/2832415.2832438
Trinh HYatani KEdge DJones MPalanque PSchmidt AGrossman T(2014)PitchPerfectProceedings of the SIGCHI Conference on Human Factors in Computing Systems10.1145/2556288.2557286(1571-1580)Online publication date: 26-Apr-2014
https://dl.acm.org/doi/10.1145/2556288.2557286
Perera PKosseim L(2014)Evaluation of Sentence Compression Techniques against Human PerformanceProceedings of the 15th International Conference on Computational Linguistics and Intelligent Text Processing - Volume 840410.1007/978-3-642-54903-8_46(553-565)Online publication date: 6-Apr-2014
https://dl.acm.org/doi/10.1007/978-3-642-54903-8_46
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents