JP2603269B2 - Character processor - Google Patents

Description

Description: TECHNICAL FIELD The present invention relates to a character processing apparatus capable of creating and editing a document, and more particularly to a character processing apparatus capable of converting a single input character string in consideration of fluctuations in Japanese notation. The present invention relates to a character processing device capable of searching for a character string having the same meaning as the above-mentioned input character string but having a different writing style, and converting the character string according to the input character string.

[Related Art] The way of expressing a foreign word varies from person to person, and a long sound may be added at the end of “computer” or a long sound at the end of “computer” may be omitted. When using both "chi" and "tay" such as "romantic" and "romantic", "developer" and "developer" by writing in a manner similar to the original pronunciation, and using both "de" and "day" There is.

On the other hand, recent character processing devices have adopted a batch conversion method in which all words are entered in Hiragana or Roman characters, instead of shifting to Katakana as in the past, even in Katakana notation. Even the conversion is performed via the dictionary at a glance.

"Problems to be solved by the invention" Regarding such fluctuation of notation, it is not possible to have all writing methods due to the limitation of memory capacity. There has been a problem that only dictionary headings can be converted, and correct conversion results cannot be obtained unless input is performed as stored in the dictionary memory.

As described above, the object of the present invention is to have only one notation method in the dictionary memory, and to improve the dictionary search so that characters having the same meaning but different writing style for one input character string can be obtained. It is an object of the present invention to provide a kana-kanji conversion device in which the capacity of a dictionary memory is reduced and the kanji-kanji conversion device is improved in operability by matching and outputting columns.

[Means and Actions for Solving Problems] In order to solve the above problems, the character processing apparatus of the present invention includes a dictionary unit for storing a notation corresponding to a reading, and an input unit for inputting a reading kana. Reading processing means for processing the reading kana input by the input means based on a predetermined rule; first searching means for searching the dictionary means by the reading kana input by the input means; First
A second searching means for searching the dictionary means by using a reading pseudonym processed by the reading processing means when a notation corresponding to the reading inputted by the searching means is not searched; Means for processing, when a katakana notation corresponding to the reading processed by the reading processing means is searched, processing the searched katakana notation so as to correspond to the input reading; And output means for outputting the katakana notation processed by the means or the notation searched by the first search means. When the notation corresponding to the reading cannot be searched, the dictionary means is searched by the reading kana which is obtained by processing the input reading kana based on a predetermined rule, and When katakana notation corresponding to reading which is retrieved and processed to the retrieved Katakana so as to correspond to the inputted read, and outputs the processed katakana.

Embodiment An embodiment according to the present invention will be described below in detail with reference to the accompanying drawings.

FIG. 1 shows an example of the configuration of a character processing apparatus according to the present invention. Here, a CPU is a microprocessor, which performs calculations and logical judgments for character processing, and performs an address bus AB, a control bus CB, and a data bus. Control each component connected to those buses via DB. The address bus AB transfers an address signal indicating a component to be controlled by the microprocessor CPU. Control bus CB
Transfers and applies a control signal of each component to be controlled by the microprocessor CPU. Data bus
The DB transfers data between components.

The ROM is a fixed read-only memory, and stores control procedures and the like by the microprocessor CPU. R
AM is a writable random access memory having a structure of / word / 6 bits, and is used to temporarily store various data from each component.

 INBUF is in RAM and contains the input character string.

 OUTBUF is in RAM and contains the converted characters.

Dic is in ROM and consists of YF reading field, KF Kanji field, and HF part-of-speech field.

KB is a keyboard in which various key groups for inputting and instructing various data in the character processing device are arranged.

CR is a cursor register, which is a memory for writing and reading data relating to the position of the cursor under the control of the microprocessor CPU, and stored in the cursor register CR under the control of the CRT controller CRTC. Move the cursor to the display position on the CRT display surface corresponding to the address and display it. In the present invention, the display surface is assumed to correspond to a document page, and the display position on the display surface corresponds to the line and column of each document. Further, each page is based on a document having the same number of lines.

The PRT is a printer and prints the contents of the DBUF under the control of the microprocessor CPU.

