JPH07249042A - Document processor - Google Patents

Abstract

PURPOSE:To obtain a document processor which detects places to be proofread and elaborated in one specific text and also provides the proofreading and elaboration information capable of curvying out required confirmation and correction on an editing device equipped with no function for proofreading and elaboration. CONSTITUTION:The document processor is equipped with a text storage means (text storage part 2) which stores the text to be proofread and elaborated, a selection means (appearing character storage part 5 and specification part 5A attached thereto, and judgement part 6A and selection part 6B of output processing part 6) which selects characters undetected in the text as characters for marking by referring to the text to be proofread and elaborated in the text storage means, a detection processing means (text detection processing part 3) which detects candidate places to be proofread and elaborated from the text to be proofread and elaborated in the text storage means, and an insertion means (processing result storage part 4 and insertion part 6C of output processing part 6) which inserts the characters for marking selected by the selection means at the candidate places for proofreading and elaboration detected by the detection processing means.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a document processing device, and more particularly to a device for detecting a portion to be proofread / revised from a predetermined text and having a proofreading / revising function. The present invention relates to the above-mentioned document processing device capable of providing proofreading and revision information that enables confirmation and correction in a desired editing device.

[0002]

2. Description of the Related Art In recent years, with the advent of document processing devices such as word processors, it has become more common to create Japanese sentences using such devices. However, as the number of such cases increases, typographical errors and omissions, which did not occur during handwriting, are more likely to occur, and as a result, documents are created without correction of the typographical errors and omissions. I'm getting more and more. In addition, it has become easier for multiple people to share a single document, but since there are individual differences in the notation of sentences, it is not consistent in the notation. In some cases, a sentence that does not have is created. On the contrary,
A proofreading and elaboration support system has been developed to detect typographical errors, omissions, and inconsistencies in a given document (text), and to assist in checking and correcting them. Conventionally, a marking operation which is distinguishable from another part of the document is performed on a part of the proofreading / revision detected from a certain predetermined document so that the detected part can be easily identified. For example, JP-A-1-30356
According to Japanese Patent Laid-Open No. 4 [Document Creation Support Device], the relevant part of the document pointed out by the device is emphasized and displayed on a predetermined screen in a manner according to the type of proofreading content. Further, according to Japanese Unexamined Patent Publication No. 3-9465 [sentence creating device], words and phrases other than words and phrases to be proofread and revised are displayed in an invisible state or a substantially invisible state,
The target word / phrase and the other words / phrases are displayed separately. Then, by using such marking as a clue, the user of the device confirms the detection position in the target document, and if necessary correction is performed, the corresponding correction operation is performed. There is.
It should be noted that the marking is erased after the confirmation and correction have been made. Since the proofreading and selection support function based on a certain predetermined grammar process is complicated, it is usually mounted on a high-performance dedicated machine, and a general popular word processor or It was not something that could easily be installed in an editor or the like. Therefore, as a usual method, the document created by the general popular word processor is transferred to the high-grade special-purpose machine side with the calibration / revision support function, and the high-grade special-purpose machine side detects the calibration / revision information. Or perform necessary confirmation / correction work, or once print the calibration / revision information detected on the side of the exclusive high-end machine and take it back to the word processor side, and visually check the results of this printing to check.
The corresponding correction was done on the word processor side.

[0003]

In the conventional proofreading / revising support system, it is possible to easily recognize a portion to be detected by applying [underline], [shade], [coloring] or the like to a required portion of the document. However, since the marking method and the checking / correcting method are of a nature that depends on the device used, if the device deviates from the device used, the corresponding calibration / correction support function is directly There was a problem that it could not be used for. One measure against this is to enclose the above-mentioned detection point with a special symbol such as [◆], find this special symbol using the search function of a general word processor, and support the necessary confirmation and correction. It is possible to do it. However, with such a method of enclosing the detection location by using such a special symbol, the special symbol for marking may be included in the document to be proofreading-corrected. It is necessary to check whether it was included in the target document and was actually used for marking. Also, the special symbol for marking is to be deleted after the confirmation / correction is completed, but if so-called [collective deletion] is applied at this time, even those in the document to be left behind for correction and correction should be left. There is a possibility that it will be deleted, and it is necessary to make certain confirmation when deleting it.

The present invention has been made in view of the above-mentioned conventional example and the problem of the method of enclosing a detection point with a special symbol. For example, a required calibration / revision support is designated from a general word processor. It is an object of the present invention to provide a document processing device capable of indicating a detection position with a special symbol for marking.

[0005]

A document processing apparatus according to the present invention refers to a text storage means for storing a text to be proofreading and a text to be proofreading stored in the storage means, and refers to the text. Selection means for selecting a character not detected as a character for marking, and detection processing means for detecting the location of the proofreading candidate from the text of the proofreading object stored in the text storage means,
It is characterized by further comprising an inserting means for inserting the marking character selected by the selecting means into the position of the calibration revision candidate detected by the detecting processing means. Further, the document processing device according to the present invention is
The appearance character storage means for storing the appearance state of the marking character, and the specification means for specifying the marking character whose appearance state should be stored in the appearance character storage means are further provided. is there.

