JPH0830629A - Document processor - Google Patents

Abstract

PURPOSE:To quickly retrieve plural keywords having mutual relation without erasing the original contents of a document to be processed by. retrieving a code corresponding to a specified keyword and a code belonging to the same group as the specified keyword and corresponding to the keyword. CONSTITUTION:When a keyword is inputted, a group of already registered keywords is displayed on a display as a list (100, 102). A user determines which group includes the inputted keyword, inputs information expressing the group, and when the keyword has not been registered yet, inputs information for specifying a new group (104, 106). In the case of a group other than the new group, the newest code of the specified group is set up (108). In the case of the new group, an unused group code and an individual code are set up (110, 112). The inputted keyword and the set codes are correspondingly registered in a keyword registering table.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a document processing apparatus, and more particularly to a document processing apparatus having a function of simultaneously searching a designated keyword existing in a document and a keyword related to the designated keyword.

[0002]

2. Description of the Related Art In recent years, document processing devices such as word processors and workstations have become widespread. Generally, these document processing apparatuses have a function of searching for a specific character string existing in a document and displaying a search result, or replacing the searched specific character string with another character string. Is. By the way, in the above-mentioned character string search, since it is searched whether the character code of the specified character string exists in the document, for example, when a specific word is specified as the character string, "compiler" There is a problem that other words such as "compiler", "COMPILER", and "compiler" that have the same meaning but have different character codes are not searched.

Therefore, in recent years, a similar word search has been proposed in which words having the same or similar meanings can be searched by a single search instruction. In this similar word search,
When a plurality of words are registered in advance as similar words in association with each other and a specific word is designated and a similar word search is instructed, the specific word and other words registered as similar words are searched for. Is done. However, in this similar word search, for example, similar words such as "Compiler" and "Comp
If three types of words, "ler" and "cc", are registered,
"Compiler", "Compiler", "c" for the same document
Since "c" is used as the search target word and the search is performed three times,
There was a problem that processing took time.

For this reason, Japanese Laid-Open Patent Publication Nos. 3-6666 and 3-
In Japanese Patent Laid-Open No. 177972, Japanese Patent Laid-Open No. 4-338171, etc., in order to unify the notation of a word that represents a certain meaning, a plurality of types of similar words existing in a document to be processed are preliminarily or from a user. It is described that, in accordance with an instruction, a keyword (hereinafter referred to as a representative keyword) representative of the plurality of types of similar words is collectively replaced. In the above, since the notation of a word having a certain meaning is unified, the search only needs to be performed with the representative keyword as the search target word, and the search processing time is shortened.

[0005]

However, in the above, once a plurality of types of similar word character strings are replaced with a representative character string, information indicating the contents of the character string before replacement with the representative character string does not remain. The original contents of the target document are lost and the target document cannot be restored to the original contents. Therefore, for example, even if there is a request such that the designation of a similar word is inappropriate and the notation of a specific word among a plurality of words already replaced with a representative keyword is restored, this cannot be satisfied. There was a problem. In order to eliminate the above inconvenience, it is necessary to perform a complicated process such as saving the original contents of the processing target document in addition to the document in which the similar word is replaced with the representative keyword.

The present invention has been made in consideration of the above facts, and can search a plurality of keywords related to each other in a short time without erasing the original contents of the document to be processed. The purpose is to obtain.

[0007]

In order to achieve the above object, in the document processing apparatus according to the invention of claim 1, the input means for inputting a keyword and the keyword input by the input means are related to each other. Determining a group to which each of the plurality of keywords belongs, and assigning a different code to each of the keywords, the code assigning means capable of determining the group to which the keyword belongs, and the input means. A storage unit for storing the keyword inputted by the code and the code assigned by the code assigning unit in association with each other, searching for a keyword existing in the document to be processed, and storing the retrieved keyword in the storage unit. Code replacement means to replace the code corresponding to the above keyword and the keyword to be searched Specifying means for determining, a search means for searching for a code existing in the document to be processed, the code corresponding to the keyword specified by the specifying means, and the code corresponding to the keyword belonging to the same group as the keyword. It is configured to include.

According to a second aspect of the invention, in the first aspect of the invention, the search means replaces the searched code with a corresponding keyword or a keyword representing the group, and then outputs the result as a search result. , Is characterized.

[0009]

