JPS608921A - character processing device - Google Patents

Abstract

PURPOSE:To process a character by inputting a ''KANA'' (Japanese syllabary) at a high speed, by determining forcibly a proposed example Chinese character word of the same sound contained in a character processing output sentence so as to give a room, when a room of a storage area in a memory device has gone. CONSTITUTION:A ''KANA'' character sentence is inputted successively by operating a key, and subsequently, whether a ''KANA''-Chinese character conversion should be started or not is discriminated. In case of starting it, whether there is a room in a storage area of the same sound word buffer DOBUF or not is discriminated by a flag, and in case when there is no room, the first same sound Chinese character word in the same sound Chinese character word group converted and generated first, which is stored in the head storage area BODY in the buffer DOBUF is selected forcibly as a converted output Chinese character word of the corresponding ''KANA'' character input, inserted by replacing it with the same sound proposed example Chinese character word surrounded by a frame in a character processing output, and determined as the converted output Chinese character word. Subsequently, the area BODY is retrieved and secured, and thereafter, the ''KANA''-Chinese character conversion is executed.

Description

[Detailed Description of the Invention] (Technical Field) The present invention relates to a character processing device that performs character processing by converting input kana characters into kanji, and particularly when it is not possible to convert input kana characters into a specific kanji word. This allows the character processing process to proceed smoothly even when there is no more room in the storage area of a memory device that temporarily stores a plurality of homophone kanji words.

(Prior art) In general, the kana-kanji conversion input method in character processing systems that creates sentences containing kanji as character processing output has the advantage of allowing any operator to input at high speed; Since there are multiple homophone kanji words for , it has the disadvantage that l-to-many conversion is unavoidable. Therefore, the operator performs kana-kanji conversion on the kana characters input by the operator, selects the desired (ko) kanji part from among the generated multiple homophone kanji words, and inserts it into the character processing output sentence. This will complete the required character processing.

Conventionally, various processing methods are known for processing such homophone kanji parts.

One of these processing methods is to limit the homophone candidate kanji side that exists in the character processing output sentence in response to the input of kana characters to one, This processing method inserts the same-sounding kanji into the processing output sentence only immediately after the homophone kanji part is converted and generated. According to this processing method, the homonym kanji part corresponding to the kana character input is finally determined. The buffer memory, that is, the homophone kanji part temporarily stored in the homophone buffer, is limited to the homophone kanji part immediately after conversion, and the capacity of the homophone buffer is limited to one homophone kanji part. This has the advantage of simplifying the processing process, but the operator
You must always keep an eye on the congruent kanji parts that are sequentially converted and displayed in response to the input of kana characters, and decide immediately after conversion whether or not to insert them into the character processing output sentence as the homophone candidate kanji side. First, there is a drawback that the operation of inputting kana characters cannot be performed smoothly due to the hassle of selecting the agreeable kanji characters.

In other processing methods, multiple homophone kanji parts are allowed to exist in the homophone buffer, and the converted homophone kanji part is temporarily stored undetermined before inputting subsequent kana characters. However, when the storage area of the homophone buffer runs out, the operator can determine the desired kanji portions for each of multiple sets of homophone kanji portions and extract those homophone kanji portions from the homophone buffer. Unless it disappears and the homophone buffer is released, subsequent kana character input is prohibited. According to this processing method, if there is room in the t@ area of the homophone buffer, continuous input of front name characters is possible, but when the piping area of the homophone buffer is used up, input of kana characters is prohibited. This has the disadvantage that smooth kana character input operations are hindered.

(Objective of the Invention) The object of the present invention is to eliminate the above-mentioned conventional drawbacks, and select a desired kanji part from homophone kanji words that are sequentially generated every time kana-kanji conversion is performed for input kana characters. Character processing that allows you to smoothly continue inputting kana characters without having to perform the required kana-kanji conversion at any time if you frequently need to continue inputting kana characters. Our goal is to provide equipment.

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

First, an example of the configuration of the character processing device of the present invention is shown in FIG.