[0006]

According to the present invention, the proofreading / correction candidate part from the proofreading / correction target text stored in the text storage means (for example, information on the location of a typographical error / missing character in a sentence constituting the target text). Is detected by the text detection processing means. The character for marking selected by the selecting means is inserted by the inserting means at the position of the calibration / elevation candidate detected by the detection processing means. As the marking character here, a character whose appearance is not detected in the text is selected by the selecting means. The selecting means may select from the marking characters designated by the designating means by referring to the appearing character storing means that stores the appearance state of the characters of the target text.

[0007]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS FIG. 1 is a schematic block diagram of an apparatus according to an embodiment of the present invention. In FIG. 1, the input unit 1 reads control information for controlling text processing and text to be processed from the input file 7 in the front stage, and corresponding information is read in the text storage unit 2 and the appearing character storage unit 5 in the rear stage.
It fulfills the function of storing in. The text storage unit 2 has a function of storing text to be processed and control information read from the input file 7 via the input unit 1. The text detection processing unit 3 cuts out one sentence as a processing unit from the text stored in the text storage unit 2 and processes the character string constituting the cut-out one sentence specified by the control information. The processing result is stored in the processing result storage unit 4 in the subsequent stage. Further, at that time, it also has a function of investigating whether or not a predetermined character appears in the text to be processed, and storing the result in the appearing character storage unit 5. Here, as one of the processes for the target text, there is a detection of the presence of a typographical error or a missing character in the text that constitutes the text. For example, [1] a word that is not registered in a certain dictionary,
[2] A technique for detecting a connection between words without a definition, [3] a connection that easily causes an error, etc. can be realized by using the method disclosed in Japanese Patent Laid-Open No. 4-134408. It is possible. This Japanese Patent Laid-Open No. 4-134040
According to the method disclosed in Japanese Patent No. 8, the sentence constituting the text to be processed is divided into units of words or clauses, and a rule for detecting a case where an error is likely to occur is applied. It is made to detect a typographical error / missing character candidate in a sentence. Also, when dividing the sentence into words, the dictionary that stores the attribute information of the words is referred to. Therefore, when the corresponding [yomi] is registered in the dictionary, [yomi] is Words that are the same but different in [notation] can be detected as [candidates for unification of notation]. The processing result storage unit 4 has a function of storing the predetermined information detected by the text detection processing unit 3 in the preceding stage in correspondence with the text to be processed. The appearance character storage unit 5 has a function of storing the appearance state of the characters of the target text (for example, whether or not a predetermined character appears in a sentence forming the text). The output processing unit 6 investigates the content of the information in the appearance character storage unit 5 to obtain a character [marking character] that does not appear in the target text, and outputs the obtained [marking character] to the output file 8. While inserting this [marking character] at a required position in the target text, this also outputs the function to the output file 8. The output processing unit 6 includes a determination unit 6A for determining whether or not a designated marking character appears in the text by referring to the appearance character storage unit 5, A selection unit 6B that refers to the appearing character storage unit 5 and selects a character that matches a predetermined condition as a character for marking, an insertion unit that inserts the character for marking selected as described above into an appropriate place of the target text. 6
Output section 6D for outputting C, and [marking characters] and [text with marking characters inserted]
Is. The input file 7 is a file functionally arranged in the preceding stage of the input unit 1, and includes a text to be processed and its processing condition. The output file 8 is functionally equivalent to the output processing unit 6
It is a file arranged in the latter stage of the above, and is adapted to save the [marking character] itself and the [target text in which the marking character is inserted in a key place]. Here, the text storage unit 2 in FIG. 1 corresponds to the text storage means of the constituent elements in the claims. The text detection processing unit 3 corresponds to detection processing means. The insertion portion 6C in the processing result storage unit 4 and the output processing unit 6 corresponds to the insertion means as a whole. The appearance character storage unit 5, the designation unit 5A attached thereto, the determination unit 6A and the selection unit 6B in the output processing unit 6 correspond to the selection unit as a whole. Further, the appearing character storage unit 5 corresponds to the appearing character storage unit, and the designation unit 5A corresponds to the designation unit.

