JPH0766379B2 - Kana-Kanji converter - Google Patents

Description

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a kana-kanji conversion device for inputting a Japanese sentence as reading and outputting it as kanji notation.

Structure of conventional example and its problems Conventional kana-kanji conversion device is a word dictionary that stores a keyboard for inputting readings of Japanese sentences and pairs of readings of many words in Japanese and kanji notation. And a word search unit that searches the word dictionary for a word having the input pronunciation, and an output unit that outputs the Kanji notation of the searched word. It outputs the kanji notation of a word or word string that has readings. However, in Japanese, there are words that have the same reading but different kanji notation (same phonetic words, hereafter referred to as homophones). Therefore, in the conventional kana-kanji conversion device, multiple words having the same reading are output and operated. It is customary for the person to have a homonym selection unit that selects one of them. Further, the word once selected is output more preferentially than other homophones at the time of the next conversion, so that the operation of selecting the homophone is reduced. For this purpose, information that uniquely specifies a certain word (that is, reading and kanji notation),
A word learning dictionary is used that temporarily stores a pair of information that the word is selected. In the case of performing the above-mentioned word search, a method of searching for a word having a reading input in advance in the learning dictionary and outputting the kanji notation of the corresponding word is taken.

Also, in the Japanese grammar, when a homophone is used, it means that the reading of one word matches with the reading of another word. When the reading of A matches the reading of a plurality of different word strings B ₁ B ₂ ...... B _n , the reading of A is a homonym of the word A, and the reading of B ₁ B ₂ ...... B _n May be included. For example, when reading the proper noun "Akai",
The adjective stem “red” and the adjective ending ending “i” are read in the same way, but in the conventional kana-kanji conversion device, the kanji notation “Akai” and the kanji “red” are displayed simultaneously. Some allow you to choose one of them. Furthermore, a series of certain words C ₁ …… C _m is read and a series of different words D ₁
...... Even _if the reading of D _n is the same, there are cases where the above-mentioned operation of selecting a homonym is possible. For example, in response to the reading "Sinquish", the noun "new" and the suffix "seed" in sequence "new model" and the prefix "new" and the noun "model" in sequence "new model" are output and operated. The person chooses one of them. Even in this case, the following measures are taken to preferentially output the word string selected by the operator next time. That is, when the operator selects the "new model" in the above example, the word "new" having the longest matching reading string from the beginning with respect to the reading string "thinkish"
And the information that uniquely indicates the pair of the first word “new” of the word string “new model” selected by the operator, and the information that the word “new” has been selected. Temporarily store in. Then, when the reading string "Sinquish" is input again, the word search unit detects that the word having the longest matching reading from the beginning of the reading string is "new", and further, "new" in the word learning dictionary. The word "new" is searched and the word "new" is previously selected for the word "new". And "Sinquish"
After converting the top-lid kana string of the reading string to "new", change the input reading string to "kis", obtain the kanji notation "model" by searching the word dictionary, and finally "new model" To get the kanji notation for the word string.

The conventional kana-kanji conversion device realizes the selective learning function between words having different reading lengths as described above. However, the Kana-Kanji conversion device as described above is premised on displaying the Kanji output of a series of a plurality of different word strings up to the word break for the same input Kana string.

On the other hand, when the kana-kanji conversion output for a certain input kana string is incorrect (not desired by the user), a method is devised that can easily correct the incorrect conversion result by dividing the input kana string itself. Has been done. further,
Some of these types implement the above-described word selection learning function. That is, in the method described in Japanese Patent Laid-Open No. 59-9749, a dictionary for temporarily storing words designated by the user is constructed on the system separately from the general word dictionary, and the general word dictionary is searched. By unconditionally performing a search of the provisional word dictionary by using a search rule such as last in fast out before performing, it is possible to reduce the possibility of unnecessary conversion due to the length of the heading. However, in this method, when the corrected word is stored in the provisional dictionary, it is stored regardless of what word is the longest match with the input kana string, so it was originally obtained by searching the general word dictionary. Where words should be output, the words in the provisional dictionary are searched for and output is given priority, which has the disadvantage of producing incorrect output. For example, for an input of "Shinkishu", 1
It is assumed that the place where the conversion result for the second time is "new / type" is corrected to "new / model" by the operation of the operator.
At this time, in this conventional method, the correspondence "shin = new" is registered in the provisional dictionary. When the user inputs "Shinkyu", the Kanji notation "new model" is output by preferentially processing the search results of the temporary dictionary. However, if there is an input of "Shindaisha" following this registration process, in this method, the Kanji output of "new dolly" is output in order to process the search results of the temporary dictionary with priority. There is a drawback that it will be done.

