JP2771020B2 - Character processor - Google Patents

Description

Description: BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a character processing apparatus for creating a document, and more particularly, to a function of converting a hiragana reading string into a predetermined character string mixed with kanji, and a predetermined character mixed with kanji. The present invention relates to a character processing device having a function of converting a sequence into a hiragana reading sequence.

[Prior Art] Conventionally, a character processing apparatus having a function of converting a predetermined character string mixed with kanji into a hiragana reading string has a function of inserting only a hiragana reading string into a document with respect to the converted hiragana reading string. A character processing device has been proposed.

[Problem to be Solved by the Invention] However, in this conventional method, when hiragana reading is inserted into a document in parentheses for a difficult-to-read kanji,
After inserting Hiragana reading into a document, there is a drawback in that it must be edited by moving the cursor and inserting parentheses.

Further, in order to obtain a kana character string to be ruby by kanji / kana conversion, it was necessary to provide a dictionary for kanji / kana conversion requiring a large memory capacity.

According to the present invention, according to the present invention, a reading unit in which a kana character string representing a kanji reading is classified for each reading and arranged in reading order is provided in a character processing device. A kanji part in which the kanji notation corresponding to each reading is sorted for each notation and arranged in reading order, and an index part having a pointer to each of the reading part and the kanji part with each kana character as the leading character of the reading. A kana-kanji conversion means for retrieving and outputting a kanji notation corresponding to a reading represented by an input kana character string with reference to the dictionary means, and An address having a kanji notation that matches the designated kanji notation is searched from the kanji part, a pointer to the kanji part where the searched address exists is searched from the index part, and the searched kanji part is searched. Poi A pointer to the corresponding reading unit from the pointer, and for the kanji notation group to which the kanji notation present at the searched address belongs, obtains the order from the head indicated by the searched pointer to the kanji part, and A kana character string representing a reading that matches the order in which the order from the head indicated by the pointer to the reading unit is found, is obtained by the kanji kana conversion unit searching from the reading unit and the kanji kana conversion unit. Means for adding the input kana character string to the specified kanji notation in the document, thereby converting the input kana character string to the kanji notation, A kana character string representing the reading of is read and added to the specified kanji notation in the document.

EXAMPLES Hereinafter, the present invention will be described in detail with reference to the drawings.

 FIG. 1 shows an example of the overall configuration of the present invention.

In the configuration shown in the figure, a CPU is a microprocessor, performs calculations for character processing, performs logical judgment, and the like, and is connected to those components via an address bus AB, a control bus CB, and a data bus DB. Control elements.

The address bus AB transfers an address signal indicating a component to be controlled by the microprocessor CPU.
The control bus CB transfers and applies a control signal of each component to be controlled by the microprocessor CPU. The data bus DB transfers data between the components.

Next, the ROM is a fixed read-only memory.
The procedure of the control by the microprocessor CPU, which will be described later with reference to FIGS. To 12, and the fixed data of the Kana-Kanji conversion dictionary KNCNVDIC, which stores the dictionary to be referred to when performing the Kana-Kanji conversion, are stored.

The Kana-Kanji conversion dictionary KNCNVDIC is composed of pointer information to the kanji reading part by the first character of the reading n and pointer information to the kanji part by the first character of the reading n, as described later in FIGS. 7 to 9. Index part, Kanji reading sequence n
Kanji reading part consisting of length information, reading information of kanji reading string n, number information of kanji group n corresponding to kanji reading string n, and kanji code part consisting of kanji information of kanji group n It is a dictionary composed.

The RAM is a writable random access memory having a structure of one word and 16 bits, and is used for temporarily storing various data from each component.

TEXT is a text buffer, and stores a document handled by the character processing apparatus in an internal format, as described later in FIG.

KBBUF is a keyboard buffer for storing input readings.

YOMIBUF is a reading input buffer for storing input readings for kana-kanji conversion.

