Handbook of formal languages, vol. 3
Handbook of formal languages, vol. 3
The interface between phrasal and functional constraints
Computational Linguistics
Efficient generation of random sentences
Natural Language Engineering
Characterizing structural descriptions produced by various grammatical formalisms
ACL '87 Proceedings of the 25th 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
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
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
Generation for grammar engineering
INLG '12 Proceedings of the Seventh International Natural Language Generation Conference
| Hi-index | 0.00 |
Feature-based regular tree grammars (FRTG) can be used to generate the derivation trees of a feature-based tree adjoining grammar (FTAG). We make use of this fact to specify and implement both an FTAG-based sentence realiser and a benchmark generator for this realiser. We argue furthermore that the FRTG encoding enables us to improve on other proposals based on a grammar of TAG derivation trees in several ways. It preserves the compositional semantics that can be encoded in feature-based TAGs; it increases efficiency and restricts overgeneration; and it provides a uniform resource for generation, benchmark construction and parsing.