Building factorized TAGs with meta-grammars

@inproceedings{Clergerie2010BuildingFT,
  title={Building factorized TAGs with meta-grammars},
  author={{\'E}ric Villemonte de la Clergerie},
  booktitle={TAG},
  year={2010}
}
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 widecoverage French TAG of only 207 trees. 
Highly Cited
This paper has 21 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Représentation informatique de

Benoît Crabbé
2005
View 1 Excerpt

Partially ordered multiset context-free grammars and freeword-order parsing

M.-J. Nederhof, G. Satta, S. Shieber.
In 8th International Workshop on Parsing Technologies (IWPT’03), pages 171–182. • 2003
View 2 Excerpts

Une grammaire électronique du français

A. Abeillé.
CNRS Editions, Paris. • 2002
View 1 Excerpt

Similar Papers

Loading similar papers…