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
Evaluation metrics for generation
INLG '00 Proceedings of the first international conference on Natural language generation - Volume 14
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
Sentence fusion via dependency graph compression
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
Dependency based Chinese sentence realization
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2
Detecting errors in automatically-parsed dependency relations
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Broad coverage multilingual deep sentence generation with a stochastic multi-level realizer
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Multi-sentence compression: finding shortest paths in word graphs
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Syntax-based grammaticality improvement using CCG and guided search
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Syntax-based word ordering incorporating a large-scale language model
EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
Generating non-projective word order in statistical linearization
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
Partial-tree linearization: generalized word ordering for text synthesis
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Abstract-like text summarisation requires a means of producing novel summary sentences. In order to improve the grammaticality of the generated sentence, 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 (or assignment) problem, a well studied problem in graph theory. Using BLEU to measure performance on a string regeneration task, we found an improvement, illustrating the benefit of the spanning tree approach armed with an argument satisfaction model.