JP2012194920A - Program and image processing device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a program and an image processing device capable of using the other object corresponding to one object in accordance with a use state of a user.SOLUTION: The other object T1 is temporarily stored in a storage unit. Whether one object T2 displayed on a display unit 14 is replaced with the other object T1 stored temporarily in the storage unit is detected by a control unit. When replacement is detected, the other object T1 and one object T2 are associated with each other by the control unit and are stored in the storage unit. When one object T2 is displayed on the display unit 14, the storage unit is referred to by the control unit, and the other object T1 associated with one object T2 is extracted. The control unit replaces one object T2 with the other object T1 and displays the other object T1 on the display unit 14.

Description

  The present invention relates to a program and an information processing apparatus for performing information processing by a computer.

  A technique for editing data using an information processing apparatus is disclosed (see Patent Documents 1 and 2). These disclose techniques for copying and pasting data to a clipboard.

JP-A-8-185514 JP-A-8-212219

  However, when trying to use the data on the clipboard later, the data may already be deleted, and there is a problem that the data must be searched again.

  The present invention has been made in view of such circumstances. The purpose is to provide a program or the like that can use another object corresponding to one object in accordance with the use state of the user.

  The program disclosed in the present application is a program for performing information processing by a computer having a control unit and a display unit. In the computer, one object displayed on the display unit is transferred to another object temporarily stored in the storage unit. The control unit detects whether or not it has been replaced, and when the replacement is detected, the control unit stores the other object and one object in association with each other, and the one object is stored in the storage unit. When displayed on the display unit, the control unit refers to the storage unit and executes a process of extracting another object associated with the one object.

  According to one aspect of the present application, it is possible to use another object corresponding to one object in accordance with the usage status of the user.

It is explanatory drawing which shows the image of a replacement process. It is explanatory drawing which shows the image of a conversion process. It is explanatory drawing which shows the hardware group of information processing apparatus. It is explanatory drawing which shows the record layout of an example file. It is explanatory drawing which shows the record layout of an evacuation table. It is explanatory drawing which shows the record layout of an object table. It is explanatory drawing which shows the record layout of a link table. It is a flowchart which shows the procedure of a replacement process. It is a flowchart which shows the procedure of a replacement process. It is a flowchart which shows the procedure of a replacement process. It is a flowchart which shows the procedure of a replacement process. It is a flowchart which shows the procedure of a replacement process. It is a flowchart which shows the procedure of a replacement process. It is explanatory drawing which shows the image of a replacement process. 10 is an explanatory diagram showing a record layout of an object table according to Embodiment 2. FIG. It is explanatory drawing which shows the record layout of the link table which concerns on Embodiment 2. FIG. It is a flowchart which shows the procedure of a replacement process. It is a flowchart which shows the procedure of a replacement process. It is a flowchart which shows the procedure of a replacement process. It is a flowchart which shows the procedure of a replacement process. It is a flowchart which shows the procedure of a replacement process. It is a flowchart which shows the procedure of a replacement process. It is a flowchart which shows the procedure of a replacement process. It is a flowchart which shows the procedure of a replacement process. FIG. 10 is a block diagram illustrating a hardware group of a personal computer according to a third embodiment. It is explanatory drawing which shows the record layout of the link table which concerns on Embodiment 3. FIG. It is a flowchart which shows the procedure of a link memory | storage process. It is a flowchart which shows the procedure of a link memory | storage process. It is explanatory drawing which shows the procedure of the link extraction process based on the threshold link number. It is explanatory drawing which shows the procedure of the link extraction process based on the threshold link number. It is explanatory drawing which shows the procedure of the link extraction process based on the threshold link number. It is explanatory drawing which shows the procedure of the link extraction process based on the threshold link number. It is explanatory drawing which shows the procedure of the link extraction process based on the threshold link number. It is explanatory drawing which shows the record layout of a link work table. It is a flowchart which shows the extraction process procedure of the hash value according to the threshold link number. It is a flowchart which shows the extraction process procedure of the hash value according to the threshold link number. It is a flowchart which shows the extraction process procedure of the hash value according to the threshold link number. It is a flowchart which shows the display processing procedure of the link column and abbreviated data using a link work table. It is a functional block diagram which shows operation | movement of the personal computer of the form mentioned above. FIG. 10 is a block diagram illustrating a hardware group of a personal computer according to a fourth embodiment.

