JPS61249167A - Kana-kanji converting system - Google Patents

Abstract

PURPOSE:To set the KANA (Japanese syllabary) character, which is the converting object, to the narrow scope when equivalent KANJI (Chinese character) are not obtained by retrieving the stem of the word by starting the candidate Chinese character retrieving mechanism with the KANA character changed by the KANA KANJI number changing means as the converting object. CONSTITUTION:When a KANJI-mixed sentence is KANA-inputted by the operation of a keyboard 11, it is successively stored into an input buffer 19, displayed on a displaying part 12 and the number of the input characters is stored in a RAM 21 for the work. When a converting/next candidate key fa is operated, maximum five characters are read from the head of the KANA character string stored in the input buffer 19, and the converting object character data are decreased. Based upon the character string, a KANJI converting dictionary 20 is indexed, the character of the stem of the work exists, and then, out of the input character string inverted and displayed at the displaying part 12, to the object character of the stem of the word, the underline is given. When the character of the stem of the word is not detected, next, the stem of the word is retrieved again by the input character to decrease one character. When it is detected that the converting object character number is '0', the character is written in a document memory 17 as the fact that the equivalent Chinese character is not found at the inputted KANA character.

Description

DETAILED DESCRIPTION OF THE INVENTION [Technical Field of the Invention] The present invention relates to a kana-kanji conversion method that uses a single-kanji conversion dictionary to convert an input kana sentence into kanji using the longest match method.

[Prior art and its problems] Conventionally, document input I' uses a kana-kanji conversion method that uses a single kanji conversion dictionary to convert kana input sentences into kanji using the longest match method.
In ll, the kana character string to be converted is successively shortened by one character until a candidate kanji is found, using a preset maximum character unit, for example, 5 characters. It is configured to search for candidate kanji each time, and when a candidate kanji is searched, the display of the corresponding kana character is erased and one candidate kanji is displayed in its place. .

For this reason, depending on the character to be changed, it takes a lot of time and effort to obtain the desired kanji. ′ In other words, if you want to use the longest match method to convert the kana character string ``Gokurouza de shita.'' to ``Thank you for your hard work.'' ” was extremely deafening. " is displayed. In this case, use the next candidate key to display the other candidate kanji for "Goku" in sequence, and when the kana display for "Goku" is finally displayed, use the cursor keys to move the cursor and select the character to be converted. ``Go'' is specified, kanji conversion is specified by operating the conversion key, and the desired ``ago'' is selected from the corresponding candidate kanji by operating the next candidate key.

As described above, the conventional kana-kanji conversion means using the longest match method requires complicated operations when it is desired to reduce the number of characters in the reading.

[Object of the Invention] The present invention provides a kana-kanji conversion device that simplifies the kanji selection operation and easily and quickly obtains a desired kanji in a device that performs kana-kanji conversion by the longest match method using a single kanji conversion dictionary. The purpose is to provide a method.

[Summary of the Invention] The present invention provides a kana-kanji conversion method that uses a single kanji conversion dictionary and converts a kana input sentence into kanji using the longest match method.
It has a kana character number changing means for changing the number of kana characters to be searched, and a means for activating a candidate kanji search mechanism to convert the kana characters changed by the same kana character number changing means, and searches for matching characters using the longest match method. When you can't find kanji,
The system is configured so that the kana characters to be converted can be arbitrarily set within a narrow range.This simplifies the kanji selection operation and allows the desired kanji to be obtained easily and quickly. , editing work can be done efficiently and quickly.

[Embodiment] FIG. 1 is a block diagram showing the configuration of an embodiment according to the present invention.

In Fig. 1, numeral 11 is a keyboard, which is equipped with character keys for kana and kanji conversion as well as various function keys. (hereinafter referred to as the conversion/next candidate key), fb is the function key operated when specifying kana power (hereinafter referred to as the non-conversion key), c
l and cr are left and right cursor keys.

Reference numeral 12 denotes a display unit that displays the input document, and here it is composed of a two-line LCD. During kana-kanji conversion, the first line displays the characters after kana-kanji conversion and the input characters (kana and kanji) that are being converted. characters) and the input characters (kana characters) before conversion are displayed, and candidate kanji characters are displayed on the second line. At this time, in this embodiment, the input characters (kana characters) being converted are displayed underlined, and the input characters (kana characters) before conversion are displayed in reverse. 13 is a display control section that controls the display section 12. 14 is a printing unit that prints a document, and 15 is a printing control unit that controls the printing unit 14.

