JPS62266660A - Kana-Kanji conversion device - Google Patents

Abstract

PURPOSE:To increase the correct answer ratio of KANJI (Chinese character) conversion by string data on the KANJI mixed words together with the connection information between respective words. CONSTITUTION:In S1, the head of a character string to execute the conversion from a cursor address is retrieved, and in S2, a pointer is set to a head character position. In S3, a word which can be the last word of a segment, is retrieved with the longest coincidence method by referring to a dictionary memory. In S5, the pointer is updated, in S6, it is decided whether or not the word becomes the last of the segment. If the answer is NO, the next word is retrieved in the same way as previously, and in S8, the connection information with the previous word is decided on the basis of the connection information. When a word which can comes to be the last of the segment is found in S6, the word retrieving is executed concerning the next continuous character string in S9, and when in S11 and S12, it is decided that the word found by the word retrieving in S9 can be connected with the previous word and comes to be the head of the segment, the words, which are decided in S6 to form the segment are selected as the candidate character string in S13.

Description

DETAILED DESCRIPTION OF THE INVENTION (Field of Industrial Application) The present invention relates to a kana-kanji conversion device used in Japanese word processors and the like.

(Prior art) Conventionally, in a Japanese word processor, when one sentence consisting of, for example, multiple text breaks is input using kana input, one sentence is a string of many hirakana characters (an undefined kana character string). is displayed. Then, when I operated the kanji conversion key to convert this undefined kana character string into kanji, there were cases where all of the breaks that made up that one sentence were converted into kanji at once.

(Problem to be Solved by the Invention) However, there is no problem if all the kanji in each section are converted to the desired kanji, but if some of the kanji are converted incorrectly, then there is no problem. When the kanji conversion was performed again to convert the incorrect kanji into the correct kanji, the problem occurred that other correctly kanji-converted kanji breaks were converted into the wrong kanji.

This problem becomes more serious as the number of kana character strings to be converted increases, and in some cases, haphazard kana-kanji conversions that are completely different from what is desired may occur.

As a result, it takes a lot of time and troublesome correction operations to perform accurate kanji conversion, and the user is forced to perform kanji correction keys separately at each break.

(Purpose) The purpose of this invention is to solve the above-mentioned problems by making it possible to reliably convert undefined kana character strings containing multiple delimiters with simple key operations, thereby reducing the labor involved in converting kana to kanji. To provide a kana-kanji conversion device.

(Means for Solving the Problem) The kana-kanji conversion device of the present invention identifies multiple breaks included in a part of a kana character string, and converts the kana character string corresponding to each break into a converted string containing kanji at once. A convertible kana-kanji conversion device includes character keys for inputting kana characters, storage means for sequentially storing kana character strings input by the character keys, and data of words mixed with kanji corresponding to various kana character strings. a dictionary memory which is stored in advance together with connection information between each word; and a first division in a kana character string to be converted in the storage means, and the first division in the kana character string is stored in the dictionary memory. When converting into a candidate character string consisting of words, it is determined whether or not it can be connected to the next delimiter, and the connectable candidate character strings are selectively selected and the candidate character string corresponding to the first delimiter is selected. a unit delimiter converting means for giving an execution command to the converting means; a selection key for selecting whether or not to confirm the candidate character string converted by the converting means as a final character string; The present invention is characterized by comprising a confirmation processing means for removing a kana character string corresponding to a confirmed character string confirmed from the conversion target in response to a confirmation operation of a selection key.

(Operation) When a kana character string is input by operating the character keys, the storage means stores this kana character string. Then, when the unit delimiter conversion means gives an execution command to the conversion means, the conversion means determines the first delimiter in the kana character string to be converted in the storage means, and stores the kana character string of that one delimiter in the dictionary memory. When converting into a candidate character string consisting of the words stored in , it is determined whether or not it can be connected to the next delimiter, and a candidate character string that can be connected is preferentially selected, and the candidate character string corresponding to the first delimiter is selected. As a string. When the selection key is operated to confirm the candidate character string, the candidate character string converted by the conversion means is determined as the final character string. Then,
The confirmation processing means responds to the confirmation operation of the selection key and removes the kana character string corresponding to the confirmed confirmation character string from the conversion target.

(Embodiment) An embodiment in which the present invention is embodied in a word processor kana-kanji conversion device will be described below with reference to FIGS. 1 to 3.

In FIG. 2, a keyboard 3 as an input means is provided on the front side of a main body case 2 of a word processor 1.
A printer 4 is provided on the rear side. keyboard 3
is provided with a liquid crystal display 5 having multiple lines each containing 40 digits. Various operation keys are arranged on the keyboard 3, including a character key 6 for inputting hiragana and alphabet letters and numbers, a conversion key 7, an execution key 8 as a selection key, a function key 9, and a next candidate key. 22, various keys such as a cursor movement key 23 for moving the cursor displayed on the liquid crystal display 5 are provided.

