JPH0432957A - character processing device - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

[Detailed Description of the Invention] [Industrial Application Field] The present invention relates to a character processing device that edits a document, and more specifically, a proofreading support function that automatically points out problematic terms or character strings in a document. The present invention relates to a character processing device having a character processing device.

[Prior Art] Conventionally, as a character processing device that points out difficult character strings in a document, a character processing device that has a proofreading support function that sets a difficulty level for pointing out character strings and presents only the reason for pointing out the difficulty level based on the difficulty level. For example, it is proposed to point out kanji that are not commonly used kanji (hereinafter referred to as non-commonly used kanji) in a document, and present only the reason for pointing them out (in this case, ``not commonly used kanji'') on the display device. I can think of things.

[Problem to be solved by the invention] However, in such conventional devices, only the reason for pointing out is presented, so even if a point is made, it is difficult to know what simple string to replace the character string related to the pointing out. There was a drawback that the user had to look it up in a dictionary or the like because he did not know if it was correct.

In addition, when only the reason for pointing out a problem corresponding to the difficulty level of the pointed out character string is presented, the user does not know which hiragana pronunciation should be used to replace the pointed out character string, so the user looks it up in a dictionary, etc. There was a drawback that it had to be done.

The purpose of the present invention is to eliminate the above-mentioned drawbacks, to present an interpretation corresponding to the character string when a difficult character string is pointed out, and to change the content of the document through the interpretation, thereby improving the usage situation and document quality. To provide a character processing device capable of creating an easy-to-read document that matches the ability level of a reader.

[Means for Solving the Problems] In order to achieve the above object, the present invention provides a document storage means for storing a document consisting of character strings, and a document storage means for storing a document consisting of character strings, and a document storage means for storing a document consisting of character strings, and a document storing means for storing a document consisting of character strings in correspondence with each other. A text string interpretation/difficulty level dictionary, a means for setting a difficulty level for pointing out character strings in a document stored in a document storage means, and a text string interpretation/difficulty level dictionary are referenced. An interpretation presentation means for pointing out a character string based on a difficulty level set in a document stored in a storage means and presenting an interpretation corresponding to the character string; and a character string presented by the interpretation presentation means. The present invention is characterized by comprising a document changing means for changing the contents of the document stored in the document storage means to an interpretation corresponding to the document storage means.

[Function] In the present invention, the difficulty level of a character string in a document stored by the document storage means is determined from a character string interpretation/difficulty level dictionary, and the difficulty level for pointing out the character string is set. This makes it possible to present an interpretation corresponding to a character string based on the difficulty level set from the character string interpretation/difficulty dictionary.Also, it is possible to change the content of the document to that interpretation, so it is possible to It is possible to realize a character processing device that can create easy-to-read documents that match the ability level of readers.

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

FIG. 1 shows the basic configuration of an embodiment of the present invention. In the figure, A is a document storage means for storing a document consisting of character strings. B is a character string interpretation/difficulty level dictionary in which character strings are associated with interpretations and difficulty levels of the character strings and stored in advance. C refers to the character string interpretation/difficulty level dictionary B and the character string pointing difficulty level setting means E to find a character string with a difficulty level that is set in the document stored in the document storage means A or higher. This is an interpretation presentation means that points out the character string and also presents an interpretation corresponding to the character string. D is interpretation presentation means C
This document changing means changes the content of the document stored in the document storage means A according to the interpretation corresponding to the above-mentioned character string presented. E is means for setting the difficulty level of pointing out character strings in the document stored in the document storage means A.

FIG. 2 shows the overall circuit configuration of a document processing device according to an embodiment of the present invention.

In the figure, 1 is a microprocessor (CPU) that performs calculations, logical judgments, etc. for character processing, and each component connected to these buses via an address bus AB, a control bus CB, and a data bus DB. Control elements.

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

2 is a read-only fixed memory (ROM). R
PA in the OMZ is a program area in which control procedures etc. by the microprocessor 1, which will be described later with reference to FIGS. 8 to 12, are stored in advance.

