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
Inria Nancy - Grand Est, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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 : generation TAG paraphrase
Document type :
Conference papers
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download
https://hal.inria.fr/inria-00149366
Contributor : Eric Kow <>
Submitted on : Friday, May 25, 2007 - 2:20:26 PM
Last modification on : Thursday, January 11, 2018 - 6:21:35 AM
Long-term archiving on : Thursday, April 8, 2010 - 5:53:40 PM

File

acl07-garkow.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00149366, version 1

Collections

INRIA | LORIA | UNIV-LORRAINE

Citation

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

250

Files downloads

230

Contact


archive-ouverte@inria.fr