The operation of this embodiment shown in FIG. 1 will be described below with reference to FIGS. FIG. 2 is a flow chart for explaining the operation of the entire apparatus of the above embodiment. FIG. 3 is a flow chart for explaining the inserting operation of the marking character in the apparatus of the above embodiment. FIG. 4 is a first exemplary diagram of an input file that can be processed by the apparatus of the above-mentioned embodiment, and its content column 40 is shown. In FIG. 4, the input file content column 40 is divided into a control information column 40A and a target text column 40B by a predetermined character string (here, a character string representing a dotted line). Note that, in FIG. 4, [detection of error location] is illustrated as the control information. In addition, as a sentence which constitutes the target text, [◎ When the child process terminates, the parent process receives sigcld and ends. sigcld helps signal the completion of the parent process. ] Is illustrated. FIG. 5 is a view showing an example of the initial state of the appearance character storage unit in the apparatus of the above embodiment. In FIG. 5, the column 50 of the content of the initial state of the appearing character storage unit 5 is a character column 50 of a sentence forming the target text.
A column 50B for the presence or absence of the appearance of the corresponding character is provided. Here, the normal character is not included in the character column 50A of the sentence that constitutes the target text as an object of investigation, and for example, [*: @: §: ☆: ★:
Only symbols such as ○: ●: ◎: ◇: ◆: □: ■ are subject to investigation for the presence or absence of occurrence. Further, in the presence / absence column 50B of appearance of the corresponding character, one of [appearance pear: 0] [appearance ant: 1] is entered for each corresponding symbol.
Note that for [appearance ant: 1], regardless of the number of appearances, [1] will be entered regardless of whether it appears once or more. In addition, this FIG.
, The contents of the initial state of the appearing character storage unit 5 are shown.
0] is entered. FIG. 6 is a view showing an example of a state after processing of the appearing character storage unit in the apparatus of the above embodiment. In FIG. 6, [◎] is added to the sentence illustrated in FIG.
Since the symbol is included, the column 60 of the content of the state of the appearance character storage unit 5 after this sentence is cut out is as follows. That is, in the character column 60A of the sentence that constitutes the target text, [1] is set in the column 60B for the presence / absence of the character corresponding to the portion of the symbol [◎], and the other portions are set to [0]. To stay. FIG. 7 is an exemplary diagram of the content 70 of the state in the processing result storage unit 4 in the apparatus of the above embodiment after processing a certain sentence. Now, when the child process terminates in the sentence illustrated in FIG. 4, the parent process receives sigcld and terminates. : First sentence], if the words [terminated] and [sigcld] are not registered in the dictionary (not shown) referred to by the text processing unit 3, the former word [terminated] appears in the corresponding sentence. The start position is [8], and the appearance end position is [1
3] (see column 70A of detection No. 1). (Note that the appearance start position and the like here are counted from the first position [here, the position where the character (symbol) [◎] exists] of the target sentence). Also, the latter word [sigcl
The appearance start position in the relevant sentence of d] is [24] and the appearance end position is [29] (Detection No. 2
Column 70B). Here, [Terminate]
Since neither of the words and [sigcld] is registered, their error types are set to [unregistered word]. FIG. 8 is a view showing an example of the state of the processing result storage unit in the apparatus of the above-mentioned embodiment after processing the whole sentence. Now, in the sentence illustrated in FIG. 4, [sigcld
Helps signal the completion of the parent process. : Second
[Sentence], the word referred to as [sigcld] is not registered in the dictionary referred to by the text processing unit 3 as described above, and the definition of a continuous [o] of the word [o] is made. If not performed, the column of detection No 3 80C and the column of detection No 4 80D in FIG. 8 are set, respectively. That is, the appearance start position of the word [sigcld] in the relevant sentence is [38], and the appearance end position thereof is [43] (see the detection No 3 column 80C), and the word [sigcld] is It is not registered and its error type is set to [Unregistered word]. In addition, regarding the consecutive [wa] of the word [wo], the detection No. 4
Column 80D, the error type is set to [connection undefined]. Note that the detection No. 1 column 80A and the detection No. 2 column 80 in FIG.
B is the detection No. in FIG.
The column 70A is the same as the column 70A of No. 1 and the column 70B of Detection No2, and a description thereof will be omitted here. FIG. 9 is a view showing an example of the contents 90 of the output file corresponding to the contents of the first input file (see FIG. 4) in the apparatus of the above embodiment. In FIG. 9, step S7 (S701 to S701 to be described later in FIGS. 2 and 3).
The content as a result of the work of S712) is illustrated. In FIG. 9, the output file content column 90 is a control information column 90A and (processed) by a certain predetermined character string (here, a character string representing a dotted line).
It is divided into target text fields 90B. In addition, in FIG. 9, [marking character: *] is shown as one type of control information. In addition, as a sentence that constitutes the (processed) target text, [◎ If the child process is * terminated *, the parent process receives * sigcld * and terminates. * Sigcld * is useful for informing * of completion of the parent process. ]It is shown. Since such a processed target text can be obtained, the operator of the word processor can quickly and accurately identify a questionable part in creating a sentence by designating a character (symbol) [*] as a search pattern. Can be searched and detected. Then, the operator of the word processor sequentially confirms the detection points and makes corrections as necessary. When such confirmation / correction work is completed, the character (symbol) [*] is collectively replaced with a symbol that represents an empty character [], so that the character [*] ([marking character] ( (Symbol) can be surely deleted collectively. Here, the character (symbol) [*] as the [marking character] is not used to compose the sentence as the text to be proofreading-corrected, and by deleting this [marking character] , The part of the text to be proofreading-corrected as described above is not deleted by mistake.

The overall operation of the above embodiment will now be described with reference mainly to FIG. When the apparatus of the above-described embodiment is activated, the input unit 1 stores the text to be processed and the corresponding control information from the input file 7 in the text storage unit 2. As a result, the target text illustrated in FIG. 4 and the control information meaning “error detection” are stored in the text storage unit 2 (S1). The text detection processing unit 3 reads out a predetermined one sentence forming the target text stored in the text storage unit 2 (S2). Regarding the cutout of the text here, punctuation marks [. ] And the period [. ] As a clue, select the one that appears frequently in the relevant sentence and cut out the desired text. In this embodiment, the punctuation marks [. ] Has been cut out. In this case, when the child process described above terminates, the parent process receives sigcld and terminates. sigcld helps signal the completion of the parent process. ] Cut out a sentence from the text. And, a punctuation mark [. ], The presence or absence of the appearance character (symbol) as illustrated in FIG. 5 is investigated, and the result of the investigation is stored in the appearance character storage unit 5. At the present stage, when the child process in the above sentence terminates, the parent process receives sigcld and terminates. : First sentence] will be stored. The text detection processing unit 3 extracts one sentence as described above,
Processing according to the control information from the text storage unit 2 (here, processing according to the control information "error detection") is performed (S3). It should be noted that the error detection process here can be realized by using, for example, the method disclosed in the above-mentioned Japanese Patent Laid-Open No. 4-134408. That is,
As I have already mentioned, [Words not registered in the dictionary], [Connections between undefined words],
It is possible to detect that it corresponds to [connection that is prone to error]. Next, it is checked whether or not the text to be processed remains in the text storage unit 2 (S4). Here, since the sentence to be processed still remains, the process returns to the previous step S2. If there is no text to be processed, the process proceeds to the next step S5. In step S2 described above, [➝When the child process terminates, the parent process receives sigcld and ends. s
igcld helps signal the completion of the parent process. ] From the text [sigcld helps signal the completion of the parent process. : Second sentence] is read. Again, this is a punctuation mark [. ], The presence or absence of an appearing character (symbol) as illustrated in FIG. 6 is investigated, and the result of the investigation is stored in the appearing character storage unit 5. In addition,
At this stage, none of the corresponding characters (symbols) in the appearing character storage unit 5 appear in the second sentence, and the stored contents of the appearing character storage unit 5 are shown in FIG. Will stay in the state. In the subsequent step S3, the second sentence is subjected to the processing according to the control information stored in the text storage unit 2 (again, the processing according to the control information [error detection]). In the next step S4, it is checked whether or not the sentence to be read subsequent to the second sentence remains in the text storage unit 2. At this stage, there is no sentence to be read after the second sentence, and the process proceeds to step S5.
In step S5, the contents stored in the appearing character storage unit 5 (see FIG. 6) are sequentially examined from the beginning by the operation of the output processing unit 6, and the first character (symbol) ) [*] Is selected as the so-called [marking character]. Subsequently, the output processing unit 6 (the output unit 6D therein) outputs the above [marking character] [*] to the output file 8 (S6). Following this, the output processing unit 6 (the output unit 6D therein) outputs the target text stored in the text storage unit 2 to the output file 8 character by character (S7). In this process, as illustrated in the flowchart of FIG. 3 described later, before outputting the characters corresponding to the start position and the end position regarding the error detection position, the [marking character ] Is output, and the processing as a whole ends.

