JPS60189569A - Character processor - Google Patents

Abstract

PURPOSE:To process characters efficiently by inputting contracted sound and double consonant characters as a normal one and by referring to a character table for collecting characters which can be contracted sound and double consonant characters at the time of converting KANA (Japansese syllabory) into KANJI (Chinese character). CONSTITUTION:When you would like to input a Japanese sentence written in KANJI and KANA, you input rewrite the all sentence in KANA and input is and depress a conversion key. The the sentence is stored in a stentece buffer BB and recognised as one sentence, which is deviced into two paragraphs in a paragraph conversion table HT. Then characters which can be a contracted sound and a double consonant in sequence by utilizing a contracted sound/double consonant table TY. By refering to a KANA to KANJI conversion table KT and a word dictionary table JT which does not employ KANJI, said characters are investigated to be converted into KANJI. If they are converted into a KANJI string, it is stored in the table JT. To put it concretely, conversion words which area homonyms with respect to the 1st paragraph which is written in KANJI is obtained.

Description

DETAILED DESCRIPTION OF THE INVENTION [Technical Field] The present invention relates to a character processing device such as a word processor, and particularly relates to conversion of consonants and consonants of characters.

[Prior Art 1 Conventionally, in this type of character processing device, when you want to input the word "chui", in Roman alphabet it is written as rcYUUI J
kar(:HYUUrJ), and in Hiraita Meijinki, it is input as "Chi Yuui". Therefore, when inputting Romaji, I have to learn the new input method of "chu", and in Hiraita Meijinki, I have to learn the input method of ``chu'', and in Hiraita Meijinki, I input the ``Yu'' sound. For the character ``,'' students must learn how to input the ``Yu'' sound, such as using the shift key to input ``Yu.''

In other words, when inputting romaji, ya nyunyo kiya
I have to remember how to input ``kyukyo'', ``old'', and ``J'', and I have to remember how to input ``Yai Yue'' in lower case with my flat board master skills.
Regarding YoJ, there was a drawback that the input rhythm was likely to be disrupted as it required the shift key to be pressed each time.

Similarly, the consonant (tsumaru) such as ``tsu'' in ``taiita'' is also the same, and in romaji input it is r ITTEJ.
There is a confusing feeling that you have to input the character ``tsu'' by pressing the shift key etc., as in ``Itte'' in the flat board Meijiniki.

[Objective] The purpose of the present invention is to eliminate these drawbacks, and to make it possible to input sultic sounds, consonant characters, etc. without being conscious of the input, even when attempting to input sultic sounds or consonant characters. Input it as a normal character that is not a consonant or a consonant, and when converting such as kana-kanji conversion, refer to a character table that collects characters that can be a consonant or consonant, create all words that can be a consonant or consonant, and then To provide a character processing device which searches for words by converting kana to kanji.

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

FIG. 1 shows an example of a configuration for achieving the present invention. In the figure, A is an input means, and B is a persistent sound.

C is a consonant discrimination means, C is a kana-kanji conversion means, D is a phrase conversion means, E is a storage means, and F is a display means.

Next, FIG. 2 shows a schematic configuration diagram of an embodiment of the character processing device according to the present invention. In the illustrated configuration, 1 is a microprocessor, 2 is an address bus for specifying the storage address of each input/output memory, 3 is a bidirectional data bus used for transferring various data, and 4 is for writing and reading each memory, etc. This is a control bus for transmitting control signals such as acceptance of interruption and timing instructions for data setting. Further, 5 is a keyboard provided with various keys such as alphabet keys, kana character keys, and numeric keys. Reference numeral 8 denotes a keyboard controller for controlling the keyboard 5, which encodes data input through the keyboard 5 using the keyboard controller 6, and sends an interruption signal, that is, an interwoven signal, to the control bus. Further, 7 is a CRT controller, and 7 is a CRT controller.
7" display device 8, display controller 8, character generator IO, refresh memory 11, and refresh memory controller 12.

In the display controller 8, the character pattern signal from the character generator 10 is processed according to display control signals such as brightness, inversion, underlining, and blinking stored in the refresh memory 11, and the processed character pattern signal is is supplied to the CRT display device 8 and displayed. On the other hand, character generator lO
The refresh memory 11 sequentially outputs the character patterns to be arranged in the row specified by the code input such as the character code and the row address of the character pattern among the stored character patterns. Once you have memorized the character code and display control code to display,
In response to display instructions from the CRT controller 7, these character codes and display control codes are repeatedly output.

Furthermore, the refresh memory controller 12
7 controls the fresh cycle for display and the writing and reading of data from the microprocessor 1.

Reference numeral 13 denotes a read-only memory, ie, a so-called read-only memory (ROM), which stores control procedures for character processing as shown in FIG. 4, as well as various processing procedures. 14 is a controller for the ROM 13, and 15 is a random access memory (RAM).
It temporarily stores various data. For example, this RAM 15 includes a buffer SB for temporarily storing a created document and a sentence buffer 8B for temporarily storing a single input sentence.
, a phrase conversion table HT that converts the contents of the sentence buffer BB for each phrase, a suction consonant table YT that finds words that can be consonants and consonants in a sentence, and a kana-kanji conversion table K
T, dictionary table JT with a word dictionary that does not use kanji,
It also has a cursor buffer KB for remembering the cursor position.

Next, the specific key arrangement of the keyboard 5 will be explained based on FIG. 3. In Figure 3, 5A is an input key for inputting kana, alphanumeric characters and symbols, 5B is a movement key for moving the cursor up, down, left and right, 5G is a kanji position specification key for specifying the beginning and end of a kanji, and 5D is a conversion key.

FIG. 4 is a flowchart showing the character processing procedure according to the present invention, FIG. 5 is a diagram showing the display contents of the CRT 8, FIG. 8 is a diagram showing the contents of the bunsetsu conversion table HT, and FIGS. A diagram showing the contents of the consonant table YT, and FIGS. 8 and 10 are diagrams showing the contents of the dictionary table JT.

Next, an example of character processing by the character processing apparatus of the present invention will be explained using the flowchart shown in FIG. Now, if you want to input ``I received a certificate,'' first enter ``I received a certificate'' in S2 (see Figure 5). Here, "(" and ")" indicate input by the Kanji character designation key 50, which designates the beginning and end of a Kanji character, respectively. Next, at Sl, it is checked whether the conversion key 50 has been pressed. If it is not pressed, proceed to S2; if it is pressed, proceed to S3. For example, if you input ``(shojiyou) wo (got)ta'', this input sentence is stored in the sentence buffer BH, and by pressing the conversion key 50,
Proceed to 3. In S3, the document input using the conversion key 5D is regarded as one sentence, and this sentence is divided into phrases in the phrase conversion table (IT) through phrase processing and converted into phrases as shown in Figure 6. It is converted into two clauses: ``wo'' and ``(Mora)tsuta''.

Next, a process is performed to find words that can be consonants or consonants for each of the two divided clauses. That is, in S4, the first
From each character in the phrase "(Shojiyo) wo", words that can be consonants or consonants are sequentially found using the consonant consonant table YT. Specifically, it is checked whether the first "shi" can be a consonant or a consonant using the consonant consonant table YT. Here, "shi" cannot be either, so we proceed to S6 and set the pointer of table HT to 1.
The process then proceeds to S7, where it is checked whether the content of the pointer is a character. That is, since "yo" is a character, the program returns to S4 and checks the consonant consonant and consonant consonants using the consonant consonant table YT. Here, ``yo'' can be a sulphon, so we will go with 85. Here, table) I
Regarding the character of the target pointer in T and the character of the pointer before it, all character strings that can be combined if they are made into a sulcus or a consonant, and if they are not made into a sulcus or a consonant. are created and stored in the consonant consonant table YT (see Figure 7).