A unit delimiter conversion means is constituted by the 1-function key 9 and the conversion key 7, and when both keys 7.9 are operated together, C.
An execution command signal is output to the PU10. Further, the conversion key 7 is operated to convert all of a part of the kana character string into a converted character string containing kanji at once. The execution key 8 is used to convert a candidate character string into a confirmed character string. The next candidate key 22 is used when a candidate character string is displayed on the liquid crystal display 5 and when it is desired to display a candidate character string other than the displayed 11 complementary character strings.

Next, the electrical configuration of this word processor 1 will be explained using an electrical block circuit diagram not shown in FIG.

A central processing unit (hereinafter referred to as CPU) 10 as a conversion means and confirmation processing means built into the main body case 2 includes a read-only memory (hereinafter referred to as ROM) 11, a dictionary memory 12, and a readable and rewritable memory (RAM). ) is connected to a working memory 13 as a storage means. The working memory 13 is an input buffer section 13a that temporarily stores character code data input using the character keys 6.
and a candidate character buffer section 1 that temporarily stores candidate character strings.
3b etc. The CPU 10 is connected to the keyboard 3 via a keyboard driver 14 and to the liquid crystal display 5 via a display controller 15. Further, the CPU 10 is connected to the printer 4 via a print driver 16, and is also connected to various memories such as a code table 17 and a document memory 18.

The ROM 11 stores various control programs such as a Japanese word processor control program, a keyboard control program, a printer control program, and a liquid crystal display control program for operating the word processor 1. A character generator is stored in the program memory 19. (hereinafter referred to as CG). The CG 20 stores character pattern data such as characters and symbols displayed or printed in a dot matrix for each typeface. Further, the document memory 18 is connected to the character keys 6 of the keyboard 3.
Character data such as character code data, space code data, line feed data, etc. input by the operator by operating the , space key, line feed key, etc. are stored.

The code table 17 stores character codes corresponding to characters and symbols. Furthermore, the dictionary memory 12 stores data on words mixed with Kanji corresponding to various kana character strings, along with various grammatical information necessary for kana-kanji conversion, such as part-of-speech information and connection information. The working memory 13
is used to temporarily store the results of arithmetic processing performed by the CPU 10.

Next, the operation of the word processor 1 configured as described above will be explained according to the flowchart shown in FIG.

The operator presses the character keys 6 on the keyboard 3 to input a document.
When a key is input, the CPU 10 determines the type of key operated based on the keyboard control program, and converts the input signal for the operated key into character data such as hiragana or katakana, space data, line feed data, etc. The data are sequentially stored in the input buffer section 13a of the working memory 13.

At this time, the CPU 10 reads out the most recently inputted character data among the character data etc. that are sequentially stored in the working memory 13 based on the liquid crystal display control program and displays them sequentially on the liquid crystal display 5. To go. Also, when this display is performed, the kana character string (hereinafter referred to as unconfirmed kana character string) before being converted to kana-kanji is displayed in reverse video.

If you want to convert some of the highlighted undefined kana character strings to kana-kanji from the beginning, place the cursor somewhere within the highlighted undefined kana string or immediately after the undefined kana character string. Operate function key 〇 and conversion key 7 together in the position.

Then, in response to execution command signals from both keys 7 and 9, C is pressed.
Based on the cursor address, the PU 10 searches for the beginning of the undefined character string highlighted in step 1 (hereinafter step will be denoted by S), and sets a pointer at the position of the beginning character (S2). Then, the CPU 10 uses the character code data (i.e., "yomi") of up to 10 characters counted from the pointer and stored in the working memory 13 as a character string to be converted, and searches the dictionary memory 12 for a word corresponding to that character string. This is done by referring to it (S3). This word search is performed sequentially from long character strings to short character strings using the so-called longest match method.

Then, when a word corresponding to the character string is selected from the dictionary memory 12, CPLJlo determines whether the selected word can be the beginning of the break based on the grammatical information given to the word (S4). If the word selected here is not the beginning of the break, the process returns to S3. If it is determined that the selected word is at the beginning of the break, the process moves to S5.

In S5, the CPU 10 sets a pointer immediately after the definite kana character string corresponding to the pronunciation of the selected word W. Subsequently, in S6, the CPU 10 determines whether the selected word W can be the last word of the break. That is, it is determined whether or not the word can be the end of a break based on whether there is a period mark "," or a comma mark "." or other grammatical information given to the word.