In the illustrated configuration, the CPU is a microprocessor that performs calculations for character processing, performs logical judgment cycles, and connects each component to these paths via an address bus AB, a control bus OB, and a data bus DB. Control elements.

Address bus AB transfers address signals indicating the components to be controlled by the microprocessor CPU. The control bus OB transfers and applies control signals for each component to be controlled by the micro<S> processor CPU. The data bus DB transfers data between each component device.

Next, the ROM is a read-only fixed memory, and stores control procedures and the like by the microprocessor CPU, which will be described later with reference to FIG.

Further, the RAM is a writable random access memory having a configuration of 1 word and 76 bits, and is used for temporary storage of various data from each component. Of this random access memory RAM, TBUF is a text buffer that stores document data that has been created or is being created, and DOBUF is a homophone buffer that stores multiple homophone kanji parts corresponding to input of kana characters. temporarily memorize.

KB is a keyboard, which includes character symbol input keys such as alphabet keys, hiragana keys, and katakana keys, and various function keys for instructing various functions to this character processing device, such as kanji part start/end designation keys. It is equipped with

The DISK is a memory for storing fixed-form documents (6) and stores the created documents, and the stored documents can be recalled when necessary by instructions from the keyboard.

This is a 0R1d cursor register, and the contents of the cursor register can be read and written by the CPU. A CRT controller CRTC, which will be described later, displays a cursor at a position on the display device CRT corresponding to the address stored here.

DBUF is a buffer memory that stores document information etc. input from the keyboard KB.

0RTO is cursor register OR and buffer DBUF
It plays the role of displaying the contents stored in the CRT on the display device CRT.

Further, a CRT is a display device using a cathode ray tube or the like, and a dot-configured display pattern and a cursor display on the display device CRT are controlled by a CRT controller.

Furthermore, CG is a character generator, which generates character signals such as characters, symbols, and cursors to be displayed on the display device CRT.

The character processing device of the present invention, which is comprised of such components, operates in response to various inputs from the keyboard KB. C.P.
The microprocessor CPU reads various control signals stored in the ROM, and various controls are performed in accordance with these control signals.

Next, referring to FIGS. 2A to 2C, an outline of the operation of the character processing apparatus of the present invention having the configuration shown in FIG. 7 will be explained.

Figure 2A shows the display screen of the display device (3RT) during text creation, displaying the kana-kanji conversion output sentence corresponding to the already input kana character string, and the monitor installed at the bottom of the display screen. The line MA displays the input kana characters before kana-kanji conversion.For example, the kanji specification method is used for kana-kanji conversion, and the kana character string to be converted to kanji is enclosed in curly brackets (). It is shown by .

However, in the kana-kanji conversion output text on the display screen, the kanji words shown surrounded by frames are the homonym candidate kanji words that are determined to be the most suitable kanji word in the processing process among the multiple homonym kanji words corresponding to the input of kana characters. As such, it is displayed in a special display format, for example, at a lower brightness than others. In addition, for those homophone candidates, the homophone buffer DOB
Corresponding storage areas are secured in the UF, and all other homophone kanji words corresponding to the same kana character string are temporarily stored. That is, in Figures C and A, the input kana character string "
The display screen is shown in a state where the kana-kanji conversion process for the kana character string (tachiba) from (tachiba) to ('' is started.

However, since the homophone buffer DOBUF has only a limited storage area, there is a limit to the number of homophone kanji words that can be temporarily stored.For example, if only 10 homophone kanji groups can be temporarily stored at the same time, is already 70 in the illustrated example.
Since the homophone kanji word group of the set is temporarily stored in the homophone buffer DOBUF K, it is not possible to deal with the need to temporarily store the homophone kanji word group corresponding to (tachiba) displayed on the monitor line HA. There will be no.

(W) Therefore, in the character processing device of the present invention, among the 70 groups of homophone kanji words already temporarily stored in the homophone buffer DOBUF, the homophone candidate kanji words converted and temporarily stored first are: Forced final choice/adoption
For example, in the character processing process, the homophone buffer 1) OB is determined to be optimal for inputting kana characters.
The monitor line M
The storage area for the new homophone kanji word group corresponding to the kana character input (Tachiba) displayed in A is the homophone buffer DOB.
It can be secured in the UF, and the character processing process can continue to proceed.

