A Symbolic Approach to Near-Deterministic Surface Realisation using Tree Adjoining Grammar

Claire Gardent (1) , Eric Kow (1)

1 TALARIS - Natural Language Processing: representation, inference and semantics

Surface realisers divide into those used in generation (NLG geared realisers) and those mirroring the parsing process (Reversible realisers). While the first rely on grammars not easily usable for parsing, it is unclear how the second type of realisers could be parameterised to yield from among the set of possible paraphrases, the paraphrase appropriate to a given generation context. In this paper, we present a surface realiser which combines a reversible grammar (used for parsing and doing semantic construction) with a symbolic means of selecting paraphrases.

Mots clés: generation; TAG; paraphrase

Domaines: Informatique et langage [cs.CL]

Claire Gardent, Eric Kow. A Symbolic Approach to Near-Deterministic Surface Realisation using Tree Adjoining Grammar. 45th Annual Meeting of the Association for Computational Linguistics - ACL 2007, Jun 2007, Prague, Czech Republic. pp.328-335. ⟨inria-00149366⟩