JPH10111870A - Automatic linking system of keyword between files and its method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide an automatic keyword linking system between files, where a handling time for referring to a related part is saved in a state where the multiple files are stored and operability is improved. SOLUTION: A linking table storage part 24 stores a linking table. In the linking table, register is executed by the correspondence of a file name including a keyword to the keyword, obtained by retrieving respective documents by a keyword retrieving part 25. An correlative address from the tip of the file indicatingthe position of the keyword as necessary is registered by correspondence to the keyword and the file name in the linking table. A linking control part 23 refers to the linking table when the keyword is inputted from an input/ output device 13, opens the file indlucing the keyword and displays a part with the keyword.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

[0001] 1. Field of the Invention [0002] The present invention relates to a system for performing a search using the same keyword between files and displaying the result.

[0002]

2. Description of the Related Art In many fields, a keyword is searched in a word processor or a database, and a part related to the keyword is displayed, while the user works while referring to a description about the keyword. It has been done.

[0003] In a database, it takes a great deal of labor and time to read the contents of a huge amount of materials one by one and search for a description that includes a related keyword, so that work efficiency is high. It is also desirable to automatically display a document including a keyword for the purpose of realization.

In a word processor, when a new document is created with reference to a previously created document, if it is possible to automatically display the previously created document by using a related keyword, it is troublesome to create the document. Can be largely omitted, and work efficiency can be improved.

[0005] In particular, it is said that personal computers are now used one by one, and it is desired that one person can freely operate a database or a previously created word processor document at work. . Therefore, if database data and word processing documents containing specific keywords can be associated with each other, one person can freely manipulate database data and word processing documents, and this greatly contributes to work efficiency. Can be

[0006]

However, in a currently operating database system, keywords are extracted in advance and registered as separate keywords, and retrieval can be performed using these registered keywords. , The wrong keywords to submit,
Since the number of keywords to be registered for one file is limited, there is a possibility that necessary items for keywords may be omitted.

Further, in word processing software running on a word processor or a personal computer, a keyword can be searched for in one document, but there is no search for a keyword in another document. Therefore, if you are currently creating a document and want to refer to the description related to a specific keyword, open each other document one by one,
A keyword search must be performed to check whether the keyword is included in the document.

SUMMARY OF THE INVENTION Accordingly, an object of the present invention is to provide a system for automatically linking keywords between files, in which the operability is improved by saving the trouble of referring to a related part in a state where many files are stored. It is.

[0009]

SUMMARY OF THE INVENTION A keyword linking system of the present invention keeps a plurality of files open,
It is assumed that the same keywords included in the plurality of files are linked to each other. And an input / output unit for inputting an instruction from an operator or displaying a portion of the file content including the keyword, and a linking table storage unit for storing at least the keyword and a file name including the keyword in association with each other A keyword search means for searching for a keyword while the file is open, and a keyword search means for the file including the keyword by referring to the storage contents of the linking table storage means, and searching for the keyword. And a linking control unit.

Alternatively, in the keyword linking method of the present invention, (a) inputting a keyword used for linking, and (b) storing at least the keyword and a file name including the keyword in association with each other. (C) referring to the contents stored in step (b) and opening a file containing the keyword; (d) searching for the keyword with the file open; and (e). Displaying a portion including the keyword in the contents of the file.

According to the system and method of the present invention as described above, the same keyword search can be performed over a plurality of files. Conventionally, when a file is opened for each file and the keyword search is performed, Compared to,
The efficiency of keyword search is improved. Therefore, it is possible to efficiently edit and create a new document while referring to a plurality of files including the same keyword.

[0012]

Embodiments of the present invention will be described below with reference to the drawings. FIG. 1 is a hardware configuration diagram of the system of the present invention.