SUMMARY OF THE INVENTION The present invention has been made in view of the above-mentioned drawbacks of the conventional kana-kanji conversion device, and when the operator corrects the output kanji string into another kanji example by an operation for re-conversion, When the same reading string is input again, it is intended to preferentially output the kanji of the word selected by the operator.
Further, at this time, when another reading string including the reading string of the word selected by the operator at the head portion is input, the above-described priority process is not performed.

In order to achieve the above-mentioned object, the kana-kanji conversion device according to the present invention has a kana string storage unit that stores an input kana string, a word dictionary that stores Japanese words, and an operator re-conversion device. A forward kana row designating means for designating a partial row starting from the beginning of the kana row stored in the kana row storage section by operation, and a longest match from the beginning of the kana row or the partial kana row stored in the kana row storage section Word searching means for searching a longest matching word having a reading in the word dictionary, and maximum longest matching word temporary storage for storing reading information of the longest matching word searched by the word searching means for an inputted kana string. Part, and the reading information of the maximum longest matching word and the partial kana string designated by the operator's reconversion operation, the operator selects one of the longest matching words searched by the word searching means. A word learning information storage unit that stores word learning information composed of selection-determined words that have been selected, a word learning information registration unit that registers the word learning information in the word learning information storage unit, and a designated kana string Has a word learning information retrieval unit that retrieves the corresponding word learning information from the word learning information storage unit, and converts the input kana string into a kanji string, the word searching means is the maximum in the word dictionary. The word learning information search unit searches for a matching word, and the word learning information search unit searches the word learning information storage unit for the word learning information having the same reading information as the maximum matching word, and if the search is successful, the searched single number learning information. Output the Kanji notation of the selected decision word prior to the Kanji notation of the maximum matching word, while giving priority to the Kanji notation of the maximum matching word if the search is unsuccessful. It is characterized in that output.

Description of Embodiments FIG. 1 is a block diagram of a kana-kanji conversion device in one embodiment of the present invention. In the figure, 1 is a kana input section, for example, a Kana keyboard specified in Japanese Industrial Standard JiSC-6233,
Alternatively, it is a Romaji-kana conversion device, a monosyllabic recognition device, or another kana character string storage device. The kana row K and the number L of kana input from the kana input unit 1 are stored in the kana row storage unit 2. Then, a sequence in which the number of kana starts at the head of the kana sequence K and is equal to or less than L is output to the word search unit described later. In the following, this is called a partial kana sequence M and the number of kana is N
Is written. In the initial state, N = L. Here, in the following description, for the sake of simplicity, the kana sequence input from the kana input unit 1 is not limited to a clean sound (a, ka, mel, etc.), a dakuon / semi-voiced sound (ga, baba, pat, etc.) , Etc. are all coded as one unit and stored in the kana sequence storage unit 2. The second example of such an encoding rule
Shown in the figure. The contents of the kana row storage unit 2 are displayed on the input kana row display unit described later.

Reference numeral 3 denotes a word dictionary, which stores a large number of pairs of Japanese word reading information, kanji writing information, and part-of-speech information. Here, the word reading information indicates how to pronounce the word. For example, the word "class" is "ju".
It is assumed that it has the reading information "Gyo" and "U". It is assumed that the rules for coding the reading information are coded as one unit for each of the pure sound, the dull sound, the semi-voiced sound, and the jumble sound, as in the case of the description of the kana string storage unit 2. The kanji notation information of a word indicates how to write the word. This is, for example, Japanese Industrial Standard JiS
It is encoded by the Kanji code defined in C-6226.
Also, when the word is usually written in Hiragana, this is also referred to as Kanji notation information.

Reference numeral 4 denotes a word search unit, which searches the word dictionary 3 for a word having reading information that has the longest match with a kana string from the beginning of a partial kana string stored in the kana string storage unit 2.
The set of the reading information V and the Chinese character notation information W of the retrieved word is transferred to the longest matching word temporary storage unit described later. In addition,
In this embodiment, the word search unit 4 is activated by an operator's instruction (for example, pressing a "conversion key" (not shown)).

