JPH04191966A - Character processor - Google Patents

Abstract

PURPOSE:To create a document easy to read at the level of reader's vocabulary by using the difficulty of the usage of the designated character string as the reference of the decision. CONSTITUTION:The character string stored in a character string paraphrastic difficulty dictionary 102 is detected by a character string interpretation means 103 from among documents stored by a document storage means 101, and the usage of the character string before and after the context is obtained as a paraphrastic character string. Further, when the difficulty of this paraphrastic character string is more difficult than the specified difficulty, the character string is indicated by a character string indication means 104. Thus the only difficult character string in difficult usage can be indicated.

Description

[Detailed Description of the Invention] [Field of Industrial Application] The present invention relates to a character processing device for processing documents, and particularly to a character processing device equipped with a proofreading support system that points out difficult character strings in a document. be.

[Conventional technology]

Conventionally, as a character processing device that has the function of pointing out difficult character strings in a document in order to create an easy-to-understand document, the difficulty level of a certain character string is defined as the difficulty level when a certain character string is used in the simplest way. There was a character processing device equipped with a proofreading support system that had the ability to point out difficult character strings regardless of how they were used.

An example of a function that points out difficult characters is a function that points out kanji other than common kanji that exist in a document as difficult kanji.

[Problem that the invention is trying to solve]

However, in conventional character processing devices, the difficulty level of a character string is defined as the difficulty level when the character string is used in the simplest way, and the Because it points out character strings, if a string that has an easy usage is used in a difficult way, it cannot be pointed out as a character string that is used in a difficult way. Therefore, functions that help readers create easy-to-understand sentences that match their language ability include:
The problem was that it did not fully achieve its purpose and did not have high performance for pointing out difficult character strings.

For example, when using the conventional function of pointing out kanji other than commonly used kanji, the
Even though ``school'' (Aze) is not recognized as an onkun in the common character writing table, ``school'' itself is a commonly used kanji, so it is not pointed out as a difficult kanji.

SUMMARY OF THE INVENTION An object of the present invention is to solve the above-mentioned problems and provide a character processing device that can accurately point out difficult character strings in a document.

[Means to solve the problem]

In order to achieve such an object, the present invention includes a document storage means for storing an input document, a first character string, a plurality of second character strings that are paraphrased from the first character string, a second character string paraphrase difficulty level dictionary that stores the difficulty level of each character string; and a first character string paraphrase difficulty level dictionary that stores the difficulty level of each character string that appears in the document stored in the document storage means.
A character string interpretation means that interprets the character string and detects a second character string that can be paraphrased by judging from the surrounding context, and a difficulty level of the second character string detected by the character string interpretation means is specified. character string pointing means for pointing out in the document a first character string having a difficulty level higher than the first character string.

[For production]

According to the present invention, character strings are pointed out based on the difficulty level of how they are used, so only difficult character strings that are used in difficult ways can be pointed out.

That is, the character string interpretation means detects a character string stored in the character string paraphrase difficulty level dictionary from among the documents stored in the document storage means, and determines how the character string is used in the context before and after it. Find the string as a paraphrasable string. Furthermore, when the difficulty level of this paraphraseable character string is more difficult than a specific difficulty level, the character string can be pointed out by the character string pointing means.

[Example] Hereinafter, the present invention will be described in detail with reference to the drawings.

As shown in FIG. 1, the character processing device according to the present invention includes a document storage means 101 that stores an input document, a first character string, and a plurality of second characters that are paraphrased from the first character string. A character string paraphrase difficulty level dictionary 102 that stores strings and difficulty levels of each second character string, and a character string paraphrase difficulty level dictionary 102 that stores string paraphrase difficulty levels that appear in the document stored in the document storage means 101. a character string interpreting means 103 that interprets a first character string that is being interpreted and detects a second character string that can be paraphrased by judging from the surrounding context;
The present invention is characterized by comprising a character string pointing means 104 which points out, in a document, a first character string whose difficulty level of the second character string detected by is higher than a specific difficulty level.

FIG. 2 shows an example of the overall configuration of an embodiment of the present invention. In the illustrated configuration, CPLI is a microprocessor that performs calculations and logical judgments for character processing, and handles address bus AB, control bus CB, and data bus D.
Each component connected to these buses is controlled via the bus B.