In the hardware of the system of the present invention, a ROM 11, a RAM 12, an input / output device 13 (display, keyboard, etc.), a file storage device 14, a storage medium reading device 15, and a communication device 17 are mainly composed of a CPU 10, Connected by The file storage device 14 stores and holds files such as documents. The file storage device 14 may be a storage device for a database or a hard disk of a personal computer. The storage medium reading device 15 reads a file from a storage medium 16 in which the file is stored. The storage medium 16 is constituted by a magnetic or optical recording medium or a semiconductor memory. The recording medium 16 is fixedly provided in a storage device or is detachably mounted. A program to be recorded on the recording medium 16,
The data and the like may be configured to be received and stored from another device connected via a communication line or the like, and further provided with a storage medium provided with a recording medium on the other device connected via the communication line or the like. A device may be provided to use the program and data stored in the recording medium via a communication line. The file read from the file storage device 14 or the storage medium 16 is expanded in the RAM 12 so that the file is opened.

The ROM 11 stores a basic program for input / output control.
Read it into AM12 and start it. The loaded program is a program that opens a plurality of files and performs an editing operation. The program for performing this editing work is constituted by a window system capable of simultaneously opening a plurality of files and word processing software having a keyword search function.

The input / output device 13 comprises a display for the operator to view the opened file and a keyboard for inputting an instruction or the like for finding a desired place in a document (file) including a keyword.

The communication device 17 is connected to a host computer through a communication line, and is used when referring to a file such as a database of the host computer.
Alternatively, the communication device 17 may be of a type that wirelessly connects to a host computer. That is, when the system of the present invention is used in a portable terminal in which the file storage device 14 and the storage medium reading device 15 are not provided, the communication device 17 is used to connect to the host computer. It is also possible to use a database or the like provided by the company.

Alternatively, the host computer has the configuration shown in FIG. 1, and the portable terminal uses the communication line to communicate with the host computer, not only to input an operator's command or to output the result of processing by the host computer. A mode in which a computer performs a keyword linking process may be used.

FIG. 2 is a system configuration diagram of keyword linking according to the present invention. In FIG. 1, the description is made on the assumption that the window system 21 is used.
It is not particularly limited to 1. Window system 2
Reference numeral 1 is required to open a plurality of documents including a keyword at one time. The keyword linking system 22 of the present invention operates under the window system 21.

The keyword linking system 22 includes a linking table storage unit 24 for storing a linking table and a keyword search unit 25. The keyword address obtaining unit 26 is not required in the first embodiment, but is provided in the second embodiment. The linking control unit 23 controls these units in a unified manner.
When the keyword linking system 22 is activated, the linking control unit 23 starts operating first, refers to the linking table stored in the linking table storage unit 24, and activates the keyword search unit 25. To search for keywords in open files.

In the system shown in FIG. 1, a linking table storage section 24 is stored in the file storage device 14, and is read into the RAM 12 when the present system is operating, to constitute a keyword linking system 22. Also, in the case of a portable terminal, the file storage unit 14 for storing the document 20 is not provided so that the whole system is not too large, or the capacity is too small to store too many sentences. However, in this case, the communication device 17 connects to the host computer, and a document or database is constructed on the host computer. The input / output device is generally a display and a keyboard, but in the case of a portable terminal, it is also possible to use an input device capable of inputting by operating a pen-shaped stick on the display.

FIG. 3 shows an example of the configuration of a linking table used in the first embodiment of the system of the present invention. In the first embodiment, a keyword and a file name including the keyword are stored in association with each other. For example, in the case of the figure, a file name including the keyword “word processor” is registered in association with the keyword. It is assumed that the file name column stores a directory for clarifying the location of the file. For example, a file stored as “drive \ folder \ file name” and connected via the communication device 17 further includes its host name and network drive name.

FIG. 4 is a flowchart for creating a linking table in the first embodiment. First, the system inquires of an operator whether or not to start processing (step S1), and the operator specifies whether or not to create a linking table. If the processing is completed, the system ends the processing. If the processing is started, the system proceeds to the next step.

When the process is started, the operator inputs a keyword to be used for linking (step S2), and designates a target for keyword search (step S2).
3). In this step S3, an operator designates a search target of a file or the like in advance in order to avoid processing being performed on a file that obviously does not include a keyword and wasting processing time. Of course, it is also possible to select all the files stored in the storage medium or the file storage device. Also, the drive, folder, or directory may be specified without specifying the file itself, and in this case, files existing in the specified drive, folder, or directory are searched. I do.