Reference numeral 5 denotes a longest matching word temporary storage unit that temporarily stores a set of the reading information V and the Kanji notation information W of one word searched by the word searching unit 4. The description of the processing for the same phoneme is omitted.

6 Hana row front part take-out activation unit, which generates an activation signal 1
This key is realized as one key (for example, a "correction key" (not shown)), and when this key is pressed, a start signal is sent to the Kana row front partial take-out section described later. The depression of this key corresponds to the intention of converting the kana-kanji again when the operator does not desire the kanji notation resulting from the conversion of the kana string. Reference numeral 7 denotes a kana row front partial take-out section, which receives a start signal from the kana row front partial take-out activation section 6 and selects a partial kana row starting from the beginning among the kana rows stored in the kana row storage section 2 as follows. And sends it to the word search unit 4. That is, the value of the kana number N of the partial kana row stored in the kana row storage unit 2 is set to a positive number smaller than the current value. In this embodiment, N = N-1 is set. At the same time, the kana row front part extraction section activates an input kana row display section described later. Further, the kana string front partial extraction unit 7 sends a signal indicating that the front part of the kana string is taken out to the word search unit 4 to the word search unit 4 to the kana string front partial extraction storage unit described later. . 8 is a kana string front part extraction storage unit, which has one partial kana string extraction flag R. In this partial kana string extraction flag R, the kana string front part extraction part 7 is a front part to the word search part 4. Logical "1" when a signal indicating that the kana string has been transmitted is transmitted, and logical "0" otherwise.
Is remembered. In other words, R = 0 corresponds to the state where Kana-Kanji conversion is performed on the currently input Kana string,
R = 1 corresponds to a state in which re-conversion is performed on the input kana sequence. Reference numeral 9 denotes a maximum / longest match word storage unit having a maximum / longest match reading string register U, and a word search unit 4
Read out the read string V of the longest matching word P stored in the temporary longest matching word temporary storage unit 5 and the information R stored in the Kana string front part extraction storage unit 8 and the internal longest matching reading string The storage state of the register U is set as follows.
That is, when R is "0", the value of V is stored in U, and when R is "1", the value of U is retained as before.

That is, in the state where the kana-row front partial extraction unit 7 is not activated, the contents of the maximum longest matching reading sequence register U are updated to the reading sequence of the longest matching word P, and the kana-row front partial extraction unit 7 is activated. Then, the above update is not performed. As described above, the maximum longest-matching word temporary storage unit temporarily stores the reading string of the word that has the longest match with the kana string input from the kana input unit by the operator.

Reference numeral 10 denotes a word learning information registration unit which, when receiving a start signal from a word determination unit to be described later, has a maximum longest matching word temporary storage unit 9
The maximum longest matching word reading string U stored in, the longest matching word reading string V currently stored in the longest matching word temporary storage unit 5 (this is referred to as a selected decision word), and its Kanji writing information. A set (U, V, W) with W is transferred to the word learning information storage unit described later.

A word learning information storage unit 11 stores the word learning information (U, V, W) notified from the word learning information registration unit 10. Further, this information is referred to by the word learning information search unit described later.

Reference numeral 12 is a word learning information search unit, which is a longest matching word temporary storage unit 5
The reading string that matches the reading string V of the longest matching word stored in is searched for in the maximum longest matching reading string U of the word learning information storage unit 11. This search is successful, sent to the kanji output unit to be described later V ₀ and the Chinese characters information W ₀ read selection decision word corresponding to the read column U ₀ in the case where U ₀ is found as the maximum matching read column To do. On the other hand, when the above search is unsuccessful, the reading sequence V of the words stored in the longest matching word temporary storage unit 5 and the Kanji writing information W thereof are sent to the Kanji output unit described later.

A kanji output unit 13 outputs kanji notation information of the word in the kana string stored in the kana string storage unit 2 for the word reading string portion notified by the word learning information search unit 12.
The kana columns other than the above output the kanji notation (the hiragana part of the kanji code). This output form may be a display on a CRT screen, for example.

Reference numeral 14 is a word determination unit, which is realized by one function key, and the word learning information registration unit 10 is activated by pressing this key. The contents of the kana row temporary storage unit 2 are cleared. This key is pressed when the operator confirms that the word displayed on the Kanji output unit 13 is the desired word.

An input kana row display unit 15 displays the kana row stored in the kana row storage unit 2 and displays the partial kana row separately from the others.