KOUHOBUF is a candidate output buffer for storing candidates created as a result of the kana-kanji conversion process and the kanji-kana conversion process.

KB is a keyboard, and character symbol input keys such as alphabet keys, hiragana keys, katakana keys, and
It has various function keys for instructing various functions to the character processing apparatus, such as a conversion key, a cursor movement key, a selection key, an insertion key, an insertion key with parentheses, and an insertion key with ruby.

DISK is an external storage unit for storing document data, and stores a document created on a text buffer TEXT, and the stored document is called up when necessary by an instruction from a keyboard.

CR is a cursor register. The CPU can read and write the contents of the cursor register. A CRT controller CRTC described later displays a cursor at a position on the display device CRT corresponding to the address stored here.

DBUF is a display buffer memory for storing patterns of data to be displayed. When displaying the contents of document data, DBUF is used based on the data in the text buffer TEXT.
This is done by developing a pattern on top.

The CRTC plays a role of displaying the contents stored in the cursor register CR and the buffer TBUF on the display CRT.

The CRT is a display device using a cathode ray tube or the like, and a display pattern of a dot configuration and a display of a cursor on the display device CRT are controlled by a CRT controller. Further, CG is a character generator, and the display device CR
This stores the pattern of characters and symbols displayed on T.

In the character processing apparatus of the present invention comprising such components, the apparatus operates in response to various inputs from the keyboard KB. When an input from the keyboard KB is supplied, first, an interrupt signal is generated by the microprocessor CPU.
The microprocessor CPU reads various control signals stored in the ROM, and performs various controls in accordance with the control signals.

FIG. 2 is a diagram showing a screen configuration formed on a display device CRT of the device of the present invention.

 In the figure, DSP means a display screen.

TS is a text screen on which the contents of the document stored in the text buffer TEXT are displayed.

KS is an area for displaying soft keys, and displays keys necessary for operation conditions, for example, a selection key, a conversion key, an insertion key, an insertion key with parentheses, an insertion key with ruby, etc., and a key at a corresponding position on the keyboard KB. It is used to input by.

WDSP is a window display screen, and is an area in which character string candidates created after the kana-kanji conversion processing and reading string candidates created after the kanji-kana conversion processing are displayed.

YS is an area for displaying reading input of kana-kanji conversion.

FIG. 3 is a diagram for explaining the transition of a screen for inputting a reading, performing kana-kanji conversion, displaying converted character string candidates, and selecting candidates.

When the document processing device is ready to create a document, FIG.
As shown in (1), the operator inputs readings using the Hiragana key, and displays the input reading in an area YS for displaying reading input for kana-kanji conversion.

Then, when you enter the conversion key, the window display screen
The character string candidates converted into kana-kanji are displayed on the WDSP (FIG. 3 (b)).

Here, the operator moves the cursor position to “Yes” using the cursor movement keys (FIG. 3 (b)), and selects “Select”.
Is input into the text buffer TEXT (FIG. 3 (c)).

FIG. 4 is a diagram for explaining a transition of a screen in which a kanji at a cursor position is converted into kanji kana, a reading is displayed, a candidate is selected, and the candidate is inserted into a document.

When the document processing device can create a document, FIG.
Move the cursor to the position where you want to convert kanji to kana as shown in.

Then, when you enter the conversion key, the window display screen
The reading sequence candidates converted to kanji and kana are displayed on the WDSP (FIG. 4 (b)).

Here, the operator moves the cursor position to “Are” using the cursor movement keys and key-inputs “Insert”, whereby “Are” is inserted and input into the text buffer TEXT (FIG. 4 (c)). )).

FIG. 5 is a diagram for explaining a transition of a screen in which a kanji at a cursor position is converted into kanji kana, a reading is displayed, a candidate is selected, and then a parenthesis is inserted into a document.

When the character processing device is capable of creating a document, the cursor is moved to the position where the kanji / kana kana conversion is desired, as shown in FIG.

