JPS63263559A - Japanese-language information processor - Google Patents

Abstract

PURPOSE:To improve the efficiency of documentation work by extracting KANA (Japanese syllabary) characters giving the pronunciation of KANJI (Chinese character) in a designated range from KANA characters, which are inputted for KANA-KANJI conversion and indicate reading, to eliminate the input operation of KANA characters giving the pronunciation of KANJI independent of KANA characters for KANA-KANJI conversion. CONSTITUTION:The character string inputted as reading is stored together with the character string after KANA-KANJI conversion. When the range of KANA characters giving the pronunciation of KANJI is designated to characters after KANA-KANJI conversion for the purpose of giving KANA characters alongside KANJI, KANA characters corresponding to characters after KANA-KANJI conversion in this range are taken out and are supplied to a means, which generates KANA characters giving the pronunciation of KANJI, as KANA characters giving the pronunciation of prescribed characters (KANJI) after KANA-KANJI conversion. Preliminarily inputted KANA characters are used as KANA characters giving the pronunciation of characters (KANJI) designated as the range of KANA characters giving the pronunciation of KANJI in this manner. Thus, the key input operation for KANA characters giving the pronunciation of KANJI is eliminated to efficiently perform the input work for documentation.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a Japanese information processing device having a function of adding ruby to kanji converted from kana to kanji.

[Prior art]

Some conventional Japanese information processing devices are equipped with a ruby addition function that adds ruby consisting of kana such as flat name or katakana to kanji contained in an input document.

This ruby addition function allows you to define a specific kanji or phrase to which you want to add ruby in a character string that has already been converted into kana-kanji using kana manual input, and then manually rewrite the reading of the flat name or katakana to that character string. It is added as a ruby.

Figures 8(a) to 8(a) show an example of the procedure for adding ruby to ``today'' and ``1 weather'' in a document such as ``Today's weather is sunny'' in a conventional Japanese information processing device.
This will be explained with reference to Jl.

First, the operator manually operates the keys (or uses voice input) to input the reading, ``Today's odenki wa harezu,'', and the reading is displayed in hiragana characters on the screen of the display device. See figure + al].

Then, when the kanji conversion operation is performed, the plain name is converted into kana-kanji by the kana-kanji conversion means and displayed on the screen of the display device as a document containing kanji such as ``Today's weather is sunny'' (see Figure 8). bl].

Therefore, in order to add ruby to "Today", if you specify the ruby range using the ruby specifying means, for example, a single underline will be added to this kanji, and the screen will display "
The weather on the plate is sunny. ' is displayed, and the eighth
As shown in Figure +d+, “Today” is displayed at the specified position on this screen.
is displayed.

