JPS6311712B2 - - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a kana-kanji conversion processing device such as a Japanese word processor that converts input kana characters into sentences containing kanji.

[Conventional technology]

Conventionally, in a kana-kanji conversion processing device that uses a single kanji conversion dictionary and converts an input kana sentence into kanji using the longest match method, candidate kanji are selected using a preset maximum number of characters, for example, 5 characters, as the longest unit. The kana string to be converted is
The system shortens each character one by one and searches for candidate kanji each time. When a candidate kanji is searched, the display of the corresponding kana character is erased and the candidate kanji is displayed in its place.

By the way, in such a conversion method using the longest match method, it is not possible to easily obtain conversion candidates in which only the first character is a kana character. For example, the kana character string ``Ojokobi ni Nari'' becomes ``Ojojo ni Nari,''.
If you want to convert kana to kanji, if you use the above kana string ``Ojokobi ni Nari,'' as the conversion target,
In the conversion process, ``Oyo'' becomes the character to be converted and is converted and displayed as ``Andorokobi ni ni.''.

In such cases, conventionally, the desired sentence containing Chinese and Chinese characters has been obtained using the following two methods. The first method is to move the cursor to the digit position of the first character "O" and use a specific key operation to exclude the character specified by the cursor from the conversion target, and then specify the conversion. Method using no conversion method. As a second method, as disclosed in JP-A-55-153036 or JP-A-57-187731, for an input kana character string, the start and end ends of the conversion area are A method using the so-called conversion area specification method, in which each digit position is specified with a cursor, and then conversion is specified.

[Problem that the invention seeks to solve]

However, in both of the above two methods, the flow of conversion is divided and the operations are complicated, so there is a problem that document creation cannot be performed efficiently and quickly.

The present invention provides a kana-kanji conversion that allows a desired kanji-mixed sentence to be easily and quickly created by easily obtaining conversion candidates in which the first character of an input kana character string is a kana character. The purpose is to provide processing equipment.

[Means for solving problems]

The present invention is activated by a kana-kanji conversion dictionary, an input means for inputting a kana character string, a conversion instruction means for instructing kana-kanji conversion, and the conversion instruction means,
a search means for searching the dictionary for a corresponding conversion candidate by sequentially shortening the kana character string to be converted, with a predetermined number of kana character strings as the longest starting from the beginning of the kana character string input by the input means; A kana-kanji conversion processing device comprising: a display means for displaying conversion candidates searched by the search means; a no-conversion instruction means for instructing non-conversion of an input kana character string; , a detecting means for detecting whether or not the conversion has been instructed by the conversion instructing means; and a first character of the kana character string input by the input means when the detecting means detects that the conversion has been instructed. conversion processing means that excludes from the conversion target and activates the search means with the kana character string starting with the next input character as the conversion target.

[Effect]

To explain the operation of the present invention, in order to create a desired sentence containing kanji, a corresponding kana character string is inputted using an input means. Next, when the conversion instruction means (conversion key) is operated to instruct kana-kanji conversion, a search means is activated, and this search means converts a predetermined number of kana character strings from the beginning of the input kana character string as the longest. Search for conversion candidates in the kana-kanji conversion dictionary by sequentially shortening the target kana character string. The searched conversion candidates are then displayed on the display means (so-called Kana-Kanji conversion method using the longest match method). For such a conversion method,
At least the first character of the conversion candidates is always a kanji candidate, and if this candidate is acceptable, the conversion candidate is determined and the process moves on to the next kana-kanji conversion process. On the other hand, there may be cases where it is desired to leave the first character of the conversion candidate as a kana character and convert the second and subsequent characters into kanji (for example, in the case of "Ojoisanari"). In such a case, the no-conversion key, which is the no-conversion instruction means, is operated while the conversion candidates are displayed on the display means according to an instruction from the conversion instruction means. Then, the detection means detects whether or not the conversion has been instructed by the conversion instruction means, and if it is detected that the conversion has been instructed, the conversion processing means excludes the first character of the input kana character string from the conversion target. Then, the above-mentioned search means is activated again with the kana character string starting with the next input character as the conversion target. As a result, the first character of the conversion candidate is fixed as a kana character, and new kanji conversion is automatically performed for the second and subsequent characters, making it easy to create a desired sentence containing kanji.

