Please use this identifier to cite or link to this item:
|Title:||Memory-based learning for article generation||Authors:||Minnen, Guido
|Keywords:||DRNTU::Humanities::Linguistics::Sociolinguistics::Computational linguistics||Issue Date:||2000||Source:||Minnen, G., Bond, F. & Copestake, A. (2000). Memory-based learning for article generation. Proceedings of Conference on Computational Language Learning, Lisbon, pp.43–48.||Abstract:||Article choice can pose difficult problems in applications such as machine translation and automated summarization. In this paper, we investigate the use of corpus data to collect statistical generalizations about article use in English in order to be able to generate articles automatically to supplement a symbolic generator. We use data from the Penn Treebank as input to a memory-based learner (TiMBL 3.0; Daelemans et al., 2000) which predicts whether to generate an article with respect to an English base noun phrase. We discuss competitive results obtained using a variety of lexical, syntactic and semantic features that play an important role in automated article generation.||URI:||https://hdl.handle.net/10356/83964
|DOI:||10.3115/1117601.1117611||Rights:||© 2000 Association for Computational Linguistics. This paper was published in Proceedings of Conference on Computational Language Learning and is made available as an electronic reprint (preprint) with permission of Association for Computational Linguistics. The paper can be found at the following official URL: http://dx.doi.org/10.3115/1117601.1117611. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper is prohibited and is subject to penalties under law.||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||HSS Conference Papers|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.