JPS6364165A - Automatic input method for phonetic kana symbol - Google Patents

Abstract

PURPOSE:To add a phonetic KANA (Japanese syllabary) symbol with a simple operation and to easily prepare a KANJI (Chinese character)-KANA mixing sentence by executing the operation to match a cursor to a KANJI character string and adding automatically the phonetic KANA symbol corresponding to the KANJI character string after a document is prepared. CONSTITUTION:An operator uses the cursor key of an input part 1 and matches a cursor key to a position to add a phonetic KANA symbol. Thus, after a cursor position displayed by a displaying part 2 and a present cursor position from the information of a document file memory part 4 are detected, the phonetic KANA symbol is delivered to an automatic phonetic KANA symbol memory part 5. The memory part 5 executes the retrieving and displays the phonetic KANA symbol based on a prescribed ruby memory table from the information. For phonetic KANA symbol the character string, which is a value shown by the row and column counter of the displayed cursor position, the phonetic KANA symbol is displayed on the upper step of a KANJI character displaying from the cursor position. Hereinafter, in the same way, the corresponding phonetic KANA symbol can be added by matching the cursor position to the KANJI character.

Description

DETAILED DESCRIPTION OF THE INVENTION Field of the Invention The present invention relates to an automatic ruby input method for adding ruby to a Kanji character string in an information processing system having a document processing function.

Conventional technology The conventional method for adding kanji ruby in a document is to input kanji characters and then add hiragana characters, hiragana characters, etc.
Alternatively, a commonly used method is to input katakana characters and add the desired ruby.

Problems to be Solved by the Invention However, the above-mentioned conventional method has some drawbacks in its operating procedures. Particularly when adding ruby to a compound word that is a long kanji character string, inputting time is required. For example, when trying to learn how to read, it is difficult to compare the actual reading method with the reading method given in response.

Therefore, the present invention solves the above-mentioned problems of the conventional example, and makes it possible to add ruby characters corresponding to kanji in a document with a simple operation. The aim is to provide an automatic ruby input method that can also be applied to the learning function of .

Means for Solving the Problems and Technical Means of the present invention for solving the above problems is to store the pronunciations of kanji input during document creation in correspondence with the storage means, and display them after the document creation. By moving the cursor to a kanji character string in the section, the memorized pronunciation is automatically added as ruby in correspondence with the kanji character string.

For production The effects of the above technical means are as follows.

In other words, by moving the cursor to a kanji character string after creating a document, ruby can be automatically added to the kanji character string. can be easily created. Furthermore, after drawing the reading you have in mind, you can display the reading by placing the cursor on a kanji character string, so it can be applied to the field of education for learning how to read kanji.

EXAMPLES Hereinafter, examples of the present invention will be described with reference to the drawings.

FIG. 1 is a block diagram showing one embodiment of the present invention. In Figure 1, 1 is the input section, which includes flat names, katakana, numbers,
It is equipped with so-called character input keys such as alphabetic characters, and function keys for instructing automatic ruby mode, kanji conversion, etc. 2 is the display section,
Characters input by operating the input unit 1 or so-called document character strings converted into kanji by a kana-kanji conversion unit 3 to be described later are displayed. Reference numeral 3 denotes a kana-kanji converting section which converts the plain name or katakana human characters from the input section 1 into kanji upon receiving a kanji conversion instruction. Reference numeral 4 denotes a document file storage unit that stores character strings created in a document as a series of codes. Reference numeral 5 denotes an automatic ruby storage section which stores information such as the plain name or katakana character string used in the conversion by the kana-kanji conversion section 3 and the display position of the converted kanji on the display section 2. A 6-strip external storage section uses a floppy disk or the like to store created document files, ruby storage tables, and the like. Reference numeral 7 denotes a control section, which uses a microcomputer or the like to control the input section 1 and other sections.

Next, a ruby input method will be explained based on a specific example with reference to the flowchart shown in FIG.