Embodiment 1
Hereinafter, embodiments will be described with reference to the drawings. FIG. 1 is an explanatory diagram showing an image of replacement processing. As shown in FIG. 1A, an object T1 (hereinafter, represented by the object T in some cases) is displayed on the application A1 (hereinafter, represented by the application A in some cases). The object T1 is, for example, image data, text data, a graph, a table, audio data, moving image data, or a hyperlink describing a URL (Uniform Resource Locator). The object T1 may be a combination of text and image data. In addition, the object may be a slide of a presentation application such as PowerPoint (registered trademark). Further, it may be image data, text data, or a combination of image data and text data on a document display application such as PDF (Portable Document Format: registered trademark). The object may be Web page data created by HTML (HyperText Markup Language). In the present embodiment, it is assumed that the object T1 is image data in the GIF (Graphics Interchange Format) format and the object T2 is text data.

  In the application A1, the user copies the object T1 and stores it on the clipboard. In FIG. 1B, an object T2 described as “Ox system configuration diagram” is displayed in a different application A2. The user selects the object T2 of “◯ × system configuration diagram”. When the object T1 is pasted on the object T2 selected here, the object T1 is replaced and pasted on the application A2 as shown in FIG. 1C. In this case, the object T2 and the object T1 are associated and stored.

  FIG. 2 is an explanatory diagram showing an image of the conversion process. In FIG. 2A, “marubatsu” is input in the application A2, and a plurality of sentence example candidates L1 are displayed. “XX system price list”, “XX system restriction table”, “XX system configuration diagram ★”, and “XX system development system diagram” are displayed as sentence example candidates L1. Of these, “★” is also written as an icon in the sentence example candidate L1 related to “XX system configuration diagram” that can be replaced. In addition, the sentence example candidate L1 displays a thumbnail L3 of the object T1 in addition to the link column L2 indicating the category, attribute, and use date and time of the object T1. When the user desires conversion to the object T1, the user selects the link field L2 or the thumbnail L3. Thereby, as shown in FIG. 2B, the converted object T1 is displayed on the application A2. Details will be described below.

  FIG. 3 is an explanatory diagram showing a hardware group of the information processing apparatus 1. The information processing apparatus 1 is, for example, a personal computer, a mobile phone, a PDA (Personal Digital Assistant), a book reader, a game machine, or a control computer such as a medical device, a semiconductor manufacturing apparatus, or a machine tool. Hereinafter, the information processing apparatus 1 will be described as being a personal computer 1. The personal computer 1 includes a CPU (Central Processing Unit) 11 as a control unit, a RAM (Random Access Memory) 12, an input unit 13, a display unit 14, a storage unit 15, a clock unit 18, a communication unit 16, and the like. The CPU 11 is connected to each part of the hardware via the bus 17. The CPU 11 controls each part of the hardware according to the control program 15P stored in the storage unit 15.

  The RAM 12 is, for example, SRAM (Static RAM), DRAM (Dynamic RAM), flash memory, or the like. The RAM 12 also functions as a storage unit, and temporarily stores various data generated when the CPU 11 executes various programs. When the object T is copied on the application A, the CPU 11 temporarily stores the copied object T data, thumbnail L3, and attribute in the RAM 12 which is a clipboard. In the present embodiment, an example in which the copied object T is temporarily stored in the RAM 12 as a clipboard will be described. However, the present invention is not limited to this. The CPU 11 may temporarily store the copied object T in another storage medium such as a USB (Universal Serial Bus) memory (not shown) in addition to the storage unit 15.

  The input unit 13 is an input device such as a mouse, a keyboard, a touch pad, or a touch panel, and outputs received operation information to the CPU 11. The display unit 14 is a liquid crystal display, an organic EL (electroluminescence) display, or the like, and displays various information according to instructions from the CPU 11. The clock unit 18 outputs date and time information to the CPU 11. The communication unit 16 is a wired or wireless local area network (LAN) card and transmits / receives information to / from another computer (not shown) via a communication network N such as the Internet. The storage unit 15 is, for example, a hard disk or a large-capacity flash memory, and stores the control program 15P. In addition, the storage unit 15 stores a sentence example file 151, a save table 152, an object table 153, a link table 154, and the like.

  FIG. 4 is an explanatory diagram showing a record layout of the sentence example file 151. The sentence example file 151 includes a key field and a sentence example field. The sentence example file 151 stores a sentence example candidate L1 when a character is input from the input unit 13 to the input line. In the example of FIG. 4, “Ox”, “Ox system”, “Ox system configuration diagram”, “Ox system price list”, “Ox system restriction table”, etc. Example sentences are stored. In the present embodiment, for ease of explanation, an example in which a plurality of sentence examples corresponding to the character string input to the sentence example file 151 are stored will be described, but the present invention is not limited to this. In addition to the sentence example file 151, a word dictionary that is referred to when converting an input character string into a kanji character, and a grammar dictionary that defines grammars such as the usage of clauses and kana characters may be used.

  FIG. 5 is an explanatory diagram showing a record layout of the save table 152. The save table 152 includes a format field and a size field related to attributes in addition to the object data field and the category field. As shown in FIG. 1B and FIG. 1C, when the object T2 is selected by the input unit 13 and is replaced (pasted) with the object T1 stored in the RAM 12, the CPU 11 stores the data and attributes of the object T2 in the save table 152. To remember. In FIG. 1, a replacement process between different applications A1 and A2 is given as an example, but a replacement process between the same applications A may be used.

  In the object data field, data of the replaced object T is stored. The attribute refers to unique information and characteristics of the object, and corresponds to, for example, the file format of the object data, the size of the file of the object data, and the like. In the format field, the data format of the object data is stored in association with the object data. For example, when the object T is a figure, it is GIF, BMP (Bitmap), JPEG (Joint Photographic Experts Group), or the like. When the object T is a sentence, a format such as txt indicating the text is stored.

  When the object T is composed of a plurality of objects such as texts, hyperlinks describing URLs, and drawings, extensions of applications such as Microsoft PowerPoint (registered trademark) slides, PDF (registered trademark) files, etc. Is remembered as When the object T is related to a Web page, a format such as an HTML document is stored. When the object T is sound or image, formats such as mp3 (MPEG-1 Audio Layer 3), wma (Windows (registered trademark) Media Audio), MPEG (Moving Picture Experts Group) 4 are stored.

  In the category field, the category of the object T is stored in association with the object data and format. The CPU 11 stores a category corresponding to the format stored in the format field in the category field. Specifically, the CPU 11 refers to the storage unit 15 that stores the correspondence between the format and the category in advance, and extracts the category corresponding to the format. For example, when the format is GIF, the CPU 11 extracts the category “figure”. When the format is txt, the CPU 11 extracts the category “text”. When the format is an extension of a PowerPoint (registered trademark) slide, the CPU 11 extracts the category “PPT”.

  In the size field, the size of the object is stored in association with the object data. For example, the capacity (for example, 63 kilobytes), the image area (for example, 380 × 240 indicating the number of vertical and horizontal pixels) when the object T is a figure, and the number of characters (for example, 250 characters) may be stored when the object T is a sentence.

  FIG. 6 is an explanatory diagram showing a record layout of the object table 153. The object table 153 includes an object data field, a category field, a format field, a size field, an abbreviated data field, a use date / time field, and the like. When the replacement process of the object T occurs, the CPU 11 stores information regarding the replacement source and the replacement destination object T in the object table 153. In the example of FIG. 6, information related to the object T2 (◯ × system configuration diagram) which is a replacement source sentence and the object T1 which is a replacement destination diagram is stored.

  In the object data field, binary data of the object T is stored. Since the category field, the format field, and the size field are as described in the save table 152, detailed description thereof is omitted. In the omitted data field, information obtained by reducing the data capacity of the object data is stored in association with the object data. For example, in the case of the figure, the thumbnail L3. In the case of a sentence, it may be a part of the sentence, for example, the first few letters and the last few letters of the sentence. In the case of other sentences, the keywords in the sentences that match the nouns in the dictionary file stored in the storage unit 15 or the first few characters may be omitted data. In the case of audio data, some audio data may be omitted data. In the case of a PowerPoint slide, the slide thumbnail L3 may be omitted data.

  In the use date / time field, the date / time output from the clock unit 18 when the replacement process occurs is stored in association with the object data. In FIG. 6, the year is not shown. When the replacement process occurs, the CPU 11 reads the replacement source object data, category, format, and size from the save table 152 and stores them in the object table 153. The CPU 11 refers to the object data and generates abbreviated data. The CPU 11 stores the generated omitted data in the object table 153. The CPU 11 stores the date and time output from the clock unit 18 in association with the object data.

  The CPU 11 reads the replacement destination object data from the RAM 12 and stores it in the object table 153. The CPU 11 stores the object data format and size in the object table 153. The CPU 11 refers to the storage unit 15 to extract a category corresponding to the object data and stores it in the object table 153 together with the date and time output from the clock unit 18. Further, the CPU 11 generates abbreviated data of the replacement object T and stores it in the abbreviated data field.

  FIG. 7 is an explanatory diagram showing a record layout of the link table 154. The link table 154 includes a replacement source field and a replacement destination field. In the replacement source field, the replacement source object data at the time of the replacement processing is stored as binary data. In the replacement destination field, the replacement destination object data at the time of replacement processing is stored as binary data in association with the replacement source object data. In the example of FIG. 1, the data of the object T2 “Ox system configuration diagram” is stored in the replacement source field, and the image data of the object T1 is stored in the replacement destination field in association with the data.

  Note that the record layout and data contents of each file and table described in this embodiment are merely examples, and the present invention is not limited thereto. Other data layouts may be adopted as long as the relationship between data is maintained. For example, the relationship between the object data when the replacement process is performed may be stored in the object table 153 without providing the link table 154. In the present embodiment, an example of storing each file and table in the storage unit 15 has been described, but the present invention is not limited to this. The data may be distributed and stored in the RAM 12 or a plurality of storage units. In addition, the object table 153 and the link table 154 may be stored in a server computer (not shown) connected via the communication network N. In this case, the CPU 11 may access the server computer as necessary to read and write necessary information.

  Software processing in the above hardware will be described using a flowchart. 8 and 9 are flowcharts showing the procedure of the replacement process. The CPU 11 determines whether a copy process for the object T has been accepted through the input unit 13 (step S81). If the CPU 11 determines that the copy process is not accepted (NO in step S81), the CPU 11 waits until the copy process is accepted. If the CPU 11 determines that the copy process has been accepted (YES in step S81), the process proceeds to step S82. The CPU 11 stores the replacement object data in the RAM 12 (step S82).

  The CPU 11 accepts selection of a replacement source object (step S83). Specifically, the user selects an object to be replaced by selecting the object to be replaced through the input unit 13 or dragging the object T from the beginning to the end. The CPU 11 determines whether a replacement process has been accepted (step S84). Specifically, the CPU 11 determines whether or not the object T in the clipboard stored in the RAM 12 has been pasted on the object T selected in step S83. In the present embodiment, an example in which there is one object T stored in the clipboard will be described. However, the present invention is not limited to this. The CPU 11 may divide the clipboard into a plurality of areas and display abbreviated data of the plurality of objects T on the display unit 14. The CPU 11 pastes one object T selected from the plurality of objects T.

  If the CPU 11 has not received the replacement process (NO in step S84), the CPU 11 waits until the replacement process is received. When the CPU 11 accepts the replacement process (YES in step S84), the CPU 11 stores the replacement source object data in the save table 152 (step S85). The CPU 11 stores the format and size of the replacement source object data in the save table 152 (step S86). The CPU 11 extracts the category of the replacement source object T from the storage unit 15, and stores the extracted category in the save table 152 (step S87).

  The CPU 11 reads out the replacement destination object data from the RAM 12 and stores it in the object table 153 (step S88). The CPU 11 stores the format and size of the replacement destination object data in the object table 153 (step S89). The CPU 11 extracts the category of the replacement object T from the storage unit 15, and stores the extracted category in the object table 153 (step S91). The CPU 11 generates abbreviated data for the replacement target object T (step S92). For example, when the object T is an image, the CPU 11 generates a thumbnail L3 of the image. Further, in the case of a sentence, the CPU 11 extracts a sentence from a sentence for a part (for example, the first 100 characters at the beginning and the last 100 characters at the end of the sentence) stored in the storage unit 15 to generate omitted data. If the object T is a presentation slide, the CPU 11 generates a slide thumbnail L3. Note that when the presentation application A has already generated the thumbnail L3, the CPU 11 may acquire the generated thumbnail L3. The CPU 11 stores the generated omitted data of the replacement destination object T in the object table 153 (step S93).

  The CPU 11 reads the replacement source object data, category, format, and size from the save table 152 and stores them in the object table 153 (step S94). The CPU 11 generates abbreviated data of the replacement source object T (step S95). In the present embodiment, the omitted data is generated. However, instead of generating the omitted data, icons corresponding to categories or formats may be displayed. For example, when the object T is a power point slide, an icon used when starting the power point may be stored. If the object T is audio data, an icon that can be visually recognized as audio data (for example, a musical note mark icon) is stored, and if it is video data, an icon that can be visually recognized as video data (for example, a movie film mark) Icon) may be stored.

  The CPU 11 stores the omitted data of the replacement source object T in the object table 153 (step S96). The CPU 11 stores the date and time output from the clock unit 18 during the replacement process in step S84 as the use date and time in the object table 153 in association with the replacement source object data and the replacement destination object data (step S97). The CPU 11 stores the replacement destination object data stored in step S88 and the replacement source object data stored in step S94 in association with each other in the link table 154 (step S98). In the present embodiment, an example in which replacement source object data and data related to the data are temporarily stored in the save table 152 has been described, but the present invention is not limited to this. Instead of storing in the evacuation table 152, it may be stored directly in the object table 153.

  10 and 11 are flowcharts showing the procedure of the replacement process. The CPU 11 determines whether or not a character input has been accepted via the input unit 13 (step S101). If the CPU 11 determines that no character input is accepted (NO in step S101), the CPU 11 waits until a character input is accepted. If the CPU 11 determines that a character input has been accepted (YES in step S101), the CPU 11 refers to the sentence example file 151 and extracts candidate sentence examples (step S102). The CPU 11 displays the sentence example candidate L1 on the display unit 14 as shown in FIG. 2 (step S103). The CPU 11 determines whether or not the replacement source object data corresponding to the sentence example candidate L1 exists in the link table 154 (step S104). Specifically, the CPU 11 searches the link table 154 using the binary data of each sentence example candidate L1 that is the replacement source, and determines whether or not the corresponding binary data of the replacement source exists.

  If the CPU 11 determines that there is no replacement source object data (NO in step S104), the process proceeds to step S105. The CPU 11 accepts selection of one sentence example candidate L1 from the sentence example candidates L1 through the input unit 13 (step S105). The CPU 11 inputs the selected sentence example and displays it on the display unit 14 (step S106). If the CPU 11 determines that the replacement source object data corresponding to the replacement source sentence example L1 exists (YES in step S104), the process proceeds to step S107. The CPU 11 displays an icon in the vicinity of the sentence example candidate L1 determined to exist (step S107). In the present embodiment, an example showing an icon marked with “★” is given, but the present invention is not limited to this. For example, the sentence example candidate L1 determined to exist is displayed on the display unit 14 in a form that can be distinguished from other sentence example candidates L1 that do not have the replacement target object data, such as reverse processing, coloring processing, and changing the font size. That's fine.

  The CPU 11 refers to the replacement destination object data, and extracts the category, format, size, and use date / time of the corresponding replacement destination object T from the object table 153 (step S108). The CPU 11 displays the category, format, size, and use date / time of the replacement target object T on the link field L2 (step S109). As shown in FIG. 2A, a link column L2 is displayed in the vicinity of the sentence example candidate L1. Further, the CPU 11 refers to the replacement destination object data, and extracts the thumbnail L3 of the corresponding replacement destination object T from the omitted data field of the object table 153 (step S111). The CPU 11 displays the thumbnail L3 of the replacement target object T on the display unit 14 (step S112). In this embodiment, an example in which the link field L2 and the thumbnail L3 are displayed if there is a replacement target object T corresponding to the sentence example candidate L1 will be described, but the present invention is not limited to this. When the pointer is superimposed on the sentence example candidate L1 where the replacement target object T exists through the input unit 13, the link field L2 and the thumbnail L3 may be displayed on the display unit 14.

  As shown in FIG. 2A, a thumbnail L3 is displayed near the sentence example candidate L1. In the present embodiment, the category, format, size, use date and time, and thumbnail L3 of the replacement target object T are all displayed, but any one or a combination thereof may be used. Moreover, although the example which displays the thumbnail L3 was given in this embodiment, you may display a part of text data as abbreviated data. In the case of moving image data, the CPU 11 may activate the moving image reproduction application A and reproduce a portion of the moving image with the same size as the thumbnail L3. In the case of audio data, the CPU 11 may activate the audio reproduction application A and output a part of the audio data from a speaker (not shown).

  The CPU 11 determines whether selection of either the link field L2 or the thumbnail L3 has been received (step S113). If the CPU 11 determines that the selection of the link field L2 or the thumbnail L3 has not been accepted (NO in step S113), the process proceeds to step S114. CPU11 judges whether selection of sentence example candidate L1 was received (Step S114). If the CPU 11 determines that selection of the sentence example candidate L1 has not been received (NO in step S114), the process returns to step S113. If the CPU 11 determines that the selection of the sentence example candidate L1 has been received (YES in step S114), the CPU 11 deletes the sentence example candidate L1 from the display unit 14 (step S115). Instead, the CPU 11 inputs the selected sentence example to the application A, and displays the input sentence example on the display unit 14 (step S116).

  If the CPU 11 determines that the selection of the link field L2 or the thumbnail L3 has been received (YES in step S113), the process proceeds to step S117. The CPU 11 extracts the replacement destination object data corresponding to the selected sentence example candidate L1 from the object table 153 or the link table 154 (step S117). The CPU 11 deletes the sentence example candidate L1 from the display unit 14. The CPU 11 replaces the input character with the replacement destination object data (step S118). The CPU 11 displays the replacement object data on the display unit 14 (step S119). The CPU 11 acquires the date and time from the clock unit 18 (step S1110). The CPU 11 refers to the object table 153 and updates the use date and time of the replacement destination object data (step S1111). In the present embodiment, an example has been described in which the process proceeds to step S117 when the link field L2 or the thumbnail L3 is selected. However, the present invention is not limited to this. Even when the sentence example candidate L1 in which the replacement target object T exists is selected, instead of inputting the replacement source character data, the process may proceed to step S117 to execute the replacement processing to the replacement target object T. good.

  12 and 13 are flowcharts showing the procedure of the replacement process. In addition to displaying the sentence example candidate L1, the object T may be selected. The CPU 11 determines whether or not the selection of the object T displayed on the display unit 14 has been received via the input unit 13 (step S121). Specifically, the CPU 11 determines whether a text is selected by a drag operation by the input unit 13. In addition, the CPU 11 determines whether a selection process after a right click by the input unit 13 has been received.

  FIG. 14 is an explanatory diagram showing an image of replacement processing. FIG. 14A shows that “Ox system configuration diagram” already input is selected by the drag process. If the CPU 11 determines that the selection of the object T has not been accepted (NO in step S121), the CPU 11 waits until it is accepted. If the CPU 11 determines that selection of the object T has been received (YES in step S121), the process proceeds to step S122. The CPU 11 determines whether or not object data corresponding to the selected replacement source object data exists in the link table 154 (step S122).

  If the CPU 11 determines that there is no object data corresponding to the replacement source object data (NO in step S122), the process ends. If the CPU 11 determines that there is object data corresponding to the replacement source object data (YES in step S122), the CPU 11 extracts the category, format, size, and use date / time of the replacement target object T (step S123). The CPU 11 extracts the thumbnail L3 or omitted data of the replacement object T (step S124). Specifically, the CPU 11 extracts the replacement destination object data corresponding to the replacement source object data from the link table 154. The CPU 11 extracts the category, format, size, use date / time, and omitted data corresponding to the extracted object data. In the following, the omitted data other than the thumbnail L3 is referred to as partial character data L4 in which some characters are omitted. The CPU 11 determines whether or not there are a plurality of replacement destination objects T corresponding to the replacement source object T (step S125). In the present embodiment, a description will be given assuming that there are a plurality.

  If it is determined that there are a plurality of CPUs 11 (YES in step S125), the CPU 11 determines whether extraction processing for all replacement destination objects T has been completed (step S126). If the CPU 11 determines that the extraction process for all the replacement target objects T has not been completed (NO in step S126), the process proceeds to step S123. The CPU 11 executes the same process for the replacement destination object T that has not finished the extraction process. As a result, the extraction process for the object T that has been replaced in the past with respect to “Ox system configuration diagram” is repeatedly performed. If the CPU 11 determines that there are not a plurality of replacement destination objects T (NO in step S125), the process proceeds to step S127. If the CPU 11 determines that the processing for all the replacement destination objects T has been completed (YES in step S126), the process proceeds to step S127.

  The CPU 11 sorts the category, format, size, and usage date / time of the replacement target object T in the link column L2 in order of usage date and displays them on the display unit 14 (step S127). The CPU 11 displays the thumbnail L3 or the partial character data L4 in the vicinity of the link column L2 of each corresponding object T (step S128). In the example of FIG. 14, the link column L2 of the diagram with the new usage date and time is displayed above the link column L2 of the sentence with the old usage date and time. In the vicinity of the link column L2 in the figure, a thumbnail L3 is displayed in association with the link column L2. In the vicinity of the link column L2 of the sentence, partial character data L4 is displayed in association with the link column L2. As shown in FIG. 14A, the partial character data L4 displays a part of all 81 characters “A system created this time.

  The CPU 11 determines whether selection of the link field L2, thumbnail L3, or partial character data L4 has been received from the input unit 13 (step S129). If the CPU 11 determines that it has not been accepted (NO in step S129), it waits until it is accepted. When the CPU 11 accepts selection of the link field L2, thumbnail L3, or partial character data L4 (YES in step S129), the CPU 11 extracts the corresponding replacement destination object data from the object table 153 (step S130). Specifically, when the link field L2 or the thumbnail L3 shown in the figure is selected, the CPU 11 extracts the object data shown in the figure from the object table 153. When the link column L2 or partial character data L4 related to the sentence is selected, the CPU 11 extracts object data related to the sentence from the object table 153.

  The CPU 11 replaces the selected character selected in step S121 with the extracted replacement object data (step S131). The CPU 11 displays the replacement destination object data on the display unit 14 (step S132). The example of FIG. 14B shows that the link column L2 or the thumbnail L3 in the figure has been selected and replaced with the object T2 from the selected character “◯ × system configuration diagram”. The CPU 11 acquires the date and time from the clock unit 18 (step S133). The CPU 11 refers to the object table 153 and updates the use date and time of the replacement destination object data (step S134). Thereby, the replacement process based on the usage record of the user can be performed.