Reference numeral 16 denotes a CPU that controls the entire device and performs various document processing including copy printing processing, which will be described later.The CPU 16 receives key human power information from the keyboard 11 and executes processing such as document editing, proofreading, input/output, etc. In the kana-kanji conversion mode associated with the operation input of the conversion/next candidate key fa, the kana-kanji conversion process as shown in FIG. 2 is executed according to the kana-kanji conversion process program in the ROM, which will be described later.

Reference numerals 17 to 21 are storage units connected to the memory bus of the CP Ll 1B, and access is controlled by the CPU i6, respectively. Reference numeral 17 is a document memory for storing document information, and 18 is a character generator and various types of storage units including kana-kanji conversion. This is a ROM that stores control programs and the like. Reference numeral 19 is an input buffer for storing input character strings, and reference numeral 20 is a single kanji conversion dictionary ROM (hereinafter referred to as "kanji conversion dictionary ROM") which stores the readings of kanji and the codes of candidate kanji corresponding to the readings, each associated with each other according to a certain format. It is called the Kanji Conversion Dictionary). Further, 21 is a working RAM of the CPU 1B, and for the kana-kanji conversion process, there is an input character count register INCHR that stores the number of characters input to the input buffer 19, and a number of characters to be converted (in this case, the maximum number of characters - 5). ), a conversion target character count register HENCHR, and a kanji address register KANADR that stores a kanji address for specifying a selection target kanji character code in the single kanji conversion dictionary ROM 20.

Document memory address register TXADR1 that stores the storage start address of an input sentence (text) in the document memory 17; Flag register F that indicates the number of times the conversion/next candidate key fa is operated;
, a character code register C0DE that stores character codes to be stored in the document memory 17, and a candidate kanji code register that stores each character code of candidate kanji. 2. ..., KI
O etc. are prepared.

FIG. 2 is a flowchart showing the flow of the kana-kanji conversion process in the above embodiment.

The operation of one embodiment will be described below with reference to FIGS. 1 and 2.

When a sentence containing kanji is entered in kana by operating the character keys on the keyboard 11, the input kana characters are stored in the input buffer 19 in order and displayed on the display section 12 under the control of the cp LJ 1B. At the same time, the number of input characters is stored in the input character number register INC in the work RAM 21.
Stored in HR.

When converting kana to kanji, the user manually inputs a kana character string to be converted using the character keys on the keyboard 11, and then operates the conversion/next candidate key fa. This allows C.P.L.
The kana-kanji conversion process as shown in FIG. 2 is started under the control of 16, and a specific example thereof will be explained below.

First, the conversion/next candidate key f provided on the keyboard 11
By operating a, the number of operations of the conversion/next candidate key fa is determined in step A1 of FIG. 2 based on the operation number data stored in the flag register F in the working RAM 21, and the conversion is performed. When operating the first conversion/next candidate key fa after inputting the target kana character string (F-rOJ
In step A2, the number of input characters stored in the input buffer 19 is determined based on the character number data stored in the input character number register 3INCHR.
0" is present. Here, when the number of input characters stored in the input buffer 19 is rOJ,
In step A20, the contents of flag register F are cleared (0→F). Also, in step A2 above,
Input buffer? The number of input characters stored in 19 is "0"
Otherwise, in step A3, the input buffer 19
A maximum of five characters from the beginning of the kana character string stored in are read out, and in step A4, the conversion target character count data stored in the conversion target character count register HENCHR is subtracted by the number corresponding to the read characters.

Furthermore, in step A5, the kanji conversion dictionary 20 is indexed based on the character string (initially 5 characters) read from the human buffer 19, and in step 80, it is determined whether or not the word stem exists.

Here, if a word stem character exists, in step AI, among the input character strings highlighted on the display section 12,
The target character of the word stem is underlined, and the input character string following it is displayed in reverse video.

Furthermore, in step 88, the start address of the candidate kanji group for the stem is stored in the kanji address register KANADR, and in step A9, the contents of flag register F are updated and rewritten from "0" to "1". It will be done.

Furthermore, in step A1D, each candidate kanji code (maximum 10 characters here) corresponding to the searched word stem is stored in the candidate kanji code register Kl, 2. ....

K10, and in step A11, 1. is stored in the candidate kanji food register. 2. ..., the kanji for each kanji code stored in the KIO is displayed on the display section 12 (second line).

Also, if there are 10 or more candidate kanji (I11 or more), convert /
By operating the next candidate key fa again, the next candidate kanji is displayed on the display section 12. That is, when the conversion/next candidate key fa is operated again (second operation), step A
1, the second operation input of the conversion/next candidate key fa is determined from the operation number data (rF-IJ) stored in the flag register F in the work RAM 21,
In step A19, the kanji address register KAN
The content of ADR is updated, and in step AID, candidate kanji codes (up to 10
2.) is placed in the candidate kanji code register Kl. ...,
KIO, and further, in step A11, 2. is stored in the candidate kanji code register Kl. ..., KIJ
) The kanji for each kanji code stored in the display section 12
(2nd line).

