Statistics-Based Summarization - Step One: Sentence Compression
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
A fast and portable realizer for text generation systems
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
Motivations and methods for text simplification
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Verb paraphrase based on case frame alignment
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Learning to paraphrase: an unsupervised approach using multiple-sequence alignment
NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - 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
Sentence Fusion for Multidocument News Summarization
Computational Linguistics
Extracting structural paraphrases from aligned monolingual corpora
PARAPHRASE '03 Proceedings of the second international workshop on Paraphrasing - Volume 16
Natural language processing tools for reading level assessment and text simplification for bilingual education
Constructing corpora for the development and evaluation of paraphrase systems
Computational Linguistics
HLT-Short '08 Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers
Sentence compression as tree transduction
Journal of Artificial Intelligence Research
Reformulating discourse connectives for non-expert readers
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Complex lexico-syntactic reformulation of sentences using typed dependency representations
INLG '10 Proceedings of the 6th International Natural Language Generation Conference
Challenging choices for text simplification
PROPOR'10 Proceedings of the 9th international conference on Computational Processing of the Portuguese Language
SB: mmSystem - using decompositional semantics for lexical simplification
SemEval '12 Proceedings of the First Joint Conference on Lexical and Computational Semantics - Volume 1: Proceedings of the main conference and the shared task, and Volume 2: Proceedings of the Sixth International Workshop on Semantic Evaluation
A hybrid system for Spanish text simplification
SLPAT '12 Proceedings of the Third Workshop on Speech and Language Processing for Assistive Technologies
ERNESTA: a sentence simplification tool for children's stories in italian
CICLing'13 Proceedings of the 14th international conference on Computational Linguistics and Intelligent Text Processing - Volume 2
Text simplification resources for Spanish
Language Resources and Evaluation
Hi-index | 0.00 |
We present a framework for text simplification based on applying transformation rules to a typed dependency representation produced by the Stanford parser. We test two approaches to regeneration from typed dependencies: (a) gen-light, where the transformed dependency graphs are linearised using the word order and morphology of the original sentence, with any changes coded into the transformation rules, and (b) gen-heavy, where the Stanford dependencies are reduced to a DSyntS representation and sentences are generating formally using the RealPro surface realiser. The main contribution of this paper is to compare the robustness of these approaches in the presence of parsing errors, using both a single parse and an n-best parse setting in an overgenerate and rank approach. We find that the gen-light approach is robust to parser error, particularly in the n-best parse setting. On the other hand, parsing errors cause the realiser in the gen-heavy approach to order words and phrases in ways that are disliked by our evaluators.