JPS59221726A - Sentence producer - Google Patents

Abstract

PURPOSE:To shorten the time for addition of rubies by storing simultaneously both the ruby information and the KANJI(Chinese character) information into a KANA(Japanese syllabary)-KANJI dictionary of a sentence producer and displaying both the KANJI and its rubies at a time with just an input of KANA. CONSTITUTION:When ''BUNSHO''(SENTENCE) is fed in KANA with operation of a character key 3 of a keyboard 2, this input is stored in a buffer memory 7A. A KANA-KANJI conversion key 4a of a conversion key part 4 is pushed to give an indication to convert the fed KANA character string into KANJI. Thus the data in the memory 7A is called out to a conversion control part 8, and the KANJI string corresponding to the headword of a KANA-KANJI dictionary 9 is retrieved and read out. Then ''BUN-BUN SHO-SHO'' is stored in a buffer memory 7B. The part 8 transfers the data ''BUN-BUN SHO-SHO'' of the memory 7B to a display control part 11. Then a character pattern corresponding to the relevant character code is called out of a character generator 12 and displayed to a CRT1.

Description

[Detailed Description of the Invention] The present invention provides a text creation device having a kana-kanji conversion function.
This is related to the processing of Rirubi (furigana).

In recent years, models of Japanese imperial word processors have been announced that have the ability to add ruby to kanji and display and print them. These input methods include (1) inputting the pronunciation of a kanji in kana and converting it to kanji, then using the cursor to indicate the position where ruby is to be added, inputting the pronunciation again, and displaying the ruby.

■The pronunciation of the kanji entered in kana is used as ruby and displayed along with the kanji.

There are two main ones. However, according to the input method (■), it is necessary to manually input the reading to convert kana to kanji, input the reading to add ruby, and repeat the same kana character string twice, which is time consuming. It had the disadvantage that it took a lot of time. Although the -h1■ input method eliminates the need to enter the same kana character string twice, the following problems remain. In other words, when inputting a reading that cannot be converted into kanji using a word processor, it may not necessarily be input exactly as the character string that you want to add.

What I mean by this is that word processors generally have a so-called dictionary registration function that allows the user to enter any kana character string and register it so that it is converted into a kanji character string. For example, for the kanji ``tokuwij'', the headword ``totsukiyo'' is usually written as ``i''.
When inputting ``J'', I manually convert it into kanji by typing ``Togiyo'', but in order to speed up input, it is also possible to register ``Tokij'' as a heading. Therefore, if you register an abbreviation using the method (■), display a certain kanji, and add ruby, the ruby will be added to ``toki'' for ``patent,'' for example, which is very inconvenient. Therefore, it is desired that the correct ruby be added even if ruby is added to the kanji input as an abbreviation.

In either case, if you wanted to change the ruby displayed in hiragana to katakana, you had to re-enter it in katakana.

The present invention is based on these points. After inputting a kana character string and converting it to a kanji character string, if you instruct the user to add ruby, the correct ruby will be automatically added.
Furthermore, the purpose is to write the displayed ruby so that it can be easily converted from hiragana to katakana, or vice versa.
The feature is that in a text creation device that inputs a sentence containing kanji and kana in kana from the keyboard and converts it into kanji, it outputs the sentence containing kanji and kana from a display device or a printing device. A kana-kanji dictionary p (which stores information relating the kanji characters in the kana-kanji dictionary) and a kana conversion table storing information which relates the flat name characters and katakana characters. This is because ruby information is mixed and accommodated in the column.

Hereinafter, the present invention will be explained in detail using the drawings.

FIG. 1 is an external view showing an example of the text creation device of the present invention. 1 is a display device such as C, 2 is a keyboard, 3 is a character key for inputting alphanumeric characters and kana, 4 is a kana-kanji conversion key 4a, and a katakana (hiragana, the same applies hereinafter) conversion key 4
b, a part of conversion keys consisting of various conversion keys such as a ruby conversion key 4C, and 5 various control keys.

FIG. 2 is a block diagram showing an embodiment of the present invention. 6
Reference numeral 1 indicates a key manual control unit for controlling the f-key input manually from the keyboard 2, and 7 indicates a buffer memory consisting of two buffer memories 7Δ and 7B. 8 is kana-kanji conversion, katakana conversion,
9 is a conversion control unit that controls various conversions such as ruby conversion; 9 is a kana-kanji dictionary that stores information on the relationship between kana character strings and kanji character strings; 10 is a relationship between flat name characters and katakana characters; Attachment 1) Kana conversion table that stores information about
11 is a display control unit, and 12 is a character generator (CG) that generates character patterns. In addition, the kana-kanji dictionary 9 has the heading edict 9a and kanji 9b, as shown in Figure 3(a).
It consists of 9G readings for ruby display for each kanji character mixed with kanji characters. The actual data is structured as shown in Figure 3(b), where each character is represented by a 1-byte code for kana, a 2-byte code for kanji, and 2-byte codes for kanji.
In order to mix ruby (byte code) and ruby (1 byte code), the most significant bit of the ruby code is always turned on.

