JP2570681B2 - Word processor - Google Patents

Description

Description: BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a word processor, and more particularly to a word processor suitable for creating a high-quality sentence by discriminating a sentence end form, a double negation expression, and a passive expression in a Japanese sentence. It concerns a word processor.

[Background of the Invention]

As a method of creating high-quality sentences in a word processor that creates Japanese documents, see Nichinami and Ushijima, "Prototyping of Japanese Text Elaboration Support Tool (1)," IPSJ 29th Annual Convention Proceedings (I)
As described in 3D-8, September 11, 1984, pp. 413-414, there is a method to support the elaboration of sentences by extracting sentences and displaying the beginning, end, and length of the sentences side by side. is there.

However, in order to create an easy-to-read sentence, the end of the sentence should not be mixed with the usual wording styles "da" and "is" and the polite wording styles "da" and "masu".
Although it is desirable to eliminate double negative expressions that obscure the sentence, the above method does not consider the function of determining the end of sentences and double negation. In addition, in the above method, since the display of the passive expression part is performed separately from the target sentence because of the display method by batch processing for the target sentence, the passive expression part to be corrected is again displayed at the time of correction. A search operation was required.

[Object of the invention]

SUMMARY OF THE INVENTION An object of the present invention is to solve such a conventional problem and improve the quality of a sentence without providing a special hardware function when supporting the elaboration of a sentence when creating a document. It is an object of the present invention to provide a word processor capable of improving the efficiency of creation.

[Summary of the Invention]

In order to achieve the above object, a word processor according to the present invention is a word processor for creating a document, which is a table of a character string of a sentence end form in a normal wording form and a polite wording form, and a negative expression character for making a sentence a negative form. Storage means for respectively storing a table of columns and a table of passive expression strings for converting sentences into passive forms; a character string text of the created document; a sentence end form character string table, a negative expression character string table, and a passive expression The character string table is compared and matched by extracting a character string using a relative position counter indicating the relative position of the sentence and a flag indicating immediately after the end of sentence expression recognition. Whether there is one, whether there are at least two places in the same sentence for negative expressions, and the same parameter for passive expressions A discriminating display means for discriminating whether or not there is a certain value or more in the rough, and displaying the discriminated expression as a representation in a document; and a document file for storing the discriminated character string text. It is characterized by.

(Example of the invention)

 Hereinafter, embodiments of the present invention will be described with reference to the drawings.

First, the sentence end expression of the first embodiment is displayed by discriminating between a normal wording form and a polite wording form,
About the method to support the unification of the end form of sentences
This will be described with reference to FIG.

FIG. 2 is a functional block diagram of Japanese word processing with a sentence end form discrimination function according to the first embodiment of the present invention. In the figure, 1 is a word processing processing control function block (hereinafter, referred to as a word processor), 2 is a word processing function block group for inputting, proofreading, editing, displaying, and printing out a character string text, and 3 is a character string. A character string text storage unit that stores text, 4a is a function block for each sentence end form that identifies the sentence end expression part in the character string text, and 5a is a sentence end expression storage that stores the normal sentence end and polite sentence end character strings. Department. In this configuration, a sentence end form discrimination function block 4a and a sentence end expression storage unit 5a are provided in a conventional Japanese word processor.

When activated by the word processor 1, the sentence end form discriminating function block 4a starts the character string text storage unit 3 by a method described later.
Is compared with each character string in the sentence ending expression storage unit 5a, a matching character string is detected, and whether the detected character string expression belongs to a normal sentence end form or a polite sentence end form is displayed. At the same time, it usually determines the mixed state of the polite sentence end form for each paragraph. On the other hand, when the word processor processing function block group 2 is activated, the conventional Japanese word processing is executed.

