JPH0628064B2 - Character processor - Google Patents

Description

TECHNICAL FIELD The present invention relates to a character processing device having a function of extracting a character string satisfying a certain condition from a document.

[Prior Art] In a character processing device such as a Japanese word processor for processing Japanese sentences, as a means for extracting a character string satisfying a certain condition from a document, "pattern matching" in which a character string to be extracted is stored. There is a method of preparing a “dictionary”, matching the character string in the document with the character string in the pattern matching dictionary, and extracting the matched character string.

For example, in the proofreading process, the ambiguous "target"
If you want to point out the character string, you can point out "target" such as "qualitative" or "conventional" by registering "target" in the pattern matching dictionary.

[Problems to be solved by the invention] However, since morphological analysis, syntactic analysis, etc. are not performed by simply matching with this method,
In some cases, a character string used in a different meaning from the character string in the pattern matching dictionary may be matched.

For example, in the previous example of proofreading processing, if you want to point out the "target" of a vague expression, "qualitative""purpose" and "target" that are not ambiguous with "qualitative""conventional" There was a drawback that "target" such as "is pointed out.

[Means (and Action) for Solving the Problem] According to the present invention, the character processing device includes a document storage unit that stores a document, a dictionary unit that stores a character string to be detected from the document, and the dictionary. The search means for searching the document stored in the document storage means for a character string that matches the character string stored in the means, and the character string to be detected stored in the dictionary means are detected in the document. The constraint condition storage means for storing constraint conditions that should be satisfied or not satisfied by the character strings before and after the power string, and the document strings before and after the character string retrieved from the document by the retrieval means are searched. A determination unit that determines whether or not the character string is suitable as a character string before and after the character string is to be detected based on the constraint condition stored in the constraint condition storage unit, and is searched by the search unit. Sentence A character string that is determined by the judging means to be suitable for the character strings before and after the character string is provided with display control means for distinguishing the character string from other character strings in the document. Not only does the string itself match the character string to be detected, but the character strings before and after it are also detected based on the constraint conditions and are detected and displayed.

Embodiments Embodiments of the present invention will be described in detail below with reference to the drawings.

FIG. 1 is a block diagram showing the overall configuration of a character processing device according to an embodiment of the present invention.

In the configuration shown, 1 is a microprocessor CPU
The address bus AB, the control bus CB, and the data bus D are used to perform calculations and logical judgments for character processing.
Via B, each component connected to those buses is controlled.

The address bus AB transfers an address signal indicating a component to be controlled by the microprocessor CPU1. Control bus CB is a microprocessor CPU
The control signals of the respective constituent elements to be controlled by No. 1 are transferred and applied. The data bus DB transfers data between the constituent devices.

Next, reference numeral 2 denotes a read-only fixed memory ROM, which is a microprocessor CPU described later with reference to FIGS.
1, the pattern matching dictionary KSPMD2a, the word dictionary WD2b, the grammar dictionary GD2c
Store fixed data such as.

Reference numeral 3 is a writable random access memory RAM having a structure of 1 word and 16 bits, and is used for temporary storage of various data from each constituent element. A text buffer TBUF 3a is an area for storing document data to be created and edited.

Reference numeral 4 denotes a keyboard KB for inputting character symbols such as alphabet keys, hiragana keys, katakana keys, etc., and this character processing device such as cursor movement keys, kana-kanji conversion keys, proofreading pointing keys, pointing item selecting keys, etc. It is equipped with various function keys for instructing various functions.

5 is an external storage device DISK for storing document data
The document data created in the text buffer TBUF3a is stored, and the stored document data is called when necessary by the instruction of the keyboard KB4.

Reference numeral 6 is a cursor register CR. The CPU 1 can read and write the contents of the cursor register CR6.

A display buffer memory DBUF 7 stores a pattern of data to be displayed. When displaying the contents of the document data, the pattern is developed on the DBUF 7 based on the data on the text buffer TBUF 3a.

Reference numeral 8 is a CR which plays a role of displaying the contents stored in the cursor register CR and the buffer DBUF on the display CRT9.
It is a T controller CRTC.

Further, reference numeral 9 is a display device CRT using a cathode ray tube or the like, and the display pattern of the dot configuration and the display of the cursor on the display device CRT 9 are controlled by the CRT controller 8.

Further, 10 is a character generator CG,
It stores a pattern of characters and symbols displayed on the display device CRT9.