Reference numeral 3 denotes a writable random access memory (RAM) having a configuration of 1 word and 16 bits, and is used for temporary storage of various data from each component, which will be described below. That is, TBUF is the document buffer, and the keyboard (KB
) 4 is a storage area for storing document information input from 4. DIG is a word dictionary for analyzing the document stored in the document buffer TBUF and extracting clause information. KLDIC is a kanji learning level dictionary that stores kanji and their learning levels in association with each other in order to point out kanji at a specified learning level. KAIS is a storage area for an analysis result table that stores clause information that is the result of analyzing the document stored in the document buffer TBUF. LEVEL is a storage area that stores the learning level of the kanji to be pointed out. HANI is based on the kanji learning level specified by the learning level LEVEL.
This is a storage area for instructing whether or not to specify the range of learning level of kanji.

Furthermore, GAKU is a flag area for instructing whether to point out a kanji character when information indicating that the kanji character to be pointed out has been learned has been given. K
OYU is a flag area 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. KAYO is a flag area for instructing whether to judge the learning level of the kanji to be pointed out based on the kanji itself or the reading of the kanji. Further, i is a counter for extracting characters one by one from the document buffer TBUF.

The keyboard (KB) 4 includes various function keys such as character/symbol keys 5 such as alphabet keys, hiragana keys, and katakana keys, and cursor movement keys for instructing cursor movement. In particular, this keyboard 4 has the following special function keys (funk keys). That is, 5ITE on the keyboard 4 is a kanji level indication key for pointing out kanji of a specific learning level in a document, KAKU is a kanji level confirmation key for checking the level of the kanji being pointed out, and KEND. is the confirmation end key to return the indicated kanji to its normal state after confirmation, YOMI is the reading replacement key to replace the kanji being confirmed with its reading, and GCHG is the learning state of the kanji being confirmed. This is a learning switch key for switching.

5 is a disk memory device (DIS) for storing documents.
K), which stores the created documents, and the stored documents can be called up when necessary by instructions from the keyboard 4.

6 is a cursor register (CR). The contents of this cursor register 6 can be read and written by the CPU. A CRT controller (CRTC) 8, which will be described later, displays a cursor at a position on a display device (CRT) 9 corresponding to the address stored here.

A display buffer memory (DBUF) 7 stores patterns such as document information stored in the document buffer TBUF.

The CRTC 8 plays the role of displaying the contents stored in the cursor register 6 and the display buffer memory 7 on the display device 9. The CRT 9 is a display device using a cathode ray tube or the like, and the display of a dot pattern and a cursor on the display device 9 is controlled by a CRT controller 8. Furthermore, 10 is a character generator (CG)
It stores patterns of characters and symbols to be displayed on the display device 9.

The character processing device according to the embodiment of the present invention, which is comprised of these components, operates in response to various types of input information from the keyboard 4. When input information from the keyboard 4 is supplied, the character processing device according to the embodiment of the present invention first outputs an interwoven signal. is sent to the microprocessor 1, which reads out various control signals stored in the ROMZ, and performs various controls in accordance with these control signals.

FIG. 3 shows an example of a case where the character processing device shown in FIG. 2 executes an operation for pointing out a specific kanji level in this embodiment. In the figure, (A) represents the display state of the CRT 9 in which a document to be pointed out at a specific kanji level is displayed. In this (A), (a) indicates the position of the cursor. Also, in the state of (A), the kanji level indication key 5ITE is input, and then (b), which will be described later, is input.
When multiple numeric keys shown in (c), (d), (e), and (f) are input, the document information currently displayed on the CRT 9 is displayed, for example, when a 5th grade elementary school student is not familiar with the document information. Among the kanji, the kanji excluding the kanji that have already been learned and the kanji used in proper nouns are indicated by shading, for example, and the status of CR 9 is shown in (B) of the same figure. It comes to show. In (B) of the same figure, the Chinese characters that are shaded as in (g) are the Chinese characters that have been pointed out in this way. In the above operation, the kanji level indication key 5ITE is a key for instructing the indication of a kanji of a specific level as described above, and the key manual power in the embodiment shown in FIG.
For example r 5ITE, 5.0.0.1. I.J.