FIG. 3 is a hardware configuration diagram of a Japanese word processor with a sentence end form discrimination function according to the first embodiment of the present invention. In the figure, 6 is a processor, 7 is an input device (keyboard) for inputting a character or the like or instructing an editing process, 8 is a display device for displaying a character string text or the like,
Reference numeral 11 denotes a storage device including a program storage unit 9, a work area 10, a character string text storage unit 3, and a sentence end expression storage unit 5a.
The keyboard 7 has the key arrangement shown in FIG. 4, and includes a key group 72 for inputting characters and the like and a key group for instructing processing contents.
71 (including the sentence end form discrimination instruction key 711).

As shown in FIG. 1, when the word processor 1 receives the sentence end form discriminating instruction key 711 while waiting for a key input from the keyboard 7, the word end form discriminating function block 4a
Is activated to detect the end-of-sentence expression by referring to the end-of-sentence expression storage unit 5a (steps 101 to 103). On the other hand, when a key other than the above is received, the word processing function block group 2 is started and received. At the same time as the processing specified by the key is performed (step 104), any one of the above processing is repeatedly executed until the entire processing such as document creation is completed (step 105). Note that depending on the type of key received,
Double negative expression detection 4b and negative expression 5b (double negative expression detection function) in step 103, or passive expression detection 4c and passive expression
5c (passive expression detection function) is activated. Since both of these functions will be described in detail later as second and third embodiments, the sentence end form discrimination function block 4a and the sentence end expression storage unit 5a are used here. Only the (sentence end form discrimination function) will be described.

The details of the processing performed by the sentence end form discrimination function block 4a in step 103 will be described below with reference to FIGS. 5 to 11.

When activated by the word processor 1, the sentence end form discriminating function block 4a firstly receives a single sentence number counter S for counting the number of single sentence and a normal sentence counter for counting the number of normal sentence end forms, as shown in FIG. Sentence end form counter E ₁ , a polite sentence end form counter for counting the number of polite sentence end forms
E ₂ each is cleared to "0" (step 41a~43a). Subsequently, the character string text in the character string text storage unit 3 and each character string in the end-of-sentence expression storage unit 5a are compared and collated in order from the beginning of the character string text to the end of the paragraph by the method described later. (Steps 44a and 45a) (hereinafter referred to as a sentence end expression recognition processing module 44a), and evaluates the mixed state of the end of sentence forms in the paragraph by a method described later ( Step 46a) (hereinafter referred to as the paragraph evaluation processing module 46a), the above operation is repeatedly executed for all the character string texts in the character string text storage unit 3, and the processing of the functional block 4a ends (step 47a). ).

When the control is passed to the sentence end expression recognition processing module 44a, as shown in FIG. 6, the relative position counter C for indicating the relative position of the character in the character string text, and the flag F for indicating immediately after the end of sentence expression recognition, as shown in FIG. Are cleared to "0" (steps 4401 and 4402), and when the value of the relative position counter C does not indicate the end of the sentence, first, the character string of the character string text after the position indicated by the value of the relative position counter C is normally the end of the sentence. It determines whether or not to coincide with any form strings, when a matching normal endnote form string there usually by adding "1" to the end of the sentence form counter E _1, also simple sentence counter S "1" Is set, the flag F is set to "1", and the length of the normal sentence end form character string matched with the relative position counter C is added in order to match the position of the next character string matching. String text matched for display The position information of the character string in the strike and the identification information as to which of the sentence ending form the matched character string is usually set in a predetermined area (steps 4403 to 4409).

The normal sentence end form character string to be compared with the character at the position indicated by the relative position counter C is, as shown in FIG.
Create a table consisting of each character string and its length. In other words, the expression at the end of an ordinary sentence in Japanese sentences is generally the end form of a predicate or the auxiliary verb "da"
The character strings are registered in a table because they are represented by the attachments of the auxiliary words "is" and "is not". The length of those character strings is 2-4.

Further, for example, when the character string text has the contents shown in FIG. 10, "absent" of the normal sentence end form character string is recognized on the first line by the above-described operation of the determination.

Subsequently, similarly to the above, it is determined whether or not the character string after the position indicated by the value of the relative position counter C matches any of the polite sentence end form character strings, and when there is a matching polite sentence end form character string, after adding "1" to carefully endnotes form counter E ₂ (step 4410,4411), step described above 4406-440
Step 9 is performed in the same manner.

