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.
Type de document :
Article dans une revue
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〉
Liste complète des métadonnées

Littérature citée [25 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00537219
Contributeur : Laura Perez-Beltrachini <>
Soumis le : mercredi 17 novembre 2010 - 22:30:55
Dernière modification le : jeudi 11 janvier 2018 - 06:21:35
Document(s) archivé(s) le : vendredi 18 février 2011 - 03:26:50

Fichier

nle-final.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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〉

Partager

Métriques

Consultations de la notice

328

Téléchargements de fichiers

227