At this time, the key shown in (b) above is a key that indicates the level of the kanji to be pointed out, for example, the number "5".
The key human power indicates that the level of kanji is the level of kanji learned in the fifth grade of elementary school. In this way, the keys that can be input in (b) are the numerical keys from rH to rB),
All other keys are ignored. Here, from "1" to "6"
The keys up to `` respectively indicate the level of kanji learned in the first grade of elementary school to the level of kanji learned in the sixth grade of elementary school. "7"
indicates the level of commonly used kanji learned after junior high school, and "8"
indicates the level of kanji other than common kanji.

In addition, the key shown in (c) above is a key that indicates the level range of the kanji that should be pointed out, and the numerical "0" key or "1" key can be input as the key in (c). All other keys are ignored. Here, the "0" key instructs to point out the kanji of the level indicated by the above-mentioned key (b) and the kanji of a more difficult level. Here, it is assumed that the more difficult the level is, the higher the numerical value of the numerical key indicated by the key (b) is. In addition, the key “1” is the above-mentioned (b
) to point out only the kanji of the specified level.

The key shown in (d) is a key that indicates whether the level of the kanji indicated by the key (b) is the level of the kanji itself or the level of the reading of the kanji. "0" key or [1]
key is possible. Here, the "0" key indicates the level of the kanji itself, and the "1" key indicates the level of the reading of the kanji.

(e) uses the information set by the operator (user) described later in Figure 4 for the kanji to be pointed out to indicate whether or not it is a learned kanji. This key instructs whether to point out the kanji if it is a kanji that has already been learned. As the key (e), only the numeric rQJ key or rlJ key can be input, and other keys are ignored. Here, the "0" key instructs to point out even the learned kanji, and the "1" key instructs not to point out the learned kanji. for example,(
The kanji ``pressure'' in h) is a kanji learned by fifth-grade elementary school students, but information is set that it has already been learned, and in (e)
Since rlJ is specified in , it is not pointed out with shading.

Further, the key shown in (f) is a key for instructing whether to point out or not to point out when the kanji to be pointed out is used as a kanji in a proper noun word. Only the numeric "0" key or the rlJ key can be input as the (f) key, and other keys are ignored. Here "0"
The key instructs to point out even if the word is used as a kanji for a proper noun word, and the [1tsu key instructs not to point out if it is used as a kanji for a proper noun word. For example, the kanji ``Mai J'' is a kanji learned in the sixth grade of elementary school, so in (i) on the screen in (B) it is pointed out with shading, but in (j) it is pointed out as a proper noun ``
It is a part of Maizuru J, and since January is indicated in (f), it is not indicated by shading.

FIG. 4 shows an example of an operation when a kanji level confirmation operation is performed on the indicated kanji in this embodiment in the character processing device of FIG. In the same figure, (A) is the third
This is a diagram of a display state with exactly the same content as in FIG. In the state of (A), when the kanji level confirmation key KAKU on the keyboard 4 is input, (
As shown in B), after the cursor position (towards the end of the sentence)
The cursor moves to the position of the first pointed out kanji (shaded kanji) in The reading of the kanji, the learning level of the reading, and information as to whether the kanji has already been learned are displayed. The upper "r level" in the window represents the kanji level, and the lower "r level" represents the reading level.

Furthermore, when the confirmation end key KEND is inputted in the display state shown in (B) of the same figure, the window disappears and the shading of the kanji at the cursor position disappears, as shown in (C) of the same figure. It goes unnoticed.

In addition, in the state of (B) in the same figure, the reading replacement key Y
When OMI is input, the window disappears and the kanji at the cursor position is replaced with the reading of the kanji displayed in the window, as shown in (D) of the figure. This replaced reading is not shaded.

In addition, in the state of (B) in the same figure, the learning switch key G
When CHG is input, as shown in (E) in the same figure, the learning status of the target kanji changes from "un" to "done", and the kanji "machi" becomes a learned kanji. The information that is is set. Conversely, if the learning switching key GCHG is input in the state shown in (E) in the same figure, the state shown in (E) in the same figure is
As shown in B), the learning status of the target kanji is changed from "completed" to "unJ", and information is set that the kanji "machi" is an unlearned kanji.