The polite sentence end form character string that is compared with the character at the position indicated by the relative position counter C is, as shown in FIG.
Create a table consisting of each character string and its length. In other words, polite sentence ending expressions in Japanese sentences are generally attached with the auxiliary verbs “is” and “mas”, which indicate “polite”, and the auxiliary verbs “is” and “you”. Is registered in the table.
The length of those character strings is 2-7.

Further, for example, when the character string text has the content shown in FIG. 10, the character string "" which is the polite sentence end form character string is recognized on the second line by the above-described determination operation.

On the other hand, when there is no matching polite sentence end form character string, it is determined whether or not the position indicated by the value of the relative position counter C is a reading point, a space, a segment break, or the like. And add "1" to the single sentence counter C (steps 4412-4414). When the above operation is repeatedly executed and the value of the relative position counter C reaches the end of the sentence, the flag F is checked, and when it is "0", "1" is added to the single sentence counter S, and the processing module The processing of 44a ends (steps 4415 to 4416). Although not shown, before the end, for example, in the character string text in FIG. 10, the normal sentence-end form character string “No” and the polite sentence-end form character string “I” are shown in FIG. It is displayed on the display device 8 as shown.

Paragraph evaluation processing module 46a, when control is passed, as shown in FIG. 7, by checking the polite sentence end forms counter E _2, and immediately terminated when its value is "0" (step 4601), E _When the value of ₂ is equal to the value of the single sentence counter S, or the value of E ₂ is smaller than the value of the single sentence counter S, and the value of the normal sentence end counter E ₁ is “0”, the character string text Is displayed on the display device 8 to indicate that all of the paragraphs are in a polite wording form (step 460).
2,4603,4605). On the other hand, carefully endnotes form counter value of E ₂ is less than the value of the sentence counter S, and when the normal value of the endnote form counter E ₁ is not "0", and polite phraseology in the string text paragraph The fact that normal wording is mixed is displayed on the display device 8 in the same manner as described above (step 4604).

In this way, the polite expression of "is, masushi" is expressed by the auxiliary verbs "is" and "mas", and the polite expressions of polite and humorous words such as "isu" and "you". On the other hand, focusing on the fact that ordinary expressions are expressed by the form of the verb and the attachment of the auxiliary verbs "da" and "da", these auxiliary verb character strings are registered in a table, and by referring to the table, the character string text It is possible to distinguish the sentence ending form in the normal sentence ending form and the polite sentence ending form. Further, in the present embodiment, it is not necessary to form the normal sentence end form character string and the polite sentence end form character string in the respective tables, and identification information for identifying both sentence end form character strings is added to one table. It is possible to put it together.

When the end-of-sentence form determination function block 4a is activated, in addition to the end-of-sentence form determination instruction key 711, for example, a word, such as a key for designating the end of a paragraph, a key for designating a line feed, a key for designating a page break, or an end-of-sentence key The processing may be started by pressing a key for instructing the processing, and the processing of the sentence end form determination function block 4a may be executed in synchronization with the processing.

Regarding the paragraph unit, character string text consisting of a certain number of sentences can be regarded as one paragraph unit, and character string text consisting of a certain number of lines It is also possible to consider one paragraph unit or the whole character string text as one paragraph unit.

The paragraph evaluation processing module 46a is not essential and can be omitted.

Next, a second embodiment of the present invention is to determine and display whether a negative expression is duplicated in the same sentence, and to eliminate a double negative expression which makes the meaning of the sentence ambiguous.
This will be described with reference to FIGS. 12 and 18.

FIG. 12 is a functional configuration diagram of Japanese word processing with a double negation expression detection function showing a second embodiment of the present invention. In the figure, reference numeral 4b denotes a double negative expression detection function block for performing recognition of a negative character string in a character string text, and reference numeral 5b denotes a negative expression storage unit that stores a negative expression character string. Note that the word processor 1, word processor processing function block group 2, and character string text storage unit 3 are the same as those in the first embodiment described above, so that the description of this part will be omitted below. Further, in the present configuration, a double word expression detection function block 4b and a word expression storage unit 5b are provided in a conventional word processor as described above.