As a result, the character processing output sentence on the display screen is
As shown in the figure, at the same time as the display of the kana character string to be converted on the monitor line MA disappears, the frame for the earliest homophone candidate kanji word "adoption" is removed. C
As shown in the figure, a new homophone candidate kanji word 匡I corresponding to (tachiba) is inserted (/θ).

Next, examples of how data is stored in the text buffer TBUF and the homophone buffer DOBUF are shown in FIGS. 3A and 3B, respectively. The text buffer TBUF shown in Figure 3A is a buffer memory that temporarily stores document data that has been created or document data that is being created. memorize it. In addition,
The homophone kanji word for the kanji word in the document data is 3B
It is temporarily stored in the homophone buffer DOBUF shown in the figure. In the illustrated example, the homophone buffer DOBUF has 10 storage areas, and each storage area has a fixed length format.

Further, at the beginning of each storage area, there is a flag bit BFLG indicating whether the storage area is in use or empty, and stores "1" if the storage area is in use, and stores "OII" if it is empty.

Each code of a homophone kanji word group has a storage area BODY that lasts σ1
K is stored, and a delimiter is inserted between each homophone Kanji word.

Next, FIG. 1I shows a flowchart of a series of operations in the character processing apparatus of the present invention from inputting kana characters by key operations on the keyboard KB to obtaining character processing output sentences. Note that when the device of the present invention is powered on, various buffer memories are initialized, and in particular, the homophone buffer DOB
Regarding UF, all 7 lug BFLGs in use are “O”
Keep it.

In the illustrated flowchart, first, step S/
In step S2, it is determined whether kana-kanji conversion should be started or not, and if kana-kanji conversion is not to be performed, step S3 is performed. , and perform other required character processing.

On the other hand, if kana-kanji conversion should be started, step S
! Shifting to I, it is determined whether the storage area of the homophone buffer 1) OBUF has enough space, that is, whether there is a flag bit BFLG of "0" preceding each storage area BODY. In that case, the homophone buffer DOBU
If there is enough space in the memory area of F, the process immediately moves to step S7; if there is not enough space, first the homophones are stored, since if the input kana characters have multiple homophone kanji words, the progress of subsequent character processing will be hindered. Memory 1 in buffer DOBUF? We move on to the process of providing a margin in the r region.

That is, proceeding to step Sj, the homophone buffer D
The first homophone kanji word in the group of homophone kanji words that was converted and generated first is stored in the first storage area BODY in OBUF,
It is forcibly selected as the converted output kanji word for the corresponding kana character input, and as shown in Figure 2, a frame is placed in the sentence in place of the homonym kanji word shown in brackets in the character processing output sentence. The kanji word is inserted without any addition, and is finally determined as the converted output kanji word for that kana character. Specifically, the forcibly selected homophone kanji word is inserted into the position indicated by the pointer in the character processing output sentence, and the kana-kanji conversion for the kana character input is completed, and in step SX, the homophone kanji word is inserted. The storage area BODY in which the group was stored is released and the flag bit BFLG is set to "O".

Then, in step S7, the homophone buffer DOBUF
The flag bit BFLG in ``O'' (13) searches for and secures a usable storage area BODY, then moves to step sr, performs kana-kanji conversion for the kana character input at that time, and converts the kana character input at that time. As a result, when multiple homophone kanji words are generated, the new group of homophone kanji words is temporarily stored in the storage area BODY in the homophone buffer DOBUF secured in step S7, and the flag bit BFLG is set to "1". At the same time, one homophone Kanji word in the homophone Kanji word group is enclosed in a frame as a homophone candidate Kanji word and inserted into the character processing output sentence, and the kana-kanji conversion at that time is temporarily completed. Note that if the kanji word generated by the kana-kanji conversion at that time is a single kanji word, the single kanji word is directly transferred to the text buffer TBUF without the need for homophone processing.
, and write it into the character processing output sentence to complete the character processing for the kana character input at that time.