Next, the step S7 in FIG. 2 will be described mainly with reference to the flowchart of FIG. The various variables used in FIG. 3 have the following meanings. That is, cnt: a variable for the counter. Its initial value is 1, and is used to indicate the position of the character to be transferred in the target text. maxCnt: A variable indicating the number of characters of the target text. No: A variable indicating the detection No stored in the processing result storage unit 4. MaxNo: Detection No. stored in the processing result storage unit 4
Is a variable indicating the number (maximum value) of. pos: A variable holding the position where the [marking character] is inserted. Detection stored in the processing result storage unit 4
Holds either the start position or the end position of the detection result designated by No. Whether the start position or the end position of the detection result is indicated by this pos is
It is determined by the variable flag. flag: A variable that holds a value that determines whether the value of pos indicates the start position or end position of the detection result. If the value of this flag is 1, it is the start position, and if it is 0, it is the end position.

Now, when step S6 in FIG. 3 is completed, the initial values of the above-mentioned variables are set (S7).
01). Here, [cnt ← 1: No ← 1: flag
← 1: pos ← No. An initial value is set as follows: start (8 which is the start position of the first detection result): maxCnt ← 64 (total number of characters of target text): maxNo ← 4 (number of detection results)]. Next, it is checked whether the value of the variable cnt is equal to another variable pos (S702). In this step S702, it is determined whether or not it is the position to insert the [marking character]. Here, cnt = 1, and
Since pos = 8 and both are not equal, the process moves to step S703, and the character (symbol) [⊚] corresponding to the value of cnt is output. In the subsequent step S704, the value of cnt is 1
Is increased, and in the subsequent step S705,
It is determined whether the value of cnt exceeds the value of maxCnt. The determination made in step S705 is whether or not all the characters of the target text have been output. Here, cnt = 1, maxCnt
64, and since the determination is negative, the process returns to the original step S702. The value of cnt is 2,
When it is 3, 4, 5, 6, 7 S702 → S7
The process of 03 → S704 → S705 → S702 is repeated, and [child], [p], [b], [se], [s],
Characters such as [ga] are sequentially output. If the value of cnt is now 8, the determination in step S702 becomes affirmative, and the process moves to the corresponding step S706.
In this step S706, the [marking character] is output according to the type of the detection result, but the [marking character] in this example is [*] regardless of the type of the detection result. Has been done. Therefore, in this step S706, the above [marking character] [*] is output, and then the process proceeds to the next step S707. In this step S707, the flag
It is determined whether or not = 1, that is, whether the value of pos corresponds to the start position or the end position.
Since flag = 1 now and it is shown that the value of pos is at the start position, the process proceeds to step S709, and the value of pos is set to No. end
+1 (the end position of the first detection result: 13 + 1) is set to 14, and the value of the flag is set to 0. Following this, the process moves to step S703,
The character [ta] at the position indicated by the cnt value (= 8) here is output. Following this, S704 → S705
→ The process is performed in the order of S702 (note that the value of cnt is set to 9 in step S704). The value of cnt is 9,10,11,1
2 and 13, S702 → S703 → S7
The process of 04 → S705 → S702 is repeated,
Characters such as [-], [Mi], [Ne], [-], and [To] are sequentially output. If the value of cnt is 14 now, the determination in step S702 becomes affirmative,
The process moves to the corresponding step S706. Then, after outputting the [marking character] that is [*], the next step S
Move to 707. In this step S707,
Since the value of flag is 0, step S708
To increase the value of No by 1 (ie 2
From step S710) to step S710. In this step S710, it is determined whether or not the value of No exceeds the value of maxNo (= 4). That is, it is determined whether or not the marking process for all the predetermined detection points has been completed. If it is determined that the No value has exceeded the maxNo value, then the flow shifts to step S712, where the pos value is set to 0, and the first step S
All the determination results in 702 are made negative. Now, the value of No. does not exceed the value of maxNo, the process proceeds to step S711, and the value of pos is set to No. Start (start position of the second detection result)
Is set to 24, followed by step S70.
Move to 3. In this step S703, cn
The character [su] corresponding to the position indicated by the value of t (= 14) is output, and S704 → S705 → S702.
(The value of cnt will be set to 15).