Then, when you enter the conversion key, the window display screen
The reading sequence candidates converted to kanji and kana are displayed on the WDSP (FIG. 5 (b)).

Here, the operator moves the cursor position to “Are” using the cursor movement keys and key-inputs “Insert in parentheses” to insert and enter “(Are)” into the text buffer TEXT (No. FIG. 5 (c)).

FIG. 6 is a diagram for explaining a transition of a screen in which a kanji at a cursor position is converted into kanji kana, a reading is displayed, a candidate is selected, and a ruby state is inserted into a document in a line before the cursor line.

When the character processing device can create a document, the cursor is moved to the position where the kanji / kana conversion is desired, as shown in FIG. 6 (a).

Then, when you enter the conversion key, the window display screen
The reading sequence candidates converted to kanji and kana are displayed on the WDSP (FIG. 6 (b)).

Here, the operator moves the cursor position to “Are” using the cursor movement keys, and key-inputs “Insert with ruby” to insert a line before the cursor line, and then in the text buffer TEXT in ruby state. Is inserted and input (FIG. 6 (c)).

7 to 9 are diagrams for explaining the configuration of the kana-kanji conversion dictionary KNCNVDIC.

The kana-kanji conversion dictionary KNCNVDIC is composed of pointer information to the kanji reading part based on the first character of the reading n, index part composed of pointer information to the kanji part based on the first character of the reading n, length information of the kanji reading sequence n, kanji Kanji reading section composed of the reading information of the reading string n, the number information of the kanji group n corresponding to the kanji reading string n, and the kanji code section composed of the kanji information of the kanji group n. It is a dictionary.

First, FIG. 7 is a diagram for explaining the configuration of the index part of the Kana-Kanji conversion dictionary KNCNVDIC.

The index part of the kana-kanji conversion dictionary includes pointer information to the kanji reading part based on the first character of the reading n, pointer information to the kanji part based on the first character of the reading n, and each data is composed of 2 bytes. Codes are stored in ascending order of code (JISX0208 code).

For example, at the beginning of the index part, pointer information to the kanji reading part by the first character of the reading “ぁ” and pointer information to the kanji part by the first character of the reading “ぁ” are stored. The pointer information to the kanji reading part by the character and the pointer information to the kanji part by the first character of the reading "a" are stored.

Next, FIG. 8 is a diagram for explaining the configuration of the kanji reading section of the kana-kanji conversion dictionary KNCNVDIC.

The kanji reading part of the kana-kanji conversion dictionary is based on the length information of the kanji reading string n, and the reading information of the kanji reading string n is 2 bytes in the youngest order (ascending order) of the character code of reading n (JISX0208 code). And stored.

For example, at the beginning of the kanji reading section, the reading column length information of the kanji reading string "A" and the reading information of the reading string "A" are stored. The reading information of the column "Oh" is stored.

FIG. 9 is a diagram for explaining the configuration of the kanji code part of the kana-kanji conversion dictionary KNCNVDIC.

The kanji code part of the kana-kanji conversion dictionary is a kanji reading sequence n
The number information of the kanji group n corresponding to, and the kanji information of the kanji group n of the number described above, each data is composed of 2 bytes, and stored in ascending order (ascending order) of the character code (JISV0208 code) of the kanji reading sequence n Have been.

For example, at the beginning of the kanji code part, the kanji reading sequence "A"
The number information of the kanji group "A" corresponding to the kanji group "A", the kanji information of the kanji group "A" corresponding to the number are stored, and then the number information of the kanji group "Aa" corresponding to the kanji reading sequence "Ah". The kanji information of the number of kanji groups "Oh" is stored.

FIG. 10 is a diagram showing a configuration of the text buffer TEXT.

The text is composed of a plurality of fixed-length line data. Each line data is also composed of a plurality of character data. Each character data is composed of 2 bytes per character.
For example, it is stored in JISX0208 code.

