JPH04288665A - Text document preparation system - Google Patents

Abstract

PURPOSE:To utilize reading data for giving KANA (Japanese syllabary) and reconversion by noticing that reading data is already inputted at the time of KANA/KANJI (Chinese character) conversion in the documentation system using the KANA/KANJI conversion system. CONSTITUTION:KANA characters of each sentence inputted by a KANA input means 12 like a keyboard are converted to KANJI by a KANA/KANJI conversion means 111. A reading KANA preserving means 112 inserts previously inputted reading KANA characters to a document correspondingly to KANJI and stores this document in a document data file 13. In the case of the processing of giving of KANA reading KANA characters inserted in the document are assigned to corresponding KANJI and are displayed.

Description

[Detailed description of the invention]

0001

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a text document creation method, and more particularly to a text document creation method using a kana/kanji conversion method.

0002

2. Description of the Related Art Conventionally, when assigning ruby to a kanji part of a text document that has already been created, it has been necessary to input the reading again. Furthermore, when converting a kanji into another kanji with the same sound, it was necessary to re-input the reading.

0003

[Problem to be Solved by the Invention] As described above, conventional text documents do not store data on how to read kanji, so they have the disadvantage of having to be input again when needed. Ta. The present invention focuses on the fact that reading data has already been input during kana/kanji conversion, and makes it possible to reuse the reading data.

0004

[Means for Solving the Problems] The text document creation method of the present invention is a document creation system using a kana/kanji conversion method, in which kana data before conversion is saved together with converted kanji data. , has a reading kana storage means, and when playing ruby, displays the kanji and the saved reading kana in combination, and when reconverting, uses the saved reading kana to rewrite the reading kana. It is characterized by eliminating the need for inputting.

[0005]

Embodiments Next, embodiments of the present invention will be described with reference to the drawings.

FIG. 1 is a block diagram of one embodiment of the present invention. The apparatus of this embodiment includes a document creation system 11, a kana input means 12 for inputting document contents, a document data file 13 for storing created document data, and a document display means 14. The document creation system 11 includes a kana/kanji conversion means 111 and a pronunciation kana storage means 11.
2, a kana/kanji correspondence means 113, and a ruby addition means 114.

[0007] The kana/kanji conversion means 111 is a means for converting a phrase or sentence input as kana into a sentence containing kanji, and although the method is not particularly limited, in this embodiment, it is assumed that the phrase is converted for each phrase. There is.

FIG. 2 is a flowchart showing the processing in the pronunciation kana storage means 112. First, a phrase input from the kana input means 12 is converted into a kanji by the kana/kanji conversion means 111, or output without conversion. The reading kana storage means 112 inputs this data (step 201
). It is determined whether the obtained data includes kanji (step 203). If a kanji is included, the corresponding kana data is also obtained from the kana/kanji conversion means (step 204). Since the pronunciation is determined to be expressed in hiragana, other parts are converted to hiragana (step 20).
5). In step 206, in order to process the okuri kana, the clause containing the converted kanji is compared with its reading kana. If okurikana exists, that part is converted to katakana (step 207). The reading kana data including the number of characters of the kanji and the pronunciation kana is added to the front of the kanji data and inserted into the document (step 208). If it is determined in step 203 that the phrase does not include kanji, the data is inserted as is into the document (step 209). The above process is repeated to create a data structure for associating reading kana data with kanji or kanji idioms in the document.

FIG. 3 shows an example of the data structure of a document created by the reading kana storage means 112. Here, text data 3
The corresponding reading kana data is inserted into the kanji parts a, b, and c of 1. The format of this data is 311
, 312 and 313. The number at the beginning of these data represents the number of corresponding Kanji characters. Also, the part of the reading kana that is expressed in katakana indicates the okurigana.

Next, FIG. 4 shows a process of adding and displaying ruby based on the document data 21 in the ruby adding means 114. First, in step 401, the next character or reading kana data is obtained from the document data. When data exists, it is determined whether it is reading kana data (step 403). If it is reading kana data, the kana/kanji correspondence means 113 is called to obtain the kanji and the corresponding reading kana (step 404). In order to create a ruby character, the reading kana is changed to lower case, the character pitch is determined according to the number of characters in the kanji, and the kanji is appended to the kanji (step 405). In this case, if it is written horizontally, it is common to arrange it above the kanji character, and if it is written vertically, it is generally arranged on the right side of the kanji character, but this method is not limited here. This display data is transferred to a display buffer (step 406). On the other hand, if the data read in step 401 is not in reading kana, it is transferred as is to the display buffer (step 407). When all the data in the document has been processed in this way, the data in the display buffer is displayed and the work is finished.

[0011] The processing in the kana/kanji correspondence means 113 analyzes the reading kana data included in the document data, and returns the data of the kanji and reading kana as well as the number of characters thereof.

0012

As explained above, the present invention has the effect of greatly increasing the efficiency of creating text documents using ruby. In addition, since it is possible to process kana and kanji in correspondence,
It can also be applied to different uses of kana/kanji, checking for unification of okuri kana, automatic correction, etc.

[Brief explanation of the drawing]

FIG. 1 is a block diagram of one embodiment of the present invention.

FIG. 2 is a flowchart showing the processing of the pronunciation kana storage means 112 in FIG. 1;

FIG. 3 is an example of document data created based on this method.

FIG. 4 is a flowchart showing the processing of ruby adding means 114 in FIG. 1;

[Explanation of symbols]

11 Document creation system 12 Kana input means 13 Document data file 14 Document display means 111 Kana/Kanji conversion means 112 Reading kana storage means 113 Kana/Kanji correspondence means 114 Ruby addition means

Claims (1)

[Claims] [Claim 1] A document creation system using a kana/kanji conversion method, which includes reading kana storage means for saving converted kanji data as well as kana data before conversion, when writing ruby characters. is characterized by displaying kanji and their saved pronunciations in a composite manner, and when reconverting, the saved pronunciations are used, eliminating the need to input the pronunciations again. Text document creation method.