PROJECT ON

TEXT SUMMARIZER
UNDER THE GUIDANCE OF
RAYEES AHAMED KHAN
ASST. PROF CSE DEPT
BY
NILANJAN CHAKRABORTY(BE/6175/13)
ABHISHEK KUMAR(BE/6177/13)
ARKA PRABHO PRAMANIK(BE/6179/13)
AKASH RATAN(BE/6183/13)
 CONTENTS
INTRODUCTION

HOW DOES SUMMARIZER WORK

BLOCK DIAGRAM

ALGORITHMS USED

SCREENSHOTS

ADVANTAGES

LIMITATIONS

APPLICATIONS

CONCLUSION

FUTURE SCOPE

REFERENCES
 INTRODUCTION
TEXT SUMMARIZATION IS A PROCESS OF REDUCING THE SIZE OF THE ORIGINAL DOCUMENT
WHILE PRESERVING ITS INFORMATION CONTENT AND ITS SUMMARY IS LESS THAN HALF OF
THE MAIN TEXT.

WITH THE GROWING AMOUNT OF DATA INTEREST IN THE FILED OF TEXT SUMMARISATION HAS
BEEN WIDELY INCREASING SO AS TO REDUCING THE MANUAL EFFORT OF A PERSON WORKING
ON IT. OUR PROJECT FOCUSES ON THE COMPARISON OF VARIOUS EXISTENT ALGORITHMS FOR
THE SUMMARISATION OF DOCUMENT.

WITH THE RAPID GROWTH OF THE WORLD WIDE WEB (INTERNET), INFORMATION OVERLOAD
IS BECOMING A PROBLEM FOR AN INCREASING LARGE NUMBER OF PEOPLE. AUTOMATIC
SUMMARISATION CAN BE AN INDISPENSABLE SOLUTION TO REDUCE THE INFORMATION
OVERLOAD PROBLEM ON THE WEB.
 HOW DOES SUMMARIZER WORK
SUMMARIZATION HAS BEEN VIEWED AS A THREE STEP PROCESS:

TRANSFORM TEXT INTO A INTERNAL REPRESENTATION.

DETECT IMPORTANT TEXT UNITS.

GENERATE SUMMARY.
BLOCK DIAGRAM
 ALGORITHMS USED

IN INFORMATION RETRIEVAL, TFIDF, SHORT FOR TERM FREQUENCYINVERSE DOCUMENT

FREQUENCY, IS A NUMERICAL STATISTIC THAT IS INTENDED TO REFLECT HOW IMPORTANT
A WORD IS TO A DOCUMENT IN A COLLECTION. THE TF-IDF VALUE INCREASES
PROPORTIONALLY TO THE NUMBER OF TIMES A WORD APPEARS IN THE DOCUMENT, BUT
IS OFFSET BY THE FREQUENCY OF THE WORD IN THE DOCUMENT, WHICH HELPS TO
ADJUST FOR THE FACT THAT SOME WORDS APPEAR MORE FREQUENTLY IN GENERAL.
NOWADAYS, TF-IDF IS ONE OF THE MOST POPULAR TERM-WEIGHTING SCHEMES
SCREENSHOTS
SCREENSHOTS
SCREENSHOTS
 ADVANTAGES
WORKS INSTANTLY

DOES NOT MISS IMPORTANT FACTS

IMPROVES PRODUCTIVITY
 LIMITATIONS
CURRENTLY ONLY ENGLISH LANGUAGE IS SUPPORTED

SUMMARY OF AN ARTICLE FROM A URL IS NOT SUPPORTED

 APPLICATIONS

ACTION ITEMS FROM A MEETING

SIMPLIFYING TEXT BY COMPRESSING SENTENCES

SUMMARIES OF LARGE DOCUMENTS

 CONCLUSION
DUE TO RAPID GROWTH OF TECHNOLOGY AND USE OF INTERNET, THERE IS
INFORMATION OVERLOAD. THIS PROBLEM CAN BE SOLVED IF THERE ARE
STRONG TEXT SUMMARISERS WHICH PRODUCES A SUMMARY OF
DOCUMENT TO HELP USER. HENCE THERE IS A NEED TO DEVELOP
SYSTEM WHERE A USER CAN EFFICIENTLY RETRIEVE AND GET A
SUMMARIZED DOCUMENT.

A SUMMARIZATION MACHINE CAN BE VIEWED AS A SYSTEM WHICH ACCEPTS

EITHER A SINGLE DOCUMENT OR MULTIPLE DOCUMENTS OR A QUERY AS AN
INPUT AND PRODUCES A ABSTRACT OR EXTRACT SUMMARY.
 FUTURE SCOPE
IN FUTURE WORK ABSTRACTIVE METHODS CAN BE IMPLEMENTED.

IN ABSTRACTIVE METHOD BUILD AN INTERNAL SEMANTIC REPRESENTATION AND THEN

USE NATURAL LANGUAGE GENERATION TECHNIQUES TO CREATE A SUMMARY.
 REFERENCES
M. Osborne. Using Maximum Entropy for Sentence Extraction. In ACL Workshop on Text
Summarization, (2002).

Fang Chen, Kesong Han and Guilin Chen, An Approach to sentence selection based text
summarization", Proceedings of IEEE TENCON 02, 489-493, 2002.

A. Kiani B and M. R. Akbarzadeh T, Automatic Text Summarization Using: Hybrid Fuzzy GA-
GP, IEEE International Conference on Fuzzy Systems, 16-21 July, Vancouver, BC, Canada, 977
-983, 2006.
THANK YOU
SUBMITTED BY

NILANJAN CHAKRABORTY(BE/6175/13)
ABHISHEK KUMAR(BE/6177/13)
ARKA PRABHO PRAMANIK(BE/6179/13)
AKASH RATAN(BE/6183/13)