Abstract : Surface realisation from flat semantic formulae is known to be exponential in the length of the input. In this paper, we argue that TAG naturally supports the integration of three main ways of reducing complexity: polarity filtering, delayed adjunction and empty semantic items elimination. We support these claims by presenting some preliminary results of the TAG-based surface realiser .
https://hal.inria.fr/inria-00088784
Contributor : Eric Kow
<>
Submitted on : Friday, August 4, 2006 - 5:12:13 PM
Last modification on : Thursday, January 11, 2018 - 6:19:48 AM
Long-term archiving on : Tuesday, April 6, 2010 - 12:31:40 AM
Claire Gardent, Eric Kow. Three reasons to adopt TAG-based surface realisation. The Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms (TAG+8), Jul 2006, Sydney/Australia. ⟨inria-00088784⟩