When activated by the word processor 1, the double negation expression detection function block 4b compares and compares the character string text in the character string text storage unit 3 with each character string in the negation expression storage unit 5b according to a method described later. A character string matching the column text is recognized, and when there are two or more recognized negative character strings, it is indicated that the sentence is a double negative expression sentence.

FIG. 13 is a hardware configuration diagram of a Japanese word processor with a double negation expression detection function showing a second embodiment of the present invention, and FIG. 14 is a key layout diagram of the keyboard 7. 3 and 4 described in the first embodiment are that the storage device 11 has a negative expression storage unit 5b and that the key group 71 has a double negative expression detection instruction. The key 712 is included.

As shown in FIG. 1, when the word processor 1 receives the double negative expression detection instruction key 712 while waiting for a key input from the keyboard 7, the word processor 1 activates the double negative expression detection function block 4a. , A negative expression is detected by referring to the negative expression storage unit 5b (steps 101 to 103).
When a key other than the above is received, the word processor processing function block group 2 is started up as described above to perform the processing indicated by the received key (step 104), and the entire processing such as document creation ends. Any of the above processes is repeated until (step 105).

Double negative expression detection function block 4b in step 103 above
The details of the processing by the above will be described below with reference to FIGS. 15 to 18.

When activated by the word processor 1, the double negative expression detection function block 4b firstly receives a negative expression number counter N for counting the number of negative expressions in the same sentence, as shown in FIG. The relative position counter C for indicating the relative position of the character is cleared to "0" (steps 401 and 402), and the position of the character string text indicated by the value of the relative position counter C is determined by the ending point of the sentence symbol, "?"
If it is not "!" Or the end of the character string text (step 403), it is determined whether the character string of the character string text after the position indicated by the value of the relative position counter C matches any of the negative expression character strings. Determined in order from the beginning of the column text, and if there is no matching character string, the relative position counter C
(Steps 404 and 405), and if there is a matching character string, the length of the negative expression character string matched is added to the relative position counter C to match the position of the next character string matching. Then, "1" is added to the negative expression number counter N, and the position information of the character string in the matched character string text to be displayed on the display device 8 is set in a predetermined area (steps 406 to 408).

The negative expression character string to be compared with the character at the position indicated by the relative position counter C is, as shown in FIG. 16, a table composed of each character string and the length of the character string. In other words, negative expressions in Japanese sentences are generally "none", "none", "nakarou",
Since the character strings are represented by attaching auxiliary verbs indicating "cancel" such as "not", those character strings are registered in a table. The length of those character strings is 2-4.

In addition, for example, when the character string text has the contents shown in FIG. 17, “absent” of the negative expression character string is recognized by the above-described determination operation.

By repeatedly executing the above operation, when the position indicated by the relative position counter C is the last symbol of the sentence or the end of the text,
If the value of the negative expression number counter N is checked and is equal to or more than "2", display information for displaying that the sentence is a double negative expression containing sentence is set in a predetermined area, and (steps 409, 410) The above operation is performed by the character string text storage unit 3
Are repeatedly executed for all the character string texts in the above, and the processing of the functional block 4b is completed (steps 411, 412).
Although not shown, before the end, for example, "none" of the negative display character string recognized at two places in the character string text of FIG. 17 is displayed on the display device 8 as shown in FIG.

Focusing on the fact that a negative expression in Japanese is expressed by attaching an auxiliary verb character string of "cancel" to a declinable word, the auxiliary verb character string is registered in a table, and the character string is referred to by referring to the table. It is possible to determine whether or not the text is a double negative expression containing sentence in which the negative expression is duplicated. Further, in the present embodiment, when, for example, a polite word character string is stored in the negative expression storage unit 5b, it is possible to determine the double polite word expression of the character string text by the same operation as described above. .

