JPH0630103B2 - Character processor - Google Patents

Description

The present invention relates to a character processing device having a specially configured dictionary for creating and editing Japanese documents and the like.

[Prior Art] Conventionally, in a character processing device such as a word processor, there is a dictionary memory that stores, as a configuration of a kanji character, a common kanji character or a kanji character other than a common kanji character. There was no one that remembered the level information indicating how difficult the kanji in the kanji were. For this reason, when a teacher of an elementary school creates a document to be distributed to all grades, it is not possible to select a kanji corresponding to each grade and create a document. I had to create a dictionary.

[Problems to be Solved by the Invention] Therefore, in the above-described conventional example, there is the following drawback because a dedicated dictionary must be created in order to have the kanji level information.

(1) A memory for storing a dedicated dictionary having the level information of the kanji is required.

(2) The processing speed becomes slower because the search must be performed separately from other dictionary searches.

[Means (and Action) for Solving the Problems] According to the present invention, the character processing device has a document storage unit for storing a document and a proofreading process in which a character is the head in a predetermined length index for each character. A pointer to a character string group to be stored and the difficulty level of the character are stored, and dictionary means storing the character string group to be proofread at the position pointed to by the pointer, and a document stored in the document storage means On the other hand, the level designating means for designating the difficulty level to be pointed out, and each character in the document stored in the document storage means as a character at the search position, and referring to the index of the dictionary means for the character, A pointer to a character string group to be proofread having the character as a head and a first search means for obtaining the difficulty level of the character, and the difficulty level obtained by the first search means is designated by the level designating means. A first detection means for detecting a character at the search position and a character string starting from the search position in the document stored in the document storage means when the first search is performed. By providing a second detecting means for determining whether the character string in the character string group pointed to by the pointer obtained by the means matches, and detecting the matching character string in the document when the character strings match, The difficulty level of a character can be stored without increasing the memory, and with the process of searching for a character string to be proofread in a document, it is possible to point out characters of a specified difficulty level or higher at high speed. is there.

EXAMPLES The present invention will be described in detail below with reference to the drawings.

FIG. 1 is a block diagram of a character processing device having a dictionary according to the present invention.

In the configuration shown in the figure, reference numeral 1 is a microprocessor CPU, which performs arithmetic operations for character processing, logical judgments, etc.
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, 2 is a read-only fixed memory ROM, which is a pattern matching dictionary PMD described later with reference to FIGS. 2 to 4.
The IC 2a and the control means by the microprocessor CPU 1 shown in FIG. 8 to FIG. 10 which will be described later are stored.

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. The TBUF 3a is a text buffer, and is an area for storing document data created and edited as described later in FIG. DBBU
F3b is an area for storing search results. KBBUF
Reference numeral 3c is a keyboard buffer for storing the input key data.

Reference numeral 4 is a keyboard KB for instructing various functions for the character processing apparatus such as alphabet keys, hiragana keys, katakana keys and other character symbol input keys, and cursor movement keys, calibration pointing keys, setting end keys and the like. Equipped with various function keys.

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

Reference numeral 6 is a cursor register CR. The CPU 1 can read and write the contents of the cursor register CR. A CRT controller CRTC8, which will be described later, displays a cursor at a position on the display device CRT9 corresponding to the address stored here.

A display buffer memory CBUF 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.

8 is a cursor register CR6 and a buffer TBUF3a
The CRT controller CRTC has a role of displaying the contents stored in the display CRT9.

A display device CRT 9 using a cathode ray tube or the like controls the display pattern of the dot configuration and the display of the cursor on the display device CRT 9 with the CRTC 8. Further, 10 is a character generator CG for storing patterns of characters and symbols to be 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 CPU 1 reads out various control signals stored in the ROM 2 and various controls are performed in accordance with these control signals.

FIG. 2 is a diagram showing the overall structure of the dictionary according to the present invention.

This dictionary is provided in the ROM 2 as described above.

The proofreading pattern matching dictionary PMDIC will be described below.

This dictionary is composed of two main parts 2a ₁ storing a pattern for performing pattern matching and an index part 2a ₂ storing a pointer to a pattern starting with the same character.

FIG. 3 is a detailed diagram of the index section 2a ₂ of the dictionary.

The start address to the pattern group starting with each JIS X 0208 code is stored in code order.

FIG. 4 is a diagram showing the structure of each pointer of the dictionary index section 2a ₂ . Each pointer consists of 3 bytes. If the main body 2a ₁ has a capacity of ₁ MB (megabits), it is enough for practical use.
Since 20 bits are sufficient for the pointer to the main body 2a ₁ , the remaining 4 bits are assigned as the level information of Kanji.

These 4 bits represent characters other than Kanji, Kanji learned from elementary school 1 to 6th grade, common Kanji learned outside of elementary school, Kanji other than common Kanji, and 9 levels of Kanji level information. (4 bits can represent up to 16 levels of Chinese character level information.) FIG. 5 is a diagram showing a display screen configuration of the display device CRT9. In the figure, 9a means a display screen. CM is a cursor, and indicates the position where the character enters when the next key input is made. The contents of the document stored in the text buffer TBUF3a are displayed on the display screen 9a. For example, the text buffer TBUF3
If "machine", "product", and "cabinet" are entered in a, it will be displayed as shown in the figure. When the composition pointing key is pressed in the state of FIG. 5, a kanji level setting screen as shown in FIG. 6 is displayed. By moving the cursor up and down, the square at the beginning of the sentence is reversed, and 8 levels can be set. For example, to search for kanji that you have learned in elementary school 4 years or older, use the cursor movement as shown
Make sure that the square at the beginning of the kanji that you have learned over the years is reversed. When the setting end key is pressed here, the kanji level in which the square at the beginning of the sentence is reversed is set and the dictionary is searched.