What has been described above is that the value of cnt is 1
To output the characters of the target text from No. to No. 14 and to insert the marking character corresponding to the detection result in the detection No. 1 of the processing result storage unit 4. As a result, the output file 8 outputs a character string [◎ child process is * terminated *]. Thereafter, by performing the same operation, the marking characters are output to the positions corresponding to the start position and the end position of detection No2, No3, No4 in the processing result storage unit 4.
Then, in step S705, when the value of cnt finally exceeds the value of maxCnt, it means that all necessary processing is completed.

Next, with reference to FIGS. 10 to 16, the case where the input file having the second content example is applied to the above embodiment will be described. FIG. 10 shows an input file content column 10 of the second example applied to the above embodiment.
It is an illustration figure of 0. In FIG. 10, the input file content field 100 is divided into a control information field 100A and a target text field 100B by a predetermined character string (here, a character string representing a dotted line). In addition,
In this FIG. 10, [error detection ●] and [notation inconsistency detection ◎] are illustrated as the control information. Here, enclose the error in [●],
Parts with unconfirmed notations are enclosed in [◎]. In addition, as a sentence which constitutes the target text, [◎ When the child process terminates, the parent process receives sigcld and ends. sigcld helps signal the completion of the parent process. ] Is illustrated. The initial state of the contents of the appearing character storage unit 5 is the same as in the case of FIG. 5 related to the description of the input file of the first example in the above embodiment. When a character (symbol) different from the character (symbol) specified in advance in the appearing character storage unit 5 is specified in the input file 7,
The character (symbol) is registered again in the appearing character storage unit 5, and [0] is entered as information regarding the presence or absence of the appearance.