It is not necessary to always execute the processing operation by the double negation expression detection function block 4b from the beginning to the end of the character string text. For example, the processing operation can be ended at the end of a paragraph or the end of a page.

When starting the double negation expression detection function block 4b,
In addition to the double negation expression detection instruction key 712, for example, a key for instructing word processing such as a key for instructing the end of a paragraph, a key for instructing a page break, and a kana character in kana-kanji conversion type Japanese input. The process may be started by pressing a key for instructing conversion from a column to a kanji kana, and the process of the double negative expression detection function block 4b may be executed in synchronization with those processes.

Next, a third embodiment of the present invention will be described with reference to FIG. 1 and FIG.
This will be described with reference to FIGS. 19 to 27.

FIG. 19 is a functional block diagram of Japanese word processing with a passive expression detection function showing a third embodiment of the present invention. In the figure, reference numeral 4c denotes a passive expression detection function block for performing recognition of a passive character string in a character string text, and reference numeral 5c denotes a passive expression storage unit that stores a passive expression character string. In addition,
Since the word processor 1, the word processing function block group 2, and the character string text storage unit 3 are the same as those in the first embodiment,
Hereinafter, description of this portion will be omitted. Further, in this configuration, a passive expression detection function block 4c and a passive expression storage unit 5c are provided in a conventional word processor as described above.

When activated by the word processor 1, the passive expression detection function block 4c executes the character string text storage unit 3 in a manner described later.
Is compared with each character string in the passive expression storage unit 5c, a matching expression character string is recognized, and the recognized passive expression unit is displayed on the character string text, and includes a plurality of sentences. Calculate the percentage of passive sentences in the paragraph,
It is determined whether the content exceeds the allowable reference value.

FIG. 20 is a hardware configuration diagram of a Japanese word processor with a passive expression detection function according to a third embodiment of the present invention, and FIG. 21 is a key arrangement diagram of the keyboard 7. 3 and 4 described in the first embodiment are that the storage device 11 has a passive expression storage unit 5c and that the key group 71 has a passive expression detection instruction key 713. Is included.

When the word processor 1 receives the passive expression detection instruction key 713 while waiting for a key input from the keyboard 7, as shown in FIG. 1, the passive expression detection function block 4c
Is started to detect a passive expression by referring to the passive expression storage unit 5c (steps 101 to 103). On the other hand, when a key other than the above is received, the word processor processing function block group 2 is activated as described above. Then, the process of the content indicated by the received key is performed (step 104), and any one of the above processes is repeatedly executed until the entire process such as document creation is completed (step 105).

The details of the processing performed by the passive expression detection function block 4c in step 103 will be described below with reference to FIGS. 22 to 27.

When activated by the word processor 1, the passive expression detection function block 4c firstly receives a single sentence counter S for counting the number of simple sentences constituting the paragraph, the number of simple sentences including the passive expression, as shown in FIG. Is cleared to "0" (steps 41c and 42c). Then, the character string text in the character string text storage unit 3 and each character string in the passive expression storage unit 5c are compared and collated in order from the beginning of the character string text to the end of the paragraph by the method described later, and The included passive expression part is recognized (steps 43c and 44c) (hereinafter, referred to as a passive expression recognition processing module 43c), and the content of the passive expression sentence in the paragraph is evaluated by a method described later (step 45c). (Hereinafter, referred to as a paragraph evaluation processing module 45c), the above operation is repeatedly executed for all the character string texts in the character string text storage unit 3, and the processing of the present functional block 4c ends (step 46).
c).

When the control is passed, the certification processing module 43c
As shown in the figure, first, "1" is added to the single sentence number counter S (step 4301), and a relative position counter C for indicating the relative position of the character in the character string text, for indicating that the passive expression has. and each "0" clears the passive expression containing the flag F ₁ (step 4302,4303), when the value of the relative position counter C has not yet indicated the end of the sentence, since the position indicated by the value of the relative position counter C string text Is determined to match with any of the passive expression strings, and if there is a matching passive expression string, it matches and matches the relative position counter C in order to align the next character string matching position. The length of the passive expression character string is added, and display information indicating that the passive expression has in the character string text is set in a predetermined area for display on the display device 8 (steps 4304 to 4304).
4308).

