JPH02250148A - Character processor - Google Patents

Abstract

PURPOSE:To improve the conversion efficiency by displaying a KANJI (Chinese character) candidate of the same sound word which is brought to KANA (Japanese syllabary)/KANJI conversion in a divided sentence clause, selecting a desired KANJI candidate from among the KANJI candidates of the same sound word which are displayed, and storing a combination of this KANJI candidate and its adjacent sentence clause. CONSTITUTION:When a change instruction key of the same sound word is inputted, a position in which a cursor exists at present is discriminated and the same sound words are enumerated and displayed on a CRT display device 5, and from among them, a desired same sound word is selected. Subsequently, whether the same sound word of a first candidate is selected or not is checked, and when it is not first ranking, whether each pair of the same sound word saved in first ranking of the same sound word buffer and its previous and next sentence clauses exists as example learning data in a memory 11 for example learning or not is checked. When an example learning area exists, two of a pair of a word of the sentence clause immediately before and the same sound word of a result of change, and a pair of the changed same sound word and the same sound word continued from its same sound word are stored in the memory 11 for example learning. In such a way, a learning processing of an example can be executed effectively, and a KANA/KANJI conversion processing can be executed with high conversion efficiency.

Description

DETAILED DESCRIPTION OF THE INVENTION [Industrial Application Field] The present invention relates to a character processing device that processes Japanese, and particularly to a character processing device that creates correct sentences in kana-kanji conversion processing.

[Description of the Prior Art and its Problems] Conventionally, there have been character processing devices that perform kana-kanji conversion using examples when inputting Japanese sentences.

This type of character processing device has an example dictionary that has bare examples between adjacent phrases in the phrases that make up a sentence, and in the kana-kanji conversion process, each candidate for adjacent phrases has a usage example dictionary in the example dictionary. It is checked whether or not there is a combination of candidates, and if there is a combination, it is output first.

[Problems to be Solved by the Invention] However, in the conventional character processing device having the above-mentioned example dictionary, there are extremely many combinations of examples actually used, and it is necessary to store all of these examples in the example dictionary in advance. It is uneconomical to keep them in place. In addition, to deal with this, only the most frequently used examples are written in the example dictionary.1. Is there a character processing device that is configured like this?The trends in usage vary depending on the field of writing, and
), it is known that there are changes in usage with the 5th generation, and it is not possible to deal with such cases, and there is a limit to the improvement of the conversion rate using a usage dictionary.

[Means and effects for solving the problem] A character processing device according to the present invention has been made to solve the above problems, and includes an input means for inputting a kana character string, and an input means for inputting a kana character string. a storage means for storing the kana character strings stored in the storage means; a dividing means for dividing the kana character strings stored in the storage means into clauses; and performing kana-kanji conversion on the kana character strings stored in the storage means. a conversion means; a display means for displaying homophone kanji candidates converted into kana-kanji by the conversion means in the passage divided by the division means; and a display means for displaying homophone kanji candidates from among the homophone kanji candidates displayed by the display means. a selection means for selecting a desired kanji candidate; when the desired kanji candidate is selected by the selection means;
It has example storage means for storing combinations of the selected Kanji candidate and adjacent clauses.

[Embodiment 7] A character processing device according to an embodiment of the present invention will be described below with reference to the drawings.

FIG. 1 is a block diagram of a character processing device according to an embodiment.

Reference numeral 1 denotes a CPU consisting of a microprocessor that controls the entire device and performs example learning processing, which will be described later. 2 is a keyboard controller KBC that controls the keyboard 3; 3 is a keypad FKBD comprising a group of keys such as character keys and function keys. 4 is a CRT controller that controls the CR7 display device 5; 5 is a CRT display device capable of displaying characters such as Kanji characters converted into Kana-Kanji characters; 6 is an FDD controller that controls a floppy disk device 17 which is an external storage device, and 7 is a floppy disk device BFD which is an external storage device for storing edited document data, etc. be. Reference numeral 8 denotes a ROM (ROM) that stores control programs for the CPUI, control data, dictionaries, etc., such as an example learning processing program to be described later.
9 is a kana-kanji conversion input buffer 9a, a kana-kanji conversion output buffer 9b, a reading delimiter buffer 9c, a notation delimiter buffer 9d, a homophone buffer 91, 92, 93, . . . 9N, and other CPs.
This is a RAM (Random Access Memory) having a work area of U. 1o is an example dictionary, and 11 is a rewritable memory for example learning.

The example learning process for character IA embedded ruled lines having the above configuration will be explained based on the flowcharts shown in FIG. 2 and subsequent figures.

