RTG based surface realisation for TAG

Claire Gardent, Laura Perez-Beltrachini

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.
Original languageEnglish
Title of host publicationCOLING 2010, 23rd International Conference on Computational Linguistics, Proceedings of the Conference, 23-27 August 2010, Beijing, China
PublisherAssociation for Computational Linguistics
Pages367-375
Number of pages9
Publication statusPublished - 2010

Fingerprint

Dive into the research topics of 'RTG based surface realisation for TAG'. Together they form a unique fingerprint.

Cite this