The overall operation relating to the input file of the second example of the above-mentioned embodiment will be described with reference mainly to FIG. When the apparatus is started up now, the input unit 1 stores the text to be processed and the corresponding control information from the input file 7 in the text storage unit 2. As a result, the target text illustrated in FIG.
In addition, control information that means "error detection" and "notation inconsistency detection" is stored in the text storage unit 2 (S1). The text detection processing unit 3 reads out a predetermined one sentence forming the target text stored in the text storage unit 2 (S2). As a result, [◎ When the child process terminates, the parent process receives sigcld and terminates. ] 1 sentence is cut out. In addition, in the process of searching for the delimiter of the target sentence, the presence / absence of an appearing character is checked at the same time, and the result is stored in the appearing character storage unit 5. In this case, since the character (symbol) [◎] appears, the contents of the appearing character storage unit 5 after the one sentence is cut out are the operations related to the input file of the above-mentioned first example. Similar to the above case, the result is as shown in FIG. The text detection processing unit 3 processes the one sentence cut out as described above according to the control information from the text storage unit 2 (in this case, the control information such as [error detection] and [notation inconsistency detection] is processed. Followed processing)
(S3). The error detection processing here can be realized by using the method exemplified in the case of the operation related to the input file of the first example. Regarding the detection of inconsistencies in notation, the same [reading] but different [notation] is detected (same synonyms, feed swaying, mixed kanji and kana notation). . Here, regarding the contents of the processing result storage unit 4, error detection is as shown in FIG. 7 as in the case of the operation related to the input file of the first example. Further, the unification of the notations is as illustrated in FIG. This FIG. 12 shows one of the processing result storage units in the case of the operation related to the input file of the second and first examples.
It is an illustration figure of the state regarding the notation after processing the sentence. In FIG. 12, the columns included in the heading section 121 are a reading column 121A, a number column 121B, and an address column 121C for the notation. For example, in column 12A thereof,
[Reading: this], [Number of notations: 1] and [Address to notation:
1] is entered. The columns included in the notation unit 122 are the address column 122A and the address column 122 of the next notation.
B, start position column 122C, end position column 122D. For example, in the 12Eth stage thereof, [address: 1] [address of the following notation: 0], [start position: 2] and [end position: 2]. Is entered. That is, in FIG. 12, the [reading] and [appearing position] of the words ko (child), oya (parent), uke (receive), and kyu (end)
Are separately stored in the heading section 121 and the notation section 122. The [appearance position] here is determined from the [start position] and [end position] of a certain predetermined word, as in the case of FIGS. 7 and 8 in the operation relating to the input file of the first example. . [Number of notations: 121B] in FIG. 12 indicates the number of appearances of words having the same reading but different notations. When this value is 2, for example, it is determined that there is an inconsistent part in the notation. Following step S3, the text storage unit 2
Check if there is any text remaining to be processed (S
4). When there are remaining sentences to be processed, the process proceeds to step S5. On the other hand, when there is no text to be processed, the process returns to the first step S2. The text detection processing unit 3 reads the next one sentence from the target text stored in the text storage unit 2 (S2). As a result, [sigcld helps signal the completion of the parent process. ] 1 sentence is read. Also, in the process of searching for a delimiter (symbol) in a sentence, the presence / absence of an appearing character is also checked at the same time, and the result is stored in the appearing character storage unit 5. In this case, none of the characters (symbols) stored in the appearing character storage unit 5 appear, and the content of the appearing character storage unit 5 after such processing is 1
It is similar to FIG. 6 in the operation related to the example input file. The text detection processing unit 3 performs processing on the one sentence cut out as described above according to the control information in the text storage unit 2 (S3). Regarding the contents of the processing result storage unit 4 at this time, [Error detection] is the same as that in FIG. 8 in the operation relating to the input file of the first example, and [Notation unification] is shown in FIG. It is being done. FIG. 13 shows the processing result storage section in the operation related to the input file of the second example.
It is an illustration figure of the state regarding the notation after processing the whole sentence.
In FIG. 13, the columns included in the heading section 131 are a reading column 131A, a number column 131B, and an address column 131C for the notation. For example, in the 13Bth column,
[Reading: Oya], [Number of notations: 1] and [Address to notation: 2] are entered. Further, the columns included in the notation unit 132 are the address column 132A, and the address column of the next notation 1
32B, start position column 132C, end position column 132D
For example, in the 13G stage, [Address: 1]
[Address of the following notation: 0], [Start position: 2] and [End position: 2] are entered. Here, regarding the word "Oya (parent)", the same notation has already been registered, and it will not be registered again. However, a different notation [End] is registered for the word Shuryu (completion), and here the number of notations is [2].
Then, [completion] is registered in an appropriate place of the notation part 132. Following this, it is checked whether or not the character string to be cut out still remains in the text storage unit 2. Here, there is no character string to be cut out, and for this reason, the next step S5
Move to and decide the [marking character] to be used. At this time, in the output processing unit 6, the presence or absence of the [marking character] in the target text stored in the text storage unit 2 is checked by checking the contents of the appearance character storage unit 5 sequentially from the beginning. . Here [appearance ant:
1], the appropriate one is selected from those of [appearance pear: 0] in the appearance character storage unit 5. In this case, since a character (symbol) [[circle]] has already appeared in the target text, for example, the character (symbol) [◇] following this is selected as the [marking character]. As a result, a correspondence table 140 of [detection type] and [marking character] as shown in FIG. 14 is formed. FIG. 14 is a diagram showing correspondence between detection types and marking characters in the operation related to the input file of the second example. The correspondence table 140 in FIG. 14 includes [error type column: 141], [marking character column: 142] and [designated marking character column: 143]. In FIG. 14, as shown in stages 140A and 140B, [[]] which is [designated marking character] for [unregistered word] and [connection undefined] is [ Marking character]. On the other hand, for [Unified notation], instead of [◎] which is [specified marking character], another [◇] is used as [marking character]. In the flowchart of FIG. 11, after the above step S5, different processing results are combined into one (S5A). In this case, the state of the error detection result in FIG. 8 and the state of the detection result related to the inconsistency in the notation in FIG. 13 described above are merged so as to be arranged in ascending order of the start positions, and shown in FIG. It is made into the table of the processing result which seems to exist. FIG. 15 is a table-like illustration of the state of the processing result storage unit in the operation relating to the input file of the second example after processing all the sentences. In the processing result table 150 in FIG. 15, [detection No. column: 151], [start position column: 152], [end position column: 153], [error candidate column: 154] and [error type column: 155]. It is included. By preparing such a processing result table 150, it is possible to surely insert an appropriate [marking character] at an appropriate place in a sentence that constitutes the target text. The step S in the flowchart of FIG.
After 5A, the output processing unit 6 outputs an appropriate [marking character] to the output file 8 with reference to the correspondence table 150 in FIG. 15 (S6). Here, when the [marking character] actually used is different from the [designated marking character], the output is made such that the change is recognized. In this example, when the error type is [Notation unification],
The [marking character] actually used has been changed from [designated marking character] [◎] to [◇]. FIG. 16 is a view showing an example of the contents 160 of the output file in the operation related to the input file of the second example. In FIG. 16, the output file content column 160 described above is used.
Is divided into a control information section 160A and a (processed) target text section 160B by a certain predetermined character string (here, a character string representing a dotted line). In this FIG. 16, [●] is shown as [marking character] for the former control information [error detection], and also for the latter control information [detection of unification of notation]. As the [marking character], [◇] instead of [◎] is shown. The result of step S6 is shown in FIG.
160B of [, the child process is ● terminated ●, the parent process is ● sigcld
Receiving ● Ending ◇ ● sigcld ● helps inform ● of parent process ◇ completion ◇. ] Becomes. In the flowchart of FIG. 11, the above step S6 is performed.
Subsequently, the output processing unit 6 transfers the target text from the text storage unit 2 character by character to the output file 8 (S7). In the process of this transfer, referring to the flowchart of FIG. 3 relating to the operation relating to the input file of the first example, the corresponding [marking before the output of the character corresponding to the start position and the end position of the detection position of the error candidate is performed]. Character] is output. Note that in the case of the operation related to the input file of the second example here, in step S706 of the flowchart of FIG. 3, referring to the correspondence table 140 in FIG. ] Is output. As described above, FIG. 16 is an exemplary diagram of the content output as a result when step S7 of the flowchart of FIG. 11 is completed. In the case of FIG. 16, [●] and [◇] are used as [marking characters], but neither of them is included in the target text. Therefore, by designating [●] and [◇] as the search pattern of the word processor to be used, it is possible to quickly and accurately search the corresponding detection point. Then, the detected locations are sequentially confirmed and corrections are made if necessary. Then, when the necessary confirmation / correction is completed, by replacing these [●] and [◇] with [] (blank character) at once, only the [marking character] in the target text can be surely deleted. it can. As in the case of the input file of the first example described above, no character (symbol) matching the [marking character] is used in the target text, and the proofreading revision is performed in the deleting operation of the [marking character]. It ensures that some of the target text is not accidentally deleted.

