Introduction to algorithms
Building a large annotated corpus of English: the penn treebank
Computational Linguistics - Special issue on using large corpora: II
A new statistical parser based on bigram lexical dependencies
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Exploiting a probabilistic hierarchical model for generation
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Information fusion in the context of multi-document summarization
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
BLEU: a method for automatic evaluation of machine translation
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Intricacies of Collins' Parsing Model
Computational Linguistics
Evaluation metrics for generation
INLG '00 Proceedings of the first international conference on Natural language generation - Volume 14
Using thematic information in statistical headline generation
MultiSumQA '03 Proceedings of the ACL 2003 workshop on Multilingual summarization and question answering - Volume 12
Head-driven parsing for word lattices
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Towards developing generation algorithms for text-to-text applications
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Clause restructuring for statistical machine translation
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Paraphrasing with bilingual parallel corpora
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Optimal constituent alignment with edge covers for semantic projection
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Non-projective dependency parsing using spanning tree algorithms
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
ENLG '09 Proceedings of the 12th European Workshop on Natural Language Generation
Sentence fusion via dependency graph compression
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Seed and Grow: augmenting statistically generated summary sentences using schematic word patterns
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
On the complexity of non-projective data-driven dependency parsing
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
On the limits of sentence compression by deletion
Empirical methods in natural language generation
On the limits of sentence compression by deletion
Empirical methods in natural language generation
Generating natural language descriptions from OWL ontologies: the natural OWL system
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
In abstractive summarisation, summaries can include novel sentences that are generated automatically. In order to improve the grammaticality of the generated sentences, we model a global (sentence) level syntactic structure. We couch statistical sentence generation as a spanning tree problem in order to search for the best dependency tree spanning a set of chosen words. We also introduce a new search algorithm for this task that models argument satisfaction to improve the linguistic validity of the generated tree. We treat the allocation of modifiers to heads as a weighted bipartite graph matching problem (also known as the assignment problem), a well studied problem in graph theory. Using BLEU to measure performance on a string regeneration task, we demonstrate an improvement over standard language model baselines, illustrating the benefit of the spanning tree approach incorporating an argument satisfaction model.