When the operator manually manipulates the keys to read the pronunciation using hiragana characters, the ruby kana characters ``kyou'' are added and displayed by the ruby generation means above ``Today'' displayed at a predetermined position on the screen. [Figure 8 (el
reference〕.

When the operator checks whether the ruby kana characters are correct, the words “Today” and “Kyo” disappear from the screen.
Return to the screen "The weather is sunny this day" [Figure 8 (
see fl].

1 Then, when adding ruby to "°Weather", do the same as above [Figure 8 (phantom ~ 0
See 1].

In this way, to generate ruby, first input kana characters, convert them to kana-kanji, and then specify the ruby range for the predetermined kanji in the document after the kana-kanji conversion.
The kana characters used as the ruby for this kanji are input.

This also applies when inputting the reading in Roman characters.

[Problem that the invention seeks to solve]

In the case of such a conventional example, there are the following problems.

In other words, the operator has to input the same kana characters twice, once when performing kana-kanji conversion and when generating ruby, which requires a large number of key (or voice) inputs and is time-consuming. This inevitably leads to a decrease in efficiency when creating documents.

[Purpose of the invention]

The present invention was devised in view of these circumstances, and aims to improve the efficiency of input work when creating documents by eliminating the need for manual key operations (or voice input) for ruby kana characters. There is.

Means for Solving Problem c] In order to achieve the above object, the present invention has the following configuration.

That is, as shown in FIG. 1 corresponding to the claims, the Japanese information processing device according to the present invention converts the input kana characters representing the reading into kana-kanji conversion means converted by the kana-kanji conversion means. a storage means for storing it together with subsequent characters; and a character with a reading corresponding to the character after kana-kanji conversion is extracted from the storage means in response to the output of the specifying means for specifying a ruby range, and the character is supplied to the ruby generation means. The present invention is characterized in that it includes a ruby extracting means that performs the following steps.

(effect) The effects of the configuration of the present invention are as follows.

The character string input as a reading is stored together with the character string after kana-kanji conversion.

Therefore, when a ruby range is specified for the character after the Kana-Kanji conversion in order to add ruby, the Kana character corresponding to the character after the Kana-Kanji conversion is extracted and this is added to the predetermined character (Kanji) after the Kana-Kanji conversion. ) is supplied to the ruby generation means as ruby kana characters.

In this way, in the present invention, the kana characters input in advance are
Used as ruby kana characters for the characters (kanji) specified as the ruby range.

〔Example〕

Hereinafter, one embodiment of the present invention will be described in detail based on the drawings.

An embodiment of the present invention is shown in FIGS. 1 to 7.

The outline of the configuration of the Japanese language information processing apparatus according to the present invention will be explained using FIGS. 2 and 4.

In the figure, the symbol IO is a microcomputer,
This microcomputer 10 basically consists of a central processing unit 11 (hereinafter simply referred to as CPU), a read-only memory 12 (hereinafter simply referred to as ROM), a random access memory 12 (hereinafter simply referred to as RAM), etc. ing.

Various programs and data for controlling the CPU Ull are written in the ROM 12, including a kana-kanji conversion program area 12a, a kana-kanji conversion dictionary area 12b, a ruby generation program area 12c, and a pattern data area 12.
d.

In the kana-kanji conversion program area 12a, a program for grammatically dividing the input kana character string into clauses and executing kana-kanji conversion for each clause is written.

The kana-kanji conversion dictionary area 12b stores a kanji conversion dictionary necessary for executing kana-kanji conversion.

In the ruby generation program area 12C, a program for executing a ruby generation operation, which will be described later, is written.

The pattern data area N area 12d stores dot pattern information corresponding to various kana characters and kanji characters.

The RAM 13 includes a document storage area 13''!'', an input display buffer area 13b, a ruby generation work area 13C, and a ruby storage area 13d.

The document storage area 13a temporarily stores kana character information before kana-kanji conversion separated into each clause, and corresponding character information mixed with kanji after kana-kanji conversion separated into each clause.

The key manual display buffer area 13b temporarily stores display information input manually (or by voice input).

The ruby temporary work area 13c temporarily stores hiragana characters and the like as ruby characters.

The ruby storage area 13d stores kana characters for ruby generated corresponding to the kanji to which ruby is added in the document storage area 13a.

The microcomputer 10 has a 20°CR keyboard.
A display device 30 such as a T-display and a printing device 40 such as a printer are connected via interfaces 50 to 70, respectively.

The keyboard 20 includes character keys 21 . Numeric keypad 22゜Kana-kanji conversion key 23. A non-conversion key 24, a ruby range designation key 25, and the like are arranged as appropriate, and character codes and control codes corresponding to each key are output from the interface 50 based on manual key operations on the keyboard 20.

Next, the operation during document creation will be explained with reference to the flowchart shown in FIG.

The hiragana character information manually operated by keys on the keyboard 20 is stored in the manual key display buffer area 13b (step Sl).

In step S2, hiragana character information is displayed on the screen of the display device 30.

In step S3, it is determined whether there is a kana-kanji conversion code from the keyboard 20 (an output signal based on the press of the kana-kanji conversion key 23 of the keyboard 20), and if there is no kana-kanji conversion code, rNOJ
If there is, return to step S1; if yes, return to step S1.
It is determined to be SJ and the process proceeds to step S4.

In step S4, the kana-kanji conversion key 2 of the keyboard 20 is
In response to the output signal based on the pressing of 3, the key manual display buffer area 13b is accessed to read out each clause consisting of the hiragana characters, and the hiragana character information is stored in the ROM 1.
Based on the program data in step 2, each clause is grammatically divided and converted into kana-kanji.

In step S5, each clause of the hiragana character information before the kana-kanji conversion and the corresponding clause of the kanji-mixed character information after the kana-kanji conversion are stored in the document storage area 13a of the RAM 13.

In step S6, each phrase of character information including kanji is displayed on the screen of the display device 30.

Next, the operation for generating ruby will be explained using the flowchart of FIG.

In the character information displayed on the screen of the display bag W30, ruby is specified by operating the ruby range specifying key 25 of the keyboard 20 with a cursor in units of phrases including the kanji to which ruby is to be added (step S7).

In step S8, the phrase before kana-kanji conversion and the phrase after kana-kanji conversion corresponding to the designated phrase are read from the document storage area 13a, and the process advances to step S9.

In step S9, hiragana characters are searched from the beginning of the read phrase after kana-kanji conversion until a kanji is found, and when the kanji is confirmed, the search is stopped and step S1
Go to 0.

In step 310, the presence or absence of hiragana characters is determined.

If there is, it is judged as 'YESJ' and proceeds to step Sll, where a hiragana character matching the searched hiragana character is searched from the beginning of the read clause before kana-kanji conversion,
Remove it from the clause before kana-kanji conversion and step S1
Proceed to step 2.

On the other hand, if there are no hiragana characters in step 310, 'NO'
J is determined, and the process proceeds to step S12 without performing the process of step Sll.

In step 312, hiragana characters are searched from the end of the phrase after kana-kanji conversion excluding the searched hiragana characters until a kanji is found, and when the kanji is confirmed, the search is stopped and the process proceeds to step S14.

In step S13, the presence or absence of hiragana characters is determined.

If there is, it is determined that it is rYEsJ and the process proceeds to step 314, where it is processed in step Sll.
Clause or step Sl before kana-kanji conversion
From the phrases before kana-kanji conversion that were not processed in step 1, those that match the hiragana characters searched in step S12 are removed, and the process proceeds to step S15.

On the other hand, if there is no hiragana character in step 313, it is determined as 'NOJ' and the process proceeds to step S15 without performing the process of step 314.

In step S15, the remaining hiragana characters that have been processed are used as ruby kana characters. Note that if there are no hiragana characters at the beginning or end of the phrase after kana-kanji conversion, all the hiragana characters in the phrase before kana-kanji conversion that correspond to the phrase after kana-kanji conversion are extracted as ruby.

Subsequently, in step 316, it is determined whether or not other clauses for which ruby ranges have been specified have been processed.

If there are any remaining processes, it is determined to be 'NOJ' and the processes of steps S9 to S15 are repeated; if there are no processes remaining, it is determined to be rYESJ and the process proceeds to step S17.

In step S17, the phrase after kana-kanji conversion specified in the range is displayed at a predetermined position on the screen of the display device 30, and the extracted kana characters for ruby are added and displayed above the kanji in the phrase.

Furthermore, in step 318, it is determined whether or not the displayed ruby kana characters need to be corrected. In other words, the operator makes a judgment based on the display on the screen of the display device 30 and presses a key manually, and the CPU II makes the judgment based on the output signal from the keyboard 20 based on the judgment.

If it is determined as 'YESJ' in step 318, the process proceeds to step S19, where the operator manually enters the correct ruby kana characters and proceeds to step 520. In step 320, the ruby kana characters extracted in step S15 are corrected in step 319. The characters are changed to the kana characters for ruby, and the process proceeds to step S21.

On the other hand, if it is determined 'NOJ' in step 81B, step S2 is performed without performing the processing in steps 319 and S20.
Go to 1.

In step S21, the ruby kana characters extracted in step S15 that do not need to be corrected are stored in the ruby kana characters that were changed in step S20, and the ruby kana characters that need to be corrected are stored in the ruby memory area 13d.

By the way, to make the above explanation of operation easier to understand,
For example, in "Today's weather is sunny,""Today °
A specific example of adding ruby to 1 weather 1 will be explained using FIGS. 7 (al to el) in addition to FIGS. 5 and 6.

First, the keyboard 20 is manually operated by the operator.
outputs the hiragana character information of '1 today's odenki is not hare,' through the interface 50 and sends it to the CPU II.
(Step Sl).

In step S2, the reading "Today's odenki is hare" is displayed on the screen of the display device 300 (see FIG. 7(a)).

In step S3, it is determined whether or not there is a kana-kanji conversion code from the keyboard 20. If there is no kana-kanji conversion code, it is determined to be 'NOJ' and the process returns to step S1, whereas if there is, it is determined to be 'YESJ' and the process proceeds to step S4.

In step S4, the key manual display buffer area 13b is accessed to read out each clause of the hiragana character information, and these hiragana character expressions are read out based on the program data of the ROM 12. It is separated into three phrases such as ``Hare desu,'' and is converted into kana-kanji based on the program data of the kana-kanji conversion program area 12a and the kana-kanji conversion dictionary area 12b, such as ``Today's weather is sunny.'' Obtain character information mixed with kanji.

In step S5, ``1 of today'' and ``today'', 1 of ``day'' and 1 of ``weather'', and 1 of ``hare desu'' and ``sunny day'' are stored in the RAM 13 in correspondence with each other. It is stored in the document storage area 13a.

In step S6, as shown in FIG. 7), the screen of the display device 30 displays text information including kanji, such as "Today's weather is sunny.", and a single underline for each phrase. Add and display.

Therefore, when the two phrases "Today's" and "Otenki wa" are specified (step S7), the "Now;
The words ``day'' and ``1 weather'' are each displayed with a double 'underline, etc.

With this specification, the phrases "Today" and "Kyo no 1" stored in the document storage area 13a, and the phrases "Otenki wa" and "Odenki wa" are respectively read out by CP Ull. (Step S8).

First, the ruby for the first phrase, “Today,” is extracted from “Kyouno,” and then the ruby for the second phrase, “Otenkiwa,” is extracted from “Odenkiwa.”

That is, to search for the plain name character from the beginning of the first clause after the kana-kanji conversion, that is, "Today" read out (step S9), and determine whether or not it exists (step 310). In this example, the plain name character is found at the beginning. Since there is no ', it is judged as 'NOJ' and the process proceeds to step S12.
Search for flat name characters from the end of the clause, and step S13
Proceed to.

In step S13, it is determined whether there are flat name characters.

In this example, since there is "no", it is determined as 'YESJ' and the process proceeds to step 314, and in step S14, step S8
Search for "no" that matches the "no" from the end of the first phrase before kana-kanji conversion, that is, "kyo no" read in . It is removed from "Kyouno", and in step S15, "Kyo" is made into a ruby kana character and stored in the ruby generation work area 13C.

Among the phrases specified in the range in step 316, there are some for which ruby generation has not been performed yet, so it is judged as 'NOJ' and the process returns to step S9, where the ruby kana characters for the second phrase, ``Otenki wa'' are generated. is extracted from “Otenkiha”.

In this case, in step S9, "o" is searched from "odenkiwa", and in step 510, it is determined as 'YESJ' and the process proceeds to step Sll.

In step Sll, the first odenki wa'' is removed from the beginning of ``o'' which matches the searched ``o'', and the process proceeds to step S12.

At step 312, the plain name characters are searched from the end of "Otenkiwa". In this case, “ha” exists, so step S
13, it is determined as 'YESJ' and the process proceeds to step S14.

In step 314, the searched ``wa'' and ``-defeated'' from the end of ``1'' are removed from 0.In step S15, ``tenki'' is set as a kana character for ruby, and the work area 1 when generating ruby.
Store in 3c.

In this example, since there is no ruby range specified above, it is determined as 'YESJ' in step S16 and step S1
Proceed to step 7 and read the generated kana characters for ruby.
and "Tenki" are displayed above the kanji part of "Today's weather is" (see FIG. 7, 1dl). At this time, "Is the ruby correct?" is also displayed on the screen at the same time.

In step 31B, it is determined whether or not the generated ruby kana characters need to be corrected.

In this example, since there is no need for correction, the judgment is "NO" and the process proceeds to step 321, where the ruby kana characters for "today" are changed to "kyo", and the ruby kana characters for "weather" are changed to "tenki". ruby storage area)--sound area 13d''.The screen of the display device 30 returns to the editing screen as shown in FIG. 7 (tel).