According to the present invention, a keyword is input by the inputting means, and the code assigning means determines which of a plurality of groups each of which is composed of related keywords, The group to which the keyword belongs can be discriminated and a different code is given to each keyword. Further, the storage unit stores the keyword and the assigned code in association with each other, the code replacement unit searches for a keyword existing in the document to be processed, and the searched keyword is stored in the storage unit. Replace with the code corresponding to the keyword. Further, the keyword to be searched is specified by the specifying means, and the searching means searches for the code corresponding to the specified keyword existing in the document to be processed and the code corresponding to the keyword belonging to the same group as the keyword. To do.

The code may include, for example, a first code for identifying a group to which the keyword belongs and a second code for identifying each keyword belonging to the same group, If the code assigning means changes and assigns the first code according to the group to which each keyword belongs, it can be determined to which group the keyword corresponding to the code belongs. The addition of different codes to each keyword can be realized by the code assigning means changing and assigning the second code for each keyword in the same group, whereby the keyword corresponding to the code is added. Can be specified.

As described above, it is possible to easily determine which group the code in the document to be processed corresponds to the keyword by referring to the first code or the like. It is possible to search the code corresponding to the generated keyword and the code corresponding to the keyword belonging to the same group as the keyword by one search process, and the search for the code corresponding to the plurality of mutually related keywords can be performed in a short time. It can be carried out.

Further, as described above, since the keyword corresponding to the code can be specified based on the information stored in the storage means, as described in claim 2, the search means searches for the code. Can be replaced with a corresponding keyword and output as a search result, or can be replaced with a keyword representing a group and output as a search result. Thus, even after the plurality of keywords in the processing target document have been replaced by the corresponding codes by the code replacing means, the processing target document can be restored to the original content based on each code, The original contents of the processing target document are not lost. Therefore, it is not necessary to perform a complicated process such as storing the document to be processed before the predetermined keyword is replaced with the code by the code replacing means.

[0013]

Embodiments of the present invention will be described below in detail with reference to the drawings. In addition, although the following description will be given using numerical values that do not hinder the present invention, the present invention is not limited to the numerical values described below. FIG. 1 shows a document processing apparatus 10 according to this embodiment. The document processing device 10 is a CPU
12, a ROM 14, a RAM 16, and an input / output port 18, which are connected to each other via a bus 20.

The input / output port 18 includes a storage device 22 including a storage medium such as a magnetic disk or a magneto-optical disk, a display 24 including a CRT or LCD, a keyboard 26, and a laser beam printer. The configured printer 28 and mouse 30 are connected. The keyboard 26 and mouse 30 constitute the input means and the designation means of the present invention. Also ROM14
Stores various programs for realizing various functions as the document processing apparatus including the character string replacing function according to the present invention, and the storage device 2 as the storage means of the present invention.
The second storage medium stores a large number of document files as processing target documents and a keyword registration table (described later).

The document file is shown in FIG. 6 as an example.
As shown in (A), it is composed of a header section and a document data section. As is well known, format information such as the number of characters per line is registered in the header section.

Next, the operation of this embodiment will be described. When the user wants to search for similar keywords, the user instructs, through the keyboard 26 or the mouse 30, prior to the search, a keyword registration process for registering a keyword to be searched and a keyword similar in meaning to the keyword. .
As a result, the keyword registration process is executed according to the keyword registration program stored in the ROM 14. Details of this keyword registration processing will be described with reference to the flowchart of FIG.

In step 100, it is determined whether or not a keyword to be registered has been input, and the process waits until the keyword is input. When a keyword is entered, step 100
Is affirmative, the keyword registration table is referred to in step 102, and a group of keywords already registered in the keyword registration table is displayed as a list on the display screen of the display 24.

The keyword registration table is shown in FIG.
As shown in, the keywords registered by the keyword registration process and the code assigned to each keyword are stored in association with each other. Each keyword is classified into related keywords such that the meaning or the like is the same or similar to form a plurality of groups (in FIG. 2, keywords to which the same group belongs are indicated by bold lines). Enclosed). A representative keyword (“compiler” or “car” in FIG. 2) representative of each group is set in each group.

