Source: http://www.google.com/patents/US20030140309?dq=5,915,131
Timestamp: 2017-07-25 19:55:08
Document Index: 793077136

Matched Legal Cases: ['art 13', 'art 13', 'art 13', 'art 13', 'art 13', 'art 13', 'art 13', 'art 13', 'art 33', 'art 13', 'art 13', 'art 13', 'art 13', 'art 13', 'art 13', 'art 13', 'art 11', 'art 31', 'art 11', 'art 11', 'art 12', 'art 11', 'art 21', 'art 22', 'art 23', 'art 11', 'art 25', 'art 25', 'art 24', 'art 24', 'art 24', 'art 24', 'art 24', 'art 24', 'art 24', 'art 24', 'art 24', 'art 24', 'art 24', 'art 24', 'art 24', 'art 24', 'art 24', 'art 24', 'art 24', 'art 24', 'art 32', 'art 24', 'art 32', 'art 24', 'art 24', 'art 24', 'art 24', 'art 24', 'art 24', 'art 24', 'art 24', 'art 24', 'art 24', 'art 32', 'art 24', 'art 32', 'art 24', 'art 32', 'art 25', 'art 24', 'art 25', 'art 24', 'art 24', 'art 23', 'art 23', 'art 23', 'art 23', 'art 13', 'art 13', 'art 13', 'art 13', 'art 13', 'art 13', 'art 13']