Further, in step A6, if the word stem character is not detected, the word stem search is performed again using the next input character with one less character. That is, when the stem character is not detected in step A6, the contents of the conversion target character count register HENCHR are set to "-1" in step A12, and
In step A13, the number of characters to be converted is "0"
If it is not "0", the processing from step A5 onwards is repeatedly executed, and the stem search is performed using the number of input characters, which is one character less than the previous time, as indicated by the number of characters to be converted register HENCHR. will be held. That is, for example, if a word stem is not detected in the first five characters (five characters from the beginning), a word stem search is performed using the next four characters (four characters from the beginning).

Also, in step A13 above, the number of characters to be converted is "
0", it is determined that there is no corresponding kanji for the input kana character, and the process proceeds to step A.
In step A14, the kana character to be converted is latched into the character code register C0DH, and in step A15, the kana character code stored in the character code register C0DE is stored in the document memory address register TXADR in the document memory 17. written to the indicated memory address.

Furthermore, in step A1B, the contents of the document memory address register TXADR are updated (r+1J), and in step A17, the input character string of the input buffer 19 is updated, and the characters stored in the document memory 17 are removed. The state becomes a string starting with the next character. Furthermore, in step A1°8, input character number register I
The value of NCHH is decreased by the value of the conversion target character number register HENCHR, and the process returns to step A2.

Also, when the above candidate kanji is displayed, keyboard 1
Using the numeric key 1 and the selection/execution key (not shown),
When one kanji is selected, in step A41, the code of the selected kanji is stored in the character food register C.
The selected kanji code is latched to 0DE, and the processes from step A15 onwards are executed, and the selected kanji code is stored in the document memory 17.

Also, with the input characters displayed, press the keyboard 11.
When the non-conversion key fb is operated, in step A51, the first kana character displayed on the first line of the display section 12, that is, the input character code string stored in the input buffer 19, is selected. The first kana character code is latched into the character code register C0DE, and then the processes from step A15 onward are executed, and the selected kanji character is stored in the document memory 17. □ As described above, the kana-kanji conversion process using the single-kanji conversion dictionary 9120 using the longest match method is sequentially executed. At this time, in the kana-kanji conversion process using the longest match method described above, a stem character search is performed for each kana character string that is sequentially shortened by one character, with the maximum length being 5 characters. 1 in order with 5 characters as the longest
Since a stem character search is performed for each kana string that gets shorter by letter, if a corresponding stem is found for a kana string in the middle, candidate kanji for that stem will be displayed and a series of operations will follow. steps have to be taken. Therefore, as mentioned above, the operation becomes very troublesome. Therefore, for such kana character strings with short pronunciations to be converted, the length of the kana character strings to be searched can be arbitrarily changed by operating the cursor keys cr and cl.

In other words, if you want to make the number of characters to be converted even smaller than the number of characters to be converted when the candidate kanji is displayed, press the left cursor key C.
Operate I. For example, if the currently displayed candidate kanji has 3 target kana characters, and you want to change it to 2 characters, operate cursor key C1 once, and if you want to change it to 1 character, operate cursor key C1 twice. .

This force=by operating the crane key cl, first step A2
At step 1, it is determined whether the contents of the conversion target character number register HENCHR are greater than the minimum number of characters, ie, "1". Here, if it is determined that the content of the conversion target character count register HENCHR is greater than "1", step A
In step 22, after the value of the conversion target character count register HENCHR is set to "-1", the process starts from step A5 described above, and the conversion target character count register)-IENCH is entered.
The above-mentioned dictionary search is performed using a kana character string (or kana characters) whose number of characters corresponds to the value of R as a conversion target.

