Summarising text with a genetic algorithm-based sentence extraction

International Journal of Knowledge Management Studies

Volumn 2, Issue 4, 2008, Pages 426-444

  Qazvinian, Vahed ^a   Hassanabadi, Leila Sharif ^b   Halavati, Ramin ^a  

^a SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

^b SHAHID BEHESHTI UNIVERSITY   (Iran)

Author keywords

automatic text summarisation; genetic algorithm; sentence extraction

Indexed keywords

EID: 84961561185     PISSN: 17438268     EISSN: 17438276     Source Type: Journal    
DOI: 10.1504/IJKMS.2008.019750     Document Type: Article

References (20)

1. Baeza-Yates, R. and Ribeiro-Neto, B. (1999) Modern Information Retrieval, Addison Wesley.
2. Barzilay, R. and Elhadad, M. (1997) ‘Using lexical chains for text summarization’, Proceedings of the Intelligent Scalable Text Summarization Workshop (ISTS’97), ACL.
3. Brandow, R., Mitze, K. and Rau, L.F. (1995) ‘Automatic condensation of electronic publications by sentence selection’, Information Processing and Management, Vol. 31, No. 5, pp.675–685.
4. Edmunson, H. (1969) ‘New methods in automatic extracting’, Journal of ACM, Vol. 16, No. 2, pp.264–285.
5. Goldstein, J., Kantrowitz, M., Mittal, V.O. and Carbonell, J.G. (1999) ‘Summarizing text documents: sentence selection and evaluation metrics’, Research and Development in Information Retrieval, pp.121–128.
6. Hovy, E. and Lin, C. (1997) ‘Automated text summarization in summarist’, ACL/EACL-97 Workshop on Intelligent Scalable Text Summarization, pp.18–24.
7. Kupiec, J., Pedersen, J.O. and Chen, F. (1995) ‘A trainable document summarizer’, Proceedings of 18th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp.68–73.
8. Luhn, H. (1958) ‘The automatic creation of literature abstracts’, IBM Journal of Research and Development, Vol. 2, No. 2.
9. Mani, I. and Bloedorn, E. (1998) ‘Machine learning of generic and user-focused summarization’, Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, AAAI/IAAI, pp.821–826, AAAI Press/The MIT Press.
10. Marcu, D. (1997) ‘From discourse structures to text summaries’, The Proceedings of the ACL’97/EACL’97 Workshop on Intelligent Scalable Text Summarization, pp.82–88, Madrid, Spain.
11. Mitra, M., Singhal, A. and Buckley, C. (1997) ‘Automatic text summarization by paragraph extraction’, Proceedings of the ACL’97/EACL’97 Workshop on Intelligent Scalable Text Summarization, pp.39–46.
12. Salton, G. and Buckley, C. (1998) ‘Term-weighting approaches in automatic text retrieva’, Information Processing and Management, Vol. 24, No. 5, pp.513–523.
13. Salton, G., Singhal, A., Buckley, C. and Mitra, M. (1996) ‘Automatic text decomposition using text segments and text themes’, UK Conference on Hypertext, pp.53–65.
14. Silla, J., Nascimento, C., Pappa, G.L., Freitas, A.A. and Kaestner, C.A.A. (2004) ‘Automatic text summarization with genetic algorithm-based attribute selection’, Lecture Notes in Artificial Intelligence.
15. Teufel, S. and Moens, M. (1999) ‘Argumentative classification of extracted sentences as a first step towards flexible abstracting’, in I. Mani and M.T. Maybury (Eds). Advances in Automatic Text Summarization, pp.155–171, The MIT Press.
16. Cohesion Matrix.
17. Weight of a path is the sum of weights of its edges.
18. Human made summaries.
19. Consider any summary vector as a state, the fittest summary is the goal and GA tries to reach that goal.
20. In that case, the other child will have less 1s because the total number of 1s is constant.