Patent Document ID: 7783640
Application ID: 11647871
Patent Status: 1

Claim One:
1. A machine-readable medium having stored thereon machine-executable instructions that when executed by a machine cause the machine to perform a method, the method comprising: computing a term score for a member of a set of terms in a document to be summarized, where the term score is computed according to: 
 S ( t )=( a−b ( sf t /N−c ) 2 )* f ( ng ) S(t) being the term score; a, b, and c being pre-determined, configurable constants; sf t being the number of sentences in which term t occurs; N being the total number of sentences; and f(ng) being a function that returns a penalizing value for terms having a single uni-gram, a linearly increasing value for terms having two to four uni-grams, and a constant value for terms having more than four uni-grams; computing a sentence score for a member of a set of sentences in the document; computing a set of entries for a term-sentence matrix that relates members of the set of terms to members of the set of sentences, a sentence containing one or more terms, a term appearing in one or more sentences; computing a dominant topic for the document by computing a term eigenvector, where a member of the term eigenvector represents a relevancy of a term to the dominant topic, and by computing a sentence eigenvector, where a member of the sentence eigenvector represents a relevancy of a sentence to the dominant topic; simultaneously ranking the set of terms and the set of sentences based, at least in part, on the dominant topic; and providing a summarization item selected from one or more of, the set of terms, and the set of sentences, the summarization item being selected based, at least in part, on one or more of, a ranking of the set of terms, and a ranking of the set of sentences, where the term score and sentence score are computed in parallel while computing the set of entries for the term-sentence matrix.