When the CPU 10 determines that the word W cannot be the last of the break, it reads the character code data (within 10 characters) counted from the previously set pointer and stored in the working memory 13.
That is, the dictionary memory 12 is searched for a word corresponding to the next character string to be converted (S7).

In this case, the word search is performed sequentially from long character strings to short character strings, as described above. As a result of the search, when a word corresponding to the character string is selected from the dictionary memory 12, the CPU 10
determines whether the selected word can be connected to the previously selected word based on the grammatical information of the single item (S8).

If it is determined that this selected word cannot be connected to the previously selected single MTJ W, the CPLI 10 returns to S7 again and performs the same process until a connectable single MTJ W is selected. Then, when it is determined in S8 that a word However, the following processing is performed in the same manner as described above.

Then, if it is determined in S6 that the selected word W (or a word string that can be connected to the previous word, such as W+X) can be the end of the break, CPtJlo is used to select the character code data next to the selected word. The character code data (i.e., "yomi") of 10 characters or less stored in the working memory 13 is counted using the pointer as a reference, and the word corresponding to the character string is searched in the dictionary as a converted character string corresponding to the next break. This is done with reference to the memory 12 (S9). Then, as a result of the search, it is determined whether or not there is a unit R corresponding to the character string in the dictionary memory 12 (510), and if there is, the CPI
JIO determines whether the selected word can be connected to the previously selected word based on the word's grammatical information (81
0).

If it is determined that the selected word Y cannot be connected to the previously selected word, the CPU 10 returns to S9 and performs the same process until a connectable word is selected. And S11
When it is determined that a word that can be connected to the previous word has been selected, the CPU 10 moves to S12. At 812,
CPIJlo determines whether the word Y selected in S9 can be the beginning of the next break. C if you can't be the first
If the PU 10 makes a determination, the process returns to S9.

On the other hand, when the determination is No in S10, that is, 83
~ If there is no word in the next break that can be connected to the word (or word string) selected for the first break in the process of S8, return to S2 and determine what is the previously selected word (or word string). Processes 83 to S8 are performed to select another different word (or word string).

If it is determined in step 812 that the single HY selected will be the beginning of the next section, the CPtJ 10 determines whether it corresponds to the word determined in S4 to be the beginning of the division and the word determined to be the end of the division in S6. Determine that the character string is a break, and select a string consisting of these words as a candidate string corresponding to the break (813);
The candidate character string is stored in the candidate character buffer section 13b, and the CPU 10 normally displays the candidate character string on the liquid crystal display 5 based on the liquid crystal display control program and places the cursor immediately after the candidate character string. indicate.

Furthermore, the CPU 10 repeats the processes of S1 to S13 to search for other candidate character strings corresponding to the same unconfirmed kana character string, and stores the candidates in the working memory 13 together with the first candidate character string searched. It is stored in the character string buffer section 13b. Then, when the next candidate key 22 is pressed down, CPUIO reads the next candidate character string from the candidate character buffer section 13b based on the input signal from the next candidate key 22 and replaces it with the previous one candidate character string. Normally displayed on the liquid crystal display 5.

After the candidate character string is displayed on the liquid crystal display 5 as described above, when the operator operates the execution key 8 with the cursor positioned immediately after the candidate character string, the execution key 8
Based on the confirmation signal, the CPU 10 finalizes the candidate character string stored in the candidate character buffer section 13b of the working memory 13 as a final character string. That is, input buffer section 1
Among the undefined kana character strings stored in 3a, the kana character strings corresponding to the confirmed character strings are rewritten into confirmed character strings and excluded from the conversion target.

On the other hand, if you operate the conversion key 7 before the candidate character string is confirmed, cpuio will convert the undefined kana character string (i.e. the first delimiter character Performs normal kana-kanji conversion for columns).

Next, the specific kana-kanji conversion process will be explained using an example.

First, by inputting the character key 6, the character string ``grasp the pole while holding the pole.j'' is stored in the input buffer 13a of the working memory 13, and the cursor is positioned on the highlighted undefined character string. When function key 〇 and conversion key 7 are operated together in this state, in response to execution command signals from both keys 7 and 9, the CPU 10 searches for the beginning of the undefined character string displayed in reverse video based on the cursor address. SL), set the pointer to the position of the first character (S
2).

And cpuio is 83. S4 is repeated to select from the dictionary memory 12 the word "tobori" which can be the beginning of the break in the character string to be converted into kanji. Then, in S5, the pointer is set immediately after the undefined kana character string corresponding to the pronunciation of the selected word, that is, at the position of the character "na". Subsequently, in S6, the CPU 10 determines whether "holding down" can be the end of the break.