First, the procedure for creating sentences containing kanji and kana is shown in Figure 2 (a).
). When the operator inputs "Hanji wa good tenkitezu" from the input unit 1, the display unit 2 displays the flat name character string input from the first line of the screen. The operator presses the kanji conversion key on the input unit 1 in order to convert the above character string into a sentence containing kanji and kana. As a result, the above-mentioned character string is converted by the kana-kanji conversion section 3, and the sentence "Today is nice weather." containing kanji and kana is displayed on the display section 2, as shown in FIG. 3(a). Prior to this display, in conjunction with the kana-kanji conversion section 3, information such as readings converted into kanji is determined in the automatic ruby storage section 5. In other words, from the document file storage unit 4 regarding the position of "Today",
The row and column information for "Today" is obtained, and the contents shown in FIG. 4 are stored. That is, in column (1) of FIG. 4, a code representing 1 in the row counter, a code representing 1 in the column counter,
A code representing 1 is stored in the appearance counter, and a character code for "hanjitsu" is stored in the ruby character string. Similarly, in column (2) of Fig. 4, for the "good" position, a code representing 1 in the row counter, a code representing 4 in the column counter, a code representing 2 in the appearance counter, and a ruby character string. The character code for “yo” is stored in the column (3) of Figure 4.
For "Weather", a code representing 1 in the whereabouts counter, a code representing 6 in the column counter, a code representing 3 in the appearance counter, and a character code for "Tenki" in the ruby character string are stored. In this way, in the process of creating a sentence containing kanji and kana, the above-mentioned processing is carried out by the automatic ruby storage section 5 until the creation of one document is completed.

Next, the procedure for adding ruby to kanji characters is shown in Figure 2 (b).
). The operator uses the cursor keys on the input unit 1 to move the cursor keys to the position where ruby is to be added. As a result, as shown in FIG. 3(b), the display section 2
After the current cursor position is detected from the displayed cursor 8 position and the information in the document file storage section 4, it is transferred to the automatic ruby storage section 5.

The automatic ruby storage unit 5 searches this information based on the ruby storage table shown in FIG. 4 and displays it in ruby.

That is, as shown in Fig. 3 (bJ), at the cursor 8 position, the row counter is 1 and the column counter is 1. Therefore, the row kakunta of the ruby memory unit (see Fig. 4) determined by the above procedure is 1. , the ruby string where the column counter is 1 "
``Hanjitsu'' is displayed in kanji characters from the cursor 8 position.The ruby is displayed above ``Today''. Thereafter, by placing the cursor 8 at the beginning of the kanji characters "ryo" and "tenki" in the same manner, ruby characters for "yo" and "tenki" are added in the same manner as above.

Note that if it is desired to hide the ruby, a toggle process is provided in the automatic ruby storage section 5. In other words, by aligning the cursor 8, if the added ruby is specified an even number of times, this can be achieved by instructing the display unit 2 to erase the ruby display, thereby erasing the ruby display from the screen. be able to.

Effects of the Invention The present invention has the above configuration and has the following effects.

When adding ruby to a document containing kanji and kana, you only need to place the cursor on the kanji character string, which reduces the number of operating steps and reduces the input time, especially when adding ruby to a compound word that is a long kanji character string. This can be significantly reduced. Therefore, it is possible to easily create sentences containing kanji and kana with ruby added.

Furthermore, after drawing the reading you have in mind, you can display the reading by placing the cursor on a kanji character string, so it can be applied to the field of education for learning how to read kanji.

[Brief explanation of the drawing]

1 to 4 show an automatic ruby input method according to an embodiment of the present invention, FIG. 1 is a block diagram, and FIG. (b) is a flowchart showing the procedure for adding ruby to a sentence containing kanji and kana, No. 31...input section, No. 2...
Display section, 3... Kana-Kanji conversion section, 4... Document file storage section, 5... Automatic ruby storage section, 6... External storage section, 7... Control section. Fig. 1 112 (a < b) Fig. 3 (kari λ and Fig. 4

Claims (1)

[Claims] The readings of the kanji input during document creation are stored in correspondence with the storage means, and by moving the cursor to the kanji string on the display after creating the document, the memorized readings are converted to the kanji string as ruby. An automatic ruby input method characterized by automatically adding correspondence.