JPH06223058A - Japanese processor - Google Patents

Abstract

PURPOSE:To automatically give KANA(Japanese syllabary) alongside hard to-understand words corresponding to the usage of a user and create a document in consideration of a reader by giving KANA alongside converted data judged to be hard to understand from a user set value. CONSTITUTION:This processor is provided with RAM 2 where a document data area, a KANA conversion dictionary area, and a set value storage area are formed and ROM 3 wherein a KANA conversion routine, an agate adding process routine, an agate necessary/unnecessary determination routine, and an agate presence/absence conversion routine are programmed. Then difficulty degree data on reading is compared with the user set value according to the agate necessary/unnecessary determination routine in the ROM 3 to decide whether or not an agate needs to be given according to the user usage. Further, the agate presence/absence routine converts the agate presence or absence of specified converted data in an undetermined state during conversion. Consequently, KANA can automatically be given to words corresponding to the user's usage by giving KANA to all words or to, specially, only hard-to-understand words.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a Japanese language processing apparatus which is provided in, for example, a Japanese word processor and converts input Kana character data into converted data such as Kanji characters by rubying the converted data. Is.

[0002]

2. Description of the Related Art Conventionally, a Japanese processing device such as a Japanese word processor which displays Japanese document data on a display device and edits the document data is provided with a function to add ruby to kanji constituting the document data. I have something to prepare. There are two types of ruby input methods: a method of generating ruby at the same time as kana-kanji conversion, and a method of adding ruby to a specific character after conversion is confirmed.

A method of generating ruby at the same time as the above kana-kanji conversion is, for example, as shown in FIG. 17, when the input kana character string "bunsho to niryokusuru" is converted into kanji. At the same time, by using the above kana character string as a ruby character string, the kanji converted document data “sentence”
Add "ruby" and "nyuryuku" to each input.

On the other hand, in the method of adding a ruby to a specific character after the conversion is confirmed, for example, as shown in FIG. 18, a character "sentence" to which a user wants to add a ruby is displayed in response to a display "input a sentence". Is specified, and then the ruby character string "Bun"
By inputting, ruby is attached only to the “sentence” of the document data.

[0005]

However, the above-mentioned conventional Japanese word processor having the ruby attachment function has the following problems.

[0006] First, in the method of generating ruby at the same time as kana-kanji conversion, even if it is desired to add ruby only to difficult-to-read words, ruby is added to all the phrases of the document input and converted at one time. There is a problem that ruby is attached even to the clauses that do not need.

In addition, in the method of adding a ruby to a specific character after the conversion is confirmed, it is necessary to input the same kana character string twice. That is, there is a problem in that the same kana character string input for kana-kanji conversion must be input again as a ruby character string.

[0008]

In order to solve the above-mentioned problems, the Japanese language processing apparatus according to claim 1 of the present invention converts the input kana character data into kanji characters or the like based on the dictionary data of the kana conversion means. The following means are taken in the Japanese language processing apparatus which converts into converted data and at the same time, adds ruby to the above converted data by the ruby adding means.

That is, reading difficulty data is provided for each dictionary data, and this difficulty data is compared with a user set value that serves as a reference in the difficulty determination.
The ruby necessity determining means for controlling the ruby adding means is provided so that the ruby is added only to the converted data determined to be difficult to read from the user set value.

Further, the Japanese language processing apparatus according to claim 2 is
In order to solve the above problems, the Japanese language processing apparatus according to the first aspect takes the following means.

That is, it is provided with ruby presence / absence changing means for changing the presence / absence of ruby of designated conversion data in an unconfirmed state during conversion.

[0012]

According to the structure described in claim 1, when the inputted kana character data is converted into converted data such as kanji based on the dictionary data of the kana converting means, the ruby necessity determining means controls the reading. By comparing the difficulty level data with the user set value, it is determined whether the converted data is difficult to read for the user set value. As a result, ruby is added only to the converted data determined to be difficult to read.

According to the second aspect of the present invention, in the ruby attaching operation according to the first aspect of the present invention, the ruby presence / absence of the designated conversion data is in the unconfirmed state during conversion by the control of the ruby presence / absence changing unit. To allow changes.

[0014]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS One embodiment of the present invention is shown in FIGS.
The explanation is based on the following. In this embodiment, a case where the Japanese language processing device is applied to a Japanese word processor will be illustrated.

