A Symbolic Approach to Near-Deterministic Surface Realisation using Tree Adjoining Grammar - Archive ouverte HAL Access content directly
Conference Papers Year : 2007

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

(1) , (1)
1

Abstract

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.

Keywords

Fichier principal
Vignette du fichier
acl07-garkow.pdf (82.03 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00149366 , version 1 (25-05-2007)

Identifiers

  • HAL Id : inria-00149366 , version 1

Cite

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⟩
121 View
199 Download

Share

Gmail Facebook Twitter LinkedIn More