Next, one of the designated files is opened (step S4), and an existing keyword search function (for example, one used in word processing software) is executed in one document (step S4). S5) It is checked whether a keyword is included. It is determined whether there is a corresponding keyword (step S6), and if so, the file name of the opened file is registered in the linking table in association with the keyword (step S7). If there is no corresponding keyword, registration in the linking table is not performed.

Then, the open file is closed (step S8), and it is determined whether or not all the specified files have been searched (step S9). If any of the specified files remain unsearched,
Next, a file to be searched is specified (step S1).
0), return to step S4 and open the file,
The following processing is repeated.

If it is determined in step S9 that all the specified files have been searched, the process returns to step S1 to start processing if a linking table is to be created for another keyword. When the creation of the attachment table is completed, the operator is caused to select the end of the process.

This linking table creation process is configured to automatically start when a file is edited and the content of a document changes, and the latest link state is always registered in the linking table. It is preferable that In this case, in addition to the operator inputting the keyword, the system may automatically read a keyword already registered in the linking table and search for the keyword.

FIG. 5 is a flowchart showing processing for opening a document containing the same keyword in the first embodiment. First, the operator is prompted to enter a keyword (step S11). When the operator inputs a keyword, the system refers to the linking table (step S12) and obtains a file name including the corresponding keyword (step S13). Then, the acquired file is opened (step S14). If there are multiple files obtained, open multiple files at once using the multi-window system.

Next, an existing keyword search is sequentially performed for each of the plurality of opened files (step S).
15) Display a part including the keyword (step S)
16). The operator looks at the displayed portion and determines whether or not the target location is displayed (Step S1).
7) If the target location is not displayed, the process returns to step S15 to perform another keyword search to display another location including the keyword. By repeating this, a keyword search is performed until a place that the operator wants to display is displayed. When the target location is displayed, the keyword search in one document is completed, and it is determined whether the keyword search has been performed for all the documents including the keyword (step 18). If there is, the file for which the keyword search is to be performed next is specified (step S19), and the process returns to step S15 to perform the keyword search within the newly specified file in one document as described above.

If it is determined in step 18 that all the files including the keyword have been searched, the process ends. The operator creates a new document or the like while viewing each opened document in this way, and when the work is completed, closes all open document windows and closes the file.

Step 13 is based on the premise that all files corresponding to the keyword registered in the linking table are opened. However, after obtaining the file names including the keyword, these are sent to the operator. A file to be presented and selected by a keyword search may be selected, and only the selected file may be opened to perform a keyword search.

FIG. 6 shows an example of the configuration of a linking table used in the second embodiment of the present invention. In the second embodiment, a file name is registered in the linking table in correspondence with a keyword, and an address in the document of a keyword indicating which address in one file has the keyword is registered. This address is assumed to be a relative address from the head of the file to a position where the keyword is located. By registering the relative address from the beginning of the file, the location of the keyword in the file is specified when the file is actually loaded into memory, regardless of which address the file was read from. be able to. That is, when specifying the position of a keyword in the memory, the absolute address of the position of the keyword in the memory can be known by adding a relative address indicating the position of the keyword to the top address of the file.

FIG. 7 is a flowchart for creating a linking table according to the second embodiment. At the beginning of the process, an instruction is given to the operator to input whether to start or end the process, and it is determined whether or not the input by the operator is the start of the process (step S21). When the process is started, the operator is prompted to input a keyword to be linked (step S22). When a keyword is input, the operator specifies a file to be searched for the next keyword. At this time, it is possible to configure so that a drive, a folder, and a directory can be specified. If a drive, folder, or directory is specified,
It is assumed that all the documents belonging to them are specified. When specifying a file, a list of files and the like may be presented to the operator together with a hierarchical structure, so that the operator can easily select a file.

