Using Regular Tree Grammars to enhance Sentence Realisation

Claire Gardent 1 Benjamin Gottesman 2 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 : 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.
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/inria-00537219
Contributor : Laura Perez-Beltrachini <>
Submitted on : Wednesday, November 17, 2010 - 10:30:55 PM
Last modification on : Thursday, January 11, 2018 - 6:21:35 AM
Long-term archiving on : Friday, February 18, 2011 - 3:26:50 AM

File

nle-final.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Claire Gardent, Benjamin Gottesman, Laura Perez-Beltrachini. Using Regular Tree Grammars to enhance Sentence Realisation. Natural Language Engineering, Cambridge University Press (CUP), 2011, Finite State Methods and Models in Natural Language Processing, 17 (2), pp.185-201. ⟨10.1017/S1351324911000076⟩. ⟨inria-00537219⟩

Share

Metrics

Record views

399

Files downloads

358