CPtJlo is based on the character code data of 10 characters or less stored in the working memory 13 counting from the set pointer position, that is, the character "na", because the character code data for "tobori" cannot be at the end of the break. A search for a word corresponding to the character string is performed with reference to the dictionary memory 12, and S
7. Repeat S8. As a result, when the word "Nakara J" corresponding to that character string is found in the dictionary memory 12, the CPU
10 determines that the discovered word can be connected to a previously discovered word based on the grammatical information. Then, CPtJ
lo returns to S5 and sets the pointer immediately after the undefined kana character string corresponding to the pronunciation of the discovered word, that is, at the position of "sa".

Then, CPU10 selects the word “
When it is determined in 86 that ``While holding on'' can be the end of the break, CPtJlo selects that character based on the character data within 10 characters counted from the character code data of the character ``Za'', using the set pointer as a reference in S9. A search for a word corresponding to the column is performed by referring to the dictionary memory 12;
39,810, S11. Search is performed repeatedly in S12. As a result of the search, in S11, the CPU 10 discovers the word "kan" and determines that the word can be connected to the edict "nakara" and is the first word in the break, and in S4 the CPU 10 determines that it is the first word in the break, 1q. The edict ``Stand on'' and S.
If you set 6 to the end of the delimiter and if you set 1 to the word ``Nagagara'', select it as a candidate character string for delimiter.513)
The one candidate character string is stored in the one candidate character buffer section 13b of the working memory 13. Then, the CPU 10 normally displays character number 1 ``Tonten Nagata'', which includes the kanji created as a break, on the liquid crystal display 5 based on the liquid crystal display control program as a candidate character string, and moves the cursor immediately after the candidate character string. to be displayed.

Hereinafter, after the candidate character string ``Tonashi Nagara'' is displayed on the liquid crystal display 5, if the operator operates the execution key 8, the undetermined kana character string ``Kana'', which is the character string to be converted in the working memory 13, is displayed.
Grip the pole while hanging out. '', the kana character string "Funbarinaga" corresponding to the confirmed character string is excluded from the conversion target, that is, the kana character string is rewritten into the confirmed character string in the input buffer section 13a. Therefore, the remaining character string to be converted is "Sao wo Nigiru." Thereafter, by similarly performing the kana-kanji conversion process, the unconfirmed kana character string ``holding the pole while holding down.'' is finally converted into the confirmed character string ``holding the pole while stepping on it.''

Note that the present invention is not limited to the embodiment described above; for example, in the embodiment described above, a word search is performed using the pronunciation of within 10 characters from the first pointer, but a word search is performed using pronunciations other than 10 characters. Of course, this is a good thing.

(Effects of the Invention) As detailed above, the present invention allows undefined character strings containing multiple delimiters to be checked by simple key operations to confirm that the correct candidate character string has been selected for each delimiter from the beginning. Since it can perform simple and simple kanji conversion, there is no need to worry about correcting the haphazard conversions that tend to occur when converting all at once. In addition, since Kana-Kanji conversion is performed while checking not only one break, but also the connection with the next break, it is possible to increase the accuracy rate of Kanji conversion and reduce the labor involved in converting Kana-Kanji. Can Qin soaked effect.

[Brief explanation of the drawing]

Fig. 1 is an electrical block circuit diagram showing an embodiment of the present invention, Fig. 2 is the same (a plan view of a Japanese word processor), and Fig. 3 is a flow chart. 1 is a word processor, 3 is a keyboard, 4 is a printer, 7 is a conversion key, 8 is an execution key, 9 is a function key, 10 is a central processing unit (CPU), 11 is a ROM, 12 is a dictionary memory, 13 is a working memory, 18 is a document memory, 19
is the program memory.

Claims (1)

[Scope of Claims] 1. A kana-kanji conversion device capable of determining a plurality of breaks included in a group of kana character strings and converting the kana character string corresponding to each break into a converted character string containing kanji at one time, comprising: A character key for inputting a character key, a storage means for sequentially storing kana character strings input by the character key, and a storage means for storing in advance data of words mixed with kanji corresponding to various kana character strings along with connection information between each word. a dictionary memory; and determining the first break in the kana character string to be converted in the storage means and converting the kana character string of the one break into a candidate string consisting of the words stored in the dictionary memory. a converting means that determines whether or not it can be connected to the next break and selects connectable candidate character strings preferentially as candidate character strings corresponding to the first break; and an execution command to the converting means. unit delimiter converting means for adding a unit delimiter, a selection key for selecting whether or not to confirm the candidate character string converted by the converting means as a confirmed character string, A kana-kanji conversion device comprising: confirmation processing means for removing a kana character string corresponding to a confirmed character string from the conversion target.