Embodiment 2
The second embodiment relates to a form in which a replacement source and a replacement destination object T are associated using a hash value. FIG. 15 is an explanatory diagram showing a record layout of the object table 153 according to the second embodiment. A new hash value field is provided. During the replacement process, the CPU 11 calculates a hash value of the replacement source object T and a replacement destination object T based on the hash function stored in the storage unit 15. The CPU 11 stores the hash value calculated in association with the object data in the hash value field.

  FIG. 16 is an explanatory diagram showing a record layout of the link table 154 according to the second embodiment. Although the object data is stored in the first embodiment, the hash value of the object T is stored in the second embodiment. During the replacement process, the CPU 11 stores the hash value of the replacement source object T in the replacement source hash value field. Further, the CPU 11 stores the hash value of the replacement destination object T in the replacement destination hash value field in association with the hash value of the replacement destination object T. In the example of FIG. 16, the hash value “1212” of “◯ × system configuration diagram” that is the text data of the replacement source and the hash value “16AF” of the replacement destination image are stored in association with each other.

  17 to 19 are flowcharts showing the procedure of the replacement process. The CPU 11 determines whether a copy process for the object T has been accepted through the input unit 13 (step S171). If the CPU 11 determines that the copy process is not accepted (NO in step S171), the CPU 11 waits until the copy process is accepted. If the CPU 11 determines that the copy process has been accepted (YES in step S171), the process proceeds to step S172. The CPU 11 stores the replacement object data in the RAM 12 (step S172).

  The CPU 11 accepts selection of the replacement source object T (step S173). The CPU 11 determines whether a replacement process has been accepted (step S174). If the CPU 11 has not received a replacement process (NO in step S174), the CPU 11 waits until a replacement process is received. When the CPU 11 receives the replacement process (YES in step S174), the CPU 11 stores the replacement source object data in the save table 152 (step S175). The CPU 11 stores the format and size of the replacement source object data in the save table 152 (step S176). The CPU 11 extracts the category of the replacement source object T from the storage unit 15, and stores the extracted category in the save table 152 (step S177).

  The CPU 11 reads the replacement object data from the RAM 12 (step S178). The CPU 11 reads a hash function stored in advance in the storage unit 15 or described in advance in the control program 15P. The CPU 11 calculates a hash value of the replacement object data based on the read hash function (step S179). The CPU 11 determines whether or not the hash value of the replacement destination object data is already stored in the object table 153 (step S181).

  If the CPU 11 determines that it is not stored (NO in step S181), it stores the replacement destination object data and hash value in the object table 153 (step S182). The CPU 11 stores the format and size of the replacement object T in the object table 153 in association with the hash value (step S183). The CPU 11 extracts the category of the replacement target object T from the storage unit 15, and stores the extracted category in the object table 153 in association with the hash value (step S184). The CPU 11 generates abbreviated data for the replacement object T (step S185). The CPU 11 stores the generated omitted data of the replacement destination object T in the object table 153 in association with the hash value (step S186).

  Thereafter, the process proceeds to step S187. If the CPU 11 determines that the hash value of the replacement object data has already been stored (YES in step S181), the process proceeds to step S187. The CPU 11 stores the date and time output from the clock unit 18 in association with the hash value of the replacement target object T (step S187). As a result, various data related to the replacement target object T are stored in association with the hash value. The CPU 11 reads the replacement source object data from the save table 152 (step S188).

  The CPU 11 calculates a hash value of the replacement source object data based on the read hash function (step S189). The CPU 11 determines whether or not the hash value of the replacement source object data is already stored in the object table 153 (step S191). If the CPU 11 determines that it is not stored (NO in step S191), it reads out the category, format, and size of the replacement source object data from the save table 152 (step S192).

  The CPU 11 generates abbreviated data of the replacement source object T (step S193). The CPU 11 stores the replacement source object data, hash value, category, format, size, and omitted data in association with the object table 153 (step S194). In the present embodiment, an example in which all of the category, format, size, and omitted data are stored in association with the hash value has been described. However, the present invention is not limited to this. In association with the hash value and the object data, any one of the category, the format, the size, the omitted data, or any combination thereof may be used. Thereafter, the process proceeds to step S195.

  If the CPU 11 determines that the hash value of the replacement source object data has already been stored (YES in step S191), the process proceeds to step S195. The CPU 11 stores the date and time in association with the hash value of the replacement target object T (step S195). Note that the CPU 11 may store the date and time output from the clock unit 18 during the replacement process in step S174 in the object table 153 as the usage date and time. If the hash value has already been stored and the date and time when it was replaced in the past is stored, it is updated to the date and time when it was replaced this time. In the present embodiment, the date and time at the time of replacement processing are used, but some time zones may be mixed.

  The CPU 11 determines whether or not the combination of the hash value of the replacement destination object data calculated in step S179 and the hash value of the replacement source object data calculated in step S189 is stored in the link table 154 (step S196). ). If the CPU 11 determines that the combination is registered (YES in step S196), the process ends. On the other hand, when the CPU 11 determines that no combination is registered (NO in step S196), the process proceeds to step S197.

  The CPU 11 stores the combination of the hash value of the replacement source object T and the hash value of the replacement destination object T in the link table 154 (step S197). Thus, each time a replacement process occurs, a combination of a replacement destination and a replacement source hash value is accumulated as shown in FIG.

  20 to 22 are flowcharts showing the procedure of the replacement process. CPU11 judges whether the character input was received via the input part 13 (step S201). If the CPU 11 determines that no character input is accepted (NO in step S201), the CPU 11 waits until a character input is accepted. If the CPU 11 determines that a character input has been received (YES in step S201), the CPU 11 refers to the sentence example file 151 and extracts candidate sentence examples (step S202). The CPU 11 displays the sentence example candidate L1 on the display unit 14 as shown in FIG. 7 (step S203). The CPU 11 calculates a hash value of the sentence example candidate L1 (step S204).

  CPU11 judges whether the hash value of all the sentence example candidates L1 was calculated (step S205). If the CPU 11 determines that the hash values of all the sentence example candidates L1 have not been calculated (NO in step S205), the process returns to step S204. As a result, hash values of all the plurality of sentence example candidates L1 are calculated. If the CPU 11 determines that the hash values of all the sentence example candidates L1 have been calculated (YES in step S205), the process proceeds to step S206.

  The CPU 11 determines whether or not a replacement source hash value corresponding to the hash value of each sentence example candidate L1 exists in the link table 154 (step S206). Specifically, the CPU 11 determines whether or not the hash value exists in the replacement source hash value field of the link table 154 using the hash value of each sentence example candidate L1 that is the replacement source.

  If the CPU 11 determines that there is no replacement source hash value (NO in step S206), the process proceeds to step S207. The CPU 11 accepts selection of one sentence example candidate L1 from the sentence example candidates L1 through the input unit 13 (step S207). The CPU 11 inputs the selected sentence example and displays it on the display unit 14 (step S208). If the CPU 11 determines that there is a replacement source hash value corresponding to the hash value of the replacement source sentence candidate L1 (YES in step S206), the process proceeds to step S209. The CPU 11 displays an icon in the vicinity of the sentence example candidate L1 determined to exist (step S209).

  The CPU 11 refers to the link table 154 and reads the replacement destination hash value corresponding to the hash value of the sentence example candidate L1 for which it is determined in step S206 that the corresponding hash value is stored (step S211). The CPU 11 reads the replacement destination object data from the object table 153 based on the replacement destination hash value (step S212). The CPU 11 refers to the replacement destination object data, and extracts the category, format, size, and use date / time of the corresponding replacement destination object T from the object table 153 (step S213).

  The CPU 11 displays the category, format, size, and use date / time of the replacement target object T on the link field L2 (step S214). The CPU 11 stores the link field L2 displayed on the display unit 14 and the hash value of the replacement destination object T displayed in the link field L2 in association with each other. The CPU 11 refers to the replacement destination object data, and extracts the omitted data of the corresponding replacement destination object T from the object table 153 (step S215). The CPU 11 displays the omitted data of the replacement object T on the display unit 14 (step S216). The CPU 11 stores the thumbnail L3 displayed on the display unit 14 and the hash value of the replacement destination object T displayed on the thumbnail L3 in association with each other. When there are a plurality of replacement target objects T for one sentence example candidate L1, as described in the first embodiment, the link column L2 and the omitted data are sequentially arranged so that the new date and time is on the upper side. What is necessary is just to display on the display part 14. FIG.

  The CPU 11 determines whether selection of either the link field L2 or the thumbnail L3 (omitted data) has been accepted (step S217). When the CPU 11 determines that the selection of the link field L2 or the thumbnail L3 is not accepted (NO in step S217), the CPU 11 proceeds to step S218. The CPU 11 determines whether or not the selection of the sentence example candidate L1 has been accepted (step S218). If the CPU 11 determines that selection of the sentence example candidate L1 has not been received (NO in step S218), the process returns to step S217. When the CPU 11 determines that the selection of the sentence example candidate L1 has been received (YES in step S218), the CPU 11 deletes the sentence example candidate L1 from the display unit 14 (step S219). Instead, the CPU 11 inputs the selected sentence example to the application A, and displays the input sentence example on the display unit 14 (step S221).

  If the CPU 11 determines that the selection of the link field L2 or the thumbnail L3 has been received (YES in step S217), the process proceeds to step S222. The CPU 11 reads the hash value stored in association with the link field L2 or the thumbnail L3. The CPU 11 extracts the replacement destination object data corresponding to the selected link L2 or thumbnail L3 from the object table 153 using the read hash value (step S222). The CPU 11 deletes the sentence example candidate L1 from the display unit 14. The CPU 11 replaces the input character with the replacement destination object data (step S223). The CPU 11 displays the replacement destination object data on the display unit 14 (step S224). The CPU 11 acquires the date and time from the clock unit 18 (step S225). The CPU 11 refers to the object table 153 and updates the use date and time of the replacement destination object data (step S226).

  23 and 24 are flowcharts showing the procedure of the replacement process. The CPU 11 determines whether or not the selection of the object T displayed on the display unit 14 has been received via the input unit 13 (step S231). If the CPU 11 determines that the selection of the object T has not been accepted (NO in step S231), the CPU 11 waits until it is accepted. If the CPU 11 determines that selection of the object T has been received (YES in step S231), the process proceeds to step S232. The CPU 11 calculates a hash value of the replacement source object data based on the hash function stored in the storage unit 15 (step S232). The CPU 11 determines whether or not the hash value of the replacement source object T exists in the link table 154 (step S233).

  If the CPU 11 determines that the hash value of the replacement source object T does not exist (NO in step S233), the process ends. If the CPU 11 determines that the hash value of the replacement source object T exists (YES in step S233), the CPU 11 reads the replacement destination hash value corresponding to the hash value from the link table 154 (step S234). The CPU 11 reads out replacement destination object data corresponding to the replacement destination hash value from the object table 153 (step S235).

  The CPU 11 extracts the category, format, size, and use date and time corresponding to the read replacement destination object data from the object table 153 (step S236). The CPU 11 extracts omitted data of the replacement target object T from the object table 153 (step S237). The CPU 11 determines whether or not there are a plurality of replacement destination objects T corresponding to the replacement source object T (step S238).

  If the CPU 11 determines that there are a plurality of objects (YES in step S238), the CPU 11 determines whether extraction processing for all the replacement destination objects T has been completed (step S239). If the CPU 11 determines that the extraction process for all the replacement target objects T has not been completed (NO in step S239), the process proceeds to step S236. The CPU 11 executes the same process for the replacement destination object T that has not finished the extraction process. If the CPU 11 determines that there are not a plurality of replacement destination objects T (NO in step S238), the process proceeds to step S241. When the CPU 11 determines that the processing for all the replacement destination objects T has been completed (YES in step S239), the CPU 11 proceeds to step S241.

  The CPU 11 sorts the category, format, size, and usage date and time of the replacement target object T in the link field L2 in order of usage date and displays them on the display unit 14 (step S241). The CPU 11 stores the hash value of the replacement destination object T in the RAM 12 in association with the category of the replacement destination object T displayed in the link field L2. The CPU 11 displays the omitted data in the vicinity of the link column L2 of each corresponding object T (step S242). The CPU 11 stores the hash value of the replacement destination object T in the RAM 12 in association with the omitted data of the displayed replacement destination object T. The CPU 11 determines whether or not the selection of the link field L2 or omitted data has been received from the input unit 13 (step S243). If the CPU 11 determines that it has not been accepted (NO in step S243), it waits until it is accepted. When the CPU 11 accepts selection of the link field L2 or omitted data (YES in step S243), the CPU 11 extracts corresponding replacement destination object data from the object table 153 (step S244). Specifically, the CPU 11 reads out the object data corresponding to the hash value from the object table 153 using the hash value stored in the RAM 12 in association with the selected link field L2 or omitted data.

  The CPU 11 replaces the selected character selected in step S231 with the extracted replacement destination object data (step S245). The CPU 11 displays the replacement object data on the display unit 14 (step S246). The CPU 11 acquires the date and time from the clock unit 18 (step S247). The CPU 11 refers to the object table 153 and updates the use date and time of the replacement object data (step S248). In this way, the replacement source and replacement target objects T can be associated using the hash value, and various types of objects T can be efficiently extracted.

  The second embodiment is as described above, and the other parts are the same as those of the first embodiment. Therefore, the corresponding parts are denoted by the same reference numerals, and detailed description thereof is omitted.