Next, for each character string stored in table YT, check whether it can be converted into kana-kanji or not by referring to the kana-kanji conversion table KT and the dictionary table JT for words that do not use kanji, and find the character string that can be converted into kana-kanji. If there is, it is stored in table JT (see Figure 8). Specifically, when the 84 steps to the last "wo" are completed and the process advances to S5, "Shojiyo" and "Shojiyo" are created for the first "yo", and table YT is created.
Among these, it was determined that ``Shojiyo J'' could be converted into kana-kanji, and as shown in Figure 8, the converted word ``Shoji use (wo)'' was obtained, and up to the first 1' yo. If the pointer of the table HT has been moved, step 85 ends. In this way, the pointer of the table HT is increased one by one, and the same operation as above is performed until the last "wo" of "(shojiyo)wo". As a result, examples of character strings obtained in the consonant and consonant table YT are shown in FIG. 7, and examples of converted words obtained in the dictionary table JT are shown in FIG.

Next, for the word for which the work up to S5 regarding the last "wo" has been completed, the process proceeds to S8 via S6 and S7, where it is determined whether or not there is the next clause in the clause conversion table (IT), and if there is, it is Proceed to the text of the law! i (i.e.
Select the first pointer of ``(Mora) Tsuta''). Next, the process returns to S4 and the same operations as those described above are performed.

Specifically, ``moj'', ``ra'', and ``ta'' do not correspond to consonants or consonants, and only ``r'' is a consonant. Therefore,
As shown in Figure 9, the consonant and consonant table YT includes
Two character strings are obtained, ``obtained'' and ``obtained.'' Of these strings, ``obtained'' cannot be converted into kana-kanji, and only ``obtained'' can be converted into kana-kanji. Therefore, the dictionary table For JT, ``gotta'' is obtained as shown in Figure 1θ.

Finally, in 88, if there is no next clause in the table HT, the process advances to S9, where the converted words shown in FIG. 8 and the converted words shown in FIG. 10 are output as candidate words to the CRT 8 and displayed. .

Although the above embodiments have been described with respect to a kana-kanji specification input method, it is clear that the present invention can also be applied to a bunsetsu specification input method.

[Effects] As explained above, according to the present invention, by simply inputting ordinary characters without inputting persistent sounds or consonant sounds, it is possible to convert them into kanji with persistent sounds or consonant sounds, making it possible to input quickly. can do.

[Brief explanation of the drawing]

FIG. 1 is a diagram showing an example of a configuration for achieving the present invention, FIG. 2 is a schematic configuration diagram of an embodiment of a character processing device according to the present invention, and FIG. 3 is a diagram showing a specific key arrangement of a keyboard. 4 is a flowchart showing the character processing procedure according to the present invention, FIG. 5 is a diagram showing the display contents of the CRT, FIG. 6 is a diagram showing the contents of the phrase conversion table, and FIGS. 7 and 9. FIG. 8 and FIG. 1O are diagrams showing the contents of the dictionary table. l...Microprocessor, 2...Address bus, 3...Data bus, 4...Control bus, ゛5...Keyboard, 5A...Enter key-1 5B...Movement key, 5G... Kanji position specification key, 5D... Conversion key, 6... Keyboard controller, 7... CRT controller, 8... CRT display device, 8... Display controller, 10... Character Generator, 11... Refresh memory, 12... Refresh memory controller, 13... Read only memory, 14... Controller, 15... Random access memory. Patent Applicant Canon Co., Ltd. Representative Patent Attorney Yoshi Tani - E F m day Fig. 4]9 ]] - Fig. 5 Fig. 6 Fig. 7 Fig. 8 Fig. 9 Fig. 10

Claims (1)

[Scope of Claims] An input means for inputting characters, etc.; a discrimination means for discriminating a character that becomes a consonant or a consonant from information input without inputting a consonant or a consonant by the input means; Based on the determination result, characters that can be converted into a persistent sound or a consonant among the information inputted by the input means without being input as a persistent sound or a consonant are converted into two types: ordinary characters and a persistent sound or a consonant. , conversion means for creating kana words that do not include a persistent sound or a consonant and kana words that include a persistent consonant or a consonant. (Hereafter, margin)