FIGS. 5A to 5D show examples of the structure of the document buffer TBUF in the RAM 3 of FIG.

(A) in the same figure shows the structure of the document buffer TBUF when the pointed out kanji does not exist. If the indicated kanji does not exist, the characters of the document are stored as 2-byte JIS codes for each character from the beginning of the document buffer TBUF, and the end of the document is stored as a 2-byte end-of-document code rOx ffff.
Indicated by J.

(B) of the same figure shows the structure of the pointed out kanji in the document buffer TBUF. When a kanji character that is represented by 2 bytes per character is pointed out, the 2-byte data is replaced with data of indefinite length (indicated kanji) sandwiched between the indicated kanji start code rOXe 0OOJ and the indicated kanji end code rOXe 0OIJ. Inside the indicated kanji start code and indicated kanji end code, the character code of the indicated kanji expressed in 2-byte JIS code from the beginning, 2-byte indicated information, and the reading of the indicated kanji are successively stored. be done. The reading of the indicated kanji is stored as a JIS code of 2 bytes per character.

(C) of the same figure shows an example of the configuration of the indication information in (B) of the same figure. The pointing information stores information on the learning level (kanji level) of the pointed out kanji itself, information on the learning level (reading level) of the reading, and information on a learning flag. The meanings of the kanji level and reading level values are shown in (D) of the figure. The learning flag is information indicating the learning status of the indicated kanji, and if it is l, it means that the reading of the kanji has been learned, and if it is 0, it means that the reading of the kanji has not been learned yet. means.

(A) and (B) of FIG. 6 show an example of the configuration of the kanji learning level dictionary KLDIC in the RAM 5 of FIG.

As shown in (A) of the same figure, the Kanji learning level dictionary KLD
The IC is divided into a kanji level section and a reading information section. In the kanji level section, the level information of the kanji itself (kanji level information) and the pointer to the reading information for each kanji are stored in 1 byte and 4 bytes, respectively. They are stored in a fixed length, and are stored consecutively in character code order. therefore,
In this kanji level section, kanji level information and a pointer to reading information for the character can be obtained from the value of the character code. Furthermore, by following the pointer to the reading information, information on the reading of the kanji can be obtained in the reading information section. This reading information section can store a plurality of reading candidates for the kanji, and the reading candidates also store readings and level information of the reading (reading level information).

This reading is stored in JIS code of 1 character and 2 bytes,
Since all MSBs (most significant bits) are off and all MSBs of the level information are on, it is possible to determine the boundary between reading candidates.

(B) of the figure shows the structure of kanji (or reading) level information. Kanji (reading) level information includes kanji (reading)
Level and learning flag are stored.

That is, the kanji level information stores the level of the kanji itself, and the reading level information stores the reading level. What this level value means is exactly the same as (D) in FIG. This kanji (reading) level setting shall be provided by another means. In addition, the learning flag is information indicating the learning status of the indicated kanji (reading), and if it is 1, it means that the kanji (reading) has been learned, and if it is 0, it means that it has not been learned yet. Kanji (reading)
It means that. 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 only when all the learning flags of the reading level information are O. , the learning flag of the kanji level information becomes 0.

FIGS. 7A and 7B show an example of 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 (A) of the figure, 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 sequentially from the number entry in the analysis result table KAIS. This bunsetsu information includes the bunsetsu information size, the bunsetsu start position 9 expressed in 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 are stored. In this independent word reading, the reading of the independent word is stored as a JIS code of 1 character and 2 bytes.

In addition, as shown in (B) in the same figure, the MSB of each reading of the independent word reading is turned on for the first reading of one character in the document, but for the second and subsequent readings. is o
ff, so you can get the reading for each character.

The operation procedure of the embodiment of the present invention described above will be explained in detail according to the flowcharts of FIGS. 8 to 12.

The flowchart in FIG. 8 shows the overall operation of the character processing device according to the embodiment of the present invention.

First, in step S1, a key is pressed on the keyboard 4 and waits for an interrupt to occur. When a key is input, the key is determined in the next step S2, and step S3 is performed depending on the type of key. S4. The process branches to one of steps S5.