As described above, in this embodiment, kana characters for ruby are extracted and generated from pre-input flat name characters before kana-kanji conversion, so the operator has to manually operate keys (or use voice input) to generate ruby. There is no need to do this (input operations can be reduced compared to conventional methods).

In the above embodiment, the ruby range is specified for each clause, but the present invention is not limited to this, and it is also possible to specify only the kanji part as in the conventional method.

Furthermore, the method for extracting ruby kana characters from hiragana characters before conversion of kanji from kana to kanji is not limited to the above embodiment.

Furthermore, it is optional whether to generate ruby during document creation or after document creation, and whether or not to display the generated ruby on the screen of display device 30 is also optional.

Incidentally, in the above embodiment, the same applies when inputting the reading in Roman characters, in which case ruby is extracted based on the Roman character-kana conversion table.

(Effects of the invention) 1. According to the present invention, the following effects are achieved.

That is, since the ruby kana characters of the characters specified in the ruby range (such as kanji) are extracted from the kana characters representing the pronunciation input for the kana-kanji conversion, the operator has to take the trouble to convert the ruby kana characters into the kana characters for the kana-kanji conversion. It is possible to eliminate input operations separately from kana characters, and the number of manual key inputs (or voice inputs) can be reduced compared to the conventional method.

In this way, the present invention can provide a Japanese information processing device that is extremely easy to use in practice and can contribute to improving the efficiency of document creation work.

[Brief explanation of drawings]

1 to 7 relate to one embodiment of the present invention, and FIG.
The figure is a functional block diagram corresponding to the claims, FIG. 2 is a configuration block diagram showing an outline of the Japanese information processing device, FIG. 3 is a diagram showing the layout of each program area of the ROM, and FIG. 4 is a RAM A diagram showing the layout of each storage area,
FIG. 5 is a flowchart for explaining the operation of document creation;
FIG. 6 is a flowchart for explaining the operation of ruby generation,
FIG. 7 (al~+81 is an explanatory diagram showing the screen of a display device used for explaining the specific example. Also, FIG. 7111al~0) is an explanatory diagram showing the screen of the display device used for explaining the operation according to the conventional example. be. lO...Microcomputer 11...CPU 12...ROM' 13...RAM 20...Keyboard 30...Display device.

Claims (1)

[Claims] (1) A storage means for storing the input kana characters representing the pronunciations together with the characters after kana-kanji conversion converted by the kana-kanji conversion means; and said storage in response to the output of the specification means for specifying the ruby range. A Japanese information processing device comprising: ruby extracting means for extracting characters with pronunciations corresponding to characters after kana-kanji conversion from the means and supplying them to ruby generating means.