Embodiment 3
Embodiment 3 relates to a form using the number of links. FIG. 25 is a block diagram illustrating a hardware group of the personal computer 1 according to the third embodiment. A new link work table 155 is provided in the RAM 12. Details of the link work table 155 will be described later. FIG. 26 is an explanatory diagram showing a record layout of the link table 154 according to the third embodiment. When the replacement source hash value and the replacement destination hash value are stored in the link table 154 as in the third embodiment, the reverse link relationship may be stored together. That is, when the replacement source object T is replaced with the replacement destination object T, the CPU 11 stores the hash value of the replacement source object T in the replacement source hash value field of the link table 154. As a result, as shown in the first line of the record in FIG. 26, the hash value “1212” of the replacement source object T is stored in the replacement source hash value field, which is replacement source information indicating the replacement source.

  Next, the CPU 11 stores the hash value of the replacement destination object T in the replacement destination hash value field of the link table 154 in association with the hash value “1212” of the replacement source object T stored in the replacement source hash value field. To do. As a result, as shown in the first line of the record in FIG. 26, the hash value “16AF” of the replacement target object T is stored in the replacement destination hash value field, which is replacement destination information indicating the replacement destination.

  Further, the CPU 11 stores the hash value “16AF” of the replacement target object T in the replacement source hash value field. As a result, as shown in the second row of the record in FIG. 26, the hash value “16AF” of the replacement target object T is stored in the replacement source hash value field that is the replacement source information. Finally, the CPU 11 replaces the hash value “1212” of the replacement source object T stored in the replacement source hash value field in association with the hash value of the replacement destination object T stored in the replacement source hash value field. Store in the destination hash value field.

  As a result, as shown in the second row of the record in FIG. 26, the hash value “1212” of the replacement source object T is stored in the replacement destination hash value field that is the replacement destination information. For example, in the example of FIG. 2, in addition to the association of the hash value indicating that the character is replaced with the image, the association of the hash value indicating that the image is replaced with the character is additionally stored. Note that the storage method related to association described in the present embodiment may be used in the second embodiment. In the first embodiment, the object data itself may be stored instead of the hash value.

  27 and 28 are flowcharts showing the procedure of the link storage process. After steps S195, S226, and S248, the following processing is performed. The CPU 11 reads the hash value of the replacement source object T and the hash value of the replacement destination object T (step S271). The CPU 11 determines whether or not the combination of the hash value of the replacement source object T in the replacement source hash value field and the hash value of the replacement destination object T in the replacement destination hash value field is stored in the link table 154 (step S272). ).

  When the CPU 11 determines that the combination is not stored in the link table 154 (NO in step S272), the CPU 11 proceeds to step S273. The CPU 11 stores the hash value of the replacement source object T in the replacement source hash value field of the link table 154 (step S273). The CPU 11 stores the hash value of the replacement destination object T in the replacement destination hash value field in association with the hash value of the replacement source object T (step S274). When the CPU 11 determines that the combination is stored (YES in step S272), the process of steps S273 and 274 is skipped.

  The CPU 11 determines whether or not the combination of the hash value of the replacement destination object T in the replacement source hash value field and the hash value of the replacement source object T in the replacement destination hash value field is stored in the link table 154 (step S275). ).

  When the CPU 11 determines that the combination in step S275 is not stored in the link table 154 (NO in step S275), the CPU 11 proceeds to step S276. The CPU 11 stores the hash value of the replacement destination object T in the replacement source hash value field of the link table 154 (step S276). The CPU 11 stores the hash value of the replacement source object T in the replacement destination hash value field in association with the hash value of the replacement destination object T (step S277). If the CPU 11 determines that the combination in step S275 is stored (YES in step S275), it skips the processes in steps S276 and S277. Thereby, the mutual link relationship between the replacement source object T and the replacement destination object T is stored. Below, the link by step S273 and S274 is called a forward link, and the link by step S276 and S277 is called a reverse link.

  In the first and second embodiments, the example in which the hash value stored in the replacement destination hash value table corresponding to the hash value stored in the replacement source hash value table of the link table 154 is extracted has been described. In this case, the number of links from the hash value of one object T to the hash value of another object T is 1. The number of links is not limited to 1 and may be plural. That is, the hash value of the second object T (other object T) linked to the hash value of the first object T (one object T), and further the third object T (further other object T) linked to the hash value. May be extracted.

  In this case, the number of links is two between one object T and another object T, and between another object T further different from the other object T. For example, in the example of FIG. 26, when the number of links is 1, the replacement destination hash value “16AF” corresponding to the replacement source hash value “1212” is extracted. When the number of links is 2, in addition to “16AF” with the number of links 1, the replacement destination hash value “1212” is extracted. The threshold number of links serving as a threshold value is stored in the storage unit 15 in advance. CPU11 reads the threshold link number memorize | stored in the memory | storage part 15, and extracts the hash value which has the link number below a threshold link number. Hereinafter, detailed processing will be described assuming that the threshold link number is four. The threshold link number can be set by the user inputting an appropriate value from the input unit 13. The CPU 11 stores the input threshold link number in the storage unit 15.

  FIG. 29 to FIG. 33 are explanatory diagrams showing the procedure of link extraction processing based on the threshold link number. In FIG. 29A, an arrow indicated by a white triangle indicates a forward link, and shows an example in which the hash value A of the replacement source object T is replaced with the hash value B of the replacement destination object T. In the following description, A, B, C, D, E, H, I, J, H, and Z in FIGS. 29 to 33 are assumed to be hash values of the object T. Based on the relationship between the replacement destination and the replacement source in FIG. 29A, the link table 154 shown in FIG. 29A is constructed.

  The CPU 11 performs the processing described in FIGS. 27 and 28 and stores the reverse link shown in FIG. 29B in the link table 154. An arrow indicated by a black triangle in FIG. 29B indicates a reverse link. Here, assuming that the hash value of the replacement source object T is A and the threshold link number is 4, the hash value extraction procedure of the replacement destination object T having the threshold link number of 4 or less will be described. First, the CPU 11 subtracts 1 from the initial value 1 of the number of links, and calculates the number of links 0. The CPU 11 extracts the hash value with the link number 0 from the start hash value A. In this case, only the hash value A of the start point is extracted. The CPU 11 reads out various data corresponding to the hash value A from the object table 153. The CPU 11 stores the hash value, various data, and the number of links read from the object table 153 in the link work table 155.

  FIG. 34 is an explanatory diagram showing a record layout of the link work table 155. The CPU 11 reads object data, category, format, size, abbreviated data, use date and time, etc. from the object table 153 as various data corresponding to the hash value. Hereinafter, object data, category, format, size, omitted data, and use date and time corresponding to the hash value stored in the object table 153 are referred to as various data. The CPU 11 stores the read various data in association with the hash value. Further, the CPU 11 stores the link number when the hash value is extracted in the link number field in the link number field. In the example described above, the number of links 0 is stored. In addition, description of various data is abbreviate | omitted in the link work table 155 described in FIG. 30 thru | or FIG.

  Subsequently, the CPU 11 increments the number of links to set the number of links to 1. The CPU 11 refers to the link table 154 and extracts a hash value having a link number of 1 from the replacement source hash value to the replacement destination hash value. In the example of FIG. 30B, the hash values Z, B, C, and D can be advanced from A by one frame. The CPU 11 stores the extracted hash value and the number of links 1 in the link work table 155 in association with each other.

  The CPU 11 increments the number of links to set the number of links to 2. The CPU 11 refers to the link table 154 and extracts a hash value having a link number of 2 from the replacement source hash value to the replacement destination hash value. In the example of FIG. 31A, the hash values A, E, H, and I that can be advanced by one frame from the hash values B, C, D, and Z of the replacement source with the number of links of 1 are obtained. The CPU 11 stores the extracted hash value and the number of links 2 in the link work table 155 in association with each other. When there are a plurality of links, the same hash value is extracted. For example, in the case of A → C → A, a hash value A is further extracted. If the same hash value is stored in the link work table 155 in order to eliminate duplication, the CPU 11 deletes the hash value having the smaller number of links from the record. When a plurality of the same hash values are stored for the same number of links, one hash value is left and the other hash values are deleted.

  In the example of FIG. 31B, since the hash value A already exists at the link number 0, the hash value A with the link number 2 is deleted. Since there are a plurality of hash values H in the number of links 2, the record of one hash value H is deleted. The CPU 11 increments the number of links to set the number of links to 3. The CPU 11 refers to the link table 154 and extracts a hash value having 3 links from the replacement source hash value to the replacement destination hash value. In the example of FIG. 32A, hash values C, E, H, D, and J that can be advanced by one frame from hash values E, H, and I having two links are obtained. The CPU 11 stores the extracted hash value and the number of links 3 in the link work table 155 in association with each other.

  The CPU 11 performs a deletion process. In the example of FIG. 32B, since the hash value C already exists for the link number 1, the hash value C for the link number 3 is deleted. Since the hash value E already exists for the link number 2, the hash value E for the link number 3 is deleted from the link work table 155. Since the hash value H already exists in the link number 2, the hash value H with the link number 3 is deleted. Since the hash value D already exists for the link number 1, the hash value D for the link number 3 is deleted.

  The CPU 11 increments the number of links to set the number of links to 4. The CPU 11 refers to the link table 154 and extracts a hash value having the number of links of 4 from the replacement source hash value to the replacement destination hash value. In the example of FIG. 33A, a hash value E that can be advanced by one frame from a hash value J of 3 links. The CPU 11 stores the extracted hash value and the number of links 4 in the link work table 155 in association with each other. Since the CPU 11 stores the hash value E of the link number 2 in the link work table 155, the hash value of the link number 4 having a large link number is deleted. Through the processing described above, a hash value having a link number equal to or less than the threshold link number can be extracted. In the present embodiment, an example in which the link work table 155 is stored in the RAM 12 is described, but the present invention is not limited to this. You may memorize | store in the memory | storage part 15. FIG.

  FIG. 35 to FIG. 37 are flowcharts showing the hash value extraction processing procedure corresponding to the threshold link number. The CPU 11 performs the following processing after YES in step S206 or after YES in step S233. The CPU 11 reads the threshold link number stored in the storage unit 15 (step S351). The CPU 11 reads the hash value of the replacement source object T (step S352). The CPU 11 substitutes 0, which is an initial value, for the number of links, which is a variable (step S353).

  The CPU 11 reads out various data corresponding to the hash value of the replacement source object T from the object table 153 (step S354). The CPU 11 stores various data corresponding to the hash value of the replacement source object T and the link number 0 in the link work table 155 in association with the hash value (step S355). The CPU 11 increments the number of links (step S356). The CPU 11 determines whether or not the number of links is equal to or less than the threshold number of links read in step S351 (step S357). If the CPU 11 determines that the number of links is not less than or equal to the threshold number of links (NO in step S357), the process proceeds to step S371.

  If the CPU 11 determines that the number of links is equal to or less than the threshold number of links (YES in step S357), the process proceeds to step S358. The CPU 11 determines whether or not the hash value of the number of links obtained by subtracting 1 from the number of links is stored in the link work table 155 (step S358). If the CPU 11 determines that it is not stored (NO in step S358), the process proceeds to step S371. If the CPU 11 determines that the link is stored (YES in step S358), the hash value of the number of links obtained by subtracting 1 from the number of links is read from the link work table 155 (step S359).

  The CPU 11 determines whether or not the read hash value is stored in the replacement source field of the link table 154 (step S361). If the CPU 11 determines that it is not stored (NO in step S361), the process proceeds to step S371. If the CPU 11 determines that it is stored (YES in step S361), the process proceeds to step S362. The CPU 11 extracts the hash value of the corresponding replacement destination field from the link table 154 (step S362).

  The CPU 11 reads various data corresponding to the read hash value from the object table 153 (step S363). The CPU 11 stores the read various data in the link work table 155 in association with the hash value extracted in step S362 (step S364). The CPU 11 stores the number of links in the link work table 155 in association with the hash value extracted in step S362 (step S365).

  The CPU 11 determines whether or not the same hash value is stored in the link work table 155 (step S366). If the same hash value is not stored (NO in step S366), the CPU 11 shifts the process to step S356. When the CPU 11 determines that the same hash value is stored (YES in step S366), the CPU 11 determines whether the number of links of the same hash value is the same (step S367). If the CPU 11 determines that the number of links is the same (YES in step S367), it leaves one hash value and deletes the same hash value for the same number of links (step S368). After that, the CPU 11 shifts the process to step S356.

  If the CPU 11 determines that the number of links is not the same (NO in step S367), the CPU 11 proceeds to step S369. The CPU 11 deletes other identical hash values while leaving the hash value with the minimum number of links (step S369). After that, the CPU 11 shifts the process to step S356. By repeating the above processing, information is accumulated in the link work table 155 until the number of links reaches the threshold number of links. The CPU 11 deletes the record with the link number 0 from the link work table 155 (step S371). The CPU 11 rearranges the link work table 155 in the order of newest use date or the smallest number of links (step S372).

  FIG. 38 is a flowchart showing a display processing procedure of the link column L2 and abbreviated data using the link work table 155. The following processing is performed after step S372. The CPU 11 displays an icon on the sentence example candidate L1 in which the replacement hash value exists (step S381). The CPU 11 extracts the category, format, size, and use date / time of the replacement object T from the link work table 155 (step S382). The CPU 11 displays the category, format, size, and use date / time of the replacement object T in the link column L2 in order of use date / time (step S383). When there are a plurality of link fields L2, the CPU 11 stores a corresponding hash value in the RAM 12 in association with the category, format, size, and use date / time displayed in the link field L2.

  The CPU 11 extracts the omitted data of the replacement destination object T from the link work table 155 (step S384). When a plurality of omitted data exists, the CPU 11 stores a corresponding hash value in the RAM 12 in association with the omitted data. The CPU 11 displays the replacement destination omitted data on the display unit 14 in association with the link field L2 (step S385). Thereafter, the CPU 11 shifts the process to step S217. When the link column L2 is selected, the CPU 11 reads out the object data corresponding to the hash value stored in association with the RAM 12 from the link work table 155 and replaces it. When the omitted data is selected, the CPU 11 reads out the object data corresponding to the hash value stored in association with the RAM 12 from the link work table 155 and replaces it.

  As described in step S226, the CPU 11 refers to the hash value of the replacement object T and updates the use date and time of the object table 153. As described with reference to FIGS. 27 and 28, the associating process between the hash value of the replacement source object T read in step S352 and the hash value of the selected replacement destination object T is performed in the forward link and the reverse link. Do about. Note that the processing when the object T is selected instead of the selection of the sentence example candidate L1 is the same, and thus detailed description thereof is omitted. This makes it possible to improve the editing efficiency by effectively utilizing the user's own past replacement history. In addition, by appropriately setting the threshold link number, it is possible to utilize past replacement history according to preference.

  The third embodiment is as described above, and the others are the same as in the first and second embodiments. Therefore, the corresponding parts are denoted by the same reference numerals, and detailed description thereof is omitted.