As shown in FIG. 2, the Japanese word processor according to the present embodiment is a CPU (Central) that controls the operation of each component constituting the apparatus and executes a program.
Processing Unit) 1. This CPU1 has
RAM (Random A) that stores document data such as characters and ruled lines
A ccess memory 2 and a ROM (Read Only Memory) 3 that stores various control programs are connected via an address bus, a data bus, and various control signal lines, respectively.

The RAM 2 has a kana conversion dictionary area for storing dictionary data for converting kana character data, in addition to a document data area for storing document data. R
The OM3 includes a kana conversion routine for converting kana character data into converted data such as kanji, a ruby addition processing routine for rubying converted data, and a ruby key for determining whether rubying is necessary or not according to user's purpose. A rejection determination routine and a ruby presence / absence changing routine that changes presence / absence of ruby of designated conversion data in an unconfirmed state during conversion are programmed. The RAM 2 and the ROM 3 constitute the kana conversion means, the ruby adding means, the ruby necessity determining means, and the ruby presence / absence changing means of the present invention.

Further, in the CPU 1 via the address bus, the data bus and various control signal lines as described above,
A display device 4 such as a CRT (Cathode Ray Tube) or an LCD (Liquid Crystal Display) for displaying document data,
A keyboard 5 for inputting information such as document data by a user's key operation, and a printer 6 for printing document data
And a floppy disk (hereinafter referred to as FD) 7 for loading and saving document data and an IC (Integrated C).
ircuit) card 8 and display controller 9,
Key interface 10, printer controller 1
1, the FD controller 12, and the IC card interface 13 are connected.

FIG. 3 shows the definition of the document data stored in the document data area of the RAM 2. Document data is 1
Character code, modifier code, and ruby code (ruby header, ruby character code) in units of 6 bits (2 bytes)
The modifier code and the ruby code act on the character represented by the immediately preceding character code. Also, the upper 2 bits (a) of each word shown in the figure represent the type of data, "00" is a character code, "01" is a modifier code, "10" is a ruby code, and "11" is an unused code. is there.

As for the character code, the lower 14 bits are substantially the character code. For example, 7 bits represent a section code, and the remaining 7 bits represent a section code point. In addition, the unused value (95-127 for each ward and point) as the ward code is
It is assigned to the control code.

The modification code is information on the modification of the character represented by the immediately preceding character code. If this code does not exist, the modification that is the same as the preceding character is applied. The structure of the modifier code includes character emphasis (b), font (c), and size (d). The character enhancement (b) represents 64 types of enhancement with a value of 6 bits, 0 is no enhancement, 1-10 is underline (10 types), 21-30 is shaded (10 types), and 31-40 is cancellation. (10 types), 41 and 42 are side points (2 types), and others are unused. Font (c)
Indicates that when each bit is 1, bold, italic, white (blank), and shaded. The size (d) is a value of 3 bits, and specifies eight types of character sizes (quarter-width top-up, quarter-width bottom-up, half-width, full-width, horizontal double-width, vertical double-width, and double-width).

The ruby code is composed of the ruby header of the first word in the ruby character string and the ruby character code of the second and subsequent words. In the ruby header, the upper 6 bits of the 14 bits excluding 2 bits of the data type correspond to the ruby. It is the corresponding number of characters (e) that specifies the number of characters, and the lower 8 bits are the ruby character code (f). On the other hand, the ruby character code is the top 6 of 14 bits excluding the data type of 2 bits.
Bits are unused bits, and the lower 8 bits are the ruby character code.

FIG. 4 shows an example of data of a character string with ruby. This is an example of displaying "today's weather" in a standard typeface in full-width without character emphasis. A character code is actually stored in a portion indicated by "" in the figure, and for example, "001101" is included in the first word "now" portion.
000000011 "(Distance mark code" 26,
03 "is represented by a binary number of 7 bits + 7 bits). The ruby character code (f) is stored.
Is represented by a unique code of 8 bits.

The ruby character string as described above can correspond to one character or a plurality of characters. Usually, ruby corresponds to one character. For example, when adding ruby "bunsho" to "sentence", "bun" is replaced by "sentence"
Then, "sho" corresponds to "chapter". On the other hand, when the correspondence between Chinese characters and Yomi is ambiguous or when it is a phonetic character, the entire word is associated with the ruby character string. For example, if you want to roll the ruby “today” on “today”, do not divide the ruby character string “today” into two, and use it as the ruby for the character “now” and set the corresponding number of characters (e) to “2”.
Is set to correspond to the next character "day", and as a result, correspond to the entire character string "today".