In the above explanation, the kana-to-kanji conversion is performed using the kanji specification method, but similar kana-to-kanji conversion can also be performed by, for example, the bunsetsu specification method.

(/gu) Also, the homophone buffer DOB temporarily stores homophone kanji words.
It has been explained that the UF and the text buffer TBUF that stores the document body are provided in separate storage areas in the random access memory RAM, but they are managed as a common system buffer memory along with other buffer memories, and the common The system buffer memory can also be fluidly allocated and used as a homophone buffer, text buffer, or other buffer memory as needed.

In addition, in the above case, if it becomes impossible to allocate a homophone buffer in the system backup memory, in addition to freeing the storage area that stored the earliest homophone kanji word group by the same forced selection as described above, For example, by deleting 7 lines of character processing output sentences from the storage area used as a text buffer, you can free up 1 line for the homophone buffer, or free up other buffer memory areas. You can also use K to release it as well.

In addition, in the above explanation, seven homophone buffers are allocated to one homophone Kanji word group, but it is also possible to subdivide the storage area of the homophone buffer or use a non-fixed format. By making the number of homophone buffer memory areas allocated to one set of homophone kanji words undefined, when the memory area of the homophone buffer is insufficient, the number of homophone buffer memory areas allocated to one group of homophone kanji words is set to be sufficient for kana-kanji conversion in the character processing process. It is also possible to perform forced selection as described above for a plurality of groups of homophone kanji words until the above is secured.

In addition, in the above explanation, it is assumed that the homophone kanji word group targeted for forced selection as described above is converted and generated first. What is expected to cause the least amount of trouble,
It is also possible to do this.

Furthermore, in the above operation explanation, it was mentioned that the homophone buffer memory area must be secured before starting the kana-kanji conversion, but if it becomes necessary to use the homophone buffer as a result of the kana-kanji conversion, It is also possible to reserve a back-up memory area for homonyms only when the homonyms are selected by forced homonym selection.

(Effects) As is clear from the above explanation, according to the present invention, each time a kana-kanji conversion is performed on a kana character inputted by a character processing device, selection work or final decision on a plurality of agreeing kanji words is avoided. To smoothly continue inputting kana-kanji while continuously performing kana-kanji conversion until the creation of a converted output document is completed without being affected, and to perform comfortable and high-speed manual character processing of kana characters. I can do it.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing a configuration example of the character processing device of the present invention; FIGS.
Figures 3A and 3B are diagrams showing examples of how character processing output sentences and homophone kanji word groups are stored in the text buffer and homophone buffer, respectively, and Figure 3 is an example of how the character processing works. It is a flowchart which shows. (/7) CPU...Microprocessor, AB...Address bus, OB...Control bus, DB...Data bus, ROM...Fixed memory, RAM...Random access memory, TBUF...
Text buffer, DOBUF...homophone buffer, KB...keyboard, DISK...disk memory, OR...cursor register, DBUF...backup memory, 0RTO...cathode ray tube display controller, CRT・
・・Cathode tube display, CG・Character generator. Patent applicant: Canon Co., Ltd.

Claims (1)

[Claims] In a character processing device that performs character processing by converting input kana characters into kanji, one of a plurality of homophone kanji words obtained when input kana characters cannot be converted into a specific kanji word. a synonymous word insertion means for inserting the homophone candidate Kanji word in a character processing output sentence in a special display format as a homophone candidate Kanji word; a homophone conversion means for converting the homophone to one of the plurality of homophone Kanji words, and a homophone forced determination means for forcibly determining the homophone candidate Kanji word in the character processing output sentence to one of the plurality of homophone Kanji words as required in the character processing process. , when a memory device temporarily storing the plurality of consonant kanji words runs out of storage space during the character processing process, the homonym candidate kanji word in the character processing output sentence is forcibly determined by the homophone forced determination means; Then, the plurality of (1) agreeable Kanji words corresponding to the agreeable candidate Kanji words are deleted from the memory device to free up a storage area.