SemTAG : une plate-forme pour le calcul sémantique à partir de Grammaires d'Arbres Adjoints
Yannick Parmentier · HAL (Le Centre pour la Communication Scientifique Directe) · 2007
In this thesis, we propose a software architecture (namely SemTAG) allowing for semantic construction with Tree Adjoining Grammars (TAG). SemTAG provides with an environment allowing to build an underspecified semantic representation (Predicate Logic Unplugged (Bos, 95)) from a TAG lexicon and a sentence. In order to facilitate lexicon management, the SemTAG platforms uses a metagrammar compiler. The goal of the compiler is to automatically produce a TAG from a reduced description. This description corresponds to (a) a hierarchy of tree fragments and (b) combinations of these fragments defined using a control language. Furthermore, each tree produced may be equipped with a syntax / semantic interface following (Gardent and Kallmeyer, 03). The semantic construction is based on the result of the syntactic parsing. Parsing is done by a tabular TAG parser generated automatically from the input TAG by the DyALog system of (De La Clergerie, 05). This parser outputs a derivation forest, which encodes all TAG derivations, and from which the unifications of semantic indices are extracted. This platforms has been evaluated in terms of semantic coverage on the TSNLP test-suite.