Embodiment 4
FIG. 39 is a functional block diagram showing the operation of the personal computer 1 of the above-described form. When the CPU 11 executes the control program 15P and the like, the personal computer 1 operates as follows. The personal computer 1 includes a detection unit 101, a storage processing unit 102, an extraction unit 103, and the like. The detection unit 101 detects whether one object T displayed on the display unit 14 has been replaced with another object T stored in the storage unit 15. When the storage processing unit 102 detects that the replacement is performed by the detection unit 101, the storage processing unit 102 associates the other object T with the one object T and stores them in the storage unit 15. When one object T is displayed on the display unit 14, the extraction unit 103 refers to the storage unit 15 and extracts another object T.

  FIG. 40 is a block diagram illustrating a hardware group of the personal computer 1 according to the fourth embodiment. A program for operating the personal computer 1 is stored in the storage unit 15 by causing the reading unit 10A such as a disk drive to read the portable recording medium 1A such as a CD-ROM, a DVD (Digital Versatile Disc) disk, or a USB memory. May be. Further, a semiconductor memory 1B such as a flash memory storing the program may be mounted in the personal computer 1. Further, the program can be downloaded from another server computer (not shown) connected via a communication network N such as the Internet. The contents will be described below.

  The personal computer 1 shown in FIG. 40 reads a program for executing the above-described various software processes from the portable recording medium 1A or the semiconductor memory 1B or from another server computer (not shown) via the communication network N. to download. The program is installed as the control program 15P, loaded into the RAM 12, and executed. Thereby, it functions as the personal computer 1 described above.

  The fourth embodiment is as described above, and the others are the same as in the first to third embodiments. Therefore, the corresponding parts are denoted by the same reference numerals, and detailed description thereof is omitted.

  The following additional notes are further disclosed with respect to the embodiments including the first to fourth embodiments.