When an object to be searched for a keyword, for example, a file, a drive, a folder, or a directory is specified in step S23, one of the files is selected and opened (step S24). Next, a search for a keyword is performed in the opened document (step S25). A keyword search is performed to determine whether there is a corresponding keyword (step S2).
6) If there is a keyword, a relative address from the beginning of the file indicating the position of the keyword is obtained (step S27), and the file name and the relative address are registered in the linking table in association with the keyword. In the second embodiment, when a keyword is found, a relative address from the beginning of the file is obtained at the same time. Therefore, it is necessary to provide a keyword detection function having a function of obtaining a relative address instead of an existing keyword search function. is there.

If there is no keyword in step S26, or if registration in the linking table is completed in step S28, it is determined whether the search has been completed in one document (step S29). If the search has not been completed, the process returns to step S24 to continue the search within one document. When the search in one document is completed, the currently opened file is closed (step S30), and it is determined whether all the files specified in step S23 have been searched (step S3).
1). If the search has not been completed for all the specified files, the file to be searched next is specified, and the process returns to step S24 to perform the above-described search and registration processing. If all the specified files have been searched, the process returns to step S21 to urge the operator to input whether or not to start the process again. finish. If the operator wants to register another keyword in the linking table, the process is started again in step S21, and the process from step S22 is performed.

In this manner, registration processing in the linking table can be performed for a plurality of keywords. FIG. 8 is a flowchart of a process for searching for the position of a keyword in a plurality of files in the second embodiment.

First, the operator inputs a desired keyword (step S40). The system refers to the linking table based on the input keyword (step S41), and obtains a file name including the keyword and an address at a position where the keyword is located (step S4).
2). Here, the address at the position of the keyword is a relative address from the head of the file. When a file name and an address including a keyword are acquired, a step of listing and displaying the file names and allowing the operator to select a file may be provided so that the operator can specify a file to be linked and searched.

Upon obtaining the file name including the keyword and the address of the position of the keyword, the system opens the file having the obtained file name (step S43). If there are a plurality of acquired files, the acquired files are opened in a plurality of windows using a multi-window system.

Next, a part including the keyword is displayed based on the obtained address (step S44). The operator looks at the displayed text and determines whether or not the target location is displayed (step S45). If the target location is not displayed, the process returns to step S44 to display another location. To do. For example, when the operator presses the return key, keywords in different places are displayed one after another, and the operator selects a part of the document to be displayed. When the target location is displayed, it is determined whether all the files have been searched (step S46).

If all the files have not been searched yet, the next file to be searched is specified (step S47), and the process returns to step S44 to search for the specified file. If it is determined in step S46 that all files have been searched, the keyword search process ends. Thereafter, as in the first embodiment, the operator performs editing or the like based on the displayed document and closes each file.

However, in the second embodiment, since the address indicating the location of the keyword is stored in the linking table, there is a possibility that the keyword address may be changed as a result of editing the document by the operator. is there. Therefore, in the second embodiment, when the operator finishes editing the document and closes each file, the operator is required to execute FIG.
It is necessary to automatically start the process of creating the linking table. Also, in this case,
Since it takes time and effort for the operator to input all the keywords, it is preferable that the system automatically reads the keywords registered in the linking table and executes a process of reconstructing the linking table.

FIG. 9 is a diagram showing an example of the data structure of a document file. First, there is a file name, and then, a control code, a character code, and a line feed code are arranged. In the keyword search, the search is started from the beginning of the file, and the file name is obtained first. Next, while obtaining the relative address from the beginning of the file, the character code is sequentially searched for a keyword, and when a keyword is found, the relative address of the location is obtained and registered in the linking table. . The search of one file is completed by detecting an EOF (END OF FILE) code. When displaying a keyword from the address registered in the linking table, the file is specified from the file name, the file is moved from the head to the position indicated by the relative address, and the keyword is displayed together with the characters around the relative address.