Such reduction in the number of characters to be converted and dictionary search processing for the characters are executed each time the cursor key C1 is operated.

As a result, when the candidate kanji is displayed, the number of characters to be converted can be made smaller than the number of characters of the currently displayed candidate kanji, without performing a series of selection operations for the candidate kanji. Then, candidate kanji characters for the stem character can be displayed and output on the display unit 12.

Further, in contrast to the reduction in the number of characters to be converted by operating the cursor key 01, to increase the number of characters to be converted, the right cursor key cr is operated the number of times corresponding to the number of characters. By operating the cursor key cr, first in step A31, it is determined whether the contents - of the conversion target character number register HENCHR are greater than the maximum number of conversion characters, ie, "5". Here 1. When it is determined that the contents of the conversion target character count register t-IENcHR are smaller than "5," in step A32, it is determined whether the contents of the conversion target character count register HENCHR are smaller than the contents of the input character count register INCHR;
That is, it is determined whether the number of characters to be converted is within the number of unconverted characters stored in the input buffer 19. Here, when the number of characters to be converted is within the number of unconverted characters stored in the input buffer 19, in step A33, the value of the number of characters to be converted register HENCHH is set to "-1".
After that, the process starts from step A5 described above, and the dictionary search as described above is performed for the kana character string (or kana characters) whose number of characters corresponds to the value of the conversion target character count register HENCHR. Such an increase in the number of characters to be converted and a dictionary search process for the characters are executed each time the cursor key cr is operated.

As described above, when the candidate kanji is displayed, without performing any series of selection operations for the candidate kanji,
Use the cursor keys to arbitrarily increase or decrease the number of characters to be converted from the number of characters in the currently displayed candidate kanji.
Candidate kanji characters for the changed number of stem characters can be displayed and output on the display unit 12.

In the above-mentioned embodiment, a configuration in which only a single kanji dictionary was provided as a kana-kanji conversion dictionary was shown as an example, but the structure is not limited to this, and a configuration having both a single kanji dictionary and an idiom dictionary is shown. It can also be applied to things. .

Further, in the above embodiment, the reading of the kanji is input in hiragana, but this is not the only option. can also be applied.

[Effects of the Invention] As detailed above, according to the present invention, in the kana-kanji conversion method that uses a single kanji conversion dictionary and converts an input kana sentence into kanji by the longest match method, the number of kana characters to be searched can be reduced. A means for changing the number of kana characters for changing the number of kana characters, and a means for starting a candidate kanji search mechanism using the kana characters changed by the means for changing the number of kana characters for conversion, so that the corresponding kanji can be obtained by stem search using the longest match method. The system is structured so that the kana characters to be converted can be arbitrarily set within a narrow range when the desired kanji is not available. You can efficiently and quickly input and edit sentences containing kanji.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing one embodiment of the present invention, and FIG. 2 is a flowchart showing the main processing flow in the above embodiment. 11...Keyboard, 12...Display section, 13...
Display control section, 14... Printing section, 15... Printing control section, 16... CPU, 17... Document memory, 18...
・ROM, 19... Input buffer, 20... Kanji conversion dictionary 20 (single kanji conversion dictionary), 21-... RA for work
M, fa...conversion/next candidate key, fb-...no conversion key, cr, cl...cursor key, INCHR...
・Number of input characters register, HENCHR...Number of characters to be converted register, KANADR...Kanji address register, TXADR...Document memory address register, F
...Flag register, C0DE...Character code register, Kl, 2. ..., KID... Candidate kanji code register.

Claims (1)

[Claims] A single kanji conversion dictionary, an input means for inputting a kana character string to be converted into kana and kanji, a kana character string display means for displaying the kana character string input by the input means, and an instruction means for instructing kana to kanji conversion. and is activated by the same instruction means,
A predetermined number of kana characters from the beginning of the kana character string input by the input means are searched for in the dictionary using the same characters, and if no candidate kanji is found, the kana character string to be converted is sequentially shortened. candidate kanji search means for searching for each candidate kanji, candidate kanji display means for displaying the candidate kanji searched by the candidate kanji search means, and kana character number changing means for changing the number of kana characters to be searched. A kana-kanji conversion method comprising means for starting the candidate kanji search means using the kana characters changed by the kana character number changing means as conversion targets.