Efficient generation of random sentences
Natural Language Engineering
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Feature structures based Tree Adjoining Grammars
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Letting the cat out of the bag: generation for shake-and-bake MT
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Semantic construction in feature-based TAG
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
Generation as dependency parsing
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Spotting overgeneration suspects
ENLG '07 Proceedings of the Eleventh European Workshop on Natural Language Generation
Evaluating coverage for large symbolic NLG grammars
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
High efficiency realization for a wide-coverage unification grammar
IJCNLP'05 Proceedings of the Second international joint conference on Natural Language Processing
Using regular tree grammars to enhance sentence realisation
Natural Language Engineering
Error mining on dependency trees
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
| Hi-index | 0.00 |
We present GENSEM, a tool for generating input semantic representations for two sentence generators based on the same reversible Tree Adjoining Grammar. We then show how GENSEM can be used to produced large and controlled benchmarks and test the relative performance of these generators.