FIG. 7 shows the results. “Machine” is the level information of the kanji and indicates 4, which is the kanji learned in the fourth grade of elementary school.
Therefore, the display form is changed because it applies to the set kanji learned in the fourth grade of elementary school. The display form is also changed for "machine" because it is 4 for the level information of Kanji. “Made” is a kanji level information of 6, so the display form is changed. “Goods” is the level information of the kanji and indicates 3, that is, the kanji learned in the third grade of elementary school. Therefore, the display form does not change because it does not apply to the set Kanji learned in the fourth grade of elementary school. The display form is not changed because "inside" does not meet the set conditions similarly to "item". The display form of "Kaku" is changed because it applies to the same conditions as "Production".

The operation of the above embodiment will be described with reference to the flowcharts shown in FIG.

FIG. 8 is a flow chart of a part for receiving a key input and performing a process.

Step 8-1 is a process for fetching data from the keyboard into the input buffer KBBUF3c. Below, KBB
Depending on the type of key existing in the UF 3c, the process branches as follows. If the head of the KBBUF3c is a calibration indication, the calibration indication must be issued and the process branches to step 8-2. If not, normal editing processing is performed, so the process branches to step 8-3 to perform other processing.

In step 8-2, as described in detail in FIG. 9, it is searched and displayed whether or not the kanji existing on the document is the set kanji level or higher.

FIG. 9 is a flowchart showing in detail the indication of the Chinese character level of the proofreading indication in step 8-2.

In step 9-1, the kanji level to be pointed out is set. The input screen is as shown in FIG. By pressing the selection end key, the process proceeds to step 9-2. In step 9-2, the proofreading pattern matching dictionary is searched. A kanji level search is also performed here.

Next, in step 9-3, the kanji-level search result is displayed. The result is shown in FIG.

FIG. 10 is a detailed flowchart of the "PMDIC search" in step 9-2.

In step 10-1, the text buffer TBUF
Import the character code of 3a (JIS X 0208 code).

At step 10-2, the index address of the dictionary corresponding to the code is calculated from the fetched character code.

In step 10-3, the pointer to the main body 2a ₁ and the upper 4 bits of the pointer are fetched as the level information of the Chinese character.

At step 10-4, the level of the set kanji is compared with the level information of the kanji fetched at step 10-3. If it is larger than the set value, the process branches to step 10-5. Otherwise, it branches to step 10-6.

In step 10-5, the level information of the kanji imported in step 10-3 and the TBUF3a of the imported characters
The upper address and the like are stored in the DBBUF 3b.

In step 10-6, pattern matching is performed based on the pointer to the main body 2a ₁ fetched in step 10-3.

In step 10-7, it is compared in step 10-8 whether the pattern matches the pattern in the dictionary. If they match, the process branches to step 10-8. Otherwise step 10
Branch to -9.

In step 10-8, the information of the pattern matched in step 10-6, the address of the character fetched on the TBUF 3a, etc. are stored in the DBBUF 3b.

In step 10-9, the text buffer TBUF
The character code next to 3a is fetched.

In step 10-10, the text buffer TBU
The final address of F3a and the address of the character fetched in step 10-9 are compared for equality. If they are equal, it ends. Otherwise, it branches to step 10-2.

[Effect of the Invention] As described above, according to the present invention, the difficulty level of a character is stored in the index of the dictionary together with the pointer to the character string to be proofread which has the character at the head, so that the memory is increased. There is an effect that the difficulty level of a character can be stored without causing it.

In addition, the difficulty level of each character can be obtained along with the process of referencing the index of the dictionary to search the character string to be proofread from the document, so that characters of the specified difficulty level or higher can be pointed out at high speed. There is an effect.

[Brief description of drawings]

1 is a block diagram of the overall configuration of a character processing device according to the present invention, FIG. 2 is an overall configuration diagram of a dictionary according to the present invention, FIG. 3 is a configuration diagram of an index of the present invention, and FIG. 5 is a block diagram of a display screen of a display device CRT of a character processing device according to the present invention. FIG. 6 is a diagram of a kanji level setting screen of a character processing device according to the present invention. Is a result output diagram of the character processing device according to the present invention, FIG. 8 is a flowchart illustrating the operation of the character processing device according to the present invention, FIG. 9 is a flowchart illustrating the operation of the character processing device according to the present invention, FIG. 10 is a flowchart illustrating the operation of the character processing device according to the present invention. 1 ... Microprocessor CPU, 2 ... Read-only memory ROM, 3 ... Random access memory RAM, 2a ... Pattern matching dictionary PMDIC, 3a ... Text buffer TBUF, 3b ... Search result storage buffer DBBUF, 3c ... Keyboard buffer KBBUF, 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-A-63-100568 (JP, A) JP-A-61-262882 (JP, A) JP-A-60-225273 (JP, A) JP-A-62- 260266 (JP, A)

Claims (1)

[Claims] 1. A document storage means for storing a document, and a pointer to a character string group to be proofreading starting from the character and a difficulty level of the character are stored in an index of a predetermined length for each character. A dictionary means for storing the character string group to be proofread at a position pointed to by the pointer; a level specifying means for specifying a difficulty level to be pointed out for the document stored in the document storage means; Using each character in the document stored in the storage means as a character at the search position, the index of the dictionary means for the character is referred to, and a pointer to the character string group to be calibrated starting from the character and the character A first search means for obtaining a difficulty level, and a difficulty level obtained by the first search means being equal to or higher than the difficulty level designated by the level designation means,
First detection means for detecting a character at the search position, and a character string having the search position in the document stored in the document storage means as a head, a character string pointed to by the pointer obtained by the first search means. A character processing device comprising: a second detection unit that determines whether or not a character string in a group matches and detects a matching character string in the document when the character strings match.