Patent US20030140309 - Information processing apparatus, information processing method, storage ... - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inPatentsAn information processing apparatus is disclosed that presents related information about existing document information and about specific document information. The apparatus includes: an extracting element for extracting first and second characteristic words from respective existing and specific document...http://www.google.com/patents/US20030140309?utm_source=gb-gplus-sharePatent US20030140309 - Information processing apparatus, information processing method, storage medium, and programAdvanced Patent SearchTry the new Google Patents, with machine-classified Google Scholar results, and Japanese and South Korean patents.Publication numberUS20030140309 A1Publication typeApplicationApplication numberUS 10/316,762Publication dateJul 24, 2003Filing dateDec 12, 2002Priority dateDec 13, 2001Also published asUS7289982Publication number10316762, 316762, US 2003/0140309 A1, US 2003/140309 A1, US 20030140309 A1, US 20030140309A1, US 2003140309 A1, US 2003140309A1, US-A1-20030140309, US-A1-2003140309, US2003/0140309A1, US2003/140309A1, US20030140309 A1, US20030140309A1, US2003140309 A1, US2003140309A1InventorsMari Saito, Noriyuki YamamotoOriginal AssigneeMari Saito, Noriyuki YamamotoExport CitationBiBTeX, EndNote, RefManPatent Citations (18), Referenced by (95), Classifications (14), Legal Events (3) External Links: USPTO, USPTO Assignment, EspacenetInformation processing apparatus, information processing method, storage medium, and program
[0159] If the action of the mailer 2 in step S37 is the reception of an e-mail, the agent controlling part 13 changes the initial part of the speech like this: “I see you have just received an e-mail from Mr./Ms. A.” If the action of the mailer 2 is the editing of an e-mail, the initial part of the speech is changed to something like this: “I see you are writing an e-mail to Mr./Ms. A.” That part of the speech which is given as, “You talked to Mr./Ms. A about (a particular title) on (a specific date in the past), didn't you?” represents the reason why the related information has been selected (i.e., recommended). Alternatively, the reason for selecting the related information may not be displayed in step S39. Instead, the reason may be displayed after the processing of step S42 (i.e., display of related information), to be described later. It is also possible to display the reason for selecting the related information at any time desired by the user (e.g., where arrangements are made to provide a “reason is . . . ” command in the menu). [0160] When the elapsed time based on the timer 31A is presented (i.e., periodically), the agent's speech giving the chronological information should not refer directly to a specific event like this: “I see you have just received an e-mail from Mr./Ms. A.” Instead, the wording should be such as to merely touch on the date like this: “you talked to Mr./Ms. A on (a particular date) about (a specific title).” The balloon 73 may be displayed either before or after the related information is presented. [0161] Adjacent to the balloon 73 appears the input window 81 as illustrated in FIG. 14, for example. The input window 81, as shown in FIG. 15, includes three buttons: a “view” button selected to designate display of related information; a “don't view” button used to suppress display of related information; and a “give me background again” button operated to specify a repeated display of the background (i.e., the reason) against which the related information has been selected. [0162] In step S40, with the input window 81 on display, the agent controlling part 13 shifts display of the agent 72 to a moving image in standby mode shown in FIG. 14. In step S41 (corresponding to step S17 in FIG. 5), the agent program 1 determines which of the three buttons, “view,” “don't view” and “give me background again” in the input window 81, has been selected by the user. Display of the input window 81 is optional. [0163] If in step S41 the “view” button is judged to be selected inside the input window 81, then step S42 is reached. In step S42 (corresponding to step S18 in FIG. 5), the agent controlling part 13 displays recommended URLs 91 as related information, as shown in FIGS. 16 and 17. The agent controlling part 13 further shifts display of the agent 72 to a moving image pointing to the recommended URLs 91 on display, and causes a speech “How about that?” to appear in the balloon 73. The recommended URLs 91 are usually represented by the titles of the recommended Web pages. Only when a mouse cursor is placed on any of the recommended URLs 91, does the URL of interest appear in overlapping fashion. The recommended URLs may be relocated when dragged by use of the mouse cursor. [0164] In step S43 (corresponding to step S19 in FIG. 5), the agent program 1 detects the command entered by the user with regard to the recommended URLs 91 on display. One of three commands may be entered: one for recording, another for access, and another for erasure. [0165] The command for recording any of the recommended URLs 91 is executed illustratively by drag-and-dropping the desired URL recommended into the scrapbook window 74, or by right-clicking the mouse on the URL in question and selecting “record” from the displayed menu. Alternatively, all recommended URLs 91 may be automatically recorded. The access or erasure command is similarly executed, by drag-and-dropping the desired URL onto the icon of the WWW browser or into the recycle bin, by right-clicking the mouse on the URL and selecting the relevant command from the displayed menu, or by having the recommended URLs rendered clickable. [0166] If the command detected in step S43 is one for recording any of the recommended URLs 91, then step S44 is reached (corresponding to step S21 in FIG. 5). In step S44, the agent controlling part 13 shifts display of the agent 72 to a nodding image as shown in FIG. 18, for example. At this point, the title of the Web page corresponding to the recommended URL 91 selected for recording is added into the scrapbook window 74. [0167] If the command detected in step S43 is one for access to any of the recommended URLs 91, then step S44 is reached (this time the step corresponds to step S20 in FIG. 5). In step S44, the agent controlling part 13 shifts display of the agent 72 to a joyful image full of smiles as shown in FIGS. 19A and 19B. The balloon 73 displays a speech “Okay!” and a corresponding sound signal is output. [0168] If the command detected in step S43 is one for erasure to any of the recommended URLs 91, step S44 is reached in which the agent controlling part 13 displays a sad, disappointed image of the agent 72 with a crying face as shown in FIGS. 20A and 20B. The balloon 73 displays a speech “I'm rejected!” and a corresponding sound signal is output. [0169] After the action of step S44 is completed, control is returned to step S32. The subsequent steps are then repeated. [0170] If in step S41 the “don't view” button is judged to be selected inside the input window 81, then step S32 is reached again and the subsequent steps are repeated. If in step S41 the “give me background again” button is judged operated, control is returned to step S39, and steps S39 through S41 are repeated. [0171] If in step S38 the mailer 2 is judged to be terminated, then step S45 is reached. In step S45, the agent controlling part 13 displays a speech “Oh, no!” in the balloon 73 and outputs a corresponding sound signal. Step S45 is followed by step S46 in which the agent 72 is made to disappear (in a manner described later by referring to FIGS. 25A and 25B). [0172] If the command entered in step S35 is judged to be one for editing related information, then step S47 is reached. In step S47, the related information presenting part 33 displays a related information editing window (not shown). The agent controlling part 13 shifts display of the agent 72 from the standby state of FIG. 18 to the image pointing to the window, the same as in the example of FIG. 17. When the user later starts making edit input to the related information editing window, step S48 is reached in which the agent controlling part 13 shifts display of the agent 72 from the window-pointing image to the moving image showing the agent 72 at work as indicated in FIG. 13. [0173] In step S49, the agent program 1 checks to see whether the related information editing process is still in progress. The check is repeated until the editing process is judged terminated. More specifically, until the related information editing process is stopped, the agent controlling part 13 maintains the “at-work” image of the agent 72 shown in FIG. 13. [0174] If in step S49 the related information editing process is not judged to be in progress, i.e., if the process is found terminated after getting started in response to the edit command entered, then step S50 is reached. [0175] In step S50, the agent controlling part 13 shifts display of the agent 72 to the nodding image shown in FIG. 18. The balloon 73 displays a speech “I made the changes” and a corresponding sound signal is output. Step S50 is followed by step S32, and the subsequent steps are repeated. [0176] If in step S34 no command is judged to be entered by the user into the mailer 2 longer than a predetermined period of time, step S51 is reached. In step S51, the agent controlling part 13 carries out a standby process in displaying the agent 72. In this step, the agent's image is shifted in a loop from a moving to a playing to a sleeping state at predetermined intervals. The standby process of step S51, of which detailed steps are performed by the agent controlling part 13, is described below by referring to the flowchart of FIG. 8. [0177] In step S61 of FIG. 8, display of the agent 72 is shifted from the standby state of FIG. 12 to a moving state represented by the moving images in FIGS. 21A through D or in FIGS. 22A through 22G, for example. [0178] The agent 72 is moved horizontally or vertically on the desktop in a manner not overlapping with the currently displayed window. Alternatively, an active window (i.e., mailer window 71 in this case) may be detected and the agent 72 may be moved around the detected window horizontally or vertically. If the agent 72 is arranged to move horizontally (e.g., rightward) on the desktop, images such as those in FIGS. 21A through 21D are displayed successively to bring about the effect of the agent executing something like a “warp” motion. [0179] More specifically, at the start position of its warp motion, the agent 72 faces the direction in which it is about to warp, as shown in FIG. 21A. Upon executing a warp, the agent 72 disappears gradually from the head down as indicated in FIG. 21B. At the end position of its movement, the agent 72 appears gradually from its feet up. Eventually the agent 72 appears in its entirety as shown in FIG. 21D. [0180] When the agent 72 is moved vertically on the desktop, the images shown in FIGS. 22A through 22G are displayed successively to form the apparent movement. More specifically, at the start position of its vertical motion, the agent 72 grips its own tail (the tip is shaped like a cord plug) by hand as shown in FIG. 22A. The agent 72 is then shown inserting the tip of its tail into something overhead as indicated in FIG. 22B. [0181] Thereafter the agent 72 metamorphoses into a rope starting from its feed as shown in FIGS. 22C and 22D. In FIG. 22E, the agent 72 as a whole turns into a single rope that is moved toward the end position of the agent's move. At the end of the movement, the entire agent 72 is reconstituted successively from its head down as shown in FIGS. 22F and 22G. [0182] Where the movement of the agent 72 is expressed in the so-called warp or as the metamorphosis into a rope, there is a distinctive benefit: fewer resources (e.g., memory locations) are needed to express the agent in motion. [0183] Returning to FIG. 8 and in step S62, a check is made to see whether or not an event has occurred (i.e., input of a command for sending or receiving an e-mail or a command for editing an e-mail or related information). If no event is detected, step S63 is reached. [0184] In step S63, a check is made to see whether or not a predetermined period of time has elapsed following transition of the agent 72 into the state of movement. Steps S62 and S63 are repeated until the predetermined time period is judged to have elapsed. When the predetermined time period is found to have elapsed in step S63, step S64 is reached. [0185] In step S64, display of the agent 72 is shifted from the moving state to a playing state expressed by the images in FIGS. 23A and 23B. FIG. 23A shows the agent 72 playing with a snake, and FIG. 23B shows the agent 72 plugging the tip of its tail into something overhead and swinging therefrom. [0186] In step S65, a check is made to see whether or not an event has occurred. If no event is detected, step S66 is reached. In step S66, a check is made to see whether or not a predetermined period of time has elapsed following transition of the agent 72 into the playing state. Steps S65 and S66 are repeated until the predetermined time period is judged to have elapsed. When the fixed time period is found to have elapsed in step S66, step S67 is reached. [0187] In step S67, display of the agent 72 is shifted from the playing state to a sleeping state expressed by the image in FIG. 24. In step S68, a check is made to see if an event has occurred. The check is repeated until an event is detected. When an event is detected in step S68, control is returned to step S35 in FIG. 7 and the subsequent steps are repeated. [0188] When an event is detected in step S62 or in step S65, control is also returned to step S35 in FIG. 7 and the subsequent steps are repeated. [0189] Although not shown in the flowchart of FIG. 8, the mailer 2 could be judged to be terminated while the standby process is still underway. In that case, control is returned to step S46. Similarly, if the mailer 2 is judged terminated in step S33 of FIG. 7, then step S46 is reached. [0190] In step S46 of FIG. 7, the agent controlling part 13 shifts display of the agent 72 to a disappearing state expressed by the images in FIGS. 25A and 25B, for example. FIG. 25A shows the agent 72 walking away, waving and turning its back on the user. FIG. 25B shows the agent 72 getting smaller and eventually disappearing. [0191] When the agent 72 has disappeared, the balloon 73, scrapbook window 74 and recommended URLs 91 are also erased from the desktop. [0192] According to the invention, as described, heavily weighted words (i.e., keywords) are extracted from documents such as e-mails and processed so that information related to these words is recommended to the user in synchronism with the agent 72 in motion. The user is thus expected to experience confidence in and attachment to the agent 72 on display. [0193] The actions of the agent 72 and its speeches in the balloon 73 may be implemented and sound signals corresponding to the speeches output not only by the agent program 1 of this invention but also by diverse application programs constituting illustratively the help screens of games and word processor programs. The invention can also be applied to character images that appear on the displays of such devices as TV sets, camcorders and car navigation systems, and so forth. [0194] Where a plurality of users operate the same personal computer, multiple agents 72 may be provided to have each user assigned his or her own agent 72 (see FIG. 26). The agent 72 may be created or edited as desired by the user. If the same user utilizes the agent program 1 on a plurality of personal computers, the same agent 72 may be arranged to appear on each of the different personal computers. [0195] In the foregoing description, the agent 72 was shown appearing continuously during execution of the agent program 1. Alternatively, the agent 72 may be displayed only upon recommendation of related information or otherwise changed in its behavior as desired. [0196] For example, with the agent program 1 in execution, the user may right-click the mouse to display a menu box 101 such as one shown in FIG. 26. From the menu box 101, the user may select the “Make settings” item to display a setting screen shown in FIG. 27. [0197] The typical setting screen of FIG. 27 includes a plurality of tabs including one named “agent.” Making the “agent” tab active displays items that may be selected or input by the user, such as the agent's name, display status, sound effects, recommending interval, number of recommendations in storage, activation/deactivation of audio speech output upon recommendation, and recommended data refresh status. [0198] The user may input desired information (e.g., agent's name) or may select necessary items on the setting screen. Display status of the agent 72 and balloon 73, the interval for recommending related information, the number of preserved recommendations, and other settings are thus established as desired by the user. [0199] When to update the database with the storing part 11 will now be described. The database is created by the database creating process discussed above with reference to the flowchart of FIG. 3. After its creation, the database needs to be updated in one of the following three cases: [0200] First, the database needs to be updated when a predetermined period of time has elapsed following the creation or the most recent update of the database. The obvious reason for this is that the related information in the database may well have been outdated and largely irrelevant by then. Second, the database needs to be updated when more than a predetermined portion of the related information therein has been presented to the user. That is when some of the related information starts getting presented repeatedly or relevant information for presentation is getting scarce. Third, the database needs to be updated when e-mails furnishing the documents from which to extract keywords have been exchanged so many times that the contents of the documents have been changed significantly. [0201] In the event that the database needs to be updated (e.g., when a predetermined time period has elapsed on the timer 31A monitored by the event managing part 31), either the user may be prompted to issue an update command or the database may be automatically updated without the user's intervention. It is also possible for the user to update the database at any time desired. [0202] A database updating process to be carried out in any of the three cases above requiring the update is described below with reference to the flowchart of FIG. 28. The database updating process, one of the processes executed by the agent program 1, is started concurrently with execution of the program 1 and repeated until the program 1 is terminated. It is assumed that prior to execution of this process, the database creating process of FIG. 3 has been carried out so that the database is already in place. [0203] In step S81 of FIG. 28, the storing part 11 of the agent program 1 judges whether or not the current database needs to be updated. The step is repeated until the database is judged to be in need of updating. The criterion for the judgment may be established in advance by the user on a user interface screen such as one shown in FIG. 29. The example of FIG. 29 presents four criteria represented by check boxes in the leftmost position on the screen. Any one of the check boxes may be checked by the user to make the corresponding criterion effective for the judgment. The first criterion is shown allowing the user to set the number of URLs that may be viewed before an update. The third criterion allows the user to set the update interval in terms of days. [0204] If in step S81 the database is judged to be in need of updating, step S82 is reached. In step S82, the storing part 11 judges whether or not the database is set to be updated automatically. If the database is not judged to be set for automatic update, step S83 is reached. If in step S82 the database is judged to be set for automatic update, step S83 is skipped. [0205] In step S83, the presenting part 12 of the agent program 1 notifies the user of the need for a database update and checks to see whether or not the user has given an update command in response to the notice. If the user is judged to have issued the update command in step S83, step S84 is reached. If no update command is judged to be issued by the user in step S83, control is returned to step S81 and the subsequent steps are repeated. [0206] In step S84, the storing part 11 of the agent program 1 proceeds to update the database. More specifically, the document acquiring part 21, document attribute processing part 22 and document content processing part 23 in the storing part 11 check the mailbox file that accommodates e-mails (i.e., this file is most often furnished with an extension “mbx”) to obtain the most recent date of update. That date is compared with the previously acquired update date. If the comparison reveals that the mailbox file carries a more recent date than the preceding update and has a different file size from the preceding size, that means the file has been updated. In that case, any changes that have since been made to the file are extracted. The additions to or the modifications in the file when extracted are subjected to classification into mail groups, to mail header analysis, morphological analysis, and calculation of characteristic vectors. The keywords derived from these analyses are supplied to the related information searching part 25. [0207] It might happen that the mail groups (topics) remain unchanged (i.e., no new mail has been added to any topic) and that the keywords remain the same before and after the update following the analyses. in that case, only the calculated values such as weights may be changed without a search for related information by the related information searching part 25. Before a search for related information is attempted on the Internet, a logon check is carried out. If the check indicates that connection has yet to be established with the Internet, then the search for related information may be suppressed. In such a case, the user may be asked whether or not to search for related information at a subsequent connection to the network. [0208] One of the above-mentioned criteria for the update judgment stipulates that in order to avoid presenting (i.e., recommending) related information repeatedly, the database should be updated after the related information for a given mail group has been recommended a predetermined number of times. The criterion is enforced illustratively by averting repeated recommendation of related information about the mail group (topic) found to have a high similarity to the acquired mail. The process is carried out typically as follows: [0209] The mail groups are assigned their priorities for recommendation. For example, the maximum weight of the characteristic word within each mail group is regarded as representative of the priority value for that group, and the mail groups are queued in descending order of their recommendation priorities. Any mail group, for which related information is recommended once, is brought to the tail of the priority queue. This makes it possible to reduce the frequency with which any one of the mail groups within a given range of similarities is selected repeatedly for recommendation. Since what is changed is only the priority queue, it may be preferred to search for and acquire large quantities of related information beforehand so as to minimize the probability of repeated recommendation from the same mail group while ensuring a sufficient amount of information available. [0210] In this context, the range of similarities may be varied depending on the amount of documents that fall under the topic used for extraction of characteristics. More specifically, several ranges of similarities may be established depending on the amount of documents or on the data size within a given topic for characteristic extraction. Illustratively, if the amount of documents that fall under a given topic is 10 files or less, the similarity may be set to 0.01 or higher; if the amount is 11 or more and less than 50, the similarity may be 0.03 or higher; if the amount of 50 files or more, the similarity may be 0.05 or higher. If the data size of documents within a given topic is less than 500 KB, the similarity may be set to 0.01 or higher; if the data size is 500 KB or greater, the similarity may be 0.02 or higher. [0211] With a desired range of similarities determined in advance, related information is acquired for presentation following the search through topics in descending order of their priorities. This scheme prevents both shortages and an overflow of related information from the user's viewpoint. What is averted specifically is the situation where the range of similarities becomes too narrow to provide enough related information or too broad to furnish meaningful information to the user, as the amount of available documents diminishes and the database is updated in content. [0212] As described, the database updating process deals only with the newly added or modified documents. This translates into a reduced processing time compared with conventional cases where the database creating process is repeatedly carried out. [0213] During the database updating process, the calculated weights of words are modified to reflect the user's interest. Some examples of the weight modification are described below following an example, with reference to FIG. 30, of the characteristic vectors of topics stored in the database. [0214] As shown in FIG. 30, the characteristic vector of a topic A (formed by the weights of words “a”, “b”, “c”, “d”, “e”, “f” and “g”) is (0, 0.54, 0.02, 0, 0, 0.01, 0); the characteristic vector of a topic B is (0.01, 0, 0.41, 0.33, 0.16, 0, 0.64); and the characteristic vector of a topic C is (0.51, 0.35, 0, 0, 0.48, 0.37, 0). [0215] How to modify the weights of the words included in each topic (topics A, B and C) in FIG. 30 will now be described in three consecutive examples below. [0216] The first example of the weight modifying process is described below by referring to the flowchart of FIG. 31. In step S101 of FIG. 31, the document characteristic database creating part 24 counts the number of times the mail (including the return mail) is sent to each of different e-mail destinations. In step S102, the destinations are sorted in the descending order of transmission frequency. The number of times the mail is received may optionally be added to the transmission count. [0217] Suppose that the mail is exchanged with Messrs./Mses. A, B, C, and D and that the mail exchange count is 35 for Mr./Ms. A, 2 for Mr./Ms. B, 28 for Mr./Ms. C, and 4 for Mr./Ms. D. In that case, the mail destinations are sorted in descending order of their mail exchange counts, i.e., into Messrs./Mses. A, C, D and B, in that order. [0218] In step S103, the document characteristic database creating part 24 extracts the destinations with high mail exchange frequencies following the sorting in step S102. [0219] More specifically, the mail destinations are extracted according to any one of suitable methods. By one method, a predetermined number “n” (e.g., n=2) of destinations with the highest frequencies are selected; by another method, the destinations each having a mail exchange count of at least a predetermined number “m” (e.g., m=10) are selected; or the destinations are selected by the combination of these two methods (i.e., top “n” destinations with the highest frequencies, each having a mail exchange count of at least “m”). Extraction of the mail destinations can indeed be based on whatever method is deemed appropriate. [0220] Illustratively, if the top two destinations with the highest mail exchange frequencies are to be selected, Messrs./Mses. A and C are extracted from the four parties listed in FIG. 32. [0221] In step S104, the document characteristic database creating part 24 modifies the weight of each of the words included in the mails (topic) exchanged with the destinations extracted in step S103. [0222] If the mails exchanged with Mr./Ms. A and Mr./Ms. C touch on the topic A, the words included in that topic are “b”, “c” and “f” as indicated in FIG. 31. (Since the words “a”, “d”, “e” and “g” have zero weight each, these words are excluded from the topic A.) Then the words “b”, “c” and “f” in the topic A have their weights modified. [0223] Specifically, the weights of the words “b”, “c” and “f” are each multiplied by a predetermined weight coefficient “k” (e.g., 1.2) for modification (i.e., for a relative increase). That is, the weight of the word “b” (=0.54), weight of the word “c” (=0.02) and weight of the word “f” (=0.01) are each multiplied by 1.2. The multiplication turns the characteristic vector of the topic A into (0, 0.65 (≈0.54×1.2), 0.02 (≈0.02×1.2), 0, 0, 0.01 (≈0.01×1.2), 0) as shown in FIG. 33A. [0224] In this manner, the weights of the words included in the topic attracting the user's particular attention are modified in accordance with the updates. [0225] In another example, the words “b”, “c” and “f” included in the topic A discussed with Messrs./Mses. A and C may also be found in a topic associated with destinations other than Messrs./Mses. A and C (e.g., Messrs./Mses. B and D). Here, too, the applicable words may be multiplied by the same weight coefficient “k” (1.2 in this case) for modification. Specifically, as shown in FIG. 30, the word “c” included in the topic B and the words “b” and “f” in the topic C have their weights multiplied by 1.2 each. The multiplication turns the characteristic vector of the topic B into (0.01, 0, 0.49 (≈0.41×1.2), 0.33, 0.16, 0, 0.64) and that of the topic C into (0.51, 0.42 (=0.35×1.2), 0, 0, 0.48, 0.44 (≈0.37×1.2), 0), as indicated in FIG. 33B. [0226] As described, where the words included in the topic discussed with some destinations of high mail exchange frequencies are also found in a topic associated with other destinations of lesser mail exchange frequencies, the weights of these words may also be modified. This makes it possible to select the keywords likely to attract the user's particular attention even from the topics discussed with the parties of lower mail exchange frequencies. [0227] Furthermore, the weight coefficient “k” may be varied depending on the mail exchange frequency (order). More specifically, where the mails exchanged with Mr./Ms. A (of the highest exchange frequency) pertain to the topic B, the words “a”, “c”, “d”, “e” and “g” included in that topic may have their weights multiplied by a different weight coefficient k1 (=1.5); where the mails exchanged with Mr./Ms. C (of the second-highest exchange frequency) cover the topic C, the words “a”, “b”, “e” and “f” found in this topic may have their weights multiplied by yet another weight coefficient k2 (=1.2). The multiplication turns the characteristic vector of the topic B into (0.02 (=0.01×1.5), 0, 0.62 (≈0.41×1.5), 0.50 (≈0.33×1.5), 0.24 (=0.16×1.5), 0, 0.96 (=0.64×1.5)) and that of the topic C into (0.61 (≈0.51×1.2), 0.42 (=0.35×1.2), 0, 0, 0.58 (≈0.48×1.2), 0.44 (≈0.37×1.2), 0), as indicated in FIG. 33C. [0228] In the manner described above, the weights of the words included in the topic attracting the user's particular attention may be modified in accordance with the frequency with which mails are exchanged with each destination. The weight coefficient “k” may be either a value proportional to the mail exchange frequency in effect or any other value established as desired. [0229] The second example of the weight modifying process is described below by referring to the flowchart of FIG. 34. In step S111, the document characteristic database creating part 24 identifies outgoing mails (including return mails) from among a plurality of mails grouped by topic, and extracts words from the outgoing mails. In step S112, the document characteristic database creating part 24 identifies the incoming mails received earlier corresponding to the return mails extracted in step S111, and extracts words from the received mails. [0230] For example, words “b” and “c” are extracted from outgoing mails associated with a topic A; words “e” and “g” are extracted from outgoing mails returned in connection with a topic B; and a word “c” is extracted from an incoming mail received earlier which prompted the outgoing return mails. [0231] In step S113, the document characteristic database creating part 24 modifies the weights of the words extracted in steps S111 and S112. [0232] More specifically, the weight of each of the words included in the outgoing mails (including return mails) is multiplied by a predetermined weight coefficient k1 (e.g., 1.5) for modification. At the same time, the weight of each of the words found in the previously received incoming mail which prompted the return mails is multiplied by another weight coefficient k2 (e.g., 1.2) for modification. The multiplication turns the characteristic vector of the topic A into (0, 0.81 (≈0.54×1.5), 0.03 (≈0.02×1.5), 0, 0, 0.01, 0) and that of the topic B into (0.01, 0, 0.49 (≈0.41×1.2) 0.33, 0.24 (=0.16×1.5), 0, 0.96 (=0.64×1.5)) as shown in FIG. 35. [0233] As described above, the words included in the mails sent out or returned by the user (i.e., the words utilized deliberately by the user) are extracted and modified in weight so that the words apparently attracting the user's particular attention are selected as keywords. Any words found only in the received mails are left untouched because they are not regarded as attracting the user's attention. [0234] Alternatively, a different weight coefficient may be established for each of different mail types: one for outgoing mails, another for return mails, and another for received (incoming) mails. It might happen that the words included in outgoing mails (including return mails) and in received original mail which prompted the return mails in connection with a given topic may also be found in mails associated with another topic. In such a case, these words may also be modified accordingly. [0235] The third example of the weight modifying process is described below by referring to the flowchart of FIG. 36. In step S121, the document characteristic database creating part 24 extracts proper nouns indicative of specific regions or entities from among the words included in a given topic. Illustratively, words “b” and “f” are extracted as proper nouns. [0236] In step S122, the document characteristic database creating part 24 modifies the weights of the words extracted in step S121. [0237] Specifically, the weight of each of the words constituting the proper nouns included in each topic are multiplied by a predetermined weight coefficient “k” (e.g., 1.5) for modification. For example, the weight of the word “b” and that of the word “f” included in each of the topics shown in FIG. 30 are multiplied by 1.5. The multiplication turns the characteristic vector of the topic A into (0, 0.81 (≈0.54×1.5), 0.02, 0, 0, 0.02 (≈0.01×1.5), 0) and that of the topic C into (0.51, 0.53 (=0.35×1.5), 0, 0, 0.48, 0.56 (≈0.37×1.5), 0) as indicated in FIG. 37. (It should be noted that the words “b” and “f” are not included in the topic B.) In the manner described above, the weight of each of the words (proper nouns) attracting the user's particular attention is modified. A different weight coefficient “k” may be applied to each of different types of proper nouns (e.g., geographical names, organization names, product names, and persons' names). It is to be noted that persons' names, even if modified in weight, cannot be selected as keywords; all biographical names should be left unmodified. [0238] In the foregoing description, the weights of extracted words were shown modified depending on the mail exchange frequency, send/receive status, part of speech (i.e., proper nouns). Obviously, these criteria may be suitably combined to form another basis for modifying the weights of the words. Any other method may be utilized for modifying the words in terms of weight as long as the user's interest is properly reflected. [0239] In another example, there may be provided a category dictionary that classifies retained words in different categories. The document characteristic database creating part 24 may modify the weight of a given word included in the database depending on whether the word in question is included in the category dictionary. [0240] [0240]FIG. 38 is a schematic view showing another typical functional block structure of the agent program according to the invention. In FIG. 38, a category dictionary 201 serves as a database that retains words classified into categories such as humanities, fine arts, and diverse fields of science. In practice, the category dictionary 201 may have a plurality of categories centering on that attracts the user's particular attention, each category including corresponding words. [0241] The document characteristic database creating part 24 references the category dictionary 201 to see whether a given word included in the created database is registered in the dictionary 201. If the word in question is judged registered in the category dictionary 201, that word is modified in weight. [0242] Specifically, if a word found in the database is judged included in the category dictionary 201 (i.e., if the word falls into a category attracting the user's interest), the document characteristic database creating part 24 modifies the weight of that word. The process serves to reflect the user's interest in the weights of the words contained in the database. [0243] Described below with reference to the flowchart of FIG. 39 is how the document characteristic database creating part 24 carries out a weight modifying process using the category dictionary. In step S141 of FIG. 39, the document characteristic database creating part 24 first references the category dictionary 201 to search for words corresponding to those registered in the database. More specifically, the part 24 searches the category dictionary 201 for words that are the same as those under the same category in the database. [0244] In step S142, the document characteristic database creating part 24 judges whether any corresponding words exist based on the result of the reference. If the corresponding words are judged to exist, step S143 is reached. [0245] In step S143, the document characteristic database creating part 24 extracts the applicable words from the category dictionary 201. In step S144, the document characteristic database creating part 24 references the database to modify the weight of each of the extracted words. This terminates the weight modifying process that utilizes the category dictionary 201. [0246] If in step S142 any words corresponding to those in the database are not judged to exist based on the result of the reference, then the document characteristic database creating part 24 skips steps S143 and S144 and terminates this weight modifying process using the category dictionary 201. [0247] Illustratively, suppose that the characteristic vector of a given topic (weights of words A, B, C, D, E, F and G) is (1.1, 0.1, 0, 0, 1.4, 5.1, and 3.8) and that two words are to be selected as the most important words by the database querying part 32. In that case, the words F and G are selected. [0248] Suppose now that the category dictionary 201 includes words A, B, D, H, K, and L and that the document characteristic database creating part 24 has multiplied each of the corresponding words in the database by five for modification. Tn such a case, the characteristic vector above is modified into (5.5, 0.5, 0, 0, 1.4, 5.1, and 3.8). Thus the database querying part 32 selects the words A and F as the most important words. [0249] In the foregoing description, those words in the database, which correspond to the words in the category dictionary 201, were shown modified in weight using the same coefficient. However, this is not limitative of the invention. Alternatively the weight modifying coefficient may be varied for each of the words included in the category dictionary 201. That is how the document characteristic database creating part 24 performs the weight modifying process using the category dictionary 201. [0250] In the foregoing description, the document characteristic database creating part 24 was shown by modifying the weights of those words in the database, which correspond to the words in the category dictionary 201. Alternatively, those words in the database, which correspond to the words in the category dictionary 201, may be designated as the most important words. [0251] Described below with reference to the flowchart of FIG. 40 is another example in which the document characteristic database creating part 24 carries out the weight modifying process using the category dictionary. [0252] In step S161 of FIG. 40, the document characteristic database creating part 24 first references the category dictionary 201 to search for words corresponding to those registered in the database. Specifically, the part 24 searches the category dictionary 201 for words that are the same as those under the same category in the database. [0253] In step S162, the document characteristic database creating part 24 judges whether any corresponding words exist based on the result of the reference. If the corresponding words are judged to exist, step S163 is reached. [0254] In step S163, the document characteristic database creating part 24 extracts the applicable words from the category dictionary 201. In step S164, the document characteristic database creating part 24 registers the extracted words as the most important words in the database. The part 24 then terminates the weight modifying process that utilizes the category dictionary 201. [0255] If in step S162 any words corresponding to those in the database are not judged to exist based on the result of the reference, then the document characteristic database creating part 24 skips steps S163 and S164 and terminates this weight modifying process using the category dictionary 201. [0256] Illustratively, suppose that the characteristic vector of a given topic (weights of words A, B, C, D, E, F, and G) is (1.1, 0.1, 0, 0, 1.4, 5.1, and 3.8) and that two words are to be selected as the most important words by the database querying part 32. In that case, the words F and G are selected as the most important words. [0257] Suppose also that the category dictionary 201 includes words A, B, D, H, K, and L and that the document characteristic database creating part 24 has registered these words as the most important words in the database. In such a case, the characteristic vector above remains the same (i.e., 1.1, 0.1, 0, 0, 1.4, 5.1, 3.8) but the database querying part 32 selects the words A and B as the most important words. Although the word D is also included in the category dictionary 201, the word is not selected because it has zero weight. [0258] As described, the document characteristic database creating part 24 designates as the most important words those words in the database, which correspond to the words in the category dictionary 201. The database querying part 32 further selects some of the designated words as the most important words. [0259] Although the category dictionary 201 was shown containing six words above, this is not limitative of the invention. The category dictionary 201 may contain any number of words and may be structured in any manner desired. [0260] How to create the category dictionary 201 such as the one discussed above will now be described. Illustratively, the category dictionary 201 may be composed of commercially available thesauruses or ontology dictionaries having a hierarchical or group structure each. [0261] Such dictionaries are typically stored beforehand on the same storage medium that carries the principal application program of the invention. When the storage medium is loaded into the drive 51, the CPU 41 retrieves the dictionaries therefrom and installs what is retrieved into the storage unit 49. The CPU 41 references the installed dictionaries when creating a category dictionary. [0262] Specifically, the CPU 41 extracts words from part or all of the installed dictionaries. In creating a target category dictionary 201 using the extracted words, the CPU 41 reflects in the target the structure (hierarchical, group, etc.) of the reference dictionaries that constitute the basis for the dictionary being created. [0263] On updating the category dictionary 201, the CPU 41 performs the same steps as those for creating it. That is, with the necessary storage medium loaded into the drive 51, the CPU 41 retrieves new reference dictionaries from the medium for installation and refers to the newly installed dictionaries in order to update the category dictionary 201. [0264] The dictionaries to be referenced may alternatively be acquired over a network such as the Internet using email or a similar feature. Once the necessary dictionaries are obtained, the CPU 41 proceeds the same way as above to create the category dictionary 201. New versions of such reference dictionaries may be acquired at predetermined intervals or as designated by the user over the network to keep the category dictionary 201 up to date. [0265] The dictionaries to be referenced may be something other than the above-mentioned thesauruses or ontology dictionaries, such as a list of frequently extracted words. The category dictionary 201 may also be created directly based on the user's input. [0266] The category dictionary 201 above may alternatively be created from sources other than conventionally available dictionaries. Illustratively, Web pages of online shopping sites, bulletin board sites, category-specific search sites, or other websites on the Internet may be used to create the category dictionary 201. [0267] The CPU 41 acquires such Web pages over the Internet when connected thereto through the communication unit 50. With the pages of suitable websites obtained, the CPU 41 proceeds to create the category dictionary 201. Illustratively, the CPU 41 extracts words such as product names from the pages and turns the extracted words into a category dictionary 201 while reflecting the Web page structure (hierarchical, group, etc.) in what is being built. [0268] In such cases, the CPU 41 may acquire updated pages of the relevant websites at predetermined intervals or as designated by the user over the network to keep the category dictionary 201 up to date. [0269] In another example, in step S6 of FIG. 3, the related information searching part 25 may access a search engine for a search over the Internet using as search conditions the keywords for search (important words) furnished by the document characteristic database creating part 24. In such a case, an external server (not shown) acquires the keywords and gathers information based on these keywords. The information thus provided may then be used as a basis for creating the category dictionary 201. [0270] Specifically, the externally established server (not shown) acquires and retains the keywords used by the related information searching part 25. The server ranks the retained keywords in terms of use frequency to prepare a list of suitably ranked words. [0271] The CPU 41 obtains the word list in a properly timed manner, and creates the category dictionary 201 based on that list. [0272] More specifically, as shown in FIG. 41, the server creates user-specific word lists (for Mr./Ms. X, Y, . . . ) based on the acquired keywords. The words are grouped by the frequency with which each word has been used. [0273] In the example of FIG. 41, the server generates not only the dictionary of simply listed words in descending order of their search frequencies but also a list of grouped keywords (in Gp1 and Gp2) based on the combinations of keywords for search selected from each of the topics in effect (TopicX01 through TopicX04, TopicY01 through TopicY03). [0274] In another example, users employing similar keywords for search may be brought together to form a user group in which scalar products of the vectors sharing such keywords fall within a certain range when calculated. Then the keywords utilized only by the users within a given group may be extracted for a particular search. [0275] As another alternative, the CPU 41 may acquire information about the operations for accessing and saving related information, store the acquired information in the storage unit 49, and supply the operation information to the server in appropriately timed fashion. Based on the supplied operation information, the server may generate a preferred list of keywords that are highly appreciated by the user (i.e., the corresponding related information is attracting the user's attention). [0276] When the category dictionary 201 created in any of the manners described above is to be updated, the CPU 41 first gains access to the server in a suitably timed manner to obtain the list. The CPU 41 then updates the information in the category dictionary 201 based on the acquired list. [0277] As described, the category dictionary 201 may be created on the basis of diverse kinds of information. [0278] The category dictionary 201 may alternatively be composed of dictionaries covering a plurality of categories, each of the dictionaries being created in any of the manners discussed above. In such cases, the category dictionary to be referenced by the document characteristic database creating part 24 may be prepared in one of several ways: (1) the user may selectively download beforehand those of the multiple dictionaries in the category dictionary 201, which attract the user's attention; (2) of the component dictionaries making up the category dictionary 201, the one that contains more words about all topics than any other component dictionaries may be selected by the category dictionary 201 in advance; (3) where a dictionary of a given category is to be used according to keywords, the category dictionary 201 may select from its multiple component dictionaries the one that includes the largest number of relevant keywords registered; or (4) where an external server provides category dictionaries, the server may bring users into groups in accordance with the contract provisions, use history, or other criteria and may select the dictionary to be offered to each user group for the services preferred thereby. [0279] In the foregoing description, those words in the database judged to be included in the category dictionary 201 were shown weighted more during word weight calculation performed by the document characteristic database creating part 24. Alternatively, the words contained in the category dictionary 201 may be given further weight when the document content processing part 23 calculates the weights of words. [0280] Illustratively, suppose that it is possible to modify a morphological analysis dictionary used in the morphological analysis performed by the document content processing part 23 in step S3 of FIG. 3. In that case, a new part of speech (e.g., words of general interest) is added beforehand to the morphological analysis dictionary so that the new part of speech will correspond to some of the words in the category dictionary 201. When the document content processing part 23 weights each word by the tf.idf method in step S4 of FIG. 3, the words belonging to the new part of speech are given more weight. In this manner, the weights of the words included in the category dictionary 201 are increased when the document content processing part 23 carries out word weight calculation. [0281] It is also possible to make arrangements so that the newly added part of speech (i.e., words of general interest) in the category dictionary is given preference over the existing parts of speech when the words are weighted. In that case, even if a given word included in the category dictionary 201 falls in one of the existing parts of speech, that word is judged to belong to the newly added part of speech and thus is given higher weight. [0282] As described, using the category dictionary 201 allows the words in the database to be modified in weight in a manner facilitating the presentation of related information about a given field attracting the user's interest. [0283] In the foregoing description, the category dictionary 201 was shown used for increasing the weights of words in the database with a view to facilitating the presentation of related information about the field attracting the user's interest. Alternatively, the category dictionary 201 may be utilized to lower the weights of words in the database. [0284] Illustratively, the words in a particular field deemed inappropriate from an educational point of view may be lowered in weight for the group of underage users only. Likewise, specific words may be reduced in weight for certain groups of users. As another alternative, the category dictionary 201 may be referenced so that specific words are multiplied by zero so as to be given zero weight each. [0285] Described so far are some examples showing how the words included in a given topic are modified in weight. Alternatively, the words included in documents prepared by the word processor program 3 may also be modified in weight in like manner. In such cases, the weights of words may be modified not per topic but by the folder or document containing them. [0286] If the database were conventionally created using only the words extracted simply from the user's e-mail exchanges, the topics attracting the user's attention would be treated the same way as those not retaining the user's particular interest. That drawback is corrected by carrying out the word weight modifying processes explained above with reference to the flowcharts of FIGS. 31, 34, and 36. The modifying processes correct the weights of the words attracting the user's particular attention, thereby creating a meaningful database. Thus in step S15 of FIG. 5 showing the related information presenting process, the database thus created facilitates selection of the words deemed to attract the user's specific attention as important words. When those components of characteristic vectors in documents or topics relating to a specific field are highlighted as relevant to the user's interest in that category, it is possible to extract the topics that better reflect the user's interest. This in turn makes it possible to present related information that better reflects the user's interest. [0287] Conversely, when the vector components pertaining to fields not attracting the user's attention are lowered in weight, the important words not useful from the user's viewpoint are eliminated. That suppresses extraction of topics based on the components of insignificant characteristic vectors, whereby presentation of related information not desired by the user is prevented. [0288] In step S39 of FIG. 7 in conjunction with step S16 of FIG. 5, the agent controlling part 13 was shown displaying on the desktop the document attribute information as the reason for the selection (i.e., recommendation). In such a case, only part of the attribute information may be displayed, i.e., out of a plurality of display patterns that may be generated from the same attribute information. [0289] [0289]FIGS. 42A through 42E are schematic views showing how a plurality of display patterns are generated on the basis of the same attribute information. For example, as shown in FIG. 42A, attribute information such as “Aug. 21, 2001,” “Mr./Ms. A”, and “party” is generated and displayed on the desktop along with the reason for the selection (recommendation) “wines and cakes.” Alternatively, as indicated in FIG. 42B, the agent controlling part 13 may use all of these words when generating the reason for the selection (recommendation) in sentences like, “On Aug. 21, 2001, you talked to Mr./Ms. A about the party, didn't you? I have some information about the wines and cakes you brought up during the talk.” These sentences are displayed in the balloon 73 of the agent 72. As other alternatives, part of the words used above may be employed to create different sentences as the reasons for the selection (recommendation), and the created sentences are displayed likewise in the balloon 73 of the agent 72. [0290] More specifically, in step S39 of FIG. 7 in conjunction with step S16 of FIG. 5, the agent controlling part 13 generates one of such expressions as, “On Aug. 21, 2001, you sent an e-mail to Mr./Ms. A, didn't you? I have some information about what you talked about.” shown in FIG. 42C; “You talked to Mr./Ms. A about the party, didn't you? I have some information about that.” in FIG. 42D; and “You talked to Mr./Ms. A about wines and cakes, didn't you? I have some related information.” in FIG. 42E. One of these expressions is displayed in the balloon 73 of the agent 72 after being generated. [0291] In the manner described, the agent controlling part 13 generates and displays different expressions even when using the same document repeatedly as the reason for the selection (recommendation). The feature helps minimize the decline of the user's interest in what is being talked about. [0292] As a variation of the examples above, the combinations of words used once may be stored in the storage unit 49. Whenever the agent controlling part 13 generates an expression of the reason for selection (recommendation), the part 13 may reference the stored combinations so as to avoid using the same combinations of words. [0293] As another alternative, when generating expressions of the reason for recommendation, the agent controlling part 13 may search for synonyms, words of a superordinate concept or related words through a thesaurus or an ontology dictionary (neither shown) and may use the retrieved words as representative of the recommending reason. For example, based on “Aug. 21, 2001 ” shown in FIG. 42A, such expressions as “toward the end of August” or “toward the end of the summer” may be adopted as the words constituting the reason for the recommendation; given “the party” in FIG. 42A, words like “celebration” may be picked up to represent the recommending reason; or on the basis of “wines and cakes” in FIG. 42A, such words as “foreign liquors and foreign cakes” may be employed to indicate the reason for the recommendation. [0294] The agent program 1 of this invention is designed to address not only the documents exchanged by the mailer 2 or the documents edited by the word processor program 3 as described above, but also any documents having time-stamps as their attribute information, such as texts of chats, electronic news, and electronic bulletin boards as well as texts derived from voice signals. [0295] The agent program 1 executing the above-described series of processes is either incorporated beforehand in the personal computer or installed upon use from a suitable storage medium into the PC. [0296] The series of steps described above may be executed by hardware but is usually carried out by software. For such software-based processing to take place, the agent program 1 constituting the software may be either incorporated beforehand in dedicated hardware of a computer or installed upon use from a suitable storage medium into a general-purpose personal computer or like equipment capable of executing diverse functions based on the various programs installed. [0297] As shown in FIG. 2, the storage medium carrying programs to be installed into the computer for execution may be a package medium constituted by the magnetic disc (including flexible discs) 52, optical disc (including CD-ROM [Compact Disc-Read Only Memory] and DVD [Digital Versatile Disc]) 53, magneto-optical disc (including MD (Mini-Disc), a registered trademark) 54, or semiconductor memory 55; or may come in the form of the ROM 42 or hard discs constituting the storage unit 49. The storage medium has the programs recorded thereto as needed through wired or wireless communication means such as public switched networks, local area networks, the Internet, and digital satellite broadcasting networks, by way of communication interfaces such as routers and modems. [0298] In this specification, the steps that are stored on the storage medium and that describe the programs to be executed represent not only the processes that are carried out in the depicted sequence (i.e., on a time series basis) but also processes that are conducted parallelly or individually. [0299] Where the information processing apparatus, information processing method, and program according to the invention are in use, a first characteristic word is extracted from existing document information and a second characteristic word is extracted from specific document information. A first weight of the first characteristic word and a second weight of the second characteristic word are both calculated. The first weight is then modified based on a specific condition. Related information corresponding to the existing document information is acquired on the basis of the first characteristic word and the first weight. The existing document information related to the specific document information is searched for and retrieved based on the second characteristic word. The related information corresponding to the retrieved existing document information is then displayed. The inventive scheme thus makes it possible to present the user with related information reflecting the user's particular interest. [0300] While a preferred embodiment of the invention has been described using specific terms, such description if for illustrative purposes only, and it is to be understood that changes and variations may be made without departing from the spirit or scope of the following claims. Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS5146405 *Feb 5, 1988Sep 8, 1992At&T Bell LaboratoriesMethods for part-of-speech determination and usageUS5442778 *Nov 12, 1991Aug 15, 1995Xerox CorporationScatter-gather: a cluster-based method and apparatus for browsing large document collectionsUS5576954 *Nov 5, 1993Nov 19, 1996University Of Central FloridaProcess for determination of text relevancyUS5657462 *Jan 31, 1996Aug 12, 1997Collegeview PartnershipMethod and apparatus for displaying animated characters upon a computer screen in which a composite video display is merged into a static background such that the border between the background and the video is indiscernibleUS5715468 *Sep 30, 1994Feb 3, 1998Budzinski; Robert LuciusMemory system for storing and retrieving experience and knowledge with natural languageUS5787421 *Jan 11, 1996Jul 28, 1998International Business Machines CorporationSystem and method for information retrieval by using keywords associated with a given set of data elements and the frequency of each keyword as determined by the number of data elements attached to each keywordUS5893114 *Nov 14, 1996Apr 6, 1999Hitachi Ltd.Document information collection method and document information collection apparatusUS6006225 *Sep 1, 1998Dec 21, 1999Amazon.ComRefining search queries by the suggestion of correlated terms from prior searchesUS6182091 *Sep 29, 1999Jan 30, 2001Xerox CorporationMethod and apparatus for finding related documents in a collection of linked documents using a bibliographic coupling link analysisUS6571240 *Feb 2, 2000May 27, 2003Chi Fai HoInformation processing for searching categorizing information in a document based on a categorization hierarchy and extracted phrasesUS6754654 *Oct 1, 2001Jun 22, 2004Trilogy Development Group, Inc.System and method for extracting knowledge from documentsUS6845374 *Nov 27, 2000Jan 18, 2005Mailfrontier, IncSystem and method for adaptive text recommendationUS6862566 *Mar 12, 2001Mar 1, 2005Matushita Electric Industrial Co., Ltd.Method and apparatus for converting an expression using key wordsUS20020016786 *Dec 4, 2000Feb 7, 2002Pitkow James B.System and method for searching and recommending objects from a categorically organized information repositoryUS20020042793 *Aug 10, 2001Apr 11, 2002Jun-Hyeog ChoiMethod of order-ranking document clusters using entropy data and bayesian self-organizing feature mapsUS20020073079 *Dec 13, 2000Jun 13, 2002Merijn TerheggenMethod and apparatus for searching a database and providing relevance feedbackUS20020188599 *Mar 2, 2001Dec 12, 2002Mcgreevy Michael W.System, method and apparatus for discovering phrases in a databaseUS20030110162 *Dec 6, 2001Jun 12, 2003Newman Paula S.Lightweight subject indexing for E-mail collections* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS7171612 *May 15, 2002Jan 30, 2007Konica CorporationMedical image processing apparatus and medical network systemUS7254587 *Jan 12, 2004Aug 7, 2007International Business Machines CorporationMethod and apparatus for determining relative relevance between portions of large electronic documentsUS7440938 *May 5, 2004Oct 21, 2008Hitachi, Ltd.Method and apparatus for calculating similarity among documentsUS7640302 *Oct 6, 2006Dec 29, 2009Fuji Xerox Co., Ltd.Information delivery apparatus, information delivery method and program product thereforUS7801875 *Nov 12, 2007Sep 21, 2010Samsung Electronics Co., Ltd.Method of searching for supplementary data related to content data and apparatus thereforUS7945571 *Nov 26, 2007May 17, 2011Legit Services CorporationApplication of weights to online search requestUS8001193 *May 16, 2006Aug 16, 2011Ntt Docomo, Inc.Data communications system and data communications method for detecting unsolicited communicationsUS8078629Oct 13, 2009Dec 13, 2011Google Inc.Detecting spam documents in a phrase based information retrieval systemUS8086947 *Jul 18, 2006Dec 27, 2011Konica Minolta Business Technologies, Inc.Document processing apparatus, document processing system and data structure of document fileUS8108412Mar 4, 2010Jan 31, 2012Google, Inc.Phrase-based detection of duplicate documents in an information retrieval systemUS8117223Sep 7, 2007Feb 14, 2012Google Inc.Integrating external related phrase information into a phrase-based indexing information retrieval systemUS8126779Nov 21, 2007Feb 28, 2012William Paul WankerMachine implemented methods of ranking merchantsUS8161043 *Feb 18, 2009Apr 17, 2012Panasonic CorporationInteractive program search apparatusUS8196039 *Jul 7, 2006Jun 5, 2012International Business Machines CorporationRelevant term extraction and classification for Wiki contentUS8200695 *Jan 10, 2007Jun 12, 2012Lg Electronics Inc.Database for uploading, storing, and retrieving similar documentsUS8204797Oct 11, 2007Jun 19, 2012William Paul WankerCustomizable electronic commerce comparison system and methodUS8219900Jul 7, 2006Jul 10, 2012International Business Machines CorporationProgrammatically hiding and displaying Wiki page layout sectionsUS8321375 *Jan 19, 2005Nov 27, 2012Xanavi Informatics CorporationSearch data update method and search data update systemUS8489628Dec 1, 2011Jul 16, 2013Google Inc.Phrase-based detection of duplicate documents in an information retrieval systemUS8504618 *Jul 10, 2006Aug 6, 2013Mitel Networks CorporationDynamic mailbox size configuration by self modification based on historical behaviorUS8560550Jul 20, 2009Oct 15, 2013Google, Inc.Multiple index based information retrieval systemUS8560956Jul 7, 2006Oct 15, 2013International Business Machines CorporationProcessing model of an application wikiUS8612427 *Mar 4, 2010Dec 17, 2013Google, Inc.Information retrieval system for archiving multiple document versionsUS8620658 *Apr 14, 2008Dec 31, 2013Sony CorporationVoice chat system, information processing apparatus, speech recognition method, keyword data electrode detection method, and program for speech recognitionUS8631027Jan 10, 2012Jan 14, 2014Google Inc.Integrated external related phrase information into a phrase-based indexing information retrieval systemUS8713023Jun 18, 2013Apr 29, 2014Gordon Villy CormackSystems and methods for classifying electronic information using advanced active learning techniquesUS8775930Jul 7, 2006Jul 8, 2014International Business Machines CorporationGeneric frequency weighted visualization componentUS8782049 *Sep 16, 2010Jul 15, 2014Kabushiki Kaisha ToshibaKeyword presenting deviceUS8838606 *Jun 18, 2013Sep 16, 2014Gordon Villy CormackSystems and methods for classifying electronic information using advanced active learning techniquesUS8924396 *Sep 17, 2010Dec 30, 2014Lexxe Pty Ltd.Method and system for scoring textsUS8924491 *Feb 23, 2012Dec 30, 2014International Business Machines CorporationTracking message topics in an interactive messaging environmentUS8972839 *Oct 2, 2006Mar 3, 2015Adobe Systems IncorporatedMedia presentations including related contentUS9037573Jun 17, 2013May 19, 2015Google, Inc.Phase-based personalization of searches in an information retrieval systemUS9122681Mar 15, 2013Sep 1, 2015Gordon Villy CormackSystems and methods for classifying electronic information using advanced active learning techniquesUS9361331Mar 13, 2013Jun 7, 2016Google Inc.Multiple index based information retrieval systemUS9384224Nov 18, 2013Jul 5, 2016Google Inc.Information retrieval system for archiving multiple document versionsUS9396724 *Feb 14, 2014Jul 19, 2016Tencent Technology (Shenzhen) Company LimitedMethod and apparatus for building a language modelUS9414021Jul 30, 2014Aug 9, 2016Samsung Electronics Co., Ltd.Broadcast program information search system and methodUS9471644 *Dec 29, 2014Oct 18, 2016Lexxe Pty LtdMethod and system for scoring textsUS9569505May 15, 2015Feb 14, 2017Google Inc.Phrase-based searching in an information retrieval systemUS9600468 *Dec 3, 2010Mar 21, 2017Nec CorporationDictionary creation device, word gathering method and recording mediumUS9626633May 10, 2010Apr 18, 2017Invention Science Fund I, LlcProviding access to one or more messages in response to detecting one or more patterns of usage of one or more non-communication productivity applicationsUS9678957Jul 22, 2015Jun 13, 2017Gordon Villy CormackSystems and methods for classifying electronic information using advanced active learning techniquesUS20030172382 *Jan 8, 2003Sep 11, 2003Samsung Electronics Co., Ltd.Method and apparatus for searching for broadcasting program informationUS20040019499 *Jul 1, 2003Jan 29, 2004Fujitsu Limited Of Kawasaki, JapanInformation collecting apparatus, method, and programUS20040123319 *Dec 12, 2003Jun 24, 2004Samsung Electronics Co., Ltd.Broadcast program information search system and methodUS20050021508 *May 5, 2004Jan 27, 2005Tadataka MatsubayashiMethod and apparatus for calculating similarity among documentsUS20050021677 *May 11, 2004Jan 27, 2005Hitachi, Ltd.Information providing method, server, and programUS20050154761 *Jan 12, 2004Jul 14, 2005International Business Machines CorporationMethod and apparatus for determining relative relevance between portions of large electronic documentsUS20060230036 *Mar 28, 2006Oct 12, 2006Kei TatenoInformation processing apparatus, information processing method and programUS20060262867 *May 16, 2006Nov 23, 2006Ntt Docomo, Inc.Data communications system and data communications methodUS20070073636 *Jul 10, 2006Mar 29, 2007Mitel Networks CorporationDynamic mailbox size configuration by self modification based on historical behaviorUS20070192702 *Jul 18, 2006Aug 16, 2007Konica Minolta Business Technologies, Inc.Document processing apparatus, document processing system and data structure of document fileUS20070234140 *Jun 11, 2007Oct 4, 2007Lee Chris GMethod and apparatus for determining relative relevance between portions of large electronic documentsUS20070244881 *Jan 10, 2007Oct 18, 2007Lg Electronics Inc.System, method and user interface for retrieving documentsUS20070299911 *Oct 6, 2006Dec 27, 2007Fuji Xerox Co., Ltd.Information delivery apparatus, information delivery method and program product thereforUS20080010249 *Jul 7, 2006Jan 10, 2008Bryce Allen CurtisRelevant term extraction and classification for Wiki contentUS20080010341 *Jul 7, 2006Jan 10, 2008Bryce Allen CurtisProcessing model of an application wikiUS20080010590 *Jul 7, 2006Jan 10, 2008Bryce Allen CurtisMethod for programmatically hiding and displaying Wiki page layout sectionsUS20080010615 *Jul 7, 2006Jan 10, 2008Bryce Allen CurtisGeneric frequency weighted visualization componentUS20080033841 *Oct 11, 2007Feb 7, 2008Wanker William PCustomizable electronic commerce comparison system and methodUS20080033938 *Jul 26, 2007Feb 7, 2008Kabushiki Kaisha ToshibaKeyword outputting apparatus, keyword outputting method, and keyword outputting computer program productUS20080071638 *Nov 21, 2007Mar 20, 2008Wanker William PCustomizable electronic commerce comparison system and methodUS20080082929 *Aug 30, 2007Apr 3, 2008Thomson Global ResourcesDocument-centric workflow systems, methods, and software based on document contents, metadata, and contextUS20080228712 *Jan 19, 2005Sep 18, 2008Xanavi Informatics CorporationSearch Data Update Method and Search Data Update SystemUS20080294636 *Nov 12, 2007Nov 27, 2008Samsung Electronics Co., Ltd.Method of searching for supplementary data related to content data and apparatus thereforUS20090055185 *Apr 14, 2008Feb 26, 2009Motoki NakadeVoice chat system, information processing apparatus, speech recognition method, keyword data electrode detection method, and programUS20090070312 *Sep 7, 2007Mar 12, 2009Google Inc.Integrating external related phrase information into a phrase-based indexing information retrieval systemUS20090138329 *Nov 26, 2007May 28, 2009William Paul WankerApplication of query weights input to an electronic commerce information system to target advertisingUS20090138458 *Nov 26, 2007May 28, 2009William Paul WankerApplication of weights to online search requestUS20100076964 *Dec 17, 2008Mar 25, 2010Daniel Joseph ParrellInstance-Class-Attribute Matching Web Page RankingUS20100114884 *Feb 18, 2009May 6, 2010Takashi TsuzukiInteractive program search apparatusUS20100161625 *Mar 4, 2010Jun 24, 2010Google Inc.Phrase-based detection of duplicate documents in an information retrieval systemUS20100169305 *Mar 4, 2010Jul 1, 2010Google Inc.Information retrieval system for archiving multiple document versionsUS20110072011 *Sep 17, 2010Mar 24, 2011Lexxe Pty Ltd.Method and system for scoring textsUS20110131223 *Oct 13, 2009Jun 2, 2011Google Inc.Detecting spam documents in a phrase based information retrieval systemUS20110211590 *Apr 12, 2010Sep 1, 2011Searete Llc, A Limited Liability Corporation Of The State Of DelawarePresenting messages through a channel of a non-communication productivity application interfaceUS20110213793 *May 10, 2010Sep 1, 2011Searete Llc, A Limited Liability Corporation Of The State Of DelawareProviding access to one or more messages in response to detecting one or more patterns of usage of one or more non-communication productivity applicationsUS20110214069 *Apr 9, 2010Sep 1, 2011Searete Llc, A Limited Liability Corporation Of The State Of DelawarePresenting messages through a channel of a non-communication productivity application interfaceUS20110214070 *May 7, 2010Sep 1, 2011Searete Llc, A Limited Liability Corporation Of The State Of DelawareProviding access to one or more messages in response to detecting one or more patterns of usage of one or more non-communication productivity applicationsUS20110246464 *Sep 16, 2010Oct 6, 2011Kabushiki Kaisha ToshibaKeyword presenting deviceUS20120221656 *Feb 23, 2012Aug 30, 2012International Business Machines CorporationTracking message topics in an interactive messaging environmentUS20120303359 *Dec 3, 2010Nov 29, 2012Nec CorporationDictionary creation device, word gathering method and recording mediumUS20120310944 *Dec 3, 2010Dec 6, 2012Nec CorporationDictionary creation deviceUS20130124516 *Jan 10, 2013May 16, 2013Sony CorporationData display server, data display method and program thereofUS20130124988 *Oct 2, 2006May 16, 2013Adobe Systems IncorporatedMedia presentations including related contentUS20140199051 *Jun 30, 2011Jul 17, 2014Thomson LicensingMethod and apparatus for automatic recording according to user preferencesUS20140358539 *Feb 14, 2014Dec 4, 2014Tencent Technology (Shenzhen) Company LimitedMethod and apparatus for building a language modelUS20150058708 *Aug 23, 2013Feb 26, 2015Adobe Systems IncorporatedSystems and methods of character dialog generationUS20150127821 *Nov 5, 2014May 7, 2015Omron CorporationControl deviceUS20150215362 *Apr 7, 2015Jul 30, 2015Core Wireless Licensing S.A.R.L.System and method for enabling collaborative media stream editingUS20150365365 *Jun 1, 2015Dec 17, 2015Electronics And Telecommunications Research InstituteMethod and apparatus for modifying messageUS20150379015 *Dec 29, 2014Dec 31, 2015Lexxe Pty Ltd.Method and system for scoring textsCN1930883BNov 1, 2005Sep 29, 2010松下电器产业株式会社Display apparatus and display methodCN102651719A *Feb 28, 2011Aug 29, 2012国际商业机器公司Method and equipment for tracking message topics in message interaction environment* Cited by examinerClassifications U.S. Classification715/259, 707/E17.058, 715/273, 709/206International ClassificationG06F17/30Cooperative ClassificationY10S707/99943, Y10S707/99933, Y10S707/99935, Y10S707/99932, Y10S707/99945, G06F17/30719, G06F17/30616European ClassificationG06F17/30T5S, G06F17/30T1ELegal EventsDateCodeEventDescriptionMar 24, 2003ASAssignmentOwner name: SONY CORPORATION, JAPANFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:SAITO, MARI;YAMAMOTO, NORIYUKI;REEL/FRAME:013874/0804;SIGNING DATES FROM 20030207 TO 20030210Apr 26, 2011FPAYFee paymentYear of fee payment: 4Apr 23, 2015FPAYFee paymentYear of fee payment: 8RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services