Sentence Compression as Tree Transduction
Not on the map. Why?
Abstract (arXiv)
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 mismatches. We describe an algorithm for decoding in this framework and show how the model can be trained discriminatively within a large margin framework. Experimental results on sentence compression bring significant improvements over a state-of-the-art model.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Jan 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 2; 2023: 1.
5 papers.
- 2021Sequence-to-Sequence Learning with Latent Neural Grammarscited by 30
- 2022ExtraPhrase: Efficient Data Augmentation for Abstractive Summarizationcited by 8
- 2022Hierarchical Phrase-based Sequence-to-Sequence Learningcited by 7
- 2021With Measured Words: Simple Sentence Selection for Black-Box Optimization of Sentence Compression Algorithmscited by 2
- 2023From Lengthy to Lucid: A Systematic Literature Review on NLP Techniques for Taming Long Sentencescited by 0
- 2023From Lengthy to Lucid: A Systematic Literature Review on NLP Techniques for Taming Long Sentences8 Dec 2023
- 2022Hierarchical Phrase-based Sequence-to-Sequence Learning15 Nov 2022
- 2022ExtraPhrase: Efficient Data Augmentation for Abstractive Summarization14 Jan 2022
- 2021Sequence-to-Sequence Learning with Latent Neural Grammars2 Sep 2021
- 2021With Measured Words: Simple Sentence Selection for Black-Box Optimization of Sentence Compression Algorithms25 Jan 2021