The passive expression character string to be compared and collated with the character at the position indicated by the relative position counter C is a table composed of each character string and the length of the character string as shown in FIG. In other words, passive expressions in Japanese sentences are generally represented by affixes of the auxiliary verbs "re" and "re" of "passive" to the verbs, and these character strings are registered in a table. The length of those character strings is 2-3.

Further, for example, when the character string text has the content shown in FIG. 26, “rema” and “re” of the passive expression character strings are recognized in the first and third lines by the above-described determination operation.

Then, check the passive expression containing the flag F _1, is set to "1" indicating that it has the passive representation when it is "0",
"1" is added to the passive expression containing sentence counter U (steps 4309 to 4311). On the other hand, if there is no passive expression character string that matches the character string of the character string text after the position indicated by the relative position counter C, “1” is added to the relative position counter C (step 4306), and The processing is repeatedly executed until the value of the position counter C reaches the end of the sentence, and the processing of this processing module 43c is completed. Although not shown, before the end, for example, “rema” and “re” of the passive expression character strings recognized in the character string text of FIG. 26 are displayed on the display device 8 as shown in FIG. indicate.

When the control is passed, the paragraph evaluation processing module 45c divides the value of the passive expression containing sentence counter U by the value of the single sentence counter S and multiplies by 100, as shown in FIG. The ratio R (%) is calculated and held in a predetermined area (step 4501), and the passive expression containing sentence ratio R
When the value of exceeds the preset allowable reference value,
The display information indicating that the data has been exceeded to be displayed on the display device 8 is set in a predetermined area, and the processing of the processing module 45c ends (steps 4502 and 4503).

In this way, we focus on the fact that passive expressions in Japanese sentences are expressed by attaching an auxiliary verb character string of “passive” to a verb, registering those auxiliary verb character strings in a table, and referring to the table, The passive expression part in the character string text is determined, and it is displayed in an easily understandable manner as shown in FIG. 27, for example, and the content of comparison with a predetermined allowable reference value can also be displayed. In this embodiment,
The allowable reference value for the paragraph evaluation processing module 45c to compare with the passive expression containing sentence ratio R (%) is set when the user activates the entire Japanese word processing function, and is set according to the purpose of the document. It is possible to change the range of the allowable content.

To activate the passive expression detection function block 4c, in addition to the passive expression detection instruction key 713, for example, a key for instructing word processing such as a key for instructing the end of a paragraph, a key for instructing a page break, and a kana-kanji conversion In the type Japanese input, the process may be started by pressing a key for instructing conversion from a kana character string to a kanji kana spell, and the processing of the passive expression detection function block 4c may be executed in synchronization with the processing.

Regarding the unit of the paragraph, similar to the first embodiment described above, the character string text composed of a fixed number of sentences is regarded as one paragraph unit without being limited to the break of the semantic content in the character string text. The page unit can be regarded as one paragraph unit, or the entire character string text can be regarded as one paragraph unit.

Since the paragraph evaluation processing module 45c is not essential, it can be omitted.

Next, common effects in the first, second, and third embodiments described above will be described.

At the time of comparing and comparing each expression character string such as sentence end, negation, and passive with the character string text, if the character string text is, for example, a character such as a kanji or a number, the collation does not clearly match. Steps 4403 and (FIG. 15) for determining the character type of
Provided at the preceding stage of each of step 403 and step 4304 (of FIG. 23), when the character type is different, immediately add "1" to the relative position counter C, perform the next character string collation, and reduce the processing time of this functional block. Can be shortened.

Correction of inappropriate expressions in the sentence end, negation, and passive expressions contained in the character string text can be left to the conventional Japanese word processing function. Can do well.