The position of each character is specified by a Y coordinate indicating a line and an X coordinate indicating a character position in the line. For example, in the third line from the beginning of the text and the fourth character from the left, the X coordinate =
4, designated by Y coordinate = 3. Similarly, the current position of the cursor is managed by the X coordinate and the Y coordinate.

Next, the operation of the above embodiment will be described with reference to the flowcharts shown in FIGS.

FIG. 11 shows that, in the kana-kanji conversion process, a kana-kanji conversion dictionary KNCNVDIC creates kana-kanji conversion candidates from the reading of the reading input buffer YOMIBUF, and a candidate character string selected from the created kana-kanji conversion candidates. 9 is a flowchart of a process of editing a file into TEXT.

First, in step 11-1, an input is received from the keyboard KB, and when an input is received, data is stored in the keyboard buffer KB
Performs processing to take in the BUF. Here, if the head of the keyboard buffer KBBUF is a Hiragana key, step 11
Branching to -2, if it is a conversion key, branch to step 11-4. If it is not a hiragana key or a conversion key, proceed to step 11-1 without performing any processing.

In step 11-2, a process of adding the hiragana reading at the head of the keyboard buffer KBBUF to the reading input buffer YOMIBUF is performed.

In step 11-3, a process is performed in which the hiragana reading at the head of the keyboard buffer KBBUF is read and added to the area YS for displaying the reading input of kana-kanji conversion (see FIG. 3 (a)).

In step 11-4, the kana-kanji conversion dictionary KNCNVDIC creates a kana-kanji conversion candidate from the reading of the reading input buffer YOMIBUF, and outputs the kana-kanji conversion candidate to the candidate output buffer.

In step 11-5, the character string group in the candidate output buffer created in the kana-kanji conversion candidate creation process in step 11-4 is displayed on the window display screen WDSP, and the candidate is selected (third step). (See (b) of the figure).

In step 11-6, an input is received from the keyboard KB, and when an input is received, the data is transferred to the keyboard buffer KBBUF.
Is performed. Where the keyboard buffer
If the top of the KBBUF is an up / down cursor key, go to step 11-
Branching to step 7 is performed, and if it is a selection key, the flow branches to step 11-8. If it is not an up / down cursor key or a selection key, the process proceeds to step 11-6 without performing any processing.

In step 11-7, a character string group in the candidate output buffer created in the kana-kanji conversion candidate creation process is displayed on the window display screen WDSP, and the cursor position on the window display screen WDSP for selecting a candidate is set by an up / down cursor key. Is performed according to the input in step 11-6.
Proceed to.

In step 11-8, the character string group in the candidate output buffer created in the kana-kanji conversion candidate creation process is displayed on the window display screen WDSP, and the cursor position on the window display screen WDSP for selecting a candidate is set to the selected candidate. Edit the text buffer TEXT as if it were a character string.

In step 11-9, a character string group in the candidate output buffer created in the kana-kanji conversion candidate creation process is displayed on the window display screen WDSP, and the cursor position on the window display screen WDSP for selecting a candidate is selected. Assuming that it is a character string, the window display screen WDSP is erased, and a process of displaying and editing the selected candidate character string on the text screen TS is performed (see FIG. 3 (c)).

Fig. 12 shows the kana-kanji conversion dictionary for the kanji at the cursor position.
KNCNVDIC converts Kanji to Kana, displays the reading, selects one of the candidates, and then selects one of the following forms: simple insertion, parenthesized insertion, or insertion in the line before the cursor line in ruby state. 9 is a flowchart of a process for inserting into a document.

First, in step 12-1, an input from the keyboard KB is waited, and when an input is received, data is transferred to the keyboard buffer KB.
Performs processing to take in the BUF. Here, if the head of the keyboard buffer KBBUF is a conversion key, step 12-2
If it is not the conversion key, the process proceeds to step 12-1 without performing any processing.