(Appendix 1)
In a program for performing information processing by a computer having a control unit and a display unit,
On the computer,
The control unit detects whether one object displayed on the display unit is replaced with another object temporarily stored in the storage unit,
When the replacement is detected, the control unit associates the other object and the one object and stores them in the storage unit,
A program that, when the one object is displayed on the display unit, refers to the storage unit by the control unit and extracts another object associated with the one object.

(Appendix 2)
Replacing the one object with the other object extracted by the control unit;
The program according to claim 1, wherein the replaced other object is displayed on the display unit by the control unit.

(Appendix 3)
The process to remember is
When the replacement is detected, the control unit calculates a hash value of the other object and a hash value of the one object,
The program according to claim 1 or 2, wherein the control unit associates and stores the other object and the hash value of the other object, and the one object and the hash value of the one object.

(Appendix 4)
The process to remember is
The program according to attachment 3, wherein thumbnails of other objects are stored in association with hash values of the other objects.

(Appendix 5)
The process to remember is
The program according to claim 4, wherein the thumbnail of the one object is stored in association with the hash value of the one object.

(Appendix 6)
The process to remember is
When it is detected that it has been replaced, it stores the date and time in association with the hash value of the other object,
The program according to any one of appendices 3 to 5, wherein when the replacement is detected, the date and time is stored in association with the hash value of one object.