First, when a key input is performed using the KBD 3, the keyboard KBD input process shown in FIG. 2 is executed. In this process, different processes are performed depending on the input data. If character data is input, the input character data is stored in the kana-kanji conversion input buffer 9a of the RAM 9 in step S1. If a key, such as a punctuation mark key or a conversion key, is input to start the kana-kanji conversion process, the process moves to step 2 and performs the kana-kanji process on the character data stored in the kana-kanji conversion input buffer 9a. This kana-kanji conversion process is as shown in the flowchart of FIG. That is, in step 2a, the character data string in the kana-kanji conversion input buffer 9a of the RAM 9 is divided into phrases using the two-clause longest match method, and the delimiter data of the kana readings of the character pigs of the divided phrases are read. Then, the delimited data resulting from the conversion is put into the notation delimiter buffer 9C. The kana/asagaku mixed sentence data that is the result of the kana/kanji conversion in step 2b is the conversion result output Huffer 9
Put it in d. Further, homophones are input into the homophone buffer 91, 92, 93, . . . in order from the first clause. Therefore,
Each homophone buffer will typically store multiple homophones. Next, in step 2c, step 2a
Check whether there is an example between each clause divided by . This is a process of examining examples stored in the example dictionary 10 and examples stored in the example learning memory 11 which stores examples that have already been used. As a result of checking whether there is an example in step 2C, if there is an example, the process moves to step 2d and step 2e. In step 2e, the contents of the kana-kanji conversion output huffer 9b are changed so that the example is output preferentially, and the kana-kanji conversion process is ended. Further, if there is no example in step 2d, the kana-kanji conversion process is immediately terminated.

Then, returning to the process shown in FIG. 2, if the input is by cursor movement keys, normal cursor movement processing is performed in step 4. If other keys are input, then in step 5, each process corresponding to the key input is performed.

When the homonym change instruction key is input, the current cursor position is determined in step 3 to determine which homophone buffer the phrase corresponding to is to be changed, and the homonym is displayed on the CR7 display device 5. The desired homophone is displayed as a list and the desired homophone is selected from among them. Since the homophone buffer stores the homophones in order from the first output, it can be determined whether the selected homophone is the first candidate. In step 6, it is checked whether the first candidate homophone has been selected, and if it is in the first rank, the selection process is directly terminated.

If it is not in the first rank, proceed to step 7, and each bear of the homophone and the clauses before and after it stored in the first rank of the homophone buffer changed in step 3 is stored as example learning data in the example learning memory. Check whether it exists in 11.

A method for specifically checking the existence of an example is a well-known matching search method, so the details thereof will be omitted. If it is found in step 7 that the example learning data exists in the example learning memory 11, the process moves to step 8, where the example data is deleted, and the process moves to the next step 11. On the other hand, if the example learning data does not exist, the process moves to step 9, and it is checked whether or not there is an example learning area in the example learning memory 11. If not, the process moves to step 1O, deletes the oldest example learning data, creates a learning area, and then proceeds to the next step 11. If there is a usage example learning area, proceed directly to step 11, and change the resulting homophone and the output homophone of the homophones before and after the phrase of the homophone and bare, that is, the word of the previous phrase. The resultant homophone bear and the bear figure of the changed homophone and the homophone following the changed homophone are stored in the example learning memory 11.

In the above explanation, we have shown the case where the process is simply carried out for divided clauses, but in general, a clause consists of an independent word and an attached word, and the learning data is a base of the previous independent part and the later independent part. In addition, the adjunct words of each independent part are stored separately in association with the independent words constituting each independent part. In other words, as a simple example, if you say "Let's do that", the conversion result will be "Operation use J,"
This applies to the case where it is changed to "r operation specification".

In this case, ``use'' is changed to ``specification J'', and the homophones ``specification'' or ``operation'' and ``specification'' are stored in the example learning memory 11 as explained above. . On the other hand, if you input ``I conducted a study'', the independent words ``specification'' and ``examination'' are learned, and the adjunct word ``no'' of ``specification'' is learned. The auxiliary word ``wo'' of ``study'' is stored in association with each independent word.

In the above example, an example was shown at the time of kana-kanji conversion processing, but by detecting the extraction of phrases and changes in some of the extracted phrases, it is possible to detect when the conversion is complete and the document has already been completed. It can also be implemented in

[Effects of the Invention] As explained above, the character processing device according to the present invention can effectively perform example learning processing, and can perform kana-kanji conversion processing economically with high conversion efficiency based on the learning data. It can be done.

[Brief explanation of drawings]

FIG. 1 is a block diagram of a character processing device according to an embodiment of the invention, FIG. 2 is a flowchart showing example learning processing of the invention, and FIG. 3 is a flowchart showing kana-kanji conversion processing of the invention. 1...CPU, 3...KBD. 5...CRT, 8...ROM, 9...R
AM, 10... Example dictionary, 11... Memory for example learning.

Claims (1)

[Scope of Claims] 1. An input means for inputting a kana character string, a storage means for storing the kana character string inputted by the input means, and a storage means for storing the kana character string stored in the storage means for each clause. a dividing means for dividing the kana character string stored in the storage means into kana-kanji characters; a converting means for performing kana-kanji conversion on the kana character string stored in the storage means; and a homophone that has been converted into kana-kanji by the converting means in the phrase divided by the dividing means. a display means for displaying kanji candidates; a selection means for selecting a desired kanji candidate from the homophone kanji candidates displayed by the display means; when the desired kanji candidate is selected by the selection means;
A character processing device comprising example storage means for storing combinations of the selected Kanji candidate and adjacent bunsetsu. 2. When displaying homophone kanji candidates, the display means:
2. The character processing device according to claim 1, wherein kanji candidates with usage examples stored in the usage example storage means are displayed with priority.