Type

Text

Type

Thesis

Advisor

Ramakrishnan, IV | Fodor, Paul | Borodin, Yevgen.

Date

2016-12-01

Keywords

Natural Language Processing, Skimming | Computer science

Department

Department of Computer Science

Language

en_US

Source

This work is sponsored by the Stony Brook University Graduate School in compliance with the requirements for completion of degree.

Identifier

http://hdl.handle.net/11401/77251

Publisher

The Graduate School, Stony Brook University: Stony Brook, NY.

Format

application/pdf

Abstract

This paper is an attempt at describing the priority of skimming in enhancing the lives of the visually impaired and dyslexic. The paper distinguishes summarization from skimming. It speaks of skimming a given blob of text. And with it, arises some unique challenges. So, the paper tries to tackle these challenges by enhancing and speeding up the algorithm. The algorithm breaks down the input into smaller and compact skimmed results, which when used as the input to the algorithm completely fastens the algorithm with a tremendous decrease in run time. The ways of creating the compact skimmed version of the text are described in the paper, at the same time comparing and contrasting the differences between those ways. The paper finally describes the fastest algorithm, its origin and the way to derive the shortest skimmed version to input to the final algorithm. | 23 pages

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.