Next, the operation of the present invention will be explained using a specific example.

Here, inputting the character string "document" is used as an example. First, the operator inputs "bu/v Lyo" in kana using the character key 3 on the 4-knee board 2. The input data is stored in buffer memory 78.

Then, press the kana-kanji conversion key 48 in the conversion key part 4 to issue an instruction to convert the input kana character string to kanji.
゜When turned over, f-Y in the buffer memory 7A becomes the conversion control unit 8.
The conversion control unit 8 searches for and reads out the kanji character string corresponding to the headword ``bunshiyo'' in the kana-kanji dictionary 9, and stores ``one sentence worth of harm'' in the buffer memory 7B. Then, the conversion control section 8 transfers the character code of "Document" excluding the ruby of the data "Let's write a text" in the buffer 1 memory 7B to the display control section 11. The display control unit 11 calls the character pattern corresponding to the character code that has been transferred from the character generator 12 and displays it on the CRTl
4 (a>). If it is not necessary to add ruby (d) to the displayed kanji, leave it as is and move on to the next input.

To add ruby to the displayed kanji, press the ruby conversion key 4c in the conversion key part 4, and the conversion control unit 8 will read the lc ``letter'' in the buffer memory 7B, including the ruby code. The character code of "Sho" is generated and transferred to the display control unit 11, the character pattern corresponding to the character loading is called from the character generator 12, and the C
RT 1 as shown in Figure 4(b) (displayed together with kanji). If you wish to display ruby in katakana, press katakana conversion key 4b in conversion key part 4 to display the kanji code in buffer memory 7B. The character code consisting of and the ruby code is called to the conversion control unit 8, and the ruby code therein is converted from the flat name code to the katakana code using the kana conversion table 1o, and then transferred to the display control unit 11 along with the kanji code, and this katakana is converted into the katakana code. A character pattern corresponding to the code is called from the character generator 12 and displayed on the CRT 1 as shown in FIG. 4(c) (in katakana ruby).

Here, if you press the ruby conversion key 4C, the plain name ruby will be displayed, and if you want to change it to katakana ruby, press the katakana conversion key 4.
Although we are converting by pressing b, it is also possible to display katakana ruby in the first conversion and then change it to convert to flat name ruby.

Furthermore, ruby is monoruby (even if it is an idiom consisting of multiple kanji,
The reading corresponding to each kanji is the 5th reading above that kanji.
There are <' (=ruby with J added) as shown in Figure (a), and group ruby (ruby in which the pronunciations of the idiom are evenly distributed over the entire idiom as shown in Figure 5 (b)). In the explanation, we have explained the case of mono ruby. Here, by configuring a kana-kanji dictionary as shown in Figure 6 and setting a mono ruby/group ruby conversion key in the conversion key part 4, it is possible to select and display mono ruby and group ruby as appropriate. becomes. In other words, group ruby is added next to the heading edict and kanji to the above-mentioned kana-kanji dictionary, as shown in Figure 6, and when a mono-ruby command is issued, ruby mixed with kanji is used as f-ta, and group ruby is added. If there is a command to convert to group ruby f
If you use -Y, you can easily convert -ginorubi to group ruby, and in the same way, you can convert group ruby to monoruby. .

As explained above, according to Akira Kizata, by storing ruby information together with kanji information in a kana-kanji dictionary, 1
In addition to making it possible to display kanji and ruby at the same time in Kanajin Tsuno, we have also made it possible to display the correct ruby in abbreviation Jinka, and also to easily convert from flat name ruby to katakana ruby. This has the effect of greatly reducing the time required to add ruby to kanji and improving work efficiency.

[Brief explanation of the drawing]

FIG. 1 is an external view showing an example of the text creation device of the present invention;
FIG. 2 is a block diagram showing an embodiment of the present invention, FIG. 3 is a diagram showing the structure of a kana-kanji dictionary, FIG. 4 is a diagram showing an example of ruby display according to the present invention, and FIG. FIG. 6 is a diagram illustrating mono-ruby and group ruby, and is a diagram showing the structure of a kana-kanji dictionary that can also display group ruby. 1...CRT 2...Geeboard 3.
・Character 1- 4 ・Variable J% key 5 ・Control key 6 ・Key manual control unit 7 ・Buffer 1 memory 8 ・Conversion control unit 9 ・Kana/kanji Dictionary 1o...Kana conversion table 11...Display control unit 12...Character generator patent applicant Co., Ltd. Shaken (α) 9C (b) Figure 3 (α) (b) (C) Figure 4 (a) (b) Figure 5-- Figure 6

Claims (1)

[Scope of Claims] After inputting a text containing kanji and kana in kana from a keyboard and converting it into kanji, the text creation method outputs the text containing kanji and kana from a display device or a printing device. It is equipped with a kana-kanji dictionary that stores information relating to kanji character strings, and a kana conversion table that stores information that relates hiragana characters to katakana characters. Resignation FB
A text creation device characterized in that ruby information is mixed and accommodated in a kanji character string.