Address bus AB transfers address signals indicating the components to be controlled by the microprocessor CPU. The control bus CB transfers and applies control signals for each component to be controlled by the microprocessor CPU. The data bus DB transfers data between each component device.

ROM is a read-only fixed memory. The PA provided in the ROM is a program area in which control procedures etc. by the microprocessor CPU, which will be described later in FIGS. 8 to 12, are stored.

The RAM is a random access memory in which one word of 16 bits can be written, and is used for temporary storage of various data sent from each component.

The RAM is composed of a document buffer TBUF, a word dictionary DIC, a kanji learning level dictionary KLDIC, a memory KAIS, a memory LEVEL, a memory HANI, a flag GAKU, a 7-lag KOYU, a 7-lag KAYO, and a counter i.

The document buffer TBUF is a memory for storing document information input from the keyboard KB.

The word dictionary [11C is for analyzing the document stored in the document buffer TBUF and extracting clause information.

The Kanji learning level dictionary KLDIC stores Kanji characters and their learning levels in association with each other in order to point out Kanji characters at a specified learning level.

The memory KAIS stores an analysis result table created from clause information that is the result of analyzing the document stored in the document buffer TBUF.

The memory LEVEL is a memory that stores the learning level of the kanji to be pointed out.

The memory HAN r is a memory for instructing which learning level of Kanji is to be specified based on the learning level of the Kanji specified by the memory LEVEL.

The flag GAKU is a flag for instructing whether or not to point out a kanji when information indicating that the kanji to be pointed out has been learned has been given.

The flag KOYU is a flag for instructing whether or not to point out a kanji when the kanji to be pointed out is analyzed as part of a proper noun.

The flag KAYO is a flag for instructing whether the learning level of the kanji to be pointed out is determined by the kanji itself or by the reading of the kanji.

Counter i is a counter for taking out characters stored in document buffer TBUF one by one.

The keyboard KB includes various function keys such as alphabet keys, hiragana keys, katakana keys, and other character/symbol input keys, and cursor movement keys for instructing cursor movement. As a function key, it is 5ITE.

Equipped with KAKU, KEND, YOMI and GCHG.

5ITE is a kanji level pointing key for pointing out kanji of a specific learning level in a document.

KAKU is a kanji level confirmation key for confirming the level of the indicated kanji. KEND is a confirmation end key for returning the indicated kanji to its normal state after confirmation. YOMI is a reading replacement key for replacing the kanji being checked with its reading. GCHG is a learning switching key for switching the learning state of the kanji being checked.

The DISK is a memory for storing standard documents, and stores created documents, and the stored documents can be called up when necessary by instructions from the keyboard KB.

CR is a cursor register, and the contents of the cursor register CR can be read and written by the CPU. A CRT controller CRTC, which will be described later, displays a cursor at a position on the display device CRT corresponding to the address stored in the cursor register CR.

DBUP is a display buffer memory that stores patterns such as document information stored in the document buffer TBUF.

The CRT controller CRTC transfers the contents stored in the cursor register CR and buffer DBUP to the display CRT.
It is responsible for displaying on the screen.

A CRT is a display device using a cathode ray tube or the like, and a CRT controller CRTC controls the display of a dot configuration pattern and a cursor on the display device CRT.

CG is a character generator, and the display device CRT
It stores patterns of characters, symbols, etc. to be displayed on the screen.

The character processing device of this embodiment, which is comprised of these components, operates in response to various inputs from the keyboard KB. When the input from the keyboard KB is supplied, the interwoven signal is first sent to the microprocessor C.
is sent to the PU, and the microprocessor CPU is sent to the ROM
Various control signals stored therein are read out, and various controls are performed in accordance with these control signals.

FIG. 3 shows an example in which indication of a specific kanji level is executed in the character processing device of this embodiment.

FIG. 3(A) shows the state of the display device CRT in which a document to be pointed out at a specific kanji level is displayed. In FIG. 3(A), a indicates a cursor.

In the state shown in Fig. 3 (A), when the 5ITE key is input and the keys shown as S, C, D, e, and F are pressed manually, the displayed document is Of the kanji that have not been studied, kanji excluding kanji that have already been learned and kanji used in proper nouns are pointed out.

Based on this indication, the state of the microprocessor CRT is
The result is as shown in FIG. 3(B). In FIG. 3 CB), the shaded kanji as shown by the symbol g indicates that it is the kanji that has been pointed out. In the above operation,
Key 5ITE is a key for pointing out kanji at a specific level.