Next, the dictionary data for converting kana characters stored in the kana conversion dictionary area of the RAM 2 will be described. Dictionary data is in the order of headwords (reading) (in alphabetical order)
In addition, an index indicating the dictionary data start position is provided in the initial character string in order to improve the efficiency of the search. As shown in FIG. 5, the structure of the data for one word is a reading (a), a converted character string (b), a reading difficulty (c), and other information (d).

In the above reading (a), since the first character is known from the index, the first character is omitted and the syllable delimiter is clearly shown for reference of ruby attachment. In the converted character string (b), special reading words and phonetic letters have word delimiters. The reading difficulty (c) is shown in Table 1 below.
As shown in, the degree of difficulty of the word is represented, and it is compared with a user setting value described later at the time of conversion, and serves as a ruby necessity determination criterion for determining whether to add ruby. The other information (d) is auxiliary data used in continuous phrase conversion, such as classification of parts of speech and meaning.

[0026]

[Table 1]

The user setting value is, as shown in Table 2 below, a setting value of how hard to read a ruby word according to the user's purpose. It is stored in the storage area.

[0028]

[Table 2]

The ruby attaching operation by the Japanese word processor will be described below based on each of the input methods (1) and (2).

(1) Ruby is added at the same time as kana conversion (2) Ruby is added to the converted data after conversion is confirmed First, the kana before conversion in (1) above is used to generate ruby at the same time as conversion. As for the method, for example, as shown in FIG. 6, when a character string "kaeru" is input and converted, dictionary data is searched by the kana conversion method, and a character string "change" corresponding to the preceding "kaeru" is obtained. . And the first character, "Weird"
The ruby “ka” is added to.

A method of generating ruby will be described. The reading input by the "conversion" key is compared with the dictionary heading (reading), and the matching one is displayed as a candidate. As shown in FIG. 5, the reading of the dictionary is divided by the delimiter "/" so as to have a one-to-one correspondence with the kanji. In the above example of "change", it is "ka / e / ru", and it is associated such as change = ka, e = e, ru = ru. Further, in the case of “return”, “return / return”, and return = return, re = ru.
Based on this correspondence, the reading character string is added to the converted character string as ruby character data. However, the part where the conversion result is hiragana (the part of sending kana) is not ruby. In the above example, ruby is used for the "unusual =" part, but "e = e" and "ru = ru" are ignored. In this way, the result shown in FIG. 6 is obtained.

For words such as "today" and "hydrangea," which cannot correspond in a one-to-one conversion data such as ruby and kanji, the ruby should be distributed to the entire word. There is also a delimiter on the conversion result side of the dictionary.
Conversion result data is "/
Today is "."

Further, by using the above-mentioned reading difficulty data and the user setting value as a reference of whether or not ruby is necessary, ruby can be applied not to all words but only to some words that are difficult to read. In this case, ruby is attached only to words (or clauses depending on the dictionary) whose difficulty data has a value equal to or less than the user-set value. For example, the user sets the ruby necessity setting value to “2”.
If you set to (somewhat obfuscated words and proper nouns in Table 2) and perform kana conversion, the slightly obfuscated words such as "Fuen" and "Bakurocho" will be marked with ruby. Ruby cannot be attached to simple words such as, "Moji" and "Tokyo". FIG. 7 shows an example of the result of kana conversion and ruby attachment by changing the setting value.

In addition to the above setting, the presence / absence of ruby for each phrase can be set individually during conversion. For example, by assigning it to a function key or the like, a key operation for instructing switching of ruby presence or absence is determined. In the undecided state during conversion, the cursor is moved to the phrase whose presence / absence is to be changed, and then this key operation is performed (see FIG. 8).

FIG. 9 shows the algorithm. This is an addition of the ruby generation function to the kana conversion process, and the basic process is the same as the kana conversion. FIG. 9 shows a processing procedure from immediately after the kana character string is input and the “conversion” key is pressed until the conversion result is confirmed by the “confirm” key.