The character processing device of the present invention comprising the above-described components operates in response to various inputs from the keyboard KB4. When an input from the keyboard KB4 is supplied, first, an interrupt signal is sent to the microprocessor CPU1. The microprocessor CPU1 reads out various control signals stored in the ROM2, and various controls are performed in accordance with these control signals.

FIG. 2 is an example of a screen display of the CRT display device 9 in the present invention. In the figure, 9a means a display screen. The contents of the document data stored in the text buffer TBUF3a are displayed on the display screen 9a.

As shown in FIG. 2 (a), for the document "qualitative""conventional""correct""purpose""shoot at target" on the display screen 9a,
When the operator inputs the proofreading pointing key, the pointing item selection menu 9b is displayed in a window on the display screen 9a.

When you point out an ambiguous expression with the pointing item selection key and enter it, the pointing item "Ambiguous expression" 9c is displayed in a window as shown in FIG. The "target" of "conventional" is pointed out as a vague expression, but the "target" of "appropriate", "purpose" and "shooting" is not pointed out. Here, the indicated point is underlined.

FIG. 3 shows the pattern matching dictionary K in the present invention.
It is an example of a structure of SPMD2a.

Character string data to be matched is stored in the “heading”.

The type of the constraint condition is stored in the “constraint condition”, and each processing is performed according to this. If the "constraint condition" is not stored, it is considered that there is no constraint condition. The details of the constraint condition are stored in the “constraint condition parameter”. If there is no constraint condition, "Constraint condition parameter"
Is not remembered.

For example, in the heading "Target", the constraint condition is "1" and the constraint condition parameter is "(target) accurate".
They are “(target) middle”, “[sentence] (target)”, “eye (target)” and “shoot (target)”. Here, the [text beginning] means not the character itself but the type of the character, and is the “character representing the beginning of the text”. The constraint condition “1” is “assuming that the matching can be achieved only when the character string data before and after the character string data in the matched document data does not match the character string data described in the constraint condition parameter”. Means

FIG. 4 is a flow chart showing the proofreading process of the character processing device according to the present invention.

When the operator inputs the proofreading pointing key in step 4-1, "pointing item menu" is displayed in step 4-2.
Is displayed on the display screen of the display device 9.

Next, in step 4-3, the operator inputs the indicated item selection key.

In step 4-4, the character string data in the document data is matched with the character string data in the pattern matching dictionary, and if there is a match, before and after the character string data in the matched document data. It is determined whether or not the character string data of is satisfying the constraint condition. Matching is possible if matching is possible and the constraint conditions are satisfied, or if matching is possible and there is no constraint condition, and matching is not possible, or if matching is successful but the constraint conditions are not satisfied. If you can't get it, step 4
Go to -5. Details of the pattern matching in step 4-5 are shown in FIG.

If matching is found in step 4-5, the process branches to step 4-6. If no match is found, the process branches to step 4-7.

In step 4-5, the character string data in the displayed document data is pointed out by underlining or the like.
In step 4-6, nothing is done on the character string data in the document data and no indication is made.

FIG. 5 is a flow chart showing details of step 4-4 shown in FIG.

In step 5-1, the pointed item is discriminated and the process proceeds to step 5-2.

In step 5-2, it is determined whether or not the character string data in the document data and the character string data in the pattern matching dictionary have been matched, and then in step 5-
Go to 3.

If matching is found in step 5-3, the process branches to step 5-4. If no match is found, the process branches to step 5-7.

In step 5-4, it is determined whether or not the character string data before and after the character string data of the matched document data satisfies the constraint condition described in the pattern matching dictionary, and the process proceeds to step 5-5. move on. Step 5
Details of the determination as to whether or not the constraint condition of -5 is satisfied are shown in FIG.

If the constraint condition is satisfied in step 5-5, the process branches to step 5-6. If the constraint condition is not satisfied, the process branches to step 5-7, and it is assumed that the matching is obtained in step 5-6. If the constraint condition is not satisfied, it is assumed that no matching is obtained in step 5-7.

FIG. 6 is a flow chart showing details of step 5-4 in FIG.

In step 6-1, it is determined whether or not the constraint condition is stored, and the process proceeds to step 6-2.

If the constraint condition is stored in step 6-2, the process branches to step 6-3. If the constraint condition is not stored, the process branches to step 6-6.

In step 6-3, the type of constraint condition is determined, and the process proceeds to step 6-4.

