The interface between phrasal and functional constraints
Computational Linguistics
Parser engineering and performance profiling
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
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 |
Surface realisation with grammars integrating flat semantics is known to be NP complete. In this paper, we present a new algorithm for surface realisation based on Feature Based Tree Adjoining Grammar (FTAG) which draws on the observation that an FTAG can be translated into a Regular Tree Grammar describing its derivation trees. We carry out an extensive testing of several variants of this algorithm using an automatically produced testsuite and compare the results obtained with those obtained using GenI, another FTAG based surface realiser.