Generation under Space Constraints

13 years 6 months ago

Download www.ict.csiro.au

Reasoning about how much to generate when space is limited is a challenge for generation systems. This paper presents two algorithms that exploit the discourse structure to decide which content to drop when there are space restrictions, in the context of producing documents from pre-authored text fragments. We analyse the effectiveness of both algorithms and show that the second is near optimal.

Cécile Paris, Nathalie Colineau, Andrew Lam

Real-time Traffic

COLING 2008 | Computational Linguistics | Discourse Structure | Pre-authored Text Fragments | Space Restrictions |

claim paper

» Sampling the Repairs of Functional Dependency Violations under Hard Constraints

» Robust mixedsize placement under tight whitespace constraints

» Multiresolution Approach for Motion Planning under Differential Constraints

» Dynamic scheduling and synchronization synthesis of concurrent digital systems under syste...

» Optimizing instructionset extensible processors under data bandwidth constraints

» Application of a design space exploration tool to enhance interleaver generation

» New Constraints on Generation of Uniform Random Samples from Evolutionary Trees

» On the generation of feasible paths for aerial robots with limited climb angle

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	COLING
Authors	Cécile Paris, Nathalie Colineau, Andrew Lampert, Joan Giralt Duran

Comments (0)

Sciweavers

Generation under Space Constraints

COLING 2008 | Computational Linguistics | Discourse Structure | Pre-authored Text Fragments | Space Restrictions |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers