JPS61109168A - Kana-to-kanji converter - Google Patents

Abstract

PURPOSE:To omit unnecessary search for homophones and to improve KANA (Japanese syllabary) / KANJI (Chinese character) conversion search, by collecting the words which are not usually written in KANJI on a dictionary. CONSTITUTION:A keyboard KB, a central processor CPU, a program memory ROM, a KANJI dictionary DIC, a random access memory RAM, a display controller DCT, a liquid crystal display device LCD and a character generator CG are connected to a bus line BL. The random access memory RAM includes a document memory ME, a homophone buffer BU, a homophone counter CO, a document end address EAD, a cursor address CAD and an inserted flag IF.

Description

[Detailed Description of the Invention] [Field] The present invention relates to a kana-kanji conversion device that converts Japanese text input in kana and Roman characters into a text containing Kanji and kana.

[Prior art]

Conventionally, the device that converts human-written Japanese sentences into kanji-kana-mixed sentences without cutting or splitting the middle part has a built-in dictionary that contains words written in kanji, and the 91-character section is The search was done by matching the word rickshaw with a dictionary.

However, this method has the disadvantage that words that are not customarily written in kanji, such as ``however'', ``shikashi'', conjunctions such as ``no'' and ``kot'', and demonstrative pronouns, are also searched for kanji conversion. This method had the disadvantage of significantly reducing the efficiency of kana-kanji conversion. For example, "however" means "deer,""marketprice," or "private house."
, ``Dental'', and ``Shimikake'' were in the dictionary, so there was a problem with the conversion process, as the first two characters ``Shika'' were considered to be the first to be converted into kana-kanji. [Purpose] The present invention eliminates the above-mentioned problems, records the ordinary kana notation of conjunctions and demonstrative pronouns that are frequently used in sentences along with the kanji dictionary, improves the efficiency of searching parts that do not need to be written in kanji, and improves the efficiency of searching for parts that do not need to be written in kanji. Kana Bakujihen 1 with improved conversion efficiency! ! ! The purpose is to provide equipment.

〔explanation〕

An example of operation according to an embodiment of the present invention will be shown below.

For example, when creating the original clause ``However, the problem is '', you can enjoy the input sentence ``Shi Kashikaga Mondai wa''. At this time, on the display screen, as shown in FIG. 7(a), all human sentences are marked with an upper line, and the cursor is positioned next to the end of the input sentence. If a search process for kana-kanji conversion is performed at this point, the cursor will move to "ra" as shown in FIG. 7(b).

This is the result of searching the dictionary and finding "however" as a series of words.

In this case, ``however'' does not need to be written in kanji, so when the operator performs the search process again to move to the next word to be converted into kana-kanji, the word ``however'' appears as shown in Figure 7 (C).
However, the upper line of the part disappears.

The cursor is the ``i'' of ``mondai'' which is the result of searching the dictionary.
Proceed to ``Mondai'' and operate the conversion key to convert ``Mondai'' to kanji. When the desired word is written, the search process is performed again, and the cursor stops at ``wa'' as shown in FIG. 7(g), ``mondai'' is converted to ``question'', and the upper line is deleted.

As described above, by including not only words written in kanji but also words written in hiragana in the kanji dictionary, it is possible to convert ``Kagari Mondai wa'' to ``Kagari mondai wa'' through several search operations.

The present invention will be described in detail below with reference to the drawings.

FIG. 1 is a block diagram showing the configuration of an embodiment according to the present invention. Here, the CPU is a central processing unit that controls various arithmetic peripheral devices.

ROM is a program memory, as shown in Figures 3 and 4:fJ
It stores execution programs for the central processing unit CPU as shown in FIGS. 6 and 9. BL is a pass line that connects other memories, peripheral devices, etc. and transmits signals. KB
is a keyboard, which performs the input function. RAM is random access memory with one sentence -) Memory ME, Homophone x 2A BU, Homophone counter CO2 Document end address E
The zero document memory ME, which is composed of AD, cursor address CAD, and insertion flag IF, stores characters and characters input from the keyboard KB.

Store converted kanji etc. The homophone buffer BtJ stores readings and kanji corresponding to the readings. The homophone counter CO specifies the writing order of the homophones stored in the homophone packer BU.

The document end address EAD stores the last address where a character exists in the document memory ME. Cursor cursor dress CAD memorizes the cursor position. The insertion flag IF serves as a switch for determining whether or not to perform insertion processing.

The LCD is a liquid crystal display that displays character strings entered from the keyboard KB and the contents of the document memory ME.

Display other cursors, etc.

The OCT is a single display controller that controls the liquid crystal display (LCD).

CG is a character generator that stores fonts corresponding to character codes.D and IC are kanji dictionaries in which kanji corresponding to pronunciations are stored.

FIG. 2 is an overview diagram showing details of the keyboard KB of FIG. 1. Among these, the kana and symbol key group is equipped with a plurality of hiragana, katakana, and character/symbol keys such as ",", ",", etc. The cursor left movement and cursor right movement keys are keys for moving the cursor left and right. UL has the function of adding an upper line to the character on the cursor display with the 7 nopa line key, and SC has the function of comparing kana character strings with dictionary readings with the search key, creating a homophone buffer, and ! of homophones. ! It has functions such as confirmation. TR is the conversion key,
It has a function to sequentially display the kanji in the homonym eightfolder.

:53 V4 is a diagram showing details of the kanji dictionary DrC, which stores kanji notations for headings. This section also includes headings for words written in kana such as ``shika'', ``but'', and ``shikashikaga'', and hiragana such as ``shika'', ``but'', and ``shikashikaga'' are also included. Stores notation.

With the above configuration, the operation of the embodiment of the present invention will be explained with reference to flowcharts.

When this device is powered on, it first proceeds to step St in FIG. 4. In step Sl, the random access memory RAM
Document memory ME, Douon buffer BU, Douon J/I
Clear counter CO, pronunciation document end address EAD
Perform initialization processing such as setting the cursor address CAD, setting the cursor address CAD to 1, and turning off the insertion flag IP.
After that, the process advances to step S2, and the state of waiting for the key input from the keyboard KB shown in FIG. The process proceeds to any step, and step S4 performs processing when the character number symbol key is operated.

A detailed flowchart of the character input processing step S4 described above is shown in FIG. 5. First, in step S4@l, an upper line hit is added to the input character code.

Here, the difference in internal code between normal display characters and characters with an upper line will be explained.

In general, the document memory of a character processing device is limited to one character! ! It consists of 1 word or 16 bits. The code of each character is assigned to each bit in a one-to-one correspondence starting from 15 bits, but the most significant bit, that is, bit O, serves as the upper line bit UB. As shown in FIG. 6(b), the code for "A" is r2422J in hexadecimal notation, but the code for "A" with an upper line is < rk4221 as shown in FIG. 6(b).

Now, in step S4.2, it is determined whether the insertion flag IF in the random access memory RAM is in the ON state or the OFF state, and if it is OFF, step 54-
4, if it is ON, proceed to step S4.3.

When the insertion flag IF is ON, in step 34-3, the cursor address is also set to address CA in the document memory ME.
D shifts the character array after the indicated address backwards one character at a time.

Next, in step S4.4, the cursor address CA
The input character code is stored at the address in the one-document memory ME indicated by D. Thereafter, in step 54-5, 1 is added to the cursor address CAD, and the character input process S4 in the flowchart of FIG. 4 is ended.

Step S5 is a process when the search key SC is operated, and FIG. 7 shows details of the search process in step S5.

First, in step S5.1, it is determined by looking at the document memory ME whether or not the character on the cursor has an upper line attached. When there is no upper line, that is, Fig. 8 (
a), in the case of FIG. 8(j), step S5.3
Proceed to.

When the upper line is attached, that is: fS8 figure (b)
, as shown in Figure 8 (e), Figure 8 (g), and Figure 8 (1),
If the character to be confirmed has a 7-nopar line attached, proceed to step S5.2, and set all upper line bits of the character on the cursor and the character strings with consecutive upper lines to the left to 0. On one display screen, tJS8 (ε), Figure 8 (b), Figure 8 (h)
, erase the upper line as shown in Figure 8 (j).

Through this process, the selection of the homophone has been confirmed.

The process then proceeds to step S5.3, where the character string to the right of the cursor is examined to determine whether there is even one character with an upper line. If it exists, that is, Fig. 8 (C), Fig. 8 (b), Fig. 81 (h)
), the process goes to step S5/7, but if it does not exist, as shown in Figure 8 (J), the process goes to step S5/4, adjusts the character string to the left of the cursor, and then presses the upper Check whether there is even one character with a line. If it exists, that is, as shown in FIG. Diagram (j)
In such a case, proceed to steps S5 and S6. Therefore, in step S5#6, the upper line bits of all character codes on the document memory are O because there are no characters with upper lines on the cursor and on the left and right sides of the cursor. At this time, in order to prepare for the next character, set the cursor address CAD to document end address EAD +1 so that the cursor is placed one fingertip from document end address EAD, and display as shown in Figure 8 (k). .

On the other hand, step 55 when it is determined that 7 nopa-1 rhino characters exist only on the left side of the cursor in step S5.4.
At step 95, the cursor address CAD is set to 1 in preparation for searching for a character with an upper line from the beginning of one document memory. Furthermore, in step S5/7, if there is at least one character in the character string on the right side including the character on the cursor, then 7
Extract the characters to the homophone buffer BU and create a kanji dictionary DI
Compare with the pronunciation in C, and if it does not match, use the last 1 from the 7th character.
Delete the characters and compare them again with the readings in the Kanji Dictionary 1DIC.

If it does not match, the last character is deleted again and the same process is repeated until it matches.If a matching reading exists in the kanji dictionary DIC, that reading and all the corresponding kanji are stored in the homophone buffer BU. do. Furthermore, the kanji dictionary D corresponding to the reading with the last character deleted
All kanji in the IC are also extracted and stored in the homophone buffer 7BU along with their readings.

The above procedure is repeated to extract all the kanji in the kanji dictionary DIC corresponding to the first character among the upperlined characters and store them together with their readings in the homophone buffer BU. A check code COD is stored at the end of the homophone buffer BU. Also, if the beginning of the character with an upper line is "wo" etc. and there is no corresponding reading in Kanji Dictionary 9, then
Only the characters in the same language are stored in the 7BU, and the check code COD is stored in the next area. This situation will be explained with reference to FIG. First, the area for one word in I ma homophone XA% BU is made up of 9 words. This corresponds to searching from the 9 characters described in Iti7.

There, the expressions corresponding to ``however'' and ``mondaiino'' are stored, then the expressions corresponding to ``but'' and ``moshi'' are stored, and then ``shika''.

The notation corresponding to "shi" is stored.

Finally, when the check code CCD is entered and the processing of 0 or more is completed, the homophone counter CO is set to 1.
In order to display the cursor at the same character position as the last character of the pronunciation stored in the first area of the homophone buffer BtJ, move the cursor 7 trace CAD to the character position shown in Figure 8(b) on the document memory. Set it under r, j of ``however'', and then write the cursor.

Next, a detailed procedure of the above-mentioned step S6f conversion process will be explained with reference to FIG. 1θ. First, in step 56-1, the homophone counter Co is incremented by one. This is to indicate the next homophone area of the currently displayed homophone. Subsequently, in step S6#2, the character code in the above-mentioned homophone area is checked. If the code is CCD, the process proceeds to step 56-3, where the character code in the above-mentioned homophone area is changed to the homophone as ** to be redisplayed from the beginning of the homophone buffer BU. Set word counter CO to 1. On the other hand, check code C in step 56.2
If it is other than OD, the process proceeds to step S6.4, and the character code in the area corresponding to the homophone counter Co is stored in the document memory ME. At this time, the document memory ME is filled up when the number of characters is small so that there is no space left in the document memory ME.

Upper line processing is performed in step S8.

In the process when the 7 part key UL is operated, bit 0 of the character code stored at the address on the document memory ME indicated by the cursor address CAD, that is, the upper right 7 bit, is set to 1 and the selection is set to 1. Add 1 to the cursor address CAD and display the cursor.

＼゛Step S9 is the process when the insert key is pressed, and inserts the insert flag I in the Ginodam access memory RAM.
When F is 0Nry>1i, it is OFF, and when it is OFF, it is ON.

Step 510 is a process performed when the delete key SK is pressed, in which one character at the address on the punctuation memory ME indicated by the cursor address CAD is deleted, and the character code after that character is filled in one address at a time.

Note that although the above-mentioned upperlined kana was cut out using 9 characters, it does not impair the spirit of the present invention if it is more than 10 characters or less than 8 characters.However, in that case, each area of the homophone buffer BU is It must be composed of the same number of words as the number of characters.Furthermore, although the mark for the part to be converted into kanji is an upper line,5 display methods such as inverted characters, colored characters, underlining, etc. may also be used without departing from the spirit of the present invention. Moreover, although the display of the device of the present invention is a liquid crystal display, a CRThIF display may also be used.

Also, although I explained the kana notation in hiragana, katakana may also be used.

〔effect〕

As explained above, 1. According to the present invention, in a kana-kanji conversion device that converts Japanese sentences input in kana or Roman letters into sentences containing kanji, kana, and kanji, 1. This has the effect of omitting word searches and increasing the efficiency of kana-kanji conversion searches.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing the configuration of an embodiment of the present invention. Figure 2 is an external view of the keyboard. Figure 3 is a diagram showing the contents of the kanji dictionary. FIG. 4 is a flowchart showing the processing process. FIG. 5 is a flowchart showing the character input processing process. FIGS. 6(a) and 6(b) are diagrams showing the 7 Soperine bits of the character code. FIG. 7 is a flowchart showing the process of search processing. FIGS. 8(a) to 8(k) are diagrams showing example sentences. FIG. 9 is a diagram showing the state of the homophone buffer. FIG. 1θ is a diagram showing the process of conversion processing. B U------Homophone buffer C0------Homophone counter S C---Search key TR R------One conversion key

Claims (1)

[Scope of Claims] The present invention is characterized by comprising: a heading storage means that stores a reading of a kanji and a word written in kana as a heading, and a notation storage means that stores a kanji notation and a kana notation corresponding to the heading storage means. Kana-kanji conversion device.