In the apparatus configured as described above, the operation for performing the following Kana-Kanji conversion will be described with reference to the flowchart shown in FIG. If the process number following each process is not specified here, the process proceeds to the process of the next process number in the order of Iroha.

[Normal input]

(B) (Kana row input / storage) In the input waiting state, the kana row K is input from the kana input unit 1. The input kana sequence is additionally stored in the kana sequence storage unit 2. The number Kana of kana columns stored is set in the internal register N which represents the number of kana of partial kana columns. Further kana row front extraction storage unit 14
The partial kana string extraction flag R is set to logic "0" (that is, conversion mode). In addition, the input kana row display unit 14 displays the kana row stored in the kana row storage unit 2. At this point in time, all kana rows are partial kana rows, so all kana rows are displayed as partial kana rows, for example, hatched display. After this, input is awaited.

(B) (Word search) Operator's "conversion key" (not shown)
In response to the depression of, the word search unit 4 searches the word dictionary for the word P having the longest reading information that matches the kana string from the beginning of the partial kana string M among the kana strings stored in the kana string storage unit 2. 3, and the set of the reading information V and the Chinese character notation information W of the searched word P is transferred to the longest matching word temporary storage unit 5.

(C) (Updating maximum longest matching word) The maximum longest matching word temporary storage unit 9 stores the reading information V of the longest matching word P stored in the longest matching word temporary storage unit 5 and the kana row front part extraction storage unit 8. The stored information R is read, and the storage state of the maximum longest longest coincidence read sequence register U is set as follows. That is, when R is "0", the value of V is set in U, and when R is "1", the value of U is retained as it was.

(D) (Learning information search) The word learning information searching unit 12 sets the reading string V of the longest matching word stored in the longest matching word temporary storage unit 5 in the longest matching reading string U of the word learning information storage unit 11. Search for. This search succeeds and is the longest match reading string
It sends the column V ₀ and the Chinese characters information W ₀ read selection decision word corresponding to the read column U ₀ against kanji output unit 13 when the U ₀ found. On the other hand, when the above search is unsuccessful, the reading sequence V of the words stored in the longest matching word temporary storage unit 5 and the Kanji writing information W thereof are sent to the Kanji output unit.

(E) (Kanji notation output) Kanji output unit 13 Kana row storage unit 2
Of the kana strings stored in, the word learning information retrieval unit 12
The part of the reading column of the word notified by is output the kanji notation information of this word, and the kana string other than the above outputs the kanji notation (hiragana). After this, the system waits for input.

[Kana row front part removal]

(F) (Kana row front partial take-out) When the kana row front partial take-out activation section 6 is activated in the input waiting state, the kana row front partial take-out section 7 is activated. Then, the kana row front part extraction unit 7 determines the number N of kana rows of the partial kana row stored in the kana row storage unit 2.
Is set to N-1. Kana row front part extraction part 7
Partial kana row extraction flag R of partial row front extraction storage unit 8
Set the value of to a logical "1" (ie reconversion mode).
At this time, the input kana row display unit 14 displays the kana row stored in the kana row storage unit 2 and the partial kana row. After this, input is awaited.

[Word decision]

(G) (Word decision) While waiting for input, the word decision unit
The function key 14 is pressed.

(H) (Word learning information registration) At this time, the word learning registration unit 10
Is the reading sequence U of the maximum longest matching word stored in the maximum longest matching word temporary storage unit 9, and the longest matching word temporary storage unit 5
The word learning information storage unit 11 stores a set (U, V, W) of the reading string V of the longest matching word and its kanji notation information W stored in.

Further, the word determination unit 14 sends a clear signal to the kana string temporary storage unit 2. After this, the system waits for input.

A specific example of the operation of the kana-kanji conversion device of the present embodiment configured as above will be described below.

Now, assume that the operator creates a Japanese sentence "does not run". Therefore, the operator inputs the Japanese sentence reading with a kana from the kana input section. "C"
The book kana-kanji conversion device operates when the kana such as “shi”, “la”, “na”, and “i” are sequentially input and then the “conversion key” is pressed, as follows. FIG. 4 shows the state of each part of the book-kana-kanji conversion device in operation.