First, the input character string is converted into Kanji characters (S
1) The ruby addition process is performed on each phrase (S2), and then the content of the input key is determined (S3). In S3, when the retry of conversion is instructed by the key such as “next candidate”, “previous candidate”, “no conversion”, the conversion process is performed again (S
4) After that, ruby addition processing is performed again on the re-converted phrase (S5), and the process proceeds to S3.

In S3, if the "ruby presence / absence" key is instructed to change the presence / absence of ruby, the process proceeds to S5, the ruby addition process is performed, and then the process proceeds to S3. If any other key is pressed, a process corresponding to the input key such as moving the cursor to another phrase is performed (S6), and the process proceeds to S3. Then, in S3, when the "confirm" key is pressed to confirm the processing such as conversion and ruby attachment, the above processing process is ended.

FIG. 10 shows the details of the ruby addition processing routine which is S5 in FIG.

First, it is determined whether or not a conversion retry was instructed by the "no conversion" key immediately before (S11). S
If the retry is instructed by the "no conversion" key in 11, that is, if the conversion is not performed or the phrase in the undetermined candidate state is returned to the kana, the process proceeds to S16 described below. on the other hand,
When the retry by the "no conversion" key is not instructed, it is then determined whether or not the "ruby presence / absence" key is instructed to forcibly add or remove ruby to the target phrase (S12). .

If the "ruby presence / absence" key is set to "absent" in S12, the process proceeds to S16, while if it is set to "present", the process proceeds to S15 described later. If the operation of switching the “ruby presence / absence” key is not performed and there is no designation, the read difficulty data is read from the dictionary data of the RAM 2 (S13), and then this difficulty data is compared with the user set value. By doing so (S14), ruby presence / absence is automatically determined according to the difficulty level of reading.

Then, in the comparison of S14, if the reading difficulty data is equal to or less than the user set value, ruby is generated based on the delimiter data of the dictionary (S15), and the above processing process is terminated. On the other hand, when the reading difficulty data is larger than the user set value, if there is ruby, the ruby is erased (S16), and the above processing process ends.

FIG. 11 shows the details of the processing operation in S15 in FIG. 10 and shows the ruby generation process.

First, referring to the conversion data of the dictionary (S2
1) The read character is determined (S22). S22
When it is determined that the character is a hiragana character, the process proceeds to S23, where the reading data is skipped to the delimiter or the end of the data, and the ruby generation for the sending kana is not performed, and the process proceeds to S28 described below.

If it is determined in S22 that the character is "/ (delimiter)", the number of characters up to the next delimiter or the end of the data is set as the corresponding number of characters (S24), and the process will be described later.
Move to 26. If it is determined in S22 that the characters are other than hiragana and "/ (delimiter)",
The number of corresponding characters is set to "1" (S25), and the process proceeds to S26.

In S26, the read data is read up to the delimiter or the end of the data and coded, and then a ruby code is generated based on the data obtained as described above (S27). After that, the end of the read or converted data is confirmed (S28), and if it is not finished in S28, the process returns to S21 again, while if the end is confirmed, the above processing process is finished.

Next, a method of adding ruby to the designated character in (2) above or changing or erasing an already existing ruby will be described. In this method, there are a method (a) for adding a ruby to each character and a method (b) for adding a ruby to a plurality of characters.

In the method of adding ruby for each character in (a) above, as shown in FIG. 12, the cursor is moved to the character to which ruby is added and the "ruby input" key assigned to a function key or the like is input. To do. At this time, an input window independent of the document edit screen appears (details of the method are omitted). The character string entered here becomes the ruby for the character at the cursor position. If this operation is already performed on a character with ruby, the original ruby is deleted and replaced with the newly input ruby. If you do not enter anything (just press the line feed key on the input window), the ruby remains deleted, so you can delete the ruby. For the convenience of repeating the procedure, the cursor moves one character after the ruby input.

In the method of adding ruby to a plurality of characters designated in the area (b) above, as shown in FIG. 13, a plurality of characters are designated in the area, and then ruby input is performed to input a ruby into the plurality of characters. On the other hand, ruby is added collectively. The dictionary data is referred to from the input character string, and if there is a conversion result that matches the character string in the area, ruby is assigned based on the delimiter data of the dictionary. In the example 1 of FIG. 13, the dictionary is searched from the input “en-eki” and the reading is “en / eki” =
Obtain the conversion result "deduction" data and "enact" the "en"
Then, assign "Eki" to "Kan". In addition, the example 2 in FIG.
If there is no matching data in the dictionary, it is regarded as a phonetic and the ruby is evenly allocated to the whole.