DBUF is a data buffer, a memory for storing document information input from the keyboard KB, and is displayed on the CRT controller CRTC. The buffer memory DBUF is used as a refresh memory for the display device CRT, and can be freely read and written by the microprocessor CPU. This data buffer DBUF is 10 × 5W (W: word,
It has a capacity of 1W (one character) and is displayed on the display device CRT. The display of characters and the like is a display of 10 horizontal characters and 5 vertical lines, and is sequentially associated with the contents of 50 words of the data buffer DBUF. Data to be stored in the data buffer DBUF is numbered sequentially from 1 to 50, the first data being DBUF (1), the next being DBUF (2), and the Nth data being generally expressed as DBUF (N). I do. The CRT controller CRTC controls the display of the cursor and the display pattern on the display surface of the display CRT based on the cursor position and the character / symbol code signal stored in the cursor register CR and the data buffer memory DBUF. The CRT is a display device using a cathode ray tube or the like, and the display pattern of the dot structure and the display of the cursor on the display device CRT are controlled by a CRT controller. Furthermore, C
G is a character generator for generating character signals such as characters and a symbol cursor to be displayed on the display device CRT. Each character and symbol has a dot structure of, for example, 16 × 16. DISK is an external memory for storing created documents.

The operation of the present embodiment based on the above configuration and operation concept will be described with reference to a flowchart.

FIG. 2 shows an example of a control procedure according to the embodiment of the present invention. Second
In the figure, when the power is turned on, in step s1, the contents of the dictionary read from the external storage device are written in the random access memory RAM. In step s2, a state of waiting for a key input from the keyboard KB is maintained. When the key is pressed, the process proceeds to step s3, where the input key is determined, and either a kana-kanji conversion process or another process is performed according to the determination result. In step s4, when characters are input and Kana-Kanji conversion is selected, a process of converting the sentence into Kanji-Kana mixed sentences is performed. The details of this processing procedure are shown in FIG. In FIG. 3, for each character string cut out in word units, a dictionary search is executed in step s41. As shown in FIG. 4, the configuration of the dictionary Dic includes a word reading field YF, a kanji field KF, and a part-of-speech field HF. After the dictionary search is executed in step s41 in FIG. 3, the process proceeds to step s42 to check whether a word exists in the dictionary Dic.
If there is, the process proceeds to step s421, and the information in the kanji field KF of the corresponding word is stored in OUTBUF. If the word does not exist, the process proceeds to step s43 to check whether the word ends with a long sound. If it is not a long sound, the flow advances to step s44 to set the long sound again in the INBUF, and the flow advances to step s45 to execute the dictionary search again. If it is determined in step s43 that the last sound is a long sound, the flow advances to step s431 to set the contents of INBUF as it is in OUTBUF.

In step s46, a dictionary search is performed to determine whether or not a word exists, with a long tone added to the end of the character string in INBUF. If the word exists, the process proceeds to step s461 to set the form of taking the last long tone from the contents of KF in OUTBUF. If it is determined in step s46 that the word does not exist, the flow advances to step s47 to check whether or not "TAY" exists in the INBUF. If there is no "TAY", the flow advances to step s471 to write the contents of INBUF directly to OUTBUF. If it is determined that “TAY” exists, proceed to step s48, and INB
Replace "tay" with "chi" in UF. At step s49, a dictionary search is performed in a state in which "TAY" in INBUF is replaced with "HI". If it is determined in step s50 that there is a word in the dictionary, the process proceeds to step s51, where "HI" in KF is replaced with "TAY" and set in OUTBUF. If it is determined that the word does not exist, the flow advances to step s471 to write the contents of INBUF to OUTBUF.

Through the above processing, even if the input character string has a different notation from the contents in the dictionary memory, it is possible to match the notation in the dictionary memory and output the conversion result in accordance with the input character string.

In FIG. 2, as a result of the key discrimination in step s3, the process proceeds to step s6 except for the conversion process. After the conversion process is executed in step s4, the display process is executed in step s6.

In the present invention, the contents of OUTBUF may be displayed, but the display means is publicly known and will not be described here.

In the present embodiment, a foreign language with katakana notation has been particularly described, but the problem of notation fluctuation is not only a foreign word but also a `` triangle '' as `` sankakukei '' and `` sankakei '',
"Aquarium" is also called "Suizokan" and "Suizokan".

In this case, by improving the dictionary search taking into account the regularity that "ku" follows "ku" followed by "ka line", even if the reading as the input character string is not in the dictionary memory, correct A conversion result can be obtained.

[Effects of the Invention] As described above, according to the present invention, even if the katakana notation corresponding to the input reading is not registered in the dictionary, the input reading may be substantially changed due to the fluctuation of the notation. If the same katakana notation exists in the dictionary, it is assumed that the katakana notation corresponding to the input reading exists.
There is an effect that the input can be converted into katakana notation as read.

In addition, this allows the operator to input the reading without being aware of the fluctuation of the katakana notation, so that the operability of the input is improved.

Also, even if the katakana notation fluctuates, it is not necessary for the dictionary to cover all the notations in order to convert to each notation, and it is sufficient to register any one of them. Therefore, the dictionary can be configured flexibly, and the memory capacity of the dictionary can be saved.

[Brief description of the drawings]

FIG. 1 is a block diagram showing an embodiment of the present invention, FIG. 2 is a flowchart showing a process of the present invention, FIG. 3 is a flowchart of dictionary search in an embodiment of the present invention, and FIG. 4 is an embodiment of the present invention. Dic is a word dictionary YF is a reading field in a word dictionary KF is a notation field in a word dictionary HF is a part-of-speech field in a word dictionary Batuhua

Claims (1)

(57) [Claims] 1. A dictionary means for storing a notation corresponding to a reading, a force means for inputting a reading kana, a reading processing means for processing a reading kana inputted by the input means based on a predetermined rule, First search means for searching the dictionary means based on the reading kana input by the input means; and if the notation corresponding to the reading input by the first search means cannot be searched, the reading processing is performed. A second means for searching the dictionary means using the reading kana processed by the means.
When the second search means searches for the katakana notation corresponding to the reading processed by the reading processing means, the searched katakana notation corresponds to the input reading. A character processing apparatus comprising: a notation processing means for processing; and an output means for outputting katakana notation processed by the notation processing means or a notation searched by the first search means.