JP2862236B2 - Character processor - Google Patents

Description

Description: TECHNICAL FIELD The present invention relates to a character processing device for inputting, inputting, and editing characters mixed with kana-kanji characters. [Prior Art] Conventionally, input methods such as a touch type method and a kana-kanji conversion method have been devised as a method for inputting Japanese sentences mixed with kana-kanji characters. The touch type method is a method in which each kanji is coded by a unique sequence of keys on a keyboard, and the kanji is directly input by operating a corresponding key. Although it is necessary to memorize all the codes of each kanji, there is an advantage that the kanji input is variable at a high speed when mastered. The kana-kanji conversion method is a method in which a reading corresponding to a kanji is input and an operator selects a target one from displayed candidates. If you know how to read kanji, you can enter it immediately, so you have the advantage that learning is very fast. [Problems to be Solved by the Invention] However, these conventional systems have disadvantages. The touch-type method requires memorizing kanji codes, so it takes a long time to learn, and when the skill is not advanced, the input speed is slower than other methods (for example, the kana-kanji conversion method). Only after considerable training could they be used for daily work. That is, it was not possible to practice while using it for work. The kana-kanji conversion method is not a method of directly inputting unique kanji, but has a drawback that the input speed does not increase beyond a certain level because kanji is selected interactively. [Means and Actions for Solving Problems] To solve the above problems, according to the present invention, input means for inputting a kana-kanji mixed character string including kana and kanji to a character processing device And storage means for storing a character string mixed with kana kanji input from the input means, and separating a word reading and a kanji notation into readings of the word for each reading corresponding to each kanji in the kanji notation. Reference is made to dictionary means for adding and storing information and kana-kanji mixed notation obtained by expanding a part of the kanji of the kanji notation of the dictionary means into a corresponding reading based on the delimiter information. Conversion means for converting the kana in the kana-kanji mixed character string into a kanji reading the kana, wherein the kanji and the kanji consecutive to the kana form a kanji notation of one word. Kana Han The kana in the mixed character string is converted into a kanji reading the kana, and the kanji and the kanji following the kana form a kanji notation of one word. is there. EXAMPLES Hereinafter, the present invention will be described in detail with reference to the drawings. FIG. 1 shows an example of the overall configuration of the present invention. In the configuration shown in the figure, the CPU is a microprocessor, performs calculations for character processing, performs logical decisions, etc., and is connected to those buses via an address bus AB, a control bus CB, and a data bus DB. Control the components. The address bus AB transfers an address signal indicating a component to be controlled by the microprocessor CPU.
The control bus CB transfers and applies a control signal of each component to be controlled by the microprocessor CPU. The data bus DB transfers data between the components. Next, the ROM is a fixed read-only memory.
A procedure of control by the microprocessor CPU, which will be described later with reference to FIGS. The RAM is a writable random access memory having a structure of 16 bits per word, and is used for temporarily storing various data from each component. DIC is a dictionary and stores a correspondence table for converting words containing kana and kanji into kanji notation. IBUF is an input buffer for storing input kana-kanji mixed sentences. OBUF is an output buffer for storing the conversion sequence. BUNTB is a phrase table that stores phrases contained in the sentence mixed with the input kana / kanji. TBUF is a text buffer and is an area for temporarily storing document data being edited. KB is a keyboard. Alphabet key, hiragana key, katakana key and other character symbol input keys, and
It is provided with various function keys for instructing various functions for the character processing apparatus of the present invention, such as a conversion key. DISK is an external storage for storing document data and dictionary data, and stores created documents. The stored documents are called up when necessary according to keyboard instructions. The dictionary data is loaded into the area DIC on the RAM at an appropriate timing, and is referred to. CR is a cursor register. The CPU can read and write the contents of the cursor register. A CRT controller CRTC described later displays a cursor at a position on the display device CRT corresponding to the address stored here. DBUF is a display buffer memory for storing patterns of data to be displayed. The CRTC plays a role of displaying the contents stored in the cursor register CR and the buffer DBUF on the display CRT. The CRT is a display device using a cathode ray tube or the like, and the display pattern of the dot configuration and the display of the cursor on the display device CRT are controlled by a CRT controller. Further, CG is a character generator which stores character and symbol patterns to be displayed on the display device CRT. In the character processing device of the present invention including such components, the device operates according to various inputs from the keyboard KB, and when an input from the keyboard KB is supplied,
First, an interrupt signal is sent to the microprocessor CPU, which reads out various control signals stored in the ROM, and performs various controls according to the control signals. FIG. 2 is a diagram showing the usefulness of the present invention. In the figure, TS indicates a document screen, and MS indicates a monitor screen. The data input from the keyboard is once displayed on the monitor screen MS, and is displayed on the converted document screen TS. FIG. 7A is a diagram in which the operator inputs “traces the cause of a major accident” from the keyboard. Where "large"
"Things", "causes", and "traces" are entered by the touch-type method because the codes are stored. As for "san", "yu" and "tsuki", I wanted to directly input "miserable", "invitation" and "pursuit" with a touch type, but because I did not memorize the code, I had to read it. FIG. 4B is a diagram showing a state after a conversion key is input.
"San", "yu" and "tsuki" are "disaster" and "invitation" respectively.
Has been converted to "add". For example, "san" has many homonyms such as "san", "yama", "san", "san" and "san", but since the word "catastrophe" is registered in the dictionary, it is uniquely identified as "san". It was converted. FIG. 3 is a diagram showing a configuration of a dictionary (DIC). Each record stores a word and stores one word at 26 bytes (fixed length). The first 20 bytes of the record are the header. A word heading is stored in two bytes per character. Character code is JIS X 02
Stored in 08 code. The next four bytes are pointers. The address where the record having the kanji notation of the word exists is stored. For example,
"Large affair" points to the record of "Great catastrophe". The last two bytes are grammar information. For example, "no-san" is stored as a noun, and "tsutori" is stored as a noun. Fig. 4 shows input buffer (IBUF) and output buffer (OBUF).
FIG. 3 is a diagram showing the configuration of FIG. All keys input from the keyboard undergo code conversion by the touch type method, are converted to corresponding kanji, etc., and enter IBUF as JIS X 0208 codes. IBUF consists of 2 bytes per character, each character is JIS X 02
Described in 08D code. OFF H is filled in the last part where the input has not been completed yet. The configuration of the OBUF is the same as that of the IBUF. When the conversion is instructed, the contents of the IBUF are converted and stored in the OBUF, and then transferred in the text buffer (TBUF). FIG. 5 is a diagram for explaining the structure of the phrase table. The clauses of the sentence on the input buffer IBUF are parsed and stored on BUNTB. It is stored as 5 words per phrase from the phrase at the head of the input buffer. OFF H is filled after the last clause. The structure of each clause is shown below. The first word stores the phrase start position. The relative address from the beginning of the IBUF at the start of the clause is stored. For example, in the case of the phrase "large affair", an address corresponding to the position of "large" is stored. The phrase end position of the next one word is stored. The relative address from the beginning of the IBUF at the end point of the analysis is stored. For example, in the case of the phrase “Osansaku no”, an address corresponding to the position of “no” is stored. The next one word stores the number of characters of the independent word part at the head of the phrase. For example, in the case of the phrase “Osan-san”, “4” is stored since the independent word is “Osan-san”. The last two words store the address on the dictionary where the notation of the independent word exists. For example, if the phrase is "large sanji", the independent word is "large sanji" and its notation is "catastrophe"
Therefore, the address on the dictionary where the notation "catastrophe" exists is stored. FIG. 6 (a) is a diagram illustrating the passage of kana-kanji conversion. For the input "I'll trace the cause of the big things",
First, the phrase being input is analyzed, and the phrase is separated. The method of obtaining the delimiter includes a longest match method, a two-segment longest match method, a minimum number of clauses method, and the like, and can be arbitrarily selected. When the delimiter is determined, the kana part of each independent phrase is converted to kanji. (B) is an explanation when the longest match method is adopted as a way of separating phrases. First, the first segment of the input sequence is cut out. As a result, phrase candidates "large", "large" (personal name) "large" and "large" are cut out. Of these, the longest match, "Osansan", is adopted. Next, segmentation is performed subsequently. As a result, "Yu"("Yu")"Yu"("Tie""Evening")
“Yu factor” and “Yu factor” are cut out, and the longest matching “Yu factor” is adopted. Thereafter, the segment breaks are determined in the same manner. The operation at the time of the above will be described according to a flow. FIG. 7 is a flow chart of a portion for receiving a key input and performing processing. Step 7-1 is a process for taking data from the keyboard into the input buffer IBUF. If the conversion key data is included in the IBUF, the kana-kanji conversion must be performed, and the process proceeds to step 7-2. If not, a normal editing process is performed, so that the process proceeds to step 7-6. In step 7-2, as described in detail in FIG.
Split the input sequence into clauses above. In step 7-3, the input string divided in half as shown in FIG. 9 is converted into Chinese characters on the OBUF. In step 7-4, the conversion result created on the OBUF is output on the text buffer TBUF. Further, the conversion result output in step 7-5 is displayed. Steps 7-6 perform well-known processes such as cursor movement, character input, document storage, and the like in ordinary character processing devices, and a description thereof will be omitted. FIG. 8 shows the phrase dividing process in step 7-2 in detail. Step 8-1 is a variable initialization process. A variable i for monitoring the number of characters from the head of the input buffer IBUF being processed is initialized to i, and a variable j for managing the address of the phrase table BUNTB currently being created is initialized to 0. Step 8-2 checks if there are no more characters to process on the IBUF. Specifically, IBUF
Is determined based on whether the i-th character is OFF H. If I
If the BUF has been completed, the process proceeds to step 8-8, and the phrase table is closed. If the IBUF has not been completed, go to step 8-3. In step 8-3, all words starting from the i-th character of the IBUF are searched in order to check the possibility of any phrase that can be created on the input sequence. In step 8-4, all the accessory word strings leading to the searched word are analyzed. In step 8-5, the longest phrase candidate analyzed from the phrase candidates is determined. The longest phrase candidate determined in step 8-6 is registered in the phrase table. When registering, create from the j-th byte of BUNTB. After creation, the value of j is added by the number of created bytes, that is, by 10. In step 8-7, the value of i is added by the number of readings of the longest phrase currently processed, and the process loops to step 8-2. Step 8-8 is a process of closing the phrase table, and clears the byte after j indicated by BUNTB by OFFH. FIG. 9 shows the kanji conversion process in step 7-3 in more detail. Step 9-1 is a variable initialization process. A variable i for managing the number of clauses currently processed in the clause table BUNTB is initialized to 1. Also, a variable j that manages from which byte the output buffer OBUF should be created next.
Is initialized to 0. At step 9-2, it is checked whether or not the processing for all the phrases on the phrase table has been completed. Specifically, it is determined whether or not the i-th phrase in the phrase table starts with OFF H. If it is determined that the phrase has been completed, the flow advances to step 9-8 to close the output buffer. If the phrase is not over, go to step 9-
Proceed to 3. In step 9-3, the independent word portion in the phrase registered in the phrase table of the i-th phrase is converted into a kanji and output from the j-th byte of the output buffer OBUF. The method of conversion to kanji is a simple dictionary lookup, and the processing is clear from the dictionary configuration. In step 9-4, the output buffer pointer j is advanced by an amount corresponding to the output of the independent word part (independent word length × 2 bytes). In step 9-5, the kana part of the i-th phrase in the phrase table is output to the output buffer. In step 9-6, the output buffer pointer j is advanced by the portion where the sending kana part was output (sending kana length × 2 bytes). In step 9-7, the i-value is incremented by one, and the process proceeds to the next clause, and the process loops to step 9-2. Step 9-8 is a process for closing the output buffer. Specifically, the output buffer after the j-th byte is turned off.
To clear. [Other Embodiments] In the above description, the dictionary configuration covers all combinations of kana and kanji of each word as headings. For example, if it is "catastrophe", it should have all the headings "daisanji""daisanji""daisanji""daisanji""daisanji""catastrophe""catastrophe" Explained. However, it can be devised further. For example, a dictionary configuration as shown in FIG. 10 can be provided. At this time, the heading describes the notation of the word. In the pronunciation, the pronunciation of the word is described, and the delimitation of the pronunciation is described with “/”. The division information describes division information such as part of speech. With this configuration, the dictionary can be compactly realized. In terms of processing, the contents of the dictionary may be expanded at the time of searching the dictionary, and the search may be performed so as to take the matching. Further, the embodiment describes a method of converting kana in kana-kanji mixed with a kana-kanji input by the touch type method into kanji, but any application that converts a kana part of a sentence once into kanji can be used. It can be applied to such a thing. For example, it is also possible to configure a device that converts a document created using only kanji in the common kanji into a document that also uses kanji outside the common kanji. At this time, the dictionary mainly registers words using kanji other than common kanji. [Effects of the Invention] As described above, according to the present invention, a kana part of a word displayed in a mixture of kanji and kana can be accurately converted into a kanji in the kanji notation of the word using a dictionary having a small dictionary capacity. This has the effect.

BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a block diagram of the overall configuration of the present invention. FIG. 2 is a diagram showing the usefulness of the present invention. FIG. 3 is a diagram showing the configuration of a dictionary. FIG. 4 is an input buffer. FIG. 5 shows the structure of a phrase table. FIG. 6 shows the procedure for analyzing the phrase. FIGS. 7 to 9 show the flow of the operation of the character processing apparatus of the present invention. FIG. 10 is a diagram showing another embodiment of a dictionary configuration DISK ... external storage CPU ... microprocessor ROM ... read-only memory RAM ... random access memory DIC ... dictionary IBUF ... input buffer OBUF ... … Output buffer BUNTB …… Phrase table TBUF …… Text buffer

Claims (1)

(57) [Claims] Input means for inputting a kana-kanji mixed character string including kana and kanji; storage means for storing a kana-kanji mixed character string inputted from the input means; reading of words and kanji notation; Dictionary means for adding delimiter information to the reading of the word for each reading corresponding to each kanji in the notation, and storing the kanji in the kanji notation of the dictionary means based on the delimiter information. Referring to the expanded kana-kanji mixed notation, the kana in the kana-kanji mixed character string stored in the storage means is a kanji reading the kana, and the kanji and the kanji continuous with the kana are read. A conversion unit for converting a kanji notation of one word into kanji.