The key power indicated by the symbol is a key power that indicates the level of the kanji to be pointed out, and "5" indicates that the level of the kanji is the level of the kanji learned in the fifth grade of elementary school. The keys that can be input in b are the numeric keys from ``1'' to ``8''; other keys are ignored. rlJ to r
The number keys up to 5J each indicate the level of kanji learned by elementary school students to the level of kanji learned by sixth grade students. "7" indicates the level of commonly used kanji to be learned after junior high school, and "8" indicates the level of kanji other than commonly used kanji.

The key force indicated by the symbol C is the key force that indicates the range of the level of the kanji that should be pointed out, and is the key force that indicates the level range of the kanji that should be pointed out.
Keys can be entered; other keys are ignored.

The "0" key instructs to point out the kanji of the level indicated in b and the kanji of a more difficult level. The larger the number indicated in b is, the more difficult the level is. The "1" key instructs to point out only the kanji of the level indicated in b.

The key power indicated by the symbol d is the key power that indicates whether the level of the kanji indicated by b is the level of the kanji itself or the level of the reading of the kanji, and is "0".
key and "1" key are possible. The rQ4 key indicates that it is at the level of the kanji itself, and the "month key is
Indicates the reading level of the kanji.

The key human power indicated by code e points out the kanji to be pointed out, even if it is a learned kanji, using information on whether or not it is a learned kanji, which is set by the operator described later in Figure 4. This is the key human ability to instruct students whether to point out kanji or not to point out kanji if they have already been learned.

Here, only the "0" key and the rlJ key can be input, and manual input of other keys is ignored.