Step S3 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 S4 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 S3 is checked, and if necessary, the kanji in the document is replaced with the reading. , you can switch the learning status for kanji.

Step S5 is a process performed when a key other than the above-mentioned 5ITE or 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 the processing contents are well known, detailed explanation thereof will be omitted.

Step S6 is a display process that displays the changed part as a result of each of the above processes, and is usually widely performed by reading one character of data in a document, developing it into a display pattern, and outputting it to a display buffer. This is the processing content.

The flowchart in FIG. 9 corresponds to step S in FIG.
3 shows the kanji level pointing process in detail.

First, in step S31, the kanji level indication key S I
According to the number keys entered after TE, you can determine the learning level range of the kanji to be pointed out, whether or not to point out already learned kanji, and whether or not to point out kanji used in proper nouns. Obtain instructions (see Figure 3).

In the next step S32, the document stored in the document buffer TBUF (see FIG. 5) is analyzed using DIC, a word dictionary for analysis, and divided into phrases.
Analysis result table K for the information necessary to point out kanji
Output to AIS (see Figure 7). Since the process of dividing a sentence into phrases using an analysis dictionary is a well-known technique, detailed explanation thereof will be omitted.

In the next step S33, using the analysis result table KAIS obtained in S32, the kanji of the learning level specified in step S31 is pointed out for the document stored in the document buffer TBU'. Replace the kanji character code with the indicated kanji data.

The flowchart in FIG. 10 shows details of the kanji level setting process in step S31 in FIG. 9 described above.

First, in step 5311, a key is pressed on the keyboard 4 and 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 r8J key. If it is such a number key, the value of the number of that key is set to the learning level LEV.
The information is stored in the EL and the process proceeds to the next step 5312. On the other hand, if it is not such a numeric key, it waits for the next key to be input.

In step 5312, a key is pressed on the keyboard 4 and waits for an interrupt to occur. When a key is input, it is determined whether the input key is the rQJ key or the numeric key of the "1" key. . If it is such a numeric key, the numeric value of that key is stored in the indicated range HANI, and the process advances to the next step 5313. On the other hand, if it is not such a numeric key, it waits for the next key to be input.

In step 5313, a key is pressed on the keyboard 4 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 a "1" key. If it is such a numeric key, the numeric value of that key is set to the kanji/yomi specification flag KA.
It is stored in YO and the process advances to the next step 5314. On the other hand, if it is not such a numeric key, it waits for the next key to be input.

In step 5314, a key is pressed on the keyboard 4 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 a "1" 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 the next step 5315. On the other hand, if it is not such a numeric key, it waits for the next key to be input.

In step 5315, a key is pressed on the keyboard 4 and waits for an interrupt to occur. When a key is input, it is determined whether the input key is a ``0'' key or a ``1'' key. If it is such a numeric key, the numerical value of that key is uniquely set. The key is stored in the noun flag KOYU, and the process of step S31 is ended.On the other hand, if it is not such a numeric key, it waits for the next key to be input.

The flowchart of FIG. 11 shows in detail the kanji pointing out process in step 333 of FIG. 9 described above.

First, in step 5331, the processed character counter i
Initialize by storing 1 in .

In the next step 5332, the document buffer TBUF
The i-th character (i is the count value of counter i) stored in is fetched.

Further, in step 5333, step 5332
It is determined whether or not characters have been retrieved. If six characters have been retrieved, the process advances to the next step 5334, and if no characters have been retrieved, the process of step S33 is ended.

In step 5334, the kanji learning level dictionary KLD
Using the IC (see FIG. 6), it is determined whether the character obtained in step 5332 is a kanji. If it is a kanji, proceed to the next step 5335; if it is not a kanji, proceed to step 53
Jump to 39.

