Summarization beyond sentence extraction: a probabilistic approach to sentence compression
Artificial Intelligence
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
A stochastic Japanese morphological analyzer using a forward-DP backward-A* N-best search algorithm
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
Accurate unlexicalized parsing
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Supervised and unsupervised learning for sentence compression
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Sentence compression beyond word deletion
COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
Sentence fusion via dependency graph compression
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Sentence compression using statistical information about dependency path length
TSD'06 Proceedings of the 9th international conference on Text, Speech and Dialogue
An extractive supervised two-stage method for sentence compression
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
On the limits of sentence compression by deletion
Empirical methods in natural language generation
Simple English Wikipedia: a new text simplification task
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
Learning to simplify sentences using Wikipedia
MTTG '11 Proceedings of the Workshop on Monolingual Text-To-Text Generation
Learning to fuse disparate sentences
MTTG '11 Proceedings of the Workshop on Monolingual Text-To-Text Generation
Paraphrastic sentence compression with a character-based metric: tightening without deletion
MTTG '11 Proceedings of the Workshop on Monolingual Text-To-Text Generation
Evaluating sentence compression: pitfalls and suggested remedies
MTTG '11 Proceedings of the Workshop on Monolingual Text-To-Text Generation
UCNLG+EVAL '11 Proceedings of the UCNLG+Eval: Language Generation and Evaluation Workshop
| Hi-index | 0.00 |
This work introduces a model free approach to sentence compression, which grew out of ideas from Nomoto (2008), and examines how it compares to a state-of-art model intensive approach known as Tree-to-Tree Transducer, or T3 (Cohn and Lapata, 2008). It is found that a model free approach significantly outperforms T3 on the particular data we created from the Internet. We also discuss what might have caused T3's poor performance.