In step 6-4, it is determined whether or not the character string data before and after the character string data in the matched document data satisfies the condition stored in the constraint condition parameter based on the type of constraint condition. Go to 6-5.

If the conditions are satisfied in step 6-5, the process branches to step 6-6. If the condition is not satisfied, the process branches to step 6-7.

In step 6-6, the constraint condition is satisfied, and in step 6-7, the constraint condition is not satisfied.

[Other Embodiments] In the above description, as the configuration of the pattern matching dictionary, the case of the constraint condition “1” has been described, but the case of other constraint conditions will be described below.

FIG. 7 shows an example of the structure of the pattern matching dictionary in this case.

The constraint condition “2” is “the matching is successful only when the character strings before and after the character string in the matched document match the character string stored in the constraint parameter”.
Means that. [Numerical words] represent the type of character, and are numbers and Chinese numerals.

For example, "warikata" such as "10% way" and "20% way" can be matched, and "wari way" such as "western sake way of breaking" and "dividing method" cannot be matched.

In addition, it is possible to describe the inflectional form of a noun in the constraint condition parameter.

The constraint condition “3” means that “a match is found only when the character string following the character string in the matched document matches the inflectional inflection ending stored in the constraint parameter”. To do.

For example, it can be matched with "reading" such as "read" and "read", but cannot be matched with "reading" such as "reading" and "reading".

It is also possible to describe the constraint condition parameter together with the character string and the inflectional form of the noun.

The constraint condition "4" is "the character string before and after the character string in the matched document does not match the character string described in the constraint parameter, and after the character string in the matched document It is assumed that the matching is obtained only when the following character string matches the inflectional ending of the inflectional form described in the constraint parameter. ” [Kanji] represents the type of character.

For example, a “writing” such as “writing a letter” can be matched, and a “writing” such as “writing”, “book”, or “reading” cannot be matched.

[Effects of the Invention] As described above, according to the present invention, when not only the character string itself matches the character string to be detected, but also the character strings before and after are appropriate based on the constraint condition, Since it is detected for the first time, false detections are reduced,
This has the effect of improving the accuracy of character string detection.

[Brief description of drawings]

FIG. 1 is a block diagram showing an overall configuration of a character processing device according to the present invention, FIGS. 2 (a) and 2 (b) are diagrams showing an example of a screen display of the present invention, and FIG. 3 is a pattern matching. The figure which shows an example of a structure of a dictionary, FIG. 4 is a flow chart which shows the proofreading | inclination process of this invention, FIG. 5 is the flowchart which shows the detail of step 4-4 in FIG. 4, FIG. FIG. 5 is a flowchart showing details of step 5-4, and FIG. 7 is a diagram showing an example of the configuration of the pattern matching dictionary. 1 ... CPU, 2 ... ROM, 3 ... RAM, 4 ... Keyboard KB, 5 ... External storage device DISK, 6 ... Cursor register CR, 7 ... Display buffer memory DBUF, 8 ... CRT controller CRTC, 9 ... Display device CRT, 10 ... Character generator CG.

 ─────────────────────────────────────────────────── ─── Continuation of the front page (56) References JP 62-282364 (JP, A) JP 63-234348 (JP, A) JP 63-27928 (JP, A) Richard Stallman, Takeuchi Translated by Ikuo and Ryoji Amami, “GNU E macs Manual” (bit 1988 issue, separate volume), S63.2.2.15, published by Kyoritsu Publishing Co., Ltd. 55-63

Claims (3)

[Claims] 1. A document storage unit for storing a document, a dictionary unit for storing a character string to be detected in the document, and a character string matching the character string stored in the dictionary unit, stored in the document storage unit. With respect to the search means for searching from the document that has been searched, and the character string to be detected stored in the dictionary means,
Constraint condition storage means for storing constraint conditions that the character strings before and after the character string to be detected in the document should or should not be satisfied, and the character strings before and after the character string retrieved from the document by the retrieval means A determining unit that determines whether or not the searched character string is suitable as a character string before and after the character string to be detected is based on the constraint condition stored in the constraint condition storage unit; And a display control unit for displaying the character strings, which are determined by the determination unit, as the character strings before and after the character string searched by the search unit, to be distinguished from other character strings in the document. A character processing device characterized in that 2. The constraint condition storage means stores the notation of a character string in which the character strings before and after the character string to be detected should or should not match. Character processor. 3. The constraint condition storage means stores a grammatical attribute of a character string that should or should not satisfy a character string before and after the character string to be detected. Character processing device described.