Abstract:
The present invention provides a method and system for extending content based on the semantic meaning of content. It divides content into multiple content regions and finds words and/or phrases that are semantically relevant to the current content region and appends these words and/or phrases to the current content region as extended content. The extended content matches semantically with the original content in such a seamless way that users may think it is a part of the content.

Description:
FIELD OF INVENTION 
       [0001]    The invention relates to the information processing field, more specifically, to method and system for extending content to enrich information and knowledge that users can consume. 
       BACKGROUND OF INVENTION 
       [0002]    The Internet, which is a worldwide network of interconnected networks and computers, makes available a wide variety of information through billions of hyperlinked “web page” to users. Among these masses of hard-linked content information, there is a tremendous amount of content-related information linkages that are missing and not explored due to the scale and intellectual complexity of finding such related information. 
         [0003]    Also, when users browse content pages, they are eager to find more information that is related to the content they are reading. In the web information age, that kind of extended and enriching information that is best matched to the original content is often beyond the original authors&#39; grasp. 
         [0004]    The current art relies on human editors to comprehend the content or computer programs to search through the content to find some words to add related information to the original content. 
         [0005]    There are at least two shortcomings in such a system, the first is that since the extending content is given simply corresponding to a whole document, while several subjects with different meaning exist in the whole document, there is no way to give the extending content respectively directed to these subjects. The second is since the extending content is given manually, the efficiency is low and the relevance is inaccurate. 
         [0006]    The purpose of this application is to solve the problem, in which the content is divided into content regions, and the extending keywords relevant to the content of a current content region are found based on semantic relevance. The extending information provided by the keywords which are seamless extending of the initial content in semantics and integrated with the content, is often beyond expectation for a content creator or a user. This will significantly serve to help or expand the user&#39;s understanding of the content. 
       SUMMARY OF THE INVENTION 
       [0007]    An object of the present invention is to provide a method for extending content, comprising: dividing the content into at least one of a plurality of content regions; calculating a vector for each of the content regions; calculating a relevance score between each of the vector of the content regions and each term vector in a terms vector table; for each of the content regions, selecting a group of extending terms from a group of terms in which the term vectors have the largest relevance scores with the vector of the content region; and rendering the group of extending terms around each of the content regions. 
         [0008]    Another object of the present invention is to provide a system for extending content, comprising: a dividing unit for dividing the content into at least one of a plurality of content regions; a vector calculation unit for calculating a vector for each of the content regions; a relevance score unit for calculating a relevance score between each of the vector of the content regions and each term vector in a terms vector table; an extending terms selection unit for each of the content regions, selecting a group of extending terms from a group of terms in which the term vectors have the largest relevance scores with the vector of the content region; a rendering unit for rendering the group of extending terms around each of the content regions. 
         [0009]    Still further object of the present invention is to provide a computer program comprising instructions that when executed cause a computer to perform operations comprising: dividing the content into at least one of a plurality of content regions; calculating a vector for each of the content regions; calculating a relevance score between each vector of the content regions and each term vector in a terms vector table; for each of the content regions, selecting a group of extending terms from a group of terms in which the term vectors have the largest relevance scores with the vector of the content region; rendering the group of extending terms around each of the content regions. 
     
    
     
       DESCRIPTION OF THE DRAWINGS 
         [0010]    The above content and the those with respect to other aspect, as well as the features and advantages of the particularly preferred embodiments of the present invention will be more apparent from the detailed description with reference to the drawings. Wherein: 
           [0011]      FIG. 1  illustrates terms representation and combination. 
           [0012]      FIG. 2  illustrates a term-document matrix. 
           [0013]      FIG. 3  illustrates the formula of reducing a high dimensional (r dimension) term space to a low dimensional (k dimension) term space. 
           [0014]      FIG. 4  illustrates a term vector table. 
           [0015]      FIG. 5  illustrates the projection relationship between terms and documents in a reduced space of two dimension. 
           [0016]      FIG. 6  illustrates how to composite a query vector based on a term vector table. 
           [0017]      FIG. 7  is a first embodiment according to the present invention; 
           [0018]      FIG. 8  is a flow chart  10  for implementing the embodiment shown in  FIG. 7 ; 
           [0019]      FIG. 9  is a second embodiment according to the present invention; 
           [0020]      FIG. 10  is a flow chart  20  for implementing the embodiment shown in  FIG. 9 ; 
           [0021]      FIG. 11  is a third embodiment according to the present invention; 
           [0022]      FIG. 12  is a flow chart  30  for implementing the embodiment shown in  FIG. 11 ; 
           [0023]      FIG. 13  is a fourth embodiment according to the present invention; 
           [0024]      FIG. 14  is a flow chart  40  for implementing the embodiment shown in  FIG. 13 ; 
           [0025]      FIG. 15  is a fifth embodiment according to the present invention; 
           [0026]      FIG. 16  is a flow chart  50  for implementing the embodiment shown in  FIG. 15 ; 
           [0027]      FIG. 17  is system diagram for implementing a system  100  of the embodiments of the present invention; 
       
    
    
       [0028]    In all the appended drawings, the same reference number shall be understood as the same unit, feature and structure. 
       DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT 
       [0029]    The content defined in the specification, such as the particular structure and unit, is used to help thoroughly understand the preferable embodiments of the present invention. Therefore, various changes and modifications can be made to the embodiments described in the invention according to the common techniques in the art without departing from the scope and spirit of the present invention. Therefore, for clarity and simplicity, the description of known functions and structures in the art is omitted. 
         [0030]    Those skilled in the art could utilize a large number of semantic search technologies in the art to easily construct term vectors and document vectors. Among them, the modeling method of the latent semantic indexing (LSI) is the most representative. In the following, the principle of the latent semantic indexing will be introduced, which does not exclude other methods of semantic search to be used with the present invention. 
         [0031]    A particular example will be described herein to explain the LSI more easily. Assuming that the documents consist of titles of 17 books. 
         [0032]    A particular example will be described herein to explain the LSI more easily. Assuming that the documents consist of titles of 17 books. 
         [0033]    In  FIG. 1 , the underlined words represent terms. Of course, for those skilled in the art, there are many other rules for selecting terms including increasing or reducing the number of the terms, and changing the manner of combination of the terms, etc. 
         [0034]      FIG. 2  is a 16×17 term-document matrix, which is referred to as A. Rows represent the terms, and columns represent the documents. The elements of the matrix are the number of occurrences of each term in a particular document. 
         [0035]    By way of singular value decomposition, the term-document matrix A is decomposed into a product form of three matrices, that is, 
         [0000]      A=UΣV T    (1) 
         [0036]    Wherein, Σ is the diagonal matrix of the singular values. 
         [0037]      FIG. 3  is a dimension reduction operation of LSI method. A higher-dimension (r-dimension) term space is reduced to a lower-dimension (k-dimension) term space. 
         [0038]    For illustration purpose, the value of k is selected as 2, which means that the original term space is reduced to a two-dimensional term space. The first two columns of matrix U representing the terms in two-dimensional space as the term vector table, is shown as  FIG. 4 . 
         [0039]    With these basic term vectors, new vectors can be composited according to 
         [0000]      v=q T U k Σ −1   k    (2) 
         [0040]    For example, document vector B i  and the query request entered by users can both be composited by analyzing the terms cited. It should be appreciated by those skilled in the art that the weight of a term vector may also be considered in compositing the vector. 
         [0041]      FIG. 5  plots the relationship of terms and documents in the two-dimensional space. The smaller the angle between term vectors or conversely, the larger the cosine value of the angle is, the larger the relevance score between two terms is. Taking the term “oscillation” as an example, its angle with “delay” is the smallest in all terms, which makes “delay” the most relevant one with “oscillation”. 
         [0042]    When a user enters a query expression, for example “application theory”, the system, by way of analyzing the two terms “application” and “theory” in the expression, composites two term vectors according to equation 2, as shown in  FIG. 6 , thereby obtaining a vector for the query expression. 
         [0043]    The cosine of the angle between each document vector and the query expression vector is computed, and the greater the cosine is the more relevant the document and the query expression are. 
         [0044]    The relevance score of a term and a document is represented by the cosine value of the angle between document vector and the query expression vector. For example, the cosine of the angle between the term “nonlinear” and the document vector of B 9  is the greatest, so the document most relevant to “nonlinear” is B 9 . 
         [0045]    In conjunction with the above principle, an term vector table can be obtained by performing the foregoing process with a sufficient number of available documents. The method to compute the document vector comprises of: extracting the terms in the document; finding the term vectors from the term vector table, and compositing these vectors into a document vector as shown in equation 2. The present invention is described based on the term vector table. 
         [0046]    Relevant references are as follows: 
         [0047]    1. M. W. Berry. S. T. Dumaiis &amp; G. W. O&#39;Brien. Using Linear Algebra Intelligent Information Retrieval. Computer Science Department CS-94-270 1994-12 
         [0048]    2. Ju Bin. The Research and Implementation of Latent Semantic Index in Chinese Language Information Search. Computer Engineering 2007-03 
         [0049]    3. Chen Yue, Guo Li. Latent Semantic Search and its Application. Information Search Techniques. Column 6, 2001. 
         [0050]    4. Michael W. Berry, Paul G. Young. Using latent semantic indexing for multilanguage information retrieval. Volume 29, Number 6/1995-12 
         [0051]      FIG. 7  is a first embodiment according to the present invention. In the embodiment, the document  1  has two paragraphs, p 11  and p 12  that are divided into two content regions. Each content region has extending keywords e 11  and e 12  rendered nearby respectively. 
         [0052]      FIG. 8  is a flow chart  10  for implementing the embodiment shown in  FIG. 7 . In Step  11 , the document  1  is divided into two content regions a11 and a12 according to paragraphs. In Step  12 , each vector of the content regions is calculated as v(a11) and v(a12). In Step  13 , the relevance score between each vector of content regions and each vector in the term vector table is calculated. The relevance score refers to the angle or cosine between the vectors. In Step  14 , number of terms for example 4 terms (not limited to this number), which have the highest relevance score, are selected as the extending keywords of the corresponding content region. In the example, two groups of extending keywords are “nokia|motorola|research in motion|msft”, “cell-phone|smart phone|computer maker|consumer electronics”, respectively. Each extending keyword is separated by a special symbol, such as “|”. In step  15 , when the content is requested for rendering, the extending keywords are rendered around the corresponding content region. 
         [0053]      FIG. 9  is a second embodiment according to the present invention. In the embodiment, the document  2  has six passages, p 21 -p 26  that are divided into three content regions, a21-a23, respectively. Wherein, a21 includes p 21 -p 22 , a22 includes p 23 -p 25 , and a23 includes p 26 . Each content region has extending keywords e 21 , e 22  and e 23  rendered nearby respectively. 
         [0054]      FIG. 10  is a flow chart  20  for implementing the embodiment shown in  FIG. 9 . The content in the embodiment is document  2  that has six paragraphs. In Step  21 , the vectors v (p 21 ) to v (p 26 ) of passages p 21 -p 26  of the document  2  are calculated. Starting from the first vector v (p 21 ), the relevance score between the vector of the current paragraph and the vector of the next paragraph is calculated. If the relevance score is greater than a certain threshold, which means two paragraphs have the almost same semantic meaning, then the paragraph remains in the same content region, for example, among these paragraphs (p 21 , p 22 ), (p 23 , p 24 , p 25 ), (p 26 ), the relevance scores of the vectors of adjacent paragraphs are greater than the threshold, therefore the three group of paragraphs remain in the same content regions, as a21=(p 21 , p 22 ), a22=(p 23 , p 24 , p 25 ), a23=(p 26 ), respectively. In Step  22 , the vectors of each content region are calculated, v(a21)-v(a23), respectively. In Step  23 , the relevance score between the vector of each content region and each vector in the term vector table is calculated. The relevance score refers to the angle or cosine between the vectors. In Step  24 , following in order of relevance, the relevant terms are compared in turn to see whether they appear in the corresponding content region or not, and if so, then not taking them as the extending keywords, and thus finally obtaining N extending keywords, for example 4 (not limited to this number). Each extending keyword is separated by a special symbol, such as “|”. Certainly, the above comparison with the content region can be changed to comparison with whole document, and this can be readily realized for those skilled in the art. In step  25 , when the content is requested to render, the extending keywords are rendered around the corresponding content region. 
         [0055]      FIG. 11  is a third embodiment according to the present invention. In the embodiment, there is a document  3  has eight paragraphs, p 31 -p 38  that are divided into three content regions, a31-a33, respectively. Wherein, a31 includes p 31 -p 32 , a32 includes p 33 -p 35 , and a33 includes p 36 -p 38 . Each content region has extending keywords e 31 , e 32  and e 33  rendered nearby respectively. 
         [0056]      FIG. 12  is a flow chart  30  for implementing the embodiment shown in  FIG. 11 . The content in the embodiment is document  3  that includes eight paragraphs. In Step  31 , starting from the initial paragraph p 31 , several adjacent paragraphs are assigned into the same content region, so that the word number of each content region is greater than or equal to a preset threshold, such as 300 words, but the word number must also remain smaller than the preset threshold when the word number of the last paragraph in the content region is subtracted. For example, the total word number of paragraphs p 31 -p 33  is greater than 300, but smaller than 300 if the word number of the last paragraph p 33  is subtracted. According to this mode, there are three content regions, a31=(p 31 , p 32 ), a32=(p 33 , p 34 , p 35 ), a33=(p 36 , p 37 , p 38 ), respectively. In Step  32 , the vectors of each content region are calculated, v (a31)-v (a33), respectively. In Step  33 , the relevance score between the vector of each content region and each term vector in the term vector table is calculated. The relevance score refers to the angle or cosine between the vectors. In Step  34 , following in order of the relevance, the relevant terms are compared in turn to see whether they appear in the whole document or the extending keywords of previous content region or not, and if so, then not taking them as the extending keywords, and thus finally obtaining N extending keywords. For example 4 (but not limited to this number). Each extending keyword is separated by a special symbol such as “|”. Certainly, the above comparison with whole document is changed to comparison with a corresponding content region, and this can be readily realized for those skilled in the art. In step  35 , when the content is requested to render, the extending keywords are rendered around the corresponding content region. 
         [0057]      FIG. 13  is a fourth embodiment according to the present invention. In the embodiment, there is a content including two paragraphs, p 41 -p 42 , respectively, and an audio file. The paragraphs each have extending keywords e 41  and e 42  rendered nearby respectively. The audio file has also extending keywords e 43  rendered nearby respectively. 
         [0058]      FIG. 14  is a flow chart  40  for implementing the embodiment shown in  FIG. 13 . The content in the embodiment is a document  4  that has two paragraphs of textual content and an audio file. In Step  41 , the textual content in the document  4  is divided according to paragraphs, thereby obtaining two content regions, a41 and a42, respectively, and the audio file therein is determined to be a separate content region. In Step  42 , the vectors of each textual content region are calculated, v(a41) and v (a42) respectively. For the audio file, it uses the speech-to-text technique in the arts to convert the audio file to the corresponding text, then calculate the vector of the converted text as the vector of the content that is the audio file. If the audio file therein is replaced by an video file, then the audio part in the video file is converted into an audio text by means of the speech-to-text technique, and/or the caption in the video file is converted into a caption text by an optical-character recognition function readily available in the arts, and then the vector of the audio text and/or caption text is calculated as the vector of the video file. In addition, for a video containing a caption stream, the caption stream can be converted into a caption text directly by the existing techniques, and then the vector is calculated through the above method. Moreover, if the content includes pictures, then characters in the pictures are converted into a text by the optical character recognition function, and then the vector of the text is calculated as the vector of the pictures. In Step  43 , the relevance score between the vector of each content region and each vector in the term vector table is calculated. Wherein, the relevance score refers to the angle or the cosine between the vectors. In Step  44 , a number of terms therein, for example 4 terms (but not limited to this number), which have the highest relevance score, are selected as the extending keywords of the corresponding content region. In step  45 , when the content is requested to render, the extending keywords are rendered around the corresponding content region. 
         [0059]      FIG. 15  is a fifth embodiment according to the present invention. In the embodiment, there is a content including two paragraphs, p 51  to p 52 , respectively, and a Hyperlink, which points to another file. The paragraphs each have extending keywords e 51  and e 52  rendered nearby respectively. The Hyperlink also has extending keywords e 53  rendered nearby respectively. 
         [0060]      FIG. 16  is a flow chart  50  for implementing the embodiment shown in  FIG. 15 . The content in the embodiment is a document  5  that has two paragraphs of textual content and a Hyperlink. In Step  51 , the textual content in the document  5  is divided according to paragraph, thereby obtaining two content regions, a51 and a52 respectively, and the Hyperlink therein is determined to be a separate content region. In Step  52 , the vectors of each content region are calculated, v(a51) and v(a52), respectively. For the Hyperlink, the vector of the content is calculated as the vector of the content to which the Hyperlink points. Namely, the non-textual content in the linked document is retrieved and converted into the textual content in similar fashion to the fourth embodiment, and the textual content are composited to calculate the vector of the content region. In Step  53 , the relevance score between the vector of each content region and each vector in the term vector table is calculated. The relevance score refers to the angle or cosine between the vectors. In Step  54 , number of terms, for example 4 terms (but not limited to this number), which have the highest relevance score, are selected as the extending keywords of the corresponding content region. In step  55 , when the content is requested for rendering, the extending keywords are rendered around the corresponding content region. 
         [0061]      FIG. 17  is structural diagram of implementing a system  100  of the embodiments of the present invention. The system comprises: a content dividing unit  101 , a non-textual content recognition unit  102 , a vector calculation unit  109 , a relevance score unit  106 , an extending terms selection unit  107 , a rendering unit  108 , a term vector table  110 . The non-textual content recognition unit  102  comprises: an OCR unit  103 , a speech-to-text unit  104  and a hyperlink textual content retrieval unit  105 . 
         [0062]    The content dividing unit  101  is used to divide the content, and it calculates the paragraph and the content region vectors through the vector calculation unit  109 . If some content regions have non-textual content after dividing, for example audio, video, picture or Hyperlink, then it submits these content to the non-textual content recognition unit  102 , and the non-textural content are converted into textual content by a corresponding function unit, and sent to the vector calculation unit  109  to get the corresponding vector of content region. In addition, for the textual content, it is sent directly to the vector calculation unit  109  by the content dividing unit  101 . According to the received document and the term vector table  110 , the vector calculation unit  109  calculates the vector of the content region according to the existing semantic search techniques. The relevance score unit  106  is also used to calculate the relevance score between the vector to be compared and the term vector in the term vector table  110 , for example calculating the angle or cosine between the vectors. The relevance score unit  106  sends the comparing results to the extending terms selection unit  107 , and the extending keywords are determined by the extending terms selection unit  107 . The rendering unit  108  renders the extending keywords around the corresponding content region. 
         [0063]    Although the present invention has been described in conjunction with some particular preferred embodiments, it will be apparent to those skilled in the art that variations and modifications to the embodiments may be made without departing from the spirit of the invention and the scope defined by the claims and their equivalents.