In FIG. 4, the column I shows the input kana and the control key. Column K is the storage state of the kana column of the kana column storage unit 2. This is also the kana column display state of the input kana column display unit 14. The L column is the number of kana in the kana column storage unit 2, and the M column is the storage state of the partial kana column of the same unit. This is also the partial kana column display state of the input kana column display unit 14. N row is the number of kana of the partial kana row of the same part, R row is the front row partial extraction storage section 8
Partial kana string extraction flag, U column is reading information of the maximum longest matching word, and V column is the longest matching word P in the longest matching word temporary storage unit 5.
The reading information V, W columns are the kanji output information W, V ₀ of the longest matching word P in the same part, and the word learning information retrieval unit 12 is the word learning information storage unit for the W, V ₀ columns.
Selection of search results when 11 is searched Determined word reading sequence, W
Column ₀ is the kanji notation information of the same selection decision word, and column O is the output kanji notation information of the kanji output section. Further, in column I, "change" represents input of a conversion key, "previous" represents input of a front partial extraction key, and "decision" represents input of a determination key.

The parentheses following each description of the following specific examples show the places in FIG. 4 corresponding to the description.

(0) First, in the initial state, the stored contents of the kana-row storage unit 2 are cleared, and the register R of the Kana-row front extraction storage unit 8 is
Is set to logic "0".

