An Algorithm for Summarization of Paragraph Up to One Third with the Help of Cue Words Comparison
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2014, Vol 5, Issue 5
Abstract
In the fast growing information era utility of technology are more precise than completing the assignment manually. The digital information technology creates a knowledge-based society with high-tech global economy which spreads over and influence the corporate and service sector to operate in more efficient and convenient way. Here an attempt was made on Extract Technology based on research. In this technology data could be refined and sourced with certainty and relevance. The application of artificial intelligence matched with the theories of machine learning would prove to be very effective. Sometime summarization of paragraph required rather than page or pages. So, Auto Summarization Model is an agnostic content summarization technology that automatically parses news, information, documents and many more into relevant and contextually accurate abbreviated summaries. This is a concept to convert a whole paragraph into one third. The Auto summarization technology reads a document, much better way than manually prepared, where, keywords and key phrases accurately weighted as they are found in the document, text or web page.
Authors and Affiliations
Noopur Srivastava, Bineet Gupta
Keywords
Related Articles
- EP ID EP126504
- DOI 10.14569/IJACSA.2014.050526
- Views 107
- Downloads 0
A New Algorithm for Data Compression Optimization
People tend to store a lot of files inside theirs storage. When the storage nears it limit, they then try to reduce those files size to minimum by using data compression software. In this paper we propose a new algorithm...
Solving the Free Clustered TSP Using a Memetic Algorithm
The free clustered travelling salesman problem (FCTSP) is an extension of the classical travelling salesman problem where the set of vertices is partitioned into clusters, and the task is to find a minimum cost Hamiltoni...
Efficient Algorithm for Maximal Clique Size Evaluation
A large dataset network is considered for computation of maximal clique size (MC). Additionally, its link with popular centrality metrics to decrease uncertainty and complexity and for finding influential points of any n...
SOHO: Information Security Awareness in the Aspect of Contingency Planning
This paper seeks to take general security awareness information for home and small business owners and make it understandable and accessible by looking at practical ways to keep valuable information accessible after an i...
CluSandra: A Framework and Algorithm for Data Stream Cluster Analysis
The clustering or partitioning of a dataset’s records into groups of similar records is an important aspect of knowledge discovery from datasets. A considerable amount of research has been applied to the identification o...