RTG based surface realisation for TAG

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.

• Type: Journal
• Year: 2010
• Where: COLING
• Authors: Claire Gardent, Laura Perez-Beltrachini
• Keywords: COLING 2010, Computational Linguistics, FTAG Based Surface, Grammar, Surface Realisation