IMPLEMENTASI ALGORITMA DIJSKTRA UNTUK PERINGKASAN OTOMATIS ARTIKEL ILMIAH BERBAHASA INGGRIS

Yanuar Budi Prasetyo, Gloria Virginia, Antonius Rachmat Chrismanto

Abstract


This research implemented Dijkstra algorithm to summarize text documents. To run Dijkstra algorithm, we represented sentence as a vertex and the similarity between sentences as an edge, where the result of the summarization process was the shortest path of Dijkstra calculation. The summarization processes were conducted by utilizing WordNet database and without WordNet database. Our experiment showed that without WordNet the result was better than using WordNet. Using WordNet, the system could obtain 80% relevant sentences. While without WordNet, the system could obtain about 90% of relevant sentences.

Keywords


Dijkstra Algorithm, WordNet, Text Document, Summarization, Shortest Path

Full Text:

PDF

References


Budhi Gregorius S.,Intan Rolly , Silvia R.,Stevanus R. R. (2007). Indonesian Automated Text Summarization. Proceeding ICSIIT .

Halim Steven, Halim Felix. (2013). Competitive Programming 3. Singapore.

Manning Christopher D., Raghavan Prabhakar, Schutza Hinrich . (2009). An Introduction to Information Retrieval.

Ruohonen, K. (2013). Graph Theory.

Sankar K, Sobha L. (2009). An Approach to Text Summarization. Association for Computational Linguistics , 53-60.

Sjobergh Jonas , Araki Kenji . (2006). Extraction Based Summarization Using a Shortest Path Algorithm. Proceedings of 12th Annual Language Processing Conference .

Weiss Sholom M., Indurkhya Nitin, Zhang Tong, Damerau Fred J. (2005). Text Mining Predictive Methods for Analyzing Unstructured Information. Springer.

West, D. B. (2001). Introduction to Graph Theory Second Edition. United States of America: Prentice-Hall.




DOI: http://dx.doi.org/10.21460/inf.2015.111.429

Refbacks

  • There are currently no refbacks.


Bookmark and Share