〔Example〕

(1) Configuration FIG. 1 is a block diagram showing the configuration of an embodiment according to the present invention.

In the figure, 10 controls the entire device and performs various document processing including kana-kanji conversion processing, which will be described later.
It is a CPU and executes the processing shown in Figure 2 during kana-kanji conversion. Reference numeral 11 denotes a keyboard equipped with kana character keys for inputting documents, as well as various function keys, etc. Here, the function keys operated when inputting sentences containing kanji are used to input characters that are not subject to kana-kanji conversion. There are a "no conversion" key to specify the character to be converted, a "conversion/next candidate" key to specify the kana-kanji conversion or select the next candidate, and select one from the displayed candidate character group. Here, numeric keys are used as designation keys to do this.

Reference numeral 12 denotes a kanji dictionary 12 that is referred to by the CPU 10 during kana-kanji conversion. 13 is a display section that displays input and edited documents;
Consists of a line display LCD. During kana-kanji conversion, the first line displays the characters after kana-kanji conversion, the input characters being converted, and the input characters (kana characters) before conversion. Suggested characters are displayed on the line. At this time, in this embodiment, the input character being converted is displayed underlined, and the input character (kana character) before conversion is displayed in reverse (indicated by diagonal lines in the figure). In addition, a number is attached to each character digit position (in this case, 10 digits) on the display section 13, and one of the candidate kanji characters in a single kanji dictionary search is selected by specifying the digit by operating the numerical keys. It is configured to do this.

14 is a display driver that controls the drive of the display unit 13; 15 is a display memory that stores display data to be displayed on the display unit 13; 16 is a print unit that prints out a document; 17 is a control unit that controls the print unit 16. This is a print control section.

