| 摘要 |
<p>The invention relates to a method for finding an optimal set of k sentences that summarize an article of n sentences, which comprises the steps of (a) defining a sentence vector S=(S 1 ,....,S n ) which relates to all the sentences in the article; (b) defining a terms vector T=(T 1 )...., T m ) which relates to all the terms in the article! (c) preparing a sentence-term matrix which defines the number of appearances of each term T j within each sentence Si, (d) representing each sentence as a hyperplane which divides a space to lower and upper half-spaces, and each intersection of several hyperplanes represents a summary which comprises said several sentences respectively; (e) defining a polytope P as a body which is formed from a plurality of hypersurfaces representing sentences! and (f) defining an objective function on said polytope, and finding a point on a surface of said polytope having an optimal value of said objective function, sentences that are closest to that point are added to a summary in a greedy manner, until the maximal predefined summary length is reached.</p> |