FIG. 14 is a flowchart showing each processing process of (a) and (b) in the input method of (2).

First, it is determined whether or not there is an area designation in ruby attachment (S31). If no area is designated in S31,
That is, when the ruby attachment method of (a) is used, the process proceeds to S32. On the other hand, when there is an area designation, that is, when the ruby attachment method of (b) is used, the process proceeds to S37.

When the ruby attachment method of (a) is adopted, first,
It is determined whether or not there is a character at the cursor position (S32). S
At 32, if there is no character at the cursor position, that is, if there is a cursor at the end of the sentence, or if there is a control code instead of a character at the cursor position, the processing process is terminated.
On the other hand, when there is a character at the cursor position, the ruby character string is input (S33) to erase the existing ruby (S3).
4). After that, the input ruby character string is allocated to the character at the cursor position (S35), the cursor is moved to the next character (S36), and the above processing process is terminated.

In the case of adopting the ruby attaching method of (b), first,
In S37, the ruby character string is input to erase the existing ruby (S38), and then the input ruby character string is compared with the dictionary data (S39). In S39, if there is no input ruby character string in the dictionary data, the ruby character string is assigned to the target character (S40), and the process proceeds to S42 described later. on the other hand,
If there is a ruby character string input in the dictionary data, the ruby character string is assigned based on the delimiter data of the dictionary (S4
1) The area designation is canceled in S42, and the above process is terminated.

Next, an expression method for printing or displaying ruby at an optimum position will be described below.

In the case of printing or displaying conversion data such as kanji with ruby, the positions of the conversion data and ruby are made to correspond, and the shorter width of both is equally allocated according to the longer one. In the case of ordinary words, if the kanji such as the kanji and the reading do not have a one-to-one correspondence for each kanji, this process is performed for the entire word (see FIG. 15).

FIG. 16 shows an algorithm for obtaining print or display data according to this expression method.

First, the characters are read one by one from the document data area of the RAM 2 (S51), and then it is determined whether or not the character data is accompanied by ruby data (S5).
2). If the character data does not include ruby data in S52, the character font (in the case of general characters) or control information (in the case of control characters) is output to the printer 6 or the display device 4 (positioned before the output device). It may be a buffer memory) (S53), and the above processing process is terminated.

On the other hand, when the character data is accompanied by ruby data in S52, the number of corresponding characters and the number of ruby characters for counting the number of ruby codes are obtained from the ruby code to compare the number of characters and the character width, and the shorter one is longer. The character spacing for matching (equal allocation) to one is calculated (S54).
Next, the character font is sent to the output device at the intervals calculated as described above (S55). The process in S55 is repeated for the number of characters designated by the ruby header.

Then, the output device is instructed to set the print (or display) position at the beginning of the ruby, and the font of the ruby character string is output at the calculated interval (S5
6) The above processing process is completed.

As an example of the printing and display expression method, when the first character (“now”) of the document data in FIG. 4 is read, the following three ruby characters (“ki”, “yo”, and “u”) Then, from the corresponding character number data at the beginning, there are two kanji corresponding to this ruby. The width of these two characters (“now” and “day”) is 2 full-width characters, and the width of ruby is 3 half-width characters (= 1.5 full-width characters), and the latter is evenly allocated according to the former width.

As described above, the Japanese word processor of the present invention includes the RAM 2 in which the document data area, the kana conversion dictionary area, and the set value storage area are formed, the kana conversion routine,
A ruby addition processing routine, a ruby necessity determination routine, and a ROM 3 programmed with a ruby presence / absence changing routine are provided, and the ruby attaching operation is performed by two input methods (1) and (2) shown in FIG. ing.

In the input method of the above (1), based on the ruby necessity determination routine of the ROM 3, the reading difficulty data is compared with the user set value to determine the necessity of ruby attachment according to the user's purpose. . Further, in the input method of (1), the ruby presence / absence changing routine enables the presence / absence of ruby of the designated conversion data to be changed in the unconfirmed state during conversion.

Therefore, ruby can be automatically added to all words (conversion data), or ruby can be applied only to difficult-to-read words, depending on the user's purpose. . Therefore, it is possible to create a document considering the person who reads the sentence. Specifically, you can change how ruby is attached depending on the age group of the reader and whether you are an expert or general reader in the field described by the document.