[The OJ key instructs to point out even kanji that have been learned, and the rlJ key instructs not to point out kanji that have been learned. For example, the kanji ``pressure'', which is indicated by a sign, is a kanji learned by fifth graders of elementary school, but it is not pointed out because information is set that it has already been learned.

The key power indicated by the symbol indicates the key power to indicate whether or not to point out the kanji when the kanji to be pointed out is used as a kanji in a proper noun word. "
Only the ``0'' key and the ``1'' key can be input, and manual input of other keys is ignored. The "0" key indicates to point it out even if it is used as a kanji for a proper noun word, and the "1" key indicates not to point it out even if it is used as a kanji for a proper noun word. Instruct.

For example, the kanji ``Mai'' is a kanji learned by sixth graders of elementary school, so it is pointed out in the place indicated by the code i, but it is pointed out in the place indicated by the code j because it is part of the proper noun ``Maizuru.'' It has not been.

FIG. 4 shows an example of an operation for checking the kanji level of a pointed out kanji in the character processing device of this embodiment.

FIG. 4(A) is a diagram of exactly the same state as shown in FIG. 3(B), and shows the state of the display device CRT in which a kanji of a particular level is pointed out.

When the KAKLI key is input in the state shown in Figure 4 (A), the position of the first pointed out kanji that exists behind the cursor position (toward the end of the sentence) as shown in Figure 4 (B). The cursor moves to , window 4B is displayed,
Displayed are the kanji pointed out in the window 4B, the level of the kanji, the reading of the kanji, the learning level of the reading, and information as to whether the kanji has been learned. The upper "level" in the window 4B represents the kanji level, and the lower "level" represents the reading level.

Furthermore, in the state shown in Figure 4 (8), when the KEND key is input, as shown in Figure 4 (C), window 4B disappears and the shading of the kanji at the cursor position disappears, indicating that it has not been pointed out. become a state.

Furthermore, when the YOMI key is input in the state shown in Figure 4 (B), window 4B disappears and the kanji at the cursor position is replaced with the kanji that was displayed in window 4B, as shown in Figure 4 (D). It is replaced by the reading. Replaced readings are not shaded.

Furthermore, when the GCHG key is input in the state shown in Figure 4(B), the learning status of the target kanji changes from "Not yet" to "Not yet" as shown in window 4B of Figure 4(E). information that the kanji ``machi'' is a learned kanji is set.

On the contrary, in the state shown in Fig. 4(E), GCHG
When the key is input, as shown in Figure 4 (B), the learning status of the target kanji changes from "completed" to "un", indicating that the kanji "machi" has not been learned. Information that it is a kanji is set.

FIG. 5 shows the structure of document buffer TBUF. Figure 5 (
A) shows the structure of the document when the indicated kanji does not exist. If the indicated kanji does not exist, the characters of the document are stored from the beginning of the document buffer TBUF in a 2-byte JIS code, and the end of the document is indicated by a 2-byte document end code.

FIG. 5(B) is a diagram showing the structure of the pointed out kanji in the document buffer TBUF. When a kanji character that was previously represented by 2 bytes per character is pointed out, that 2-byte data is replaced with data of indefinite length (indicated kanji) sandwiched between the indicated kanji start code and the indicated kanji end code. Inside the indicated kanji start code and indicated kanji end code, the character code of the indicated kanji expressed in JIS code of the first 2 bytes, 2 bytes of indicated information, and the reading of the indicated kanji are written in succession. is stored. The reading of the indicated kanji is stored as a JIS code of 2 bytes per character.

FIG. 5(C) is a diagram illustrating the structure of the indication information in FIG. 5(B). The pointing information stores information on the learning level (kanji level) of the pointed out kanji itself, information on the reading learning level (yomi level), and information on a learning flag.

The meanings of the kanji level and reading level values are shown in Figure 5 (
D). The learning flag is information that indicates the learning status of the indicated kanji. If it is 1, it means that the reading of the kanji has been learned, and if it is O, it means that the reading of the kanji has not been learned yet. show.

Figure 6 shows the structure of the Kanji learning level dictionary KLDIC.As shown in Figure 6 (A), the Kanji learning level dictionary is:
It is divided into a kanji level part and a reading information part. In the kanji level part, the level information of the kanji itself (kanji level information) and the pointer to the reading information for each kanji are stored in fixed lengths of 1 byte and 4 bytes, respectively. , are stored consecutively in character code order.

Therefore, a pointer to the kanji level information and reading information for the character can be obtained from the value of the character code. Further, by following the pointer to the reading information, it is possible to obtain information on the reading of the kanji. In the reading information, a plurality of reading candidates for the kanji are stored, and in the reading candidates, the reading and level information of the reading (reading level information) are stored. The reading is J with 1 character and 2 bytes.
Since it is stored as an IS code and all MSBs are off and the MSB of level information is on, it is possible to determine the boundary between reading candidates and reading candidates.

Ru.

FIG. 6(B) shows the structure of kanji (reading) level information.

The kanji (reading) level information stores the kanji (reading) level and learning flag. The kanji level information stores the level of the kanji itself, and the reading level information stores the reading level.

The meaning of the level value is exactly the same as in FIG. 5 (DJ). However, the setting of the kanji (reading) level shall be given by another means.

The learning flag is information that indicates the learning status of the indicated kanji (reading). If it is 1, it means that the kanji (reading) has been learned, and if it is 0, it means that the kanji (reading) has not been learned yet. (pronunciation). If even one learning flag of the reading level information in the reading information for one kanji is 1, the learning flag of the kanji level information is always 1, and when all the learning flags of the reading level information are O. Only, the learning flag of the kanji level information becomes O.

FIG. 7 shows the structure of an analysis result table KAIS that stores the results of analyzing a document in the document buffer TBUF in order to point out kanji at a specific level.

As shown in FIG. 7(A), as a result of the analysis, the information on the clauses cut out from the beginning of the document in the document buffer TBUF is stored starting from the number in the analysis result table.

Each clause information stores the size of the clause information, the clause start position expressed by the number of characters from the beginning of the document, the number of clause characters, the number of independent word characters, the independent word part of speech, and the independent word reading.

For reading independent words, use JI, which has 2 bytes per character.
Stored in S code. Also, the MSB of each reading is the 7th
As shown in Figure (B), it is turned on for the first reading of one character in the document, but it is turned off for the second and subsequent readings, so you cannot get the reading for each character. I can do it.

The operation of this embodiment will be explained according to the flow. FIG. 8 is a flowchart showing the operation of the character processing device of the present invention.

In step S81, a key on the keyboard KB is pressed and waits for an interrupt to occur. When a key is input, key determination is performed in step S82, and step S83 is performed depending on the type of key. The process branches to either step S84 or S85.

Step S83 is a process performed when the kanji level indication key 5ITE is pressed, and indicates the kanji of the learning level indicated by the subsequently inputted numeric key.

Step S84 is a process performed when the kanji level confirmation key KAKU is pressed, and the level and reading of the kanji pointed out in step S83 is checked, and if necessary, the kanji in the document is replaced with the reading. , you can switch the learning status for kanji.

Step S85 is a process performed when a key other than SITE and KAKU (for example, a key used in document editing such as a cursor movement key) is pressed, and is a process commonly performed in character processing devices of the same type. Since it is well known, it will not be specifically described.

Step S86 is a display process for displaying the changed portion as a result of the above-described process. This is a commonly used process in which each character of data in a document is read into a character pattern and output to a display buffer.

FIG. 9 is a detailed flowchart of the process in step S83.

In step S91, the learning level range of the kanji to be pointed out, whether or not to point out learned kanji, and kanji used in proper nouns are pointed out, according to the number keys input after the SITE key. Get instructions on whether or not.

In step S92, the document stored in the document buffer TBIJF is analyzed using the analysis dictionary DIC, divided into phrases, and information necessary for pointing out kanji is output to the analysis result table KAIS. . Since the process of dividing a sentence into phrases using an analysis dictionary is well known, it will not be described in particular.

In step S93, using the analysis result table obtained in step S92, the kanji of the learning level specified in step S91 is pointed out for the document stored in the document buffer TBUF, and the character code of the pointed out kanji is Replace with indicated kanji data.

FIG. 1θ is a detailed flowchart of the process of step S91.

In step 5IOI, a key on the keyboard KB is pressed and the CPU waits for an interrupt to occur. When a key is input, it is determined whether the input key is a numeric key from the rlJ key to the "8" key. For such numeric keys, set the numeric value of that key to the learning level LEVE.
It is stored in L, and the process advances to step 5102. If it is not such a numeric key, it waits for the next key to be input.

In step 5102, a key on the keyboard KB is pressed and waits for an interrupt to occur. When a key is input, it is determined whether the input key is an rQJ key or a numeric key such as the "1" key. If it is such a numeric key, the numeric value of that key is pointed out in the range memory HANI.
The process then proceeds to step 5103. If it is not such a numeric key, it waits for the next key to be input.

In step 5103, a key on the keyboard KB is pressed and a 1 interrupt occurs. When a key is input, it is determined whether the input key is a ``0'' key or a numeric key of the ``rl'' key. If it is such a numeric key, the numeric value of that key is stored in the kanji/yomi specification memory KA.
It is stored in YO and the process advances to step 5104. If it is not such a numeric key, it waits for the next key to be input.

In step 5104, a key on the keyboard KB is pressed and waits for an interrupt to occur. When a key is input, it is determined whether the input key is a numeric key such as a "0" key or an "l" key. If it is such a numeric key, the numeric value of that key is stored in the learning use flag GAKU, and the process advances to step 5105. If it is not such a numeric key, it waits for the next key to be input.

In step 5105, a key on the keyboard KB is pressed and waits for an interrupt to occur. When a key is input, it is determined whether the input key is the "0" key or the "month key" numeric key. If it is such a numeric key, store the numeric value of that key in the proper noun flag KOYU and end step 5LOL.If it is not such a numeric key, wait until the next key is input. wait.

FIG. 11 is a detailed flowchart of the process of step S93.

In step 5ill, 1 is stored in the processed character counter i to initialize it.

In step 5112, the first character stored in document buffer TBUF is fetched.

In step 5113, it is determined whether the characters were successfully retrieved in step 5112. When the characters can be retrieved, proceed to step 5114,
If you can't get the letters, step S
End 93.

, in step 5114, the kanji learning level dictionary KL
Using DIC, it is determined whether the character obtained in step 5112 is a Chinese character. If it is a kanji character, the process advances to step 5iis, and if it is not a kanji character, the process advances to step 5119.

In step 5115, it is determined whether the kanji obtained in step 5l12 is within the range of the learning level obtained in step 5ill, and if it is within the range, step 5
Proceed to step 116, and if not within the range, step 511
Proceed to 9. That is, for the kanji obtained in step 5112, using the kanji learning level dictionary KLDIC:, kanji /
If the value of the reading designation flag KAYO is 0, the learning level of the kanji itself is obtained. If the flag KAYOO value is 1,
The reading of the kanji obtained in step 5112 is obtained from the reading stored in the analysis result table, and the learning level dictionary KL is obtained.
Match the readings in the DIC to obtain the learning level of reading.

Then, the obtained level value is compared with the value stored in the memory LEBEL. Pointed out range memory HANr
When the Q value is 0, if the learning level of the kanji obtained in step 5112 is equal to or larger than the memory LEBEL, the process advances to step 5116, and if it is smaller.

If so, proceed to step 5l19. When the value of the indicated range memory HANI is 1, if the learning level of the kanji obtained in step 5112 is equal to the memory LEBEL, step 51
The process advances to step 16, and if they are not equal, the process advances to step 5119.

In step 5116, it is determined whether or not to point out the kanji obtained in step 5112 depending on the state of learning.

That is, if the value of the flag GAKU is 1, in the same manner as in step 5115, information on whether the kanji obtained in step 5112 has been studied in terms of kanji or reading is obtained from the kanji learning level dictionary KLDIC. Flag GAK
If the value of U is 0 or the value of flag GAKU is 1 and the kanji obtained in step 5112 has not been learned, step 5
Proceed to 117. Step 5l when flag GAKU value is 1
If the kanji obtained in step 12 has been learned, the process proceeds to step 5119 and is not pointed out.

In step 5117, it is determined whether or not to point out the kanji obtained in step 5112, depending on whether the kanji is a proper noun kanji. That is, if the value of the flag KOYU is 0, the process advances to step 5118 and a kanji character is pointed out. If the value of the flag KOYU is 1, it is determined whether the kanji obtained in step 5112 is part of a proper noun from the independent word part of speech in the analysis result table, and if it is part of a proper noun, step 5119 is performed. Don't go ahead and point it out. If it is not part of a proper noun, the process proceeds to step 511g and points out the kanji.

In step 5118, the kanji obtained in step 5112 is pointed out. That is, the character code of the kanji obtained in step 5112 on the document buffer TBUF is shown in FIG. 5(B).
Replace it with the format shown in . The necessary data can be obtained from the Kanji learning level dictionary KLDIC. In step 5119, i is incremented and the process proceeds to step 5112.

FIG. 12 is a detailed flowchart of the process of step S84.

In step 5121, the indicated kanji is searched from the cursor position toward the end of the sentence.

That is, the indicated kanji start code is searched.

In step 5122, the process branches depending on whether the kanji pointed out in step 5121 is found. If the pointed-out kanji is found, the process advances to step 5123; if not found, step S84 ends.

In step 5123, the cursor is moved to the position of the pointed-out kanji first found in step 5121.

Step S! At 24, open window 4B and
The contents shown in FIG. 4(B) are displayed in the window 4B. The information displayed on the window 4B can be obtained from the data sandwiched between the indicated kanji start code and the indicated kanji end information at the cursor position.

In step 5125, a key on the keyboard KB is pressed and an interrupt is waited for. When the key input is performed, key determination is performed in step 5126;
Step 5127゜312g, 5 depending on the type of key
The process branches to either step 129 or 5125.

Step 5127 is a process performed when the learning switching key GCHG is pressed, and the kanji learning state is switched, and the process proceeds to step 5124. In other words, if the learning flag of the pointed out information in the pointed out kanji at the cursor position is 0, it becomes 1;
If so, switch to 0. In addition, Kanji learning level dictionary K
The learning flag in LDIC is also switched as follows.

If you switch the learning flag of pointed information from O to 1,
The learning flag for the reading in the kanji learning level dictionary KLDIC that matches the reading in the indicated kanji data is set to 1, and the learning flag for the kanji itself is also set to 1. If the learning flag of the indicated information is switched from 1 to O, the kanji learning level dictionary KLDIC that matches the pronunciation in the indicated kanji data
The learning flag for the middle reading is set to 0, and furthermore, if all the reading learning flags for the indicated kanji in the kanji learning level dictionary KLDIC are O, the learning flag for the kanji itself is set to O.

Step 5128 is a process performed when the reading replacement key YOMI is pressed, and replaces the indicated kanji at the cursor position with the reading in the indicated kanji data. That is, among the indicated kanji data, only the kanji reading is left and all others are deleted. Then, window 4B is closed.

Step 5129 is a process performed when the confirmation end key KEND is pressed, and the indicated kanji at the cursor position is replaced with a normal character code. That is, among the indicated kanji data, only the kanji code is left and all others are deleted.

Then, window 4B is closed.

If a key other than the above is input, the process advances to step 5125 and waits for the next key input.

The dictionary used in the above explanation is a dictionary that stores kanji and their reading difficulty, but it is not limited to this.
It may also be a dictionary that stores words, their synonyms, and the difficulty level of their meanings. Furthermore, this is not limited to Japanese (it is also possible to process using characters and pronunciations of other languages, or the difficulty level of words and synonyms, etc.).

In addition, processing that allows you to change the difficulty of kanji and readings in the kanji learning level dictionary, adding or deleting readings for kanji in the kanji learning level dictionary, or saving the kanji learning level dictionary to disk. It is also possible to add processing such as calling up a dictionary, so that it is possible to construct a kanji learning level dictionary that suits the user's actual situation.

In addition, in the above embodiment, the reading of the kanji in the document was obtained after analysis using the analysis dictionary, but the reading of the kanji in the document is determined using another means for the document buffer. It is also possible to prepare a reading buffer and obtain the reading of a kanji from that reading buffer.

[Effects of the Invention] As explained above, according to the present invention, the difficulty level of the usage of the character string to be pointed out is used as a criterion for judgment, so We were able to realize a character processing device that supports the creation of easy-to-read documents.

[Brief explanation of the drawing]

FIG. 1 is a basic configuration diagram of a character processing device according to the present invention. FIG. 2 is a block diagram showing the overall configuration of an embodiment of the present invention. FIG. 3 is an operation for indicating kanji level in an embodiment of the present invention. FIG. 4 is an explanatory diagram of an operation example of checking the kanji level in an embodiment of the present invention. FIG. 5 is a diagram showing the structure of a document buffer in an embodiment of the present invention. FIG. 6 is a diagram of the present invention FIG. 7 is a diagram showing the structure of the analysis result table in one embodiment of the present invention. FIGS. 8 to 12 are diagrams showing the structure of the kanji learning level dictionary in one embodiment of the present invention. It is a flowchart showing the operation. CPU...Central processing unit, ROM...Fixed memory dedicated to reading ratio, RAM...Random access memory, KB...Keyboard, CR...Cursor register, CRT...Display device, CG/ ...Character generator, CG...Control bus, DB...Data bus, AB...Address bus, DBUF...Display buffer memory CRTC...CRT controller. lot 104, $ - is a character processing device that makes it easy to read Figure 1 (A) Flowchart Figure 9 Flowchart of Hontoiro's One Disaster Loquat Series Figure 10

Claims (1)

[Scope of Claims] 1) A document storage means for storing an inputted document, a first character string, a plurality of second character strings obtained by paraphrasing the first character string, and the second character string. a character string paraphrase difficulty level dictionary that stores the difficulty level of each string; and a first character string stored in the character string paraphrase difficulty level dictionary that appears in the document stored in the document storage means. a character string interpretation means for detecting a second character string that can be interpreted and paraphrased by judging from the surrounding context; and a difficulty level of the second character string detected by the character string interpretation means is a specific difficulty level. A character processing device comprising: character string pointing means for pointing out a first character string higher than , in the document.