Generation as dependency parsing

Authors:
Alexander Koller;Kristina Striegnitz
Affiliations:
Saarland University;Saarland University
Venue:
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Year:
2002

Citing 8
Cited 17

Tree-adjoining grammars

Handbook of formal languages, vol. 3
Computational Complexity and Natural Language

Computational Complexity and Natural Language
An alternative conception of tree-adjoining derivation

Computational Linguistics
Sentence planning as description using tree adjoining grammar

ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Chart generation

ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
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
Topological dependency trees: a constraint-based account of linear precedence

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Generating with a grammar based on tree descriptions: a constraint-based approach

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics

Put My Galakmid Coin into the Dispenser and Kick It: Computational Linguistics and Theorem Proving in a Computer Game

Journal of Logic, Language and Information
Natural language and inference in a computer game

COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Anaphora and Discourse Structure

Computational Linguistics
GenI: natural language generation in Haskell

Proceedings of the 2006 ACM SIGPLAN workshop on Haskell
A polynomial parsing algorithm for the topological model: synchronizing constituent and dependency grammars, illustrated by German word order phenomena

ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
A relational syntax-semantics interface based on dependency grammar

COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Logics and Automata for Totally Ordered Trees

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Multiword expressions as dependency subgraphs

MWE '04 Proceedings of the Workshop on Multiword Expressions: Integrating Processing
Three reasons to adopt TAG-based surface realisation

TAGRF '06 Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms
Extending a surface realizer to generate coherent discourse

ACLShort '09 Proceedings of the ACL-IJCNLP 2009 Conference Short Papers
A simple domain-independent probabilistic approach to generation

EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
RTG based surface realisation for TAG

COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Comparing the performance of two TAG-based surface realisers using controlled grammar traversal

COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters
Using regular tree grammars to enhance sentence realisation

Natural Language Engineering
Reconciling parameterization, configurability and optimality in natural language generation via multiparadigm programming

CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
Multi-dimensional graph configuration for natural language processing

CSLP'04 Proceedings of the First international conference on Constraint Solving and Language Processing
KBGen: text generation from knowledge bases as a new shared task

INLG '12 Proceedings of the Seventh International Natural Language Generation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Natural-Language Generation from flat semantics is an NP-complete problem. This makes it necessary to develop algorithms that run with reasonable efficiency in practice despite the high worst-case complexity. We show how to convert TAG generation problems into dependency parsing problems, which is useful because optimizations in recent dependency parsers based on constraint programming tackle exactly the combinatorics that make generation hard. Indeed, initial experiments display promising runtimes.