Further, in FIG. 2, as an example, a code consisting of four-digit numbers is given to each keyword. This 4-digit code has a high-order 2 digits as a group code for identifying a group to which each keyword belongs, and the same group code is assigned to keywords belonging to the same group (for example, in FIG. 2, the representative keyword is ""01" is set to the group of "Compiler", and "02" is set to the group of which the representative keyword is "car". Therefore, in the above, since values of "01" to "99" can be set as the group code, it is possible to register a maximum of 99 groups.

The lower two digits of the four-digit code are individual codes for identifying each keyword belonging to the same group. The representative keyword is "00", and in the following registration order in the keyword registration table. , "01" is given as a two-digit number in ascending order. Therefore, in the above, the value of "00" to "99" can be set as the individual code.
It is possible to register a maximum of 100 keywords including the representative keyword as keywords belonging to the same group. In step 102, the above-mentioned keyword registration table is referred to, and the representative keyword of each group or all the keywords is displayed so that the group to which each keyword belongs can be identified.

In step 104, it is judged whether or not the information designating the group to which the inputted keyword belongs is inputted, and the process waits until the designation is inputted. The user refers to the contents displayed on the display screen of the display 24, decides which group the inputted keyword is classified into, and inputs the information representing the decided group. When it is determined that a group of keywords having similar meanings is not registered, information specifying a new group (a new group that is currently unregistered) is input. When the information designating the group is input, the process proceeds to step 106,
Whether or not the designation is a new group is determined.

If the determination in step 106 is negative, the process proceeds to step 108, and the latest code of the group designated by the input keyword, that is, the group code corresponding to the designated group, and the group Of a plurality of keywords belonging to (1), an individual code in which a maximum value of the numerical values set as the individual code + 1 is set, and a code is set. For example, FIG.
Already registered in the keyword registration table shown in
When the keyword "SparcCC" is additionally registered in the group whose representative keyword is "compiler", the latest code "0104" including the group code "01" and the latest individual code "04" is set.

On the other hand, if the determination in step 106 is affirmative, the keyword registration table is referenced in step 110, and an unused group code is determined as the group code to be assigned to the new group. For example, FIG.
Since "01" and "02" are used as the group codes in the keyword registration table shown in Fig. 5, the group code assigned to the new group is determined to be "03". In the next step 112, the inputted keyword is set as the representative keyword of the new group, and the code corresponding to the representative keyword of the new group is the keyword, that is, the group code determined in step 110 and the individual code (" 00 ")
Set a code consisting of and.

The processing of steps 104 to 112 described above corresponds to the code assigning means of the present invention. In the next step 114, the entered keyword is associated with the code set above and registered in the keyword registration table, and the keyword registration process is terminated.

With the above, registration of a single keyword is completed. The user repeatedly executes the above-described processing to register a keyword to be searched or a keyword whose word meaning is similar to the keyword. When the keyword registration is completed, the user designates the document for which the similar keyword is searched as the target document for the code batch replacement, and executes the code batch replacement process for replacing each of the similar keywords existing in the specified document with the code. Give instructions. This allows
The code batch replacement process shown in FIG. 4 is executed. The code batch replacing process corresponds to the code replacing means of the present invention.

That is, in step 120, it is determined whether or not a group of keywords as a target (similar keyword) to be replaced with the code at a time (similar keyword) or a representative keyword of the group has been designated, and waits until the designation is performed. . If the determination in step 120 is positive, step 1
22 and the respective keywords and codes belonging to the group of keywords to be collectively replaced, which are designated by inputting the group or representative keywords,
Import from keyword registration table. Next Step 1
At 24, it is determined whether or not the document to be processed is designated, and the process waits until it is designated.

If the determination in step 124 is affirmative, batch replacement of keywords is performed in step 126 and subsequent steps.
That is, in step 126, the flag is set to “0”, and in step 128, after the document file of the document designated as the processing target is captured, the document file is identified from among the plurality of keywords belonging to the same group. Is searched while gradually moving the search position from the beginning to the end of the document. Step 130
Then, it is determined whether or not the search position has reached the end of the document. If the determination in step 130 is negative, it is determined in step 132 whether the specific keyword has been found. When the determination in step 132 is negative, the process returns to step 128, and either step 130 or step 13
Steps 128 to 132 are repeated until the determination of 2 is affirmed.

When a specific keyword is found in the document, the determination at step 132 is affirmed, and at step 134, the found specific keyword is replaced with a corresponding code and a predetermined delimiter code, and further at step 136, a flag is set. Is set to "1" and the process returns to step 128. The delimiter code is data for distinguishing the replaced code from other data, and for example, a code not used as a character code can be used. The determination in step 132 is affirmed each time a specific keyword is discovered, and the discovered specific keyword is replaced with the corresponding code. However, if even one specific keyword is present in the document, the flag is set to "1". It

On the other hand, when the search position reaches the end of the document, the determination at step 130 is affirmative, and at step 138 it is determined whether the flag is set to "1". If the determination in step 138 is negative, the process proceeds to step 142 without performing any processing.
When the determination result of 8 is affirmative, the searched specific keyword and the code corresponding to the specific keyword are registered in the header portion of the document file of the processing target document in step 140, and the process proceeds to step 142. In step 142, it is determined whether or not the processing has been performed on all the keywords belonging to the same group. If the determination in step 142 is negative, the process returns to step 126 and step 126
Then, the flag is reset to "0" again, and the keyword which belongs to the same group and has not been processed is processed in the same manner as above. When the processing for all the keywords belonging to the same group is completed, step 14
The determination of 2 is affirmed, and the code batch replacement process ends.

As an example, as shown in FIG. 6A, when there are two "compilers" and one "Compiler" and one "compiler" in the document to be processed, the above-mentioned processing is performed. As shown in (B), each keyword is replaced with a corresponding code, and each replaced keyword is registered in the header portion of the document file in association with the code. In FIG. 6 (B), the delimiter code is represented by “*” for convenience, but this does not indicate that the delimiter code is a character code “*”, and its length is also delimited. It should be noted that the total length of the code and the code according to the present invention can be made equal to the character code for one character.

When the batch conversion of similar keywords into codes for the document to be processed is completed as described above, the user gives an instruction to search for the similar keywords replaced with the above codes. As a result, the similar keyword search process shown in FIG. 5 is performed. In the above, since the similar keywords are replaced with different codes, it is not limited to the process of searching for all similar keywords as described below, and each keyword may be searched individually as a search target. Is also possible.

The similar keyword search process corresponds to the search means of the present invention. In step 150, it is determined whether or not the keyword to be searched is designated, and the process waits until the keyword to be searched is designated. When the determination in step 150 is positive, in step 152, the group code of the group to which the designated keyword belongs and the representative keyword are fetched from the keyword registration table. Step 154
Then, determine whether the document to be searched is specified,
Wait until the document to be searched is specified. It should be noted that in step 154, a plurality of documents can be designated as search target documents.

When the determination at step 154 is affirmative, the document designated as the search target at step 156 is fetched,
In step 158, while moving the search position from the beginning to the end of the search target document, a code having the same group code existing in the search target document is searched. More specifically, this search is performed by first searching for a delimiter code existing in the document, and if a delimiter code is found, the upper two digit group code of the four digit code following the delimiter code is fetched first. This is performed by determining whether it is the same as the group code.

In the next step 160, it is determined whether or not the search position has reached the end of the document. If the determination in step 160 is negative, the group code previously fetched by the group code described above is retrieved. In step 162, it is determined whether the same code as the code is found. If the determination in step 162 is also denied, step 158
Returning to step 160, steps 158 to 162 are repeated until the determination at step 160 or step 162 becomes affirmative.

On the other hand, when the determination in step 162 is affirmative, the process proceeds to step 164, and the designated display method is the original keyword (keyword before replacing with the code).
Is displayed. If the determination in step 164 is negative, it can be determined that the designated display method is the display of the representative keyword, and therefore the found code is replaced with the representative keyword and displayed. As a result, all the notations of similar keywords that existed in the document before being replaced with the code are unified and displayed as the representative keywords.

On the other hand, for example, when the user determines that a group of similar keywords is inappropriate and only a specific keyword of a plurality of keywords that have already been replaced with a code is displayed as an original keyword, the user cannot change the original keyword. Instruct to display in. Accordingly, the determination in step 164 is affirmative, and in step 166, the original keyword corresponding to the discovered code is determined based on the information registered in the header portion of the document to be searched, and the original keyword for which the discovered code is determined is determined. And is displayed on the display screen of the display 24.

As a result, the user can confirm the contents of the document before the replacement with the code, or refer to the contents of the displayed original keyword, the context before and after, etc. to judge the keyword or the like to be removed from the current group. It is possible to change the configuration of the group of similar keywords.

At the next step 170, it is determined whether or not to continue the search process. If the determination in step 170 is affirmative, the process returns to step 158, and the code having the same group code as the previously fetched group code is searched again. When the determination in step 170 is negative or when the determination in step 160 is affirmative, the process proceeds to step 172, and it is determined whether or not there is another search target document. If the determination in step 172 is affirmative, step 154
Then, the above process is repeated for other search target documents. When the determination in step 172 is negative, the similar keyword search process ends.

As described above, the code corresponding to the designated keyword to be searched and the code corresponding to the keyword belonging to the same group as the keyword can be searched by one search process. In addition, although it depends on the length of the character string as the keyword, the length of the code according to the present invention is almost shorter than the character code representing the keyword. Therefore, it is possible to search for a plurality of keywords belonging to the same group in a very short time, as compared with the case of searching for a keyword with a character code.
Further, even after the keywords in the document have been replaced with the codes, the corresponding keywords can be determined based on the codes, so that the processing target document can be restored to the original content. Therefore, it is not necessary to perform a complicated process such as saving the process target document before replacing the keyword with the code.

In the above, the user determines the similar keywords. However, the present invention is not limited to this, and a similar word dictionary covering keywords having similar meanings is included. May be stored in advance and the determination may be automatically performed by referring to the similar word dictionary.

Further, although the case where the search result is output by displaying it on the display screen of the display 24 has been described above as an example, the present invention is not limited to this.
The search result may be output by printing on a recording medium such as paper by the printer 28. in this case,
It goes without saying that the retrieved code may be replaced with the corresponding keyword and output, or the retrieved code may be replaced with the representative keyword and output according to the instruction from the user.

Further, in the above, when the keyword to be replaced with the code does not exist in the document in the code batch replacement process, the process is terminated without leaving any information, but instead of this, the document is replaced. You may make it register into a header part as a keyword which did not exist in it.
This makes it possible to complete the processing corresponding to the instruction in a short time when the retrieval or keyword replacement of a keyword that does not exist in the document is instructed next time or later.

Although the embodiments of the present invention have been described above, the above embodiments include embodiments of the technical matters described below. (1) The document processing apparatus according to claim 1, wherein the code replacement means adds a predetermined delimiter code for identifying the code when replacing the keyword.

According to the above, when searching for a keyword that has already been replaced with a code, the delimiter code is first searched to determine whether the code corresponding to the found delimiter code is the code corresponding to the keyword to be searched. Since it is sufficient to make the determination, the search process can be performed in a shorter time even when the length of the code is long, for example.

[0045]

As described above, according to the present invention, in the code assigning means, it is determined which of a plurality of groups each of which the input keyword belongs to is composed of the related keywords, and the group to which the keyword belongs. Can be distinguished and different codes are assigned to each keyword,
The code replacement means searches for a keyword existing in the processing target document, replaces the searched keyword with a corresponding code, and the searching means searches for a keyword existing in the processing target document.
Since the code corresponding to the keyword specified by the specifying means to be searched and the code corresponding to the keyword belonging to the same group as the keyword are searched, it is possible to search for a plurality of mutually related keywords as a processing target document. It has an excellent effect that it can be carried out in a short time without losing the original contents of.

[Brief description of drawings]

FIG. 1 is a block diagram showing a schematic configuration of a document processing apparatus according to this embodiment.

FIG. 2 is a conceptual diagram showing the contents of a keyword registration table.

FIG. 3 is a flowchart illustrating the content of keyword registration processing.

FIG. 4 is a flowchart illustrating the contents of a code batch replacement process.

FIG. 5 is a flowchart illustrating the contents of a similar keyword search process.

FIG. 6A is a conceptual diagram showing a document file before code batch replacement processing, and FIG. 6B is a conceptual diagram showing a document file in which similar keywords are collectively replaced by codes.

[Explanation of symbols]

 10 Document Processing Device 12 CPU 22 Storage Device 24 Display 26 Keyboard 30 Mouse

Claims (2)

[Claims] 1. An input unit for inputting a keyword, and to which of a plurality of groups each of which the keyword input by the input unit is composed of related keywords is determined, A code assigning unit that can identify the group to which the keyword belongs and assigns a different code to each keyword, and a storage unit that stores the keyword input by the input unit and the code assigned by the code assigning unit in association with each other. And a code replacement unit that searches for a keyword existing in the processing target document and replaces the searched keyword with a code corresponding to the keyword stored in the storage unit, and a keyword replacement unit for designating a keyword to be searched. By the specifying means and the specifying means existing in the document to be processed, Document processing apparatus comprising a retrieval means for retrieving the code corresponding to the keyword that belongs to the constant has been the same group and code and said keyword corresponding to the keyword, the. 2. The document processing apparatus according to claim 1, wherein the retrieval unit replaces the retrieved code with a corresponding keyword or a keyword representative of the group, and then outputs the retrieval result as a retrieval result.