FIG. 17 is a diagram showing the contents of the input file of the third example applied in the above embodiment. This FIG.
In the above, the input file content section 170 is divided into a control information section 170A and a target text section 170B by a predetermined character string (here, a character string representing a dotted line). Note that, in FIG. 17, [error detection: ●] and [notation inconsistency detection: ⊚: KWIC] are illustrated as the control information. In addition, as the sentences constituting the target text, as in the case of other input file content examples, [[when the child process terminates, the parent process receives sigcld and ends]. sig
The cld helps signal the completion of the parent process. ]
The following sentence is illustrated. Here, KWIC is
It is an abbreviation for [Key Word In Context], and expresses a key character string together with the character strings before and after it. As an ununiform expression, the expressions here may appear over a plurality of pages separately, and it is difficult to check the target text while scrolling through the pages. Therefore, for example, by displaying KWICs using keys having the same [reading] but different [notations] as keys, it becomes possible to confirm the list of ununiform notations. In the case of the input file of the third example, the operation is the same as that of the input file of the second example, and the output in which the designated [marking character] is inserted is the same as that of FIG. . In addition, the output processing unit 6
While referring to the processing result storage unit 4, the KWIC display as shown in FIG. 18 is output. This Figure 18
It is an illustration figure of the content 180 of the output file regarding KWIC in the case of the input file of the said 3rd example. By referring to the KWIC portion in FIG. 18, it is easily confirmed that the notation is inconsistent by looking at the front and rear relationships thereof. In FIG. 18, the [reading] 180A that is [shukyu] is the target of the survey, and the notations 180B that are [end] and [completion] are unconsolidated. Here, the above [notation]
The [end] in is correct, and the text will be corrected accordingly. Incidentally, in the case of the operation related to the input file of the third example, the method of KWIC was used, but in addition to this, a request for creating a word frequency list and the creation of the list; It is also possible to perform processing such as creating a log of request and replacement.