In step 12-2, for the kanji at the position where the cursor is located, the kanji code part of the kana kanji conversion dictionary KNCNV (9th
(See FIG. 7), a process of searching for an address where the same code exists is performed.

In step 12-3, the address searched in step 12-2 exists between the pointers to the kanji part starting at the beginning of the reading in the index part (see FIG. 7) of the kana-kanji conversion dictionary KNCNV. Or search processing.

In step 12-4, processing is performed to obtain a pointer to the kanji reading section from the pointer to the kanji section in which the "address where the same code exists" retrieved in step 12-3 (see FIG. 7).

In step 12-5, the kanji code group of the kana-kanji conversion dictionary KNCNV (see FIG. 9) is assigned to the kanji group from the beginning of the address indicated by the pointer to the kanji part obtained in step 12-3. A process is performed to determine whether an “address where the same code exists” exists.

In step 12-6, from the start of the address indicated by the pointer to the kanji reading section searched in step 12-4, the reading of the kanji reading sequence determined from step 12-5 is entered in the kana-kanji conversion dictionary. The required processing is performed in the KNCNV kanji reading section (see FIG. 8).

In step 12-7, the reading obtained in step 12-6 is displayed on the window display screen WDSP, and processing for selecting a candidate is performed (FIGS. 4 (b), 5 (b), 6). (B)).

In step 12-8, the process waits for an input from the keyboard KB.
Is performed. Where the keyboard buffer
If the top of the KBBUF is the up / down cursor key, go to step 12-
9; if the key is an insert key, branch to step 12-10; if the key is parenthesized, branch to step 12-12; if the key is ruby, branch to step 12-14. , Up / down cursor keys, insert key, parenthesized insert key,
If it is not an insertion key with ruby, do nothing
Proceed to step 12-8.

In step 12-9, the group of readings obtained in step 12-6 is displayed on the window display screen WDSP,
The cursor position on the window display screen WDSP for selecting a candidate is changed according to the input of the up and down cursor keys, and the process proceeds to step 12-8.

In step 12-10, the group of reading strings obtained in step 12-6 is displayed on the window display screen WDSP,
The insertion / editing process in the text buffer TEXT is performed by regarding the cursor position on the window display screen WDSP for selecting candidates as the selected reading candidate character string.

In step 12-11, the group of reading strings obtained in step 12-6 is displayed on the window display screen WDSP,
The cursor position of the window display screen WDSP for selecting a candidate is regarded as the selected reading candidate character string, and the window display screen WDSP is erased, and a process of displaying and editing the selected reading candidate character string on the text screen TS is performed. (See FIG. 4 (c)).

In step 12-12, the group of readings obtained in step 12-6 is displayed on the window display screen WDSP,
Assuming that the cursor position on the window display screen WDSP for selecting a candidate is a selected reading candidate character string, parenthesized insertion editing processing in the text buffer TEXT is performed.

In step 12-13, the group of readings obtained in step 12-6 is displayed on the window display screen WDSP,
The cursor position on the window display screen WDSP to select the candidate is regarded as the selected reading candidate character string, the window display screen WDSP is erased, and the reading candidate character string selected on the text screen TS is displayed and edited by inserting in parentheses Processing is performed (see FIG. 5 (c)).

In step 12-14, add 1 before the line where the cursor is located.
Edit processing for inserting a line is performed in the text buffer TEXT and the text screen TS.

In step 12-15, the group of readings obtained in step 12-6 is displayed on the window display screen WDSP,
Assuming that the cursor position on the window display screen WDSP for selecting a candidate is a selected reading candidate character string, an insertion edit process is performed on the inserted line in the ruby state in the text buffer TEXT.

In step 12-16, the read column group obtained in step 12-6 is displayed on the window display screen WDSP,
The cursor position on the window display screen WDSP for selecting a candidate is regarded as a selected reading candidate character string, the window display screen NDSP is deleted, and also in the text screen TS, one line insertion processing and the selected reading candidate character are performed. A display editing process for inserting a row in a ruby state is performed (see FIG. 6 (c)).

[Other Embodiments] In the above description, a dictionary means for converting a hiragana reading string into a predetermined character string mixed with kanji, and an input hiragana reading string is converted into a predetermined character string mixed with kanji by the dictionary means. Conversion means, the dictionary for converting a hiragana reading string to a predetermined character string mixed with kanji, an inverse conversion means for converting a predetermined character string mixed with kanji into a hiragana reading string, and the converted hiragana reading string. On the other hand, open hiragana and parenthesis are added to the hiragana reading sequence and inserted into the document,
By providing a selection means for selecting whether to insert only hiragana reading columns on a document, when inserting hiragana readings into a document in parentheses for a difficult-to-read kanji, only selecting an operation with parentheses, We have described what can be achieved.

Similarly, just owning a dictionary to convert Japanese words into English words, without the English-to-Japanese conversion index to convert English words into Japanese words, When it is possible to convert English words to Japanese words and English words to Japanese words, and to insert Japanese word translations into parentheses for English words that are difficult to translate from Japanese to English , Can be realized only by selecting the operation with parentheses.

At this time, in the configuration of the kana-kanji conversion dictionary in FIGS. 7 to 9, the index part changes the pointer to the kanji reading part to the pointer to the Japanese part, and the pointer to the kanji part to the pointer to the English part. Change to The kanji reading unit changes the kanji reading sequence to the length of a Japanese word and the Japanese word sequence. Then, the kanji code part changes the number of kanji groups corresponding to the kanji reading string to the number of English string groups corresponding to the Japanese word string, and changes the kanji of the kanji group to English data of the English string group, By adding the length of English data,
The flowcharts of FIGS. 11 and 12 are realized in the same manner.

Similarly, just owning a dictionary for converting English words into Japanese words, without the Japanese-to-English conversion index for converting Japanese words into English words, Can be converted into English words, and English words can be converted into Japanese words. For Japanese words that are difficult to translate from Japanese to English, insert English words into the document in parentheses. In that case, just select the parenthesized operation,
It is possible to realize.

At this time, in the configuration of the kana-kanji conversion dictionary of FIGS. 7 to 9, the index part changes the pointer to the kanji reading part to the pointer to the English part, and the pointer to the kanji part to the Japanese part. Change to a pointer. The kanji reading unit changes the kanji reading sequence to the length of an English word and the English word sequence. The kanji code part changes the number of kanji groups corresponding to the kanji reading string to the number of Japanese string groups corresponding to the English word string, and changes the kanji of the kanji group to Japanese data of the Japanese string group By adding the length of Japanese data,
11 and 12 are realized in a similar manner.

[Effects of the Invention] As described above, according to the present invention, the character processing device includes a reading section in which a kana character string representing a kanji reading is classified for each reading and arranged in reading order, A kanji part in which the kanji notation corresponding to each reading is sorted for each notation and arranged in reading order, and an index part having a pointer to each of the reading part and the kanji part with each kana character as the leading character of the reading. A kana-kanji conversion means for retrieving and outputting a kanji notation corresponding to a reading represented by an input kana character string with reference to the dictionary means, and An address having a kanji notation that matches the designated kanji notation is searched from the kanji part, a pointer to the kanji part where the searched address exists is searched from the index part, and the searched kanji part is searched. Pointer From the obtained kanji notation group to which the kanji notation belonging to the searched address belongs, the order from the head indicated by the searched pointer to the kanji part is obtained, and the corresponding A kana character string conversion means for retrieving, from the reading part, a kana character string representing a reading corresponding to the obtained rank whose rank from the head indicated by the pointer to the reading part is obtained by the search by the kanji kana conversion means. Means for adding the kana character string to the designated kanji notation in the document, converting the input kana character string to the kanji notation, and reading the kanji notation specified in the document. The kana character string to be represented is obtained and added to the specified kanji notation in the document, so the kanji reading in the document is obtained by a simple operation, and the obtained reading is specified as the reading kana. It can be added to Chinese characters.

Further, in addition to the kana-kanji conversion, there is an effect that a memory capacity required for a dictionary for performing the kanji-kana conversion for obtaining the reading kana of the designated kanji can be reduced.

In particular, according to the aspect in which the obtained reading is enclosed in parentheses after the designated kanji, there is an effect that the reading kana part inserted in the same line can be clearly identified.

In particular, by adding the obtained reading in the form of ruby, there is an effect that the correspondence between the kanji notation and the added reading becomes clear.

As described above, it is possible to realize a character processing device that has an easy operation and has a kana-kanji conversion function and a kanji-kana conversion function.

[Brief description of the drawings]

FIG. 1 is a block diagram of a character processing device according to an embodiment of the present invention, FIG. 2 is a diagram showing a screen configuration of the character processing device according to the present invention, and FIG. FIG. 4 shows an example of a method of converting kana-kanji characters, displaying converted character string candidates, and selecting candidates. FIG. 4 shows a method of converting kanji characters at the cursor position to kanji kana, displaying readings, and selecting candidates according to the present invention. FIG. 5 is a diagram showing an example of a method of inserting a character into a document. FIG. 5 shows a method of the present invention in which a kanji at a cursor position is converted into a kanji kana, a reading is displayed, a candidate is selected, and then a parenthesis is inserted into the document. FIG. 6 shows an example of the method of the present invention in which the kanji at the cursor position is converted to kanji kana, the reading is displayed, the candidate is selected, and the document is inserted in a ruby state in the document before the cursor line. FIG. 7 shows an example. FIG. 7 shows a kana-kanji conversion dictionary according to the present invention. FIG. 8 is a diagram showing a configuration of an index portion, FIG. 8 is a diagram showing a configuration of a kanji reading portion of a kana-kanji conversion dictionary in the present invention, and FIG. 9 is a configuration of a kanji code portion of a kana-kanji conversion dictionary in the present invention. FIG. 10 is a diagram showing the configuration of the text buffer in the present invention, and FIGS. 11 and 12 are flowcharts showing the operation of the character processing device according to the present invention in the present invention. DISK: External storage unit CPU: Microprocessor ROM: Read-only memory RAM: Random access memory KBBUF: Keyboard buffer TEXT: Text buffer YOMIBUF: Read input buffer KOUHOBUF: Candidate output buffer KNCNVDIC: Kana Kanji conversion dictionary

Claims (3)

(57) [Claims] 1. A reading section in which a kana character string representing a reading of a kanji is classified for each reading and arranged in reading order, and a kanji notation corresponding to each reading of the reading section is classified for each notation and in reading order. A dictionary unit having an arranged kanji portion, an index portion having a pointer to each of the reading portion and each of the kanji portions each of which has a kana character as a leading character of the reading, and A kana-kanji conversion means for searching for and outputting a kanji notation corresponding to a reading represented by a kana character string; and using the dictionary means, an address at which a kanji notation matching a kanji notation specified in a document exists, and From the index portion, and a pointer to the corresponding reading portion is obtained from the searched pointer to the kanji portion. For the kanji notation group to which the kanji notation present at the given address belongs, the order from the head indicated by the searched pointer to the kanji part was obtained, and the order from the head indicated by the corresponding pointer to the reading part was obtained. A kanji kana conversion means for searching the reading part for a kana character string representing a reading matching the order, and a kana character string obtained by the kanji kana conversion means searching for the specified kanji notation in a document. A character processing device comprising: 2. The character processing apparatus according to claim 1, wherein said adding means inserts a kana character string obtained by said search immediately after said designated kanji notation in a form enclosed in parentheses. apparatus. 3. The character processing apparatus according to claim 1, wherein the adding means adds the kana character string obtained by the search to the designated kanji notation in the form of ruby.