As a method for displaying the character string text and each sentence end, negation, and passive expression portion contained in the display device 8,
By using the display processing function installed in the conventional Japanese word processor, it is displayed by, for example, changing the brightness on the screen or inverting the display as shown in FIGS. 11, 18, and 27. It is also possible. When the display function is small, for example, a display method is also conceivable in which a normal sentence end form and a polite sentence end form are not distinguished from each other and are distinguished from other character string portions.

Although the sentence end form discrimination function, the double negative expression detection function, and the passive expression detection function are all installed in Japanese word processing, only one or two functions may be installed.

〔The invention's effect〕

As described above, according to the present invention, the character string text of the document and the pre-registered normal sentence end form, polite sentence end form,
By comparing and comparing each expression string of negative expression and passive expression,
Identify matching expressions in string text,
Normally, the sentence form and polite character form are mixed, the negative expressions at two or more places, and the passive expressions that are more than allowable are determined and displayed on the display device. In addition, the work efficiency of text creation is improved.

[Brief description of the drawings]

FIG. 1 is a processing flowchart showing an embodiment of the Japanese word processing system according to the present invention, and FIGS.
Fig. 19 and Fig. 19 are the functional configuration diagrams of Japanese word processing with sentence end form discrimination function, double negative expression detection function, and passive expression detection function, respectively. Figs. 3, 13, and 20 show the sentence end form, respectively. Hardware structure of Japanese word processing with discrimination function, double negative expression detection function, passive expression detection function, FIGS. 4, 14 and 21 show keyboard 7
FIG. 5 is a processing flowchart of a sentence end form discrimination function block, FIG. 6 is a processing flowchart of a sentence end expression recognition processing module, FIGS. 7 and 24 are processing flowcharts of a paragraph evaluation module, and FIG. Table table of normal sentence end form character strings, FIG. 9 is a table table of polite sentence end form character strings, FIGS. 10 and 11 are diagrams for explaining the operation of the sentence end form discrimination function block, and FIG. FIG. 16 is a processing table of a negative expression detecting function block, FIG. 16 is a table of negative expression character strings, FIGS. 17 and 18 are diagrams for explaining the operation of the double negative expression detecting function block, FIG.
The figure is a processing flowchart of the passive expression detection function block,
FIG. 23 is a processing flowchart of the passive expression recognition processing module, FIG. 25 is a table of passive expression character strings, FIG.
FIG. 27 is a diagram for explaining the operation of the passive expression detection function block. 1: word processing processing control function block (word processor), 2: word processing processing block group, 3: character string text storage unit, 4a: sentence end form discrimination function block, 4b: double negative expression detection function block, 4c: passive Expression detection function block, 5a: sentence end expression storage unit, 5b: negative expression storage unit, 5c: passive expression storage unit, 6: processor, 7: input device (keyboard), 8: display device, 9: program storage unit, 10 : Work area, 11: storage device, 71, 72: key group, 711: sentence end form discrimination instruction key, 712: double negative expression detection instruction key, 713: passive expression detection instruction key.

Continuation of the front page (56) References JP-A-59-127140 (JP, A) JP-A-60-254367 (JP, A) Proceedings of the 29th Annual Conference of IPSJ p. 1403-1404 G. E. FIG. Heidorn The E PISTLE text-critical System @IBM SYS STEM JOURNAL, Vol. 3 (1982)

Claims (1)

(57) [Claims] In a word processor for creating a document, a table of a sentence end form character string in a normal wording form and a polite wording form, a table of a negative expression character string for making a sentence a negative form,
And a storage unit for storing a table of passive expression strings that make the sentence passive, a character string text of the created document, and a sentence end form character table, a negative expression string table, and a passive expression string table. The character strings are extracted and compared by using a relative position counter indicating the relative position of the sentence and a flag indicating immediately after the end of sentence expression recognition, and at least one predetermined expression exists in the same sentence as to the sentence end form. or not,
For negative expressions, determine whether there are at least two places in the same sentence, and for passive expressions, determine whether they are more than a certain value in the same paragraph, and display the determined expression as the expression in the document And a document file for storing a character string text to be determined.