In each embodiment, a document file has been described as an example. However, the present invention can be similarly realized not only for a document but also for a file storing data in which graphics, tables, and the like are mixed. Further, in the flow of creating the linking table, the keyword to be linked is input by the operator. However, without inputting the keyword, the drive or file to be linked is specified, and the target is determined based on this. Alternatively, the content of each file to be searched may be searched, and a keyword may be automatically extracted and linked. More specifically, one file to be linked is opened, the words included in this file are set as keywords, and another file containing the same word is searched for. If so, a linking table is created using this as a keyword as described in the embodiment. For example, a noun included in this file is used as a phrase targeted by the keyword. Nouns are sequentially extracted and used as keywords. If other files also include the same noun, this is used as a keyword. Hereinafter, similarly, another file is opened, and words included in this file are set as keywords, and another file containing the same word is searched. In this way, if the words included in each file are used as a keyword and a linking table is automatically created, the trouble of inputting the keyword can be saved. The operator need only specify the drive, file, and the like to be linked.

In the embodiment, as a use mode after the linking table is created, a keyword is specified and a file containing the corresponding keyword is opened, but the data in the file can be referenced and edited. Therefore, after a certain file is opened, if data in the opened file includes a keyword, another file related to the keyword may be opened and referred to. In this case, if the keyword stored in the linking table exists in the data such as the document of the opened file, the phrase corresponding to the keyword is displayed in a specific color while the data in the file is displayed. , Inverted, blink, etc. When the identified keyword is designated by a pointing means such as a mouse, the same keyword portion of another file is specified from the linking table corresponding to the designated keyword, and as a result, the corresponding file is opened. To display. As a result, even between a plurality of different files, other related files can be referred to based on the keyword, and data reference and editing work can be efficiently advanced.

[0045]

According to the present invention, for the same keyword, data can be automatically referred to between a plurality of files, so that it is not necessary to refer to a related part of a plurality of files, and data editing, creation, and database processing can be performed. Operability, such as search of a search, can be improved.

[Brief description of the drawings]

FIG. 1 is a hardware configuration diagram of a system of the present invention.

FIG. 2 is a system configuration diagram of keyword linking according to the present invention.

FIG. 3 is a configuration example of a linking table used in the first embodiment of the system of the present invention.

FIG. 4 is a flowchart for creating a linking table in the first embodiment.

FIG. 5 is a flowchart illustrating a process of opening a document including the same keyword in the first embodiment.

FIG. 6 is a configuration example of a linking table used in a second embodiment of the present invention.

FIG. 7 is a flowchart for creating a linking table according to the second embodiment.

FIG. 8 is a flowchart of a process of searching for a position of a keyword in a plurality of files in the second embodiment.

FIG. 9 is a diagram illustrating an example of a data configuration of a document file.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 10 CPU 11 ROM 12 RAM 13 input / output device 14 file storage device 15 storage medium reading device 16 storage medium 17 communication device 18 bus 20 document 21 window system 22 keyword linking system 23 linking control unit 24 linking table storage unit 25 keyword Search unit 26 Keyword address acquisition unit

Claims (5)

[Claims] 1. A system for opening a plurality of files and linking the same keywords contained in the plurality of files to each other, wherein a command from an operator is input or a portion of the file contents including the keywords. Input / output means for displaying a keyword, a linking table storage means for storing at least a keyword and a file name including the keyword in association with each other, a keyword search means for searching for a keyword with the file opened, and a linking table A system comprising: a linking control unit that refers to the storage content of a storage unit, activates a keyword search unit for a file including the keyword, and performs a keyword search. 2. The apparatus according to claim 1, wherein the linking table storage means stores a relative address from a head of a file including the keyword to a position where the keyword is located, in association with the keyword and a file name. The system of claim 1, wherein: And a communication means for communicating with another system, accessing a file held by the other system, and referring to the storage contents of the linking table storage means to execute the same operation among a plurality of files. The system according to any one of claims 1 to 2, wherein a keyword search is performed using the keyword, and a portion including the corresponding keyword is displayed. 4. A method of opening a plurality of files and linking the same keyword included in the plurality of files to each other, comprising: (a) inputting a keyword used for linking; Storing the keyword and the file name including the keyword in association with each other; (c) referring to the content stored in the step (b),
Opening a file containing the keyword; (d) searching for the keyword with the file open; and (e) displaying a portion of the file content containing the keyword. A method characterized by the following. 5. In the step (b), a relative address from a head of a file including the keyword to a certain position of the keyword is stored in association with the keyword and a file name. Item 4
The method described in.