The above embodiment is not intended to limit the present invention, and various modifications can be made within the scope of the present invention.
For example, in the above embodiment, the kana conversion dictionary area for converting kana character data into conversion data such as kanji is formed in the RAM 2, but the invention is not particularly limited to this, and the kana conversion is performed in the ROM 3 dedicated to reading data. It is also possible to form a dictionary area.

[0064]

As described above, in the Japanese language processing apparatus according to claim 1 of the present invention, the reading difficulty data is provided for each dictionary data, and the difficulty data and the difficulty determination are made. Compare with the user setting value that is the standard in
The ruby necessity determining means for controlling the ruby adding means is provided so that the ruby is added only to the converted data determined to be difficult to read based on the user setting value.

By doing so, it is possible to automatically add ruby to a difficult-to-read word according to the user's purpose. Therefore, the reader is an expert or general reader in the age group of the reader and the field described by the document. You can change how ruby is attached depending on whether or not. As a result, there is an effect that it is possible to provide a convenient Japanese language processing device capable of creating a document in consideration of the person who reads the sentence.

The Japanese language processing device according to claim 2 is
The Japanese language processing apparatus according to claim 1 is provided with ruby presence / absence changing means for changing the presence / absence of ruby of the designated conversion data in the undetermined state during conversion.

As a result, in addition to the convenience of the Japanese language processing apparatus according to the first aspect, there is an effect that it is possible to create a document more suited to the user's purpose.

[Brief description of drawings]

FIG. 1 is an explanatory diagram showing data of a Japanese word processor and respective processing methods according to an embodiment of the present invention.

FIG. 2 is a block diagram showing various components of the Japanese word processor.

FIG. 3 is an explanatory diagram showing document data stored in a document data area of a RAM.

FIG. 4 is an explanatory diagram showing an example of data of a character string with ruby.

FIG. 5 is an explanatory diagram showing conversion dictionary data stored in a kana-kanji conversion dictionary area of a RAM.

FIG. 6 is an explanatory diagram showing key operations and displays of an input method for adding ruby at the same time as kana-kanji conversion.

FIG. 7 is an explanatory diagram showing an example of a result of kana-kanji conversion and ruby attachment by changing a user setting value.

FIG. 8 is an explanatory diagram showing a key operation and a display for individually setting the necessity of ruby for each phrase at the time of conversion.

9 is a flowchart showing the algorithm of FIG.

FIG. 10 is a flowchart showing a ruby addition processing routine of FIG. 9;

11 is a flowchart showing a ruby generation processing routine of FIG.

FIG. 12 is an explanatory diagram showing key operations and display of a method of adding a ruby to each character in the input method of adding a ruby to a Chinese character after conversion confirmation.

FIG. 13 is an explanatory diagram showing key operations and display of a method of adding ruby to a plurality of characters designated in an area in an input method of adding ruby to a kanji after conversion confirmation.

FIG. 14 is a flowchart showing each processing process of FIGS. 12 and 13;

FIG. 15 is an explanatory diagram showing an example of an expression method for printing or displaying ruby at an optimum position.

16 is a flow chart showing an algorithm for obtaining the print or expression data of FIG.

FIG. 17 is an explanatory diagram showing an example of an input method for generating ruby at the same time as kana-kanji conversion in the conventional example.

FIG. 18 is an explanatory diagram showing an example of an input method for adding ruby to a specific character after conversion confirmation in a conventional example.

[Explanation of symbols]

 1 CPU 2 RAM 3 ROM 4 display device 5 keyboard 6 printer 7 FD 8 IC card

Claims (2)

[Claims] 1. A Japanese language processing apparatus for converting input kana character data into conversion data such as kanji based on dictionary data of kana conversion means, and at the same time, adding ruby to the conversion data by ruby adding means. In the above, the reading difficulty data is provided for each dictionary data, and this difficulty data is compared with the user setting value that is the reference in the difficulty determination, and the conversion data determined to be difficult reading based on the user setting value. A Japanese language processing device characterized by comprising ruby necessity determining means for controlling the ruby adding means so that only the ruby can be attached. 2. The Japanese language processing apparatus according to claim 1, further comprising ruby presence / absence changing means for changing the presence / absence of ruby of designated conversion data in an unconfirmed state during conversion.