A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Building factorized TAGs with meta-grammars
2010
International Workshop on Tree Adjoining Grammars and Related Formalisms
Preserved Fulltext
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.
dblp:conf/tag/Clergerie10
fatcat:yvkgtxj4ofgn5dajszf2rrz7eu