(1) First, when the operator inputs a kana "ha", the kana column K "ha" is stored in the kana column storage unit 2. In addition, the partial kana row M also becomes “C” (FIG. 4, row 1, column K, M).
Column). Similarly, input kana such as "shi""la""na""i". Then press the "Convert" key. (Fig. 4, line 6 I
(Column) (2) The word search unit 4 searches the word information storage unit 3 for a word having the kana string “Hashiranai” as a reading string. If the storage state of the word information storage unit 3 is as shown in FIG. 5, the longest matching word P is searched for the reading string “Hashira” and the kanji notation information “pillar”. (FIG. 4, row 6, column V, column W) (3) The maximum longest matching word temporary storage unit 9 is the maximum longest matching reading because the value of the register R of the Kana string front partial extraction storage unit 8 is “0”. Let the value of the column register U be "Hashira" (6th
(1st row, U column).

(4) The word learning information retrieval unit 12 retrieves the reading string “Hashira” stored in the longest matching word temporary storage unit 5 in the longest matching reading string of the word learning information storage unit 11. FIG. 6a shows an example of the storage state of the word learning information storage unit 11. In this example, since "Hashira" is not searched in the U-th column, the word learning information search unit 12 causes the word reading string "Hashira" stored in the longest matching word temporary storage unit 5 and its Kanji notation information ""Pole" is output to the Kanji output unit 13 (FIG. 4, line 6, column V _0, column W ₀ ).

(5) The Chinese character output unit 13 outputs the Chinese character notation information “pillar”. Then, the remaining part is output in hiragana. (FIG. 4, row 6, column O) (6) In this state, the output state (column O) of the Kanji output unit 13 is “no pillar”, which is different from what the operator desires. Then, the operator presses the function key which is the front extraction section 6 of the kana row. (Fig. 4, line 7 I
(Column) (7) At this time, the kana row front partial extraction unit 7 sets the value of the number of kana of the partial kana row to 4, which is one less than the current value (FIG. 4, row 7, column N). Then, the input kana column display unit 14 displays the partial kana column (row 7, column M in FIG. 4).

(8) After this, the kana-row front partial take-out unit 7 sets the value of the partial kana-row take-out flag R of the kana-row front partial take-out storage unit 8 to logical "1" (FIG. 4, row 7, column R). After this, input is awaited.

(9) Here, the operator presses the "conversion key". After this, the present apparatus performs the processing shown in FIGS. The third here
In the process of FIG. 6C, since the value of R is "1", the maximum longest matching word reading string U is held as the current value "Hashira" (FIG. 4, row 8, column U).

The internal state of the apparatus after this processing is as shown in FIG. 4, line 8.

(10) The kanji output state at this point is “no pillar”, which is not what the operator desires. Then, the operator further presses the front row partial extraction function key.

(11) At this time, the kana row front partial extraction unit 7 sets the value of the kana number N of the partial kana row to one less than the current value 4, that is, 3 (FIG. 4, row 9, column M, column N). Then, this device waits for input.

(12) After this, the operator presses the "conversion key". This apparatus performs the processes (b) to (e) in FIG. The internal state of the device after this process is shown in FIG. 4, line 10.

(13) Since the kanji output state in this state is “no pillar” and is not what the operator desires, the operator further presses the kana row front part extraction function key.

(14) At this time, the value of N is 2, and the partial kana row is "Hashi"
Becomes Then, this device waits for input. After this, the operator presses the "conversion key". After this, this device is shown in FIG.
Perform the processing of (e). It should be noted here that the value of R is "1" in the process of FIG. 3C, so that the longest matching word in this case has the maximum longest even though the reading of the longest matching word is "Hashi". The matching word reading string is to be retained as the current value "Hashira".

(15) After the completion of this process, the internal state of this device is
It becomes what is shown in the line.

(16) The kanji output state at this point is "not running", which is what the operator desires. Then, the operator presses the word determination function key which is the word determination unit 14.

(17) At this time, the word learning registration unit 10 reads the maximum longest matching word reading string U "Hashira" and the current longest matching word (selected decision word) reading string V "Hashi" and its Kanji notation information W "Run".
The group (“Hashira”, “Hashi”, “Run”) is stored in the word learning information storage unit 11. When this process ends, the storage state of the word learning information storage unit 11 becomes as shown in FIG. 6b.

Further, the word determination unit 14 sends a clear signal to the kana string temporary storage unit 2 (line 13 in FIG. 4). Then, after this, the operator again inputs the kana such as "ha", "shi", "la", "na", "i" to obtain the kanji string "does not run", and then presses the "conversion key". The operation of the book kana-kanji conversion device will be described.

(18) When the operator inputs a kana "ha", the kana row storage unit 2 stores the kana row K "ha". In addition, the partial kana row M also becomes “C”. (FIG. 4, row 14, column K, column M).
After this, input is awaited.

(19) Further, when the operator inputs "shi", "ra", "na", and "a", the same operation as described above is performed. The internal states of this device at the end of this process are shown in FIGS.
It becomes what is shown in the line. After this, input is awaited.

(20) When the operator presses the “conversion key”, the word search unit 4 searches the word information storage unit 3 for a word whose reading string has the longest match with the partial kana string “Hashiranai”. At this time, as the longest matching word P, the reading string is “Hashira” and the kanji notation information is “pillar”.
Is searched (row 19, column V, column W in FIG. 4).

(21) The maximum-longest matching word temporary storage unit 9 sets the value of the maximum-longest matching reading sequence register U to "Hashira" because the value of the register R of the Kana sequence front part extraction storage unit 8 is "0". Four
(Fig. 19, line U).

(22) The word learning information retrieval unit 12 retrieves the reading string “Hashira” stored in the longest matching word temporary storage unit 5 in the longest matching reading string in the word learning information storage unit 11. In the storage state of the word learning information storage unit 11 shown in FIG. 6b, "Hashira" is detected in the third row of the U-th column. At this time, the word-learning information retrieval unit 12 displays the V ₀ column “hashi” in the third row and its kanji notation W
₀ “Run” is output to the Kanji output unit 13.

(23) The kanji output unit 13 reads from the kana string storage unit 2 that the current partial kana string is “Hashiranai”, and the kana string V ₀ “Hashi” sent from the word learning information retrieval unit 12 is read.
And the Kanji notation W ₀ “Run” is read, and the Kanji notation information “Run not” is output from these information (FIG. 4, row 19, column K).

As described above, since the Chinese character notation "do not run" desired by the operator is obtained, the operator presses the "OK" key.

As described above, according to the present embodiment, when the operator desires the kanji notation "does not run", the operator first inputs the kana such as "ha""shi""la""na""i",
The kanji output notation after pressing the conversion key will be “no pillar”. Following this, if the function key for extracting the front part of the kana row and the conversion key are pressed three times each, the kanji output notation will be "not run". When the word determination key is pressed here, the reading sequence "Hashira" of the maximum longest matching word and the reading sequence "Hashi" of the longest matching word at the time when the word determination key is pressed and its Kanji notation information "Run" are displayed. The set is stored in the learning word information storage unit. And after this, "H", "Si", "La", "Na"
When the kana "i" is input and the conversion key is pressed, the above-mentioned set state stored in the learning word information storage section is called, and in this case, the kana row front part extraction key is pressed. If not, the kanji output notation will be "do not run." In addition, following the above operation, if you input the kana string "ha""shi""go" to get the kanji notation "kake", the maximum longest matching word becomes "hashigo", and the learning word information storage The section does not store words that read "hashigo" as information, so "kashi" is written in kanji,
Kanji output such as "Hashigo" is not output preferentially.

In the present invention, the case where the kana string is converted into the kanji string by inputting the kana and then pressing the conversion key has been described, but the present invention is not limited to this. For example, a kana string may be automatically converted into a kanji string each time a kana character is input from the kana input section.

Further, in this embodiment, the word is searched only once from the beginning of the kana string stored in the kana string temporary storage unit, and the subsequent grammatical processing of Japanese is not performed. But,
The present invention is not limited to such a configuration, and a grammatical connection process is performed on word candidates obtained as a result of word search, and another word string appropriate for Japanese is output. The components may be deepened.

Further, in the present embodiment, although the homonyms in the narrow sense having the same readings such as “run”, “bridge”, and “end” are not mentioned, the word learning memory, registration and search for these homonyms are not described. It goes without saying that the conventional technology of (1) can be applied.

EFFECTS OF THE INVENTION The kana-kanji conversion device of the present invention includes a front kana row designating means for designating a partial kana row from the beginning of a kana row stored in the kana row storage section by an operation for re-converting by an operator, and a kana row storage. A word search means for searching for the longest matching word having the longest matching reading from the beginning of the kana string stored in the section; and a longest matching word temporary storage section for storing the longest matching word,
The reading information of the word having the maximum reading length among the longest matching words searched by the word search device for the input kana string and each partial kana string created by the correction operation of the operator is stored. Maximum longest match storage section
By providing each unit for storing, storing and retrieving the reading information of the longest longest matching word, the reading information of the longest matching word determined by the operator, and the word learning information including information such as Kanji notation, When the Kanji output result is not what the operator desires, the operator specifies the input kana string part to display the Kanji output result again, and the operator does not want the Kanji output notation of the displayed word. If there is a notification, the learning information of the word is registered in the word learning information storage unit, and the longest matching word obtained by the word search means is searched in the word learning information storage unit, and the corresponding one is found. For example, the second word stored in association with the word is preferentially processed. Therefore, once the word learning information has been registered, if the same kana string is entered, the Kanji notation of the word previously selected by the operator is output preferentially. When another reading string including the reading string at the beginning is input, the above priority process is not performed, and it is possible to increase the possibility of outputting the conversion result desired by the operator. Effect is large.

[Brief description of drawings]

FIG. 1 is a block diagram showing a configuration of an embodiment of a kana-kanji device of the present invention, FIG. 2 is a diagram showing an example of a reading coding rule in the same embodiment, and FIG. 3 is a description of an operation of the embodiment. FIG. 4 is a diagram showing a state in one specific example of each component of the embodiment, FIG. 5 is a diagram showing an example of a storage state of the word storage unit in the embodiment, and FIG. 6 is the same. It is a figure which shows an example of the memory | storage state of the word learning information storage part in an Example. 2 ... Kana string storage section, 4 ... Word search section, 5 ... Longest matching word temporary storage section, 7 ... Kana row front section.

Claims (1)

[Claims] 1. A kana string storage unit for storing an input kana string, a word dictionary for storing pairs of Japanese word reading information and kanji writing information, and an operator's operation for reconversion. A forward kana row designating means for designating a partial row starting from the beginning of the kana row stored in the kana row storage section, and a longest matching reading from the beginning of the kana row or the partial kana row stored in the kana row storage section. A word searching means for searching the longest matching word in the word dictionary, and a maximum longest matching word temporary storage section for storing reading information of the longest matching word searched by the word searching means for an inputted kana string; A selection which is selected and determined by the operator from among the longest matching words searched by the word search means for the partial kana string designated by the reading information of the maximum longest matching word and the operator's reconversion operation. A word learning information storage unit that stores word learning information composed of a pair of constant word reading information and Kanji notation information, a word learning information registration unit that registers the word learning information in the word learning information storage unit, and The kana string has a word learning information search part for retrieving the corresponding word learning information by searching the word learning information storage part, and when converting the input kana string into a kanji string, the word searching means uses the word dictionary. The maximum matching word is searched, and the word learning information search unit searches the word learning information storage unit for word learning information having the same reading information as the maximum matching word, and if the search is successful, the searched word learning information is searched. Output the Kanji notation of the selected decision word prior to the Kanji notation of the maximum matching word, while giving priority to the Kanji notation of the maximum matching word if the search is unsuccessful. Kana-Kanji conversion device and outputs.