In step 5335, it is determined whether the kanji obtained in step 5332 is within the range of the learning level obtained in step S31 described above by referring to the learning level LEVEL, etc., and if it is within the range, the next Step 5336
If it is not within that range, proceed to step 5339.
fly to That is, for the kanji obtained in step 5332, the kanji learning level dictionary KLDIC is used, and if the value of the kanji/yomi specification flag KAYO is O, the learning level of the kanji itself is obtained. Further, if the value is 1, step 53
Obtain the reading of the kanji obtained in 32, and use the learning level dictionary KLDI.
Match the readings in C to get the learning level of that reading. Then, the obtained learning level value is compared with the value stored in the learning level LEBEL. At this time, if the value of the indicated range HANI is 0, step S
The learning level of the kanji obtained in 33:2 is the learning level LEBE.
If it is equal to or larger than the value of L, the process advances to the next step 3336, and if it is smaller, the process jumps to step 5339. On the other hand, when the value of the indicated range HANI is 1, if the learning level of the kanji obtained in step 5332 is equal to the value of the learning level LEBEL, the process advances to the next step 3336, and if not, the process jumps to step 5339.

In step 5336, it is determined whether or not to point out the kanji obtained in step 5332, depending on the state of learning. That is, if the value of the learning use flag GAKU is 1, step 5332 is performed in the same manner as step 5335 described above.
Information on whether or not the kanji obtained in step 1 has already been studied in terms of kanji or reading is obtained from the learning level dictionary KLDIC. If the value of the learning use flag GAKU is 0 or the value of the learning use flag GAKU is 1 and the kanji obtained in step 5332 has not been learned, the process proceeds to the next step 5337. If the value of learning use flag GAKU is 1, step 5332
If the kanji obtained in has been learned, jump to step 5339,
don't point out anything.

In step 5337, it is determined whether or not to point out the kanji obtained in step 5332, depending on whether the kanji is a proper noun kanji. That is, the proper noun flag KOYLI
If the value is 0, the process proceeds to the next step 5338 and is pointed out. If the value of the proper noun flag Koyu is 1, step 533
Determine whether the kanji obtained in step 2 is part of a proper noun,
If it is part of a proper noun, the process jumps to step 5339 and nothing is pointed out. On the other hand, if it is not part of a proper noun, the process proceeds to the next step 3338 and points it out.

In step 5338, the kanji obtained in step 5332 is pointed out. That is, the character code of the kanji obtained in step 5332 on the document buffer TBUF is converted to (B
) to the format shown. The data required at this time can be obtained from the Kanji learning level dictionary KLDIC.

In step 5339, the count value of counter i is incremented, and the process returns to step 5332.

The flowchart of FIG. 12 shows in detail the kanji level confirmation process in step S4 of FIG. 8 described above.

First, in step S41, the indicated kanji is searched for from the cursor position toward the end of the sentence. That is, the indicated kanji start code is searched.

Next, in step S42, the process branches depending on whether the kanji pointed out in step S41 is found. If the pointed out kanji is found, the process advances to the next step S43.
If it is not found, the process of step S4 ends.

In step S43, the cursor is moved to the position of the pointed out kanji character found first in step S41 (see (B) in FIG. 4).

Next, in step S44, a window is opened and the contents shown in FIG. 4(B) are displayed in the window. The information displayed on the window can be obtained from the data sandwiched between the indicated kanji start code and the indicated kanji end information at the cursor position.

In the next step S45, a key is pressed on the keyboard 4 and waits for an interrupt to occur.

When a key is input, the key is determined in the next step 346, and steps S47 and S48 are performed depending on the type of key.
．． S49. Then, the process branches to one of steps S45.

Step S47 is a process performed when the learning switching key GCHG is pressed, and the kanji learning state is switched and the process returns to step S44. That is, if the learning flag of the indicated information in the indicated kanji at the cursor position is O, the learning flag is switched to 1, and if the learning flag is 1, it is switched to O. At the same time, the learning flag in the Kanji learning level dictionary KLDIC is also switched as follows.

In other words, when the learning flag of the indicated information is switched from 0 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 changed to 1.
Also, set the learning flag for the kanji itself to 1. Also,
If you have switched the learning flag of the indicated information from 1 to O, change the learning flag for the reading in the Kanji learning level dictionary KLDIC that matches the reading in the indicated kanji data to O,
Furthermore, the kanji learning level dictionary K for the kanji pointed out is
If all reading learning flags in the LDIC are 0, the learning flag of the kanji itself is set to 0 (see (E) in Figure 4).

