RTG based surface realisation for TAG

Claire Gardent 1 Laura Perez-Beltrachini 1
1 TALARIS - Natural Language Processing: representation, inference and semantics
Inria Nancy - Grand Est, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/inria-00537159
Contributor : Laura Perez-Beltrachini <>
Submitted on : Friday, March 11, 2011 - 5:50:03 PM
Last modification on : Thursday, January 11, 2018 - 6:21:35 AM
Long-term archiving on : Sunday, June 12, 2011 - 2:51:34 AM

File

garper-coling10.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00537159, version 2

Collections

Citation

Claire Gardent, Laura Perez-Beltrachini. RTG based surface realisation for TAG. 23rd International Conference on Computational Linguistics - Coling 2010, Aug 2010, Beijing, China. pp.367--375. ⟨inria-00537159v2⟩

Share

Metrics

Record views

355

Files downloads

127