(Appendix 7)
The process to remember is
Store the attribute of the other object in association with the hash value of the other object,
The program according to any one of appendices 3 to 6, which stores an attribute of the one object in association with a hash value of the one object.

(Appendix 8)
The object contains text data,
The process to remember is
The program according to any one of appendices 3 to 7, wherein a part of text data of the other object is stored in association with a hash value of the other object.

(Appendix 9)
The object contains text data,
The process to remember is
The program according to any one of appendices 3 to 8, wherein a part of text data of the one object is stored in association with a hash value of the one object.

(Appendix 10)
The process to extract is
When the one object is displayed on the display unit, a hash value of the one object is calculated,
The program according to any one of appendices 3 to 9, wherein a storage unit is referenced to extract a hash value of another object corresponding to the hash value of the one object.

(Appendix 11)
The program according to claim 10, wherein a thumbnail related to a hash value of another object corresponding to the hash value of the one object is displayed on the display unit with reference to the storage unit.

(Appendix 12)
The program according to claim 10, wherein a storage unit is referred to and an attribute relating to a hash value of another object corresponding to the hash value of the one object is displayed on the display unit.

(Appendix 13)
The program according to claim 10, wherein a part of text data related to a hash value of another object corresponding to the hash value of the one object is displayed on the display unit with reference to the storage unit.