[0016]

As described above, according to the present invention, for a portion requiring correction in the text to be processed, a character (symbol) that does not appear in the text to be processed is marked [marking character]. The relevant part is clearly indicated by selecting and inserting as, and the corresponding detected place is the basic function originally attached to the ordinary word processor that the user uses daily. By using the search function, which is one of the above, it is possible to perform quick and accurate detection and required correction processing.

[Brief description of drawings]

FIG. 1 is a schematic configuration diagram of an apparatus according to an embodiment of the present invention.

FIG. 2 is a flow chart for explaining the operation of the entire apparatus of the above embodiment.

FIG. 3 is a flowchart for explaining a marking character insertion operation in the apparatus of the above embodiment.

FIG. 4 is a first input file in the apparatus of the above embodiment.
It is an illustration figure of.

FIG. 5 is a view showing an example of an initial state of a appearing character storage unit in the apparatus of the above embodiment.

FIG. 6 is a view showing an example of a state after processing of the appearing character storage unit in the apparatus of the above embodiment.

FIG. 7 is a diagram illustrating a processing result storage unit in the apparatus according to the above-described embodiment,
It is an illustration figure of a state after processing a certain sentence.

FIG. 8 is a diagram illustrating a processing result storage unit in the apparatus according to the above-described embodiment,
It is an illustration figure of the state after processing the whole sentence.

FIG. 9 is a view showing an example of the contents of an output file corresponding to the contents of the input file of the first example in the apparatus of the above embodiment.

FIG. 10 is a view showing an example of contents of a second input file applied to the apparatus of the above embodiment.

FIG. 11 is a flowchart for explaining an overall operation relating to a second input file applied to the apparatus of the above embodiment.

FIG. 12 is a view showing an example of a state related to notation after processing a certain sentence in the processing result storage section in the operation related to the input file of the second example.

FIG. 13 is a view showing an example of a state related to a notation after processing all sentences in the processing result storage section in the operation related to the input file of the second example.

FIG. 14 is a diagram showing correspondence between detection types and marking characters in the operation related to the input file of the second example.

FIG. 15 is a view showing an example of a table state of the processing result storage unit in the operation related to the input file of the second example after processing all the sentences.

FIG. 16 is a view showing an example of the contents of an output file in the operation related to the input file of the second example.

FIG. 17 is a diagram showing an example of contents of a third input file applied in the above embodiment.

FIG. 18 K in the case of the third input file
It is an illustration figure of the content of the output file regarding WIC.

[Explanation of symbols]

1-input unit; 2--text storage unit; 3--text detection processing unit; 4--processing result storage unit; 5--appearing character storage unit; 5A-designating unit; 6-output processing unit; 6A-judgment part; 6B-selection part; 6C-insertion part; 6D-output part.

Claims (2)

[Claims] 1. A text storage unit for storing a proofreading target text, and a character whose appearance is not detected in the text for marking with reference to the proofreading target text stored in the storage unit. Selection means for selecting as a character, detection processing means for detecting the location of the proofreading candidate from the text of the proofreading subject stored in the text storage means, and the location of the proofreading candidate detected by the detection processing means A document processing apparatus comprising: an inserting unit that inserts the marking character selected by the selecting unit. 2. An appearance character storage means for storing the appearance state of the marking character, and a specification means for specifying the marking character for which the appearance state should be stored in the appearance character storage means, the selecting means. Stores the appearance state of the marking character in the text stored in the text storage means in the appearance character storage means, and sets a target based on the appearance state of the marking character stored in the appearance character storage means. Characterized by selecting characters for marking
The document processing apparatus according to claim 1.