18 to 21 are storage units connected to the memory bus of the CPU 10, respectively;
18 is an input buffer for storing input character strings, 19 is a document memory for storing document information, 20 is a character generator, and kana-kanji conversion by dictionary search as shown in Figure 2. This is a ROM that stores various control programs, etc. Further, 21 is a working RAM of the CPU 10, and regarding the kana-kanji conversion process, when the kana-kanji conversion is specified, that is, the input kana character string to be converted is
An input that stores the number of characters input to the flag register F1 and input buffer 18, which becomes "0" when the "Next Candidate" key is operated for the first time, and becomes "1" when a new kana character is input. Character count register INC, conversion target character register HER that stores the kana characters (codes) to be converted, candidate character register KAN that stores the searched candidate characters (codes), number of kana characters to be converted (here, one (Maximum number of characters to be converted is 8 characters)
conversion target character count register HEN that stores , selected character register that stores selected characters (codes)
COK, input sentence (text) in document memory 19
Document memory address register TXA stores the start address of the storage destination, flag register F2 becomes "1" when the "no conversion" key is pressed before the "conversion/next candidate" key is pressed, and characters to be converted remain in the input buffer 18. A flag register F3, etc., which becomes "1" when the "line feed" key is operated while the line is on, is prepared.
FIG. 2 is a flowchart showing the flow of the kana-kanji conversion process in the above embodiment.

(2) Operation When a sentence containing kanji is input in kana by operating the character keys on the keyboard 11, the input kana characters are sequentially stored in the input buffer 18 and dotted on the display memory 15 under the control of the CPU 10. It is expanded and displayed on the display unit 13, and the number of characters input to the input buffer 18 at that time is
It is stored in the input character count register INC in RAM21.

At the time of kana-kanji conversion, after inputting a kana character string to be converted by inputting the character keys on the keyboard 11, the "conversion/next candidate" key on the same keyboard 11 is operated. As a result, the kana-kanji conversion process as shown in FIG. 2 is started under the control of the CPU 10, and its specific operation will be explained below.

First, click "Convert/
By operating the "Next Candidate" key, the contents of the flag register F1 in the working RAM 21 are determined in step SI of FIG. If the content of the flag register F1 is "1" and it is determined that this is the first "conversion/next candidate" key operation, the content of the flag register F1 is set to "0" in step S2. ", and in step S3, the contents of the input character count register INC in the working RAM 21 are checked. Here, the contents of the input character count register INC above are not "0",
If the input buffer 18 indicates that characters to be converted are stored, in step S4,
A maximum of eight characters to be converted are read from the input buffer 18, starting from the first character, and set in the conversion target character register HER. Furthermore, in step S5, after setting the character numerical value of the read character string to be converted into the number of characters to be converted register HEN, in step S6, the character string stored in the character string to be converted is stored in the register HER. Then, a search process for the kanji dictionary 12 is performed.

When the corresponding candidate kanji is retrieved in the search process of the kanji dictionary 12 (step S7), the retrieved candidate kanji is stored in the candidate character register KAN in step S8, and in step S9,
The searched candidate kanji is displayed on the display section 13, and furthermore, in step S10, the inverted display state of the character corresponding to the number of characters stored in the conversion target character count register HEN is released, and the character is displayed as the character being converted. The display changes to an underlined state indicating that it is a character.

On the other hand, if the "No Conversion" key is operated without operating the "Conversion/Next Candidate" key, the flag register F2 becomes "1", and when there are still characters to be converted in the input buffer 18, When the "line feed" key is operated, the flag register F3 becomes "1".
That is, when the "no conversion" key is operated, the contents of the flag register F1 are checked in step S26, and if the contents are "1" (if the "conversion/next candidate" key has not been operated), the contents of the flag register F1 are checked. In step S27, "1" is set in the flag register F2. Also, when the "line feed" key is operated,
In step S28, input character number register
The contents of INC are checked, and if it is not "0", the contents of flag register F1 are checked in step S29. If the content of the flag register F1 is "1" here, "1" is set in the flag register F3 in step S30.

Also, in the above step S7, the kanji dictionary 12
If no matching candidate is found in the search, in step S11, the number of characters to be converted is registered.
The content of HEN is reduced by one character, and step S1
2, it is determined whether the value is "0" or not.

Here, if it is confirmed that the content of the conversion target character count register HEN that has been subtracted by one character is not "0", then the character string that has been subtracted by one character is
The above-described search of the kanji dictionary 12 is repeated again (steps S6 to S12 in FIG. 2).

In addition, in step S12, if it is confirmed that the contents of the conversion target character number register HEN are "0", in step S13, the conversion target character number register HEN is set to "1",
In step S14, the first character is read from the input buffer 18 and stored in the selected character register COK.
After being set in the selected character register COK, in step S15, the character set in the selected character register COK is
Document memory address register in document memory 19
Written to the storage address specified by TXA.

Furthermore, in step S16, the contents of the document memory address register TXA are transferred to the document memory 19.
The input buffer 18 is updated by the number of characters written in the input buffer 18 (in this case, +1).
The contents of will be updated. That is, the character string in the input buffer 18 is deleted (shifted out) by the number of characters (in this case, one character) corresponding to the value of the conversion target character number register HEN from the first character. Next, in step S18, the value of the input character number register INC is subtracted by the value of the conversion target character number register HEN, and in step S19, the contents of the flag register F2 are checked.

Here, if the value of flag register F2 is "0" indicating that the "no conversion" key was operated after specifying kana-kanji conversion (after operating the "conversion/next candidate" key), In step S23, the value of the flag register F3 is checked, and the value of the flag register F3 indicates that the "new line" key has not been operated while the character to be converted remains in the input buffer 18. If “0”, step S
Returning to step 3, the conversion process is performed again on the character string in the input buffer 18 (the first character has already been deleted).

In this way, when the "No conversion" key is operated after the "Convert/Next candidate" key is operated, only the first character of the input string to be converted is uniquely removed from the conversion target. , the string after that character is treated as the conversion target.

In addition, in step S19 above, the value of flag register F2 is set before kana-kanji conversion is specified ("conversion/
(before the operation of the "Next Candidate" key) is "1" indicating that the "No Conversion" key has been operated, or in the above step S23, the contents of the flag register F3 are converted to the input buffer 18. If the value is "1" indicating that the "line feed" key was operated with the target character remaining, the contents of the input character count register INC are checked in the above step S20, and the contents are "0". ”, the input buffer 18 continues until the content becomes “0”.
The characters stored in the same input buffer 18 are written into the document memory 19 one character at a time from the beginning.

In this way, if the "No conversion" key is operated before specifying Kana-Kanji conversion, or if the "Line feed" key is operated with characters to be converted remaining in the input buffer 18, the input All the characters stored in the buffer 18 are removed from the kana-kanji conversion target and stored in the document memory 19.

Further, in step S20, if the value of the input character count register INC is "0", step S20 is executed.
At 21, the contents of flag register F3 are examined. If the contents of the flag register F3 are "0" here, the contents of the flag register F2 are rewritten to "0" in step S22, and then the process returns to step S3 and the number of input characters register is rewritten.
You can check the contents of INC. Also, the above step S2
1, the content of flag register F3 is “1”
If so, in step S24, the line feed code is set in the selected character register COK, and in step S25, the contents of the flag register F3 are rewritten to "0", and then the process returns to step S15 to write the selected character. The characters stored in register COK are stored in document memory 19. Furthermore, even when the contents of the input character count register INC are "0" in step S28, or when the contents of the flag register F1 are "0" in step S29, the above steps are performed. S24, S25,
Processing in S15... is executed.

The process described above is repeatedly executed, and the input kana character strings are sequentially converted into sentences containing kanji.

In the above embodiment, the kana-kanji conversion dictionary is provided with only a single kanji dictionary, but it is not limited to this. It can also be applied to structures with

Further, in the above embodiment, the reading of the kanji is input in hiragana, but the invention is not limited to this, for example, the reading of the kanji can be input in roman characters,
It can also be applied to structures that perform kana conversion.

〔Effect of the invention〕

As detailed above, according to the present invention, on the condition that the no-conversion instruction is given after the conversion instruction,
The configuration has been configured to easily output conversion candidates with the first character of the input kana character string as a kana character, so if you want to convert and output all the input kana character strings as kanji, or if you want to convert and output the entire input kana character string as kanji, Even when various situations arise when creating Japanese sentences, such as when you want to output one character as a kana character and the second and subsequent characters as kanji, you can simplify the conversion operation of the input kana character string, and output the desired kanji. Mixed sentences can be created easily and quickly.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing one embodiment of the present invention;
FIG. 2 is a flowchart showing the flow of the kana-kanji conversion process in the above embodiment. 10...CPU, 11...Keyboard, 12...
... Kanji dictionary, 13 ... Display section, 14 ... Display driver, 15 ... Display memory, 16 ... Printing section, 1
7...Print control unit, 18...Input buffer, 19
...Document memory, 20...ROM, 21...Work RAM.

Claims (1)

[Scope of Claims] 1. A kana-kanji conversion dictionary, an input means for inputting a kana character string, a conversion instruction means for instructing kana-kanji conversion, and a kana-kanji conversion dictionary activated by the conversion instruction means and inputted by the input means. a search means for searching the dictionary for corresponding conversion candidates by sequentially shortening the kana character string to be converted, with a predetermined number of kana character strings as the longest starting from the beginning of the character string; and conversion candidates searched by the search means. a kana-kanji conversion processing device, comprising: a no-conversion instruction means for instructing non-conversion of an input kana character string; a detection means for detecting whether it is after the conversion instruction, and when the detection means detects that it is after the conversion instruction, excludes the first character of the kana character string input by the input means from the conversion target, and 1. A kana-kanji conversion processing device, comprising conversion processing means for starting the above-mentioned search means with a kana character string starting with an input character as a conversion target. 2. When the detection means detects that no conversion instruction has been given, the conversion processing means excludes all of the kana character strings input by the input means from conversion targets, and nullifies the kana character strings. The kana-kanji conversion processing device according to claim 1, wherein the kana-kanji conversion processing device is determined as a character string for conversion.