(Appendix 14)
When a plurality of hash values of other objects related to the hash value of the one object are stored in the storage unit, the display unit sequentially in accordance with the date and time stored in the storage unit in association with the hash value of the other object The program according to any one of appendices 10 to 13, which is displayed on the screen.

(Appendix 15)
When a thumbnail or attribute related to the hash value of another extracted object is displayed on the display unit, the selection of the thumbnail or attribute is accepted,
The program according to any one of appendices 10 to 14, which extracts another object corresponding to the received thumbnail or hash value related to the attribute.

(Appendix 16)
The program according to claim 14 or 15, wherein when the other object is extracted and the one object is replaced with the other object, the date and time corresponding to the hash value of the other object stored in the storage unit is updated. .

(Appendix 17)
The process to remember is
When it is detected that the object has been replaced, a hash value of the other object and replacement destination information indicating that the replacement object is a replacement destination information and a hash value of the one object and replacement source information indicating a replacement source are included. Memorize it,
The program according to any one of appendices 3 to 16, which stores the hash value and replacement source information of the other object, and the hash value and replacement destination information of the one object in association with each other.

(Appendix 18)
Read the threshold stored in the storage unit,
Based on the correspondence between hash values of a plurality of objects stored in the storage unit, the hash value of another object whose number of links from the hash value of one object to the hash value of another object is equal to or less than a threshold is extracted. The program according to appendix 17.

(Appendix 19)
The program according to appendix 18, wherein the storage unit is referred to, and the thumbnail, attribute, or text data corresponding to the extracted hash value of the other object is displayed on the display unit.

(Appendix 20)
In an information processing apparatus that performs information processing,
A detection unit for detecting whether one object displayed on the display unit is replaced with another object temporarily stored in the storage unit;
A storage processing unit that associates and stores the other object and the one object in the storage unit when it is detected that the detection unit has replaced the object;
An information processing apparatus comprising: an extraction unit configured to refer to the storage unit and extract another object associated with the one object when the one object is displayed on the display unit.

DESCRIPTION OF SYMBOLS 1 Personal computer 1A Portable recording medium 1B Semiconductor memory 10A Reading part 11 CPU
12 RAM
DESCRIPTION OF SYMBOLS 13 Input part 14 Display part 15 Storage part 15P Control program 16 Communication part 18 Clock part 101 Detection part 102 Storage processing part 103 Extraction part 151 Example sentence file 152 Saving table 153 Object table 154 Link table 155 Link work table A, A1, A2 Application L1 Example sentence candidate L2 Link field L3 Thumbnail L4 Partial character data T, T1, T2 Object N Communication network

Claims (5)

In a program for performing information processing by a computer having a control unit and a display unit,
On the computer,
The control unit detects whether one object displayed on the display unit is replaced with another object temporarily stored in the storage unit,
When the replacement is detected, the control unit associates the other object and the one object and stores them in the storage unit,
A program that, when the one object is displayed on the display unit, refers to the storage unit by the control unit and extracts another object associated with the one object. Replacing the one object with the other object extracted by the control unit;
The program according to claim 1, wherein the replaced other object is displayed on the display unit by the control unit. The process to remember is
When the replacement is detected, the control unit calculates a hash value of the other object and a hash value of the one object,
The program according to claim 1 or 2, wherein the control unit stores the other object and the hash value of the other object in association with one object and the hash value of the one object. The process to remember is
The program according to claim 3, wherein a thumbnail of the other object is stored in association with a hash value of the other object. In an information processing apparatus that performs information processing,
A detection unit for detecting whether one object displayed on the display unit is replaced with another object temporarily stored in the storage unit;
A storage processing unit that associates and stores the other object and the one object in the storage unit when it is detected that the detection unit has replaced the object;
An information processing apparatus comprising: an extraction unit configured to refer to the storage unit and extract another object associated with the one object when the one object is displayed on the display unit.

Images