Structure-Driven Lexicalist Generation

Shashi Narayan, Claire Gardent

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

We present a novel algorithm for surface realisation with lexicalist grammars. In this algorithm, the structure of the input is used both top-down to constrain the selection of applicable rules and bottom-up to filter the initial search space associated with local input trees. In addition, parallelism is used to recursively pursue the realisation of each daughter node in the input tree. We evaluate the algorithm on the input data provided by the Generation Challenge Surface Realisation Task and show that it drastically reduce processing time when compared with a simpler, top-down driven, lexicalist approach.
Original languageEnglish
Title of host publicationProceedings of the 24th International Conference on Computational Linguistics (COLING)
Place of PublicationMumbai, India
PublisherThe COLING 2012 Organizing Committee
Number of pages16
Publication statusPublished - 1 Dec 2012
Event24th International Conference on Computational Linguistics - IIT Bombay, Mumbai, India
Duration: 8 Dec 201215 Dec 2012


Conference24th International Conference on Computational Linguistics
Abbreviated titleCOLING 2012
Internet address


Dive into the research topics of 'Structure-Driven Lexicalist Generation'. Together they form a unique fingerprint.

Cite this