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.
|Title of host publication||Coling 2008 - 22nd International Conference on Computational Linguistics, Proceedings of the Conference|
|Number of pages||4|
|Publication status||Published - 2008|
|Event||22nd International Conference on Computational Linguistics, Coling 2008 - Manchester, United Kingdom|
Duration: 18 Aug 2008 → 22 Aug 2008
|Other||22nd International Conference on Computational Linguistics, Coling 2008|
|Period||18/08/08 → 22/08/08|