Building factorized TAGs with meta-grammars - Inria - Institut national de recherche en sciences et technologies du numérique
Conference Papers Year : 2010

Building factorized TAGs with meta-grammars

Abstract

Highly compacted TAGs may be built by allowing subtree factorization operators within the elementary trees. While hand-crafting such trees remains possible, a better option arises from a coupling with meta-grammar descriptions. The approach has been validated by the development of FRMG, a wide-coverage French TAG of only 207 trees.

Keywords

TAG metagrammar parsing NLP

Domains

Computation and Language [cs.CL]
Fichier principal
Vignette du fichier
mgfull.pdf (107.57 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Eric Villemonte De La Clergerie  : Connect in order to contact the contributor

https://inria.hal.science/inria-00551974

Submitted on : Wednesday, January 5, 2011-10:33:08 AM

Last modification on : Tuesday, October 25, 2022-6:36:07 PM

Long-term archiving on : Monday, November 5, 2012-3:30:36 PM

Download

Dates and versions

inria-00551974 , version 1 (05-01-2011)

Identifiers

  • HAL Id : inria-00551974 , version 1

Cite

Éric Villemonte de La Clergerie. Building factorized TAGs with meta-grammars. The 10th International Conference on Tree Adjoining Grammars and Related Formalisms - TAG+10, Jun 2010, New Haven, CO, United States. pp.111-118. ⟨inria-00551974⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-PARIS7 INRIA GRID5000 INRIA2 CAMPUS-AAR AAI SILECS ANR
160 View
179 Download

Share

More