Step S48 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, close the window ((D) in Figure 4).
). After that, step S4 ends.

Step S49 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 close the window (see (C) in Figure 4).
. After that, step S4 ends.

If a key other than the above-mentioned GCHG, YOMI, and KEND keys is input, the process returns to step S45 and waits for the next key input.

The dictionary used in the description of the above embodiments is a dictionary that stores the difficulty levels of kanji characters, but it may also be a dictionary that stores the difficulty levels of words. In addition, it is not limited to Japanese words, but also other languages (
It is also possible to process using the difficulty level of characters and words in foreign languages.

In addition, there is a process that allows you to change the difficulty level of kanji and readings in the kanji learning level dictionary, a process that adds or deletes pronunciations for kanji in the kanji learning level dictionary, and a process that allows you to save the kanji learning level dictionary to a disk device. It is also possible to add processing to perform and call processes to construct a kanji learning level dictionary that suits the user's actual situation.

[Effects of the Invention] As explained above, according to the present invention, the difficulty level of a character string in a document stored in a document storage means is determined from a character string interpretation/difficulty dictionary, and the difficulty level is determined from a set difficulty level. Based on the degree, the interpretation corresponding to the string can be presented from the string interpretation/difficulty dictionary for the corresponding string.
Furthermore, since the content of the document can be changed based on the interpretation, it is possible to realize a character processing device that can create an easy-to-read document that matches the usage situation and the ability level of the reader.

[Brief explanation of drawings]

Fig. 1 is a block diagram showing the basic configuration of the embodiment of the present invention, Fig. 2 is a block diagram showing the overall circuit configuration of the embodiment of the present invention, and Fig. 3 is an example of operation for pointing out kanji level in the embodiment of the present invention. FIG. 4 is an explanatory diagram showing an operation example of checking the kanji level in the embodiment of the present invention. FIG. 5 is an explanatory diagram showing an example of the structure of the document buffer in FIG. 2 in the embodiment of the present invention. is an explanatory diagram showing an example of the structure of the kanji learning level dictionary shown in FIG. 2 according to the embodiment of the present invention; FIG. 7 is an explanatory diagram showing an example of the structure of the analysis result table shown in FIG. 2 according to the embodiment of the present invention; FIG. 12 is a flowchart showing the operating procedure of the character processing device according to the embodiment of the present invention. 1... Microprocessor (CPU), 2... Fixed memory (ROM), 3... Random access memory (RAM), 4...
Keyboard (KB), 5... Disk device (DISK), 6... Cursor register (CR), 7... Display buffer memory (DBUF), 8...
CRT controller (CRTC), 9...Device display (
CRT), 10...Character generator (CR), TBUF
...Document buffer, DIC...Word dictionary, KLDIC...Kanji learning level dictionary, KAIS...
Analysis result table, LEVEL...learning level, 1 (ANI...pointed out range, GAKU...learning use flag, KOYU...proper noun flag, KAYO...kanji/yomi specification flag, i... Processing character counter, 5ITE...Kanji level indication key KAKU...Kanji level confirmation key KEND...Confirmation end key YOMI...Reading replacement key GCHG...Learning switching key (A) SITE. Basics 4 (color area 110/tsuku diagram Figure 1 Original character level Example of operation of finger wiping Example 1 Mosquito 4 prisoners Figure 3 → Sa h Back side A column operation + Ne and Figure 1 Main flowchart Figure 8 Actual diagram) Figure 10 shows the kanji of Kanji in the mouth row and the bell finger of the star. Details and illustrations of the small-scale roadside crater I Hronayat Figure 11

Claims (1)

[Scope of Claims] 1) A document storage means for storing a document consisting of character strings, a character string interpretation/difficulty level dictionary in which character strings are stored in advance in association with interpretations and difficulty levels of the character strings, and the document means for setting a difficulty level at which a character string in a document stored in a document should be pointed out; an interpretation presenting means for pointing out a character string based on the difficulty level of the setting and presenting an interpretation corresponding to the character string; and an interpretation corresponding to the character string presented by the interpretation presenting means; A character processing device comprising: document changing means for changing the content of a document stored in the document storage means.