JP3350070B2 - Kana-Kanji conversion device - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a kana-kanji conversion processor such as a Japanese word processor.

[0002]

2. Description of the Related Art Conventionally, in this type of kana-kanji conversion apparatus, as disclosed in Japanese Patent Application Laid-Open No. 3-142658, a kana-kanji conversion is performed by referring to a basic dictionary storing notation of kanji and the like for reading words. Is performed, and the kana-kanji conversion result is stored in the conversion result storage unit. Then, a rule dictionary that stores a pattern of a plurality of word strings and its rewriting information as a set of rules is used. When a rule that matches a rule in the rule dictionary is searched, the contents of the Kana-Kanji conversion result are read. It was rewritten and displayed by a display device. In addition, such a series of actions was called rule conversion.

[0003] For example, in the case of inputting "Tsukue no Ue Fuku", when performing Kana-Kanji conversion with reference to the basic dictionary, "blowing", "blowing", "wiping", and "roofing" are performed in the basic dictionary. ", The first candidate" spray "
Is output, and an erroneous conversion of “spraying on the desk” is performed.
Then, the conversion result of “spraying on the desk” is stored in the conversion result storage unit.

[0004] Next, when performing rule conversion with reference to the rule dictionary, <U-desk: N><U-:N><D-
Top: Top><U-:N><D-F:Wipe><U-K: N
If the pattern “>” is stored, the “spray” part of “spray on the desk” stored in the conversion result storage unit is replaced with “wipe”, and the correct conversion “wipe on the desk” is performed. Was the result.

[0005]

However, even when the above-mentioned rule conversion processing is performed, it has the meaning that the user wants to use the "wipe" portion with a flat surface or to blow off dust on the desk. Sometimes I want to make a sentence that uses "blowing". Even in that case, since the pattern "wiping on the desk" is stored in the rule dictionary, the rule is always converted to "wipe on the desk". Therefore, in order to convert as desired, the user had to convert the "wipe" part back into a hiragana "fuku" or a kanji "blow" candidate.

Further, even when it is desired to repeatedly use the character string "blow on the desk", since the pattern "wipe on the desk" is stored in the rule dictionary, "wipe on the desk" must be performed. And the rules were converted. Therefore, it has been necessary for the user to convert the “wiping” portion into the kanji “blowing” again and again.

[0007] Therefore, in the conventional rule conversion, a conversion result that meets the user's preference cannot be obtained, and the character string that has been converted once must be corrected in the same manner.

The present invention has been made in order to solve the above-mentioned problem. When a word used in the previous conversion is stored, and the conversion is performed again using the same word, the word is not included in the rules. It is an object of the present invention to provide a kana-kanji conversion device capable of performing kana-kanji conversion in accordance with a user's request by prioritizing a rewriting operation.

[0009]

In order to solve this problem, a kana-kanji conversion device according to the present invention is constructed as shown in FIG.
Input means for inputting a kana reading character string, a basic dictionary storing notations for reading words, and
The words you have already used and entered
Word order storage means for storing words in the order in which they were used, and kana reading input by the input means
A string, a kana-kanji conversion means for kana-kanji conversion based on said basic dictionary and word order storage unit, a conversion result storage means for storing Rikanakanji converted result by the the kanji conversion unit, a plurality of the basic dictionary A rule dictionary storing a pattern of the word string and rewriting information thereof, a rule search means for searching a rule stored in the conversion result storage means that matches a rule in the rule dictionary, and a rule search thereof.
Means for searching for the matching rule.
Determining means for determining whether a word stored in the word order storage means exists in a portion of the contents of the replacement result storage means that matches the rule, and determining the word order storage means by the determination means A rule rewriting means for rewriting the contents of the corresponding conversion result storage means in accordance with a rule rewriting instruction searched by the rule search means only when it is determined that the word stored in the conversion result storage means does not exist; And a learning processing means for storing words having the same content as the output result of the output means in the word order storage means.

[0010]

In the kana-kanji conversion apparatus of the present invention having the above structure, the kana reading character string is inputted from the input means, and the order used in the basic dictionary and the word order storage means in which the reading of the word and the corresponding notation are stored. The kana-kanji conversion is performed by the kana-kanji conversion means with reference to the word stored in.
After that, the result of the Kana-Kanji conversion is stored in the conversion result storage means, and the rule search means searches the rules stored in the rule dictionary for rules that match the items stored in the conversion result storage means.

When the rule retrieving means finds a rule that matches the content of the conversion result storage means, the determining means stores the part of the content of the conversion result storage means that matches the rule in the word order storage means. Only when it is determined that the stored word does not exist, rewriting in the conversion result storing means is performed in accordance with the rule rewriting instruction searched by the rule rewriting means. The contents of the conversion result storage means are converted into kana-kanji character strings and output by the output means, and the learning processing means outputs words having the same contents as the output results.
Is stored in the word order storage means .

[0012]

DESCRIPTION OF THE PREFERRED EMBODIMENTS One embodiment of the present invention will be described below with reference to the drawings.

The overall structure of the kana-kanji conversion device will be described with reference to FIG.

An input device 10 such as a keyboard for inputting a character string to be subjected to kana-kanji conversion is connected to a central processing unit (CPU) 12 for controlling the entire device.
RAM 20 as storage means is connected to CPU 12,
A conversion result storage area 22 for storing a result of Kana-Kanji conversion, a reading input buffer area 24 for storing an input kana reading character string, and a conversion result storage area 22
, An output buffer area 26 for storing the contents of Kana-Kanji character strings, a work area 28 for recording pointer information, and a word I in the order of new use as word learning information.
And a word order storage area 29 for storing D.

As shown in FIG. 3, the conversion result storage area 22 stores the entire conversion result attached with information in word units, and identifies each word stored in a basic dictionary 42 described later. ID2 which is a unique numerical value for performing
2a, word reading length 22b, word notation 22c,
The homophone head ID 22d, the homophone end ID 22e, and the learning flag 22f are stored as data for each word.

Note that the homophone head ID 22d is stored in the input device 1
It is the same as the character string (word) input from 0, and indicates the word ID 42a stored in the basic dictionary 42 with the smallest numerical value. Also, the homophone end ID 22e
Is the same as the character string (word) input from the input device 10 and indicates the word ID 42a stored in the basic dictionary 42 with the largest numerical value.

The learning flag 22f is set to "0" when each word stored in the conversion result storage unit is a word that is preferentially converted with reference to the word order storage area 29.
A 1 indicating N is stored, otherwise a 0 is stored.

ROM 30 for storing programs, dictionaries, etc.
Is connected to the CPU 12, the program unit 32 and the dictionary unit 4
It consists of 0. The program section 32 stores a kana-kanji conversion program 34, a rule search program 36, a determination program 37, a rule rewriting program 38, and a learning processing program 39.

The rule search program 36, the determination program 37, and the rule rewriting program 38 are collectively called a rule conversion process.

The dictionary section 40 comprises a basic dictionary 42, a connection table 44, and a rule dictionary 46. As shown in FIG. 4, the basic dictionary 42 includes a word ID 42a which is a unique identification number of the word, a reading 42b of the word, a kanji notation 42c of the word, and a part of speech information 42d of the word.
And the word reading length 42e are stored.

The connection table 44 is stored as data defining the connection relationship between words based on part of speech information.

In rule dictionary 46, as shown in FIG. 5, rule items are generally written in the form of <search factor-word pattern: rewrite information>, and one rule is created by combining these items. It works. The search factor indicates the type of rewriting method of the rule conversion, and includes a U factor, a D factor, and a Y factor. The U factor completely matches the reading and notation of the word stored in the conversion result storage area 22. And the D factor means that the pronunciation of the word stored in the conversion result storage area 22, that is, the word coincides with the word. Further, the Y factor means that it matches the reading of the word string (or one word) stored in the conversion result storage area 22. The word patterns 46a to 46c indicate words corresponding to the respective items of the rule, and include reading and writing of the words.

The rewriting information is any one of the unchangeable marker N, the delete marker D, and the word string. When the unchangeable marker N is stored, the rewrite information is stored in the conversion result storage area 22 corresponding to the item of the rule dictionary 46. Leave the word
Indicates no rewriting. When the deletion marker D is stored, it indicates that the item is to be deleted. When the word is a word string, the word in the conversion result storage area 22 that matches the item in the rule dictionary 46 is rewritten to the word string. Represents. Here, the word string is a plurality of words (only one word may be stored) stored in the rule dictionary 46 with a word ID, and is converted by referring to the basic dictionary 42 based on the word ID. Word reading length 22b, homophone start ID 22c, homophone end ID 22 of result storage area 22
Settings such as d can be made. In FIG. 5, for easy understanding, the word ID portion is represented by a reading or a notation instead of a numerical value.

Next, the operation of the kana-kanji conversion device thus constructed will be described with reference to the flowchart of FIG.

For example, when a reading character string “Ishigai Tai” is input from the input device 10, the kana character code is R
It is stored in the read input buffer area 24 of the AM 20 (S
10). After that, the kana-kanji conversion program 34 in the ROM 30 refers to the basic dictionary 42, the word order storage area 29 and the connection table 44, and reads the reading input buffer area 2
The kana character code stored in No. 4 is converted into a sentence mixed with kanji and kana, and a word ID or the like is stored in the conversion result storage area 22. For example, the word “stone” has been used before, and in the word order storage area 29, the word ID of the word “stone” is stored before the word ID of the homophone “intention” or “doctor”. The word "stone" is prioritized and converted to a sentence "stone is hard" mixed with kanji or kana. Then, the learning flag 22f is set to ON together with the word ID and stored in the conversion result storage area 22 (S12). Then, the rule conversion processing is performed by referring to the contents of the conversion result storage area 22 and the rule dictionary 46 by the rule search program 36 and the rule rewriting program 38 of the ROM 30 (S14).

Next, the specific processing of the rule conversion processing will be described with reference to the flowcharts of FIGS.

First, a pointer P1 is set to the first word "stone" of "hard stone" stored in the conversion result storage area 22, and pointer information of the pointer P1 is stored in the work area 28 of the RAM 20 (S30). ).

Next, it is searched whether or not a rule matching the word pointed by the pointer P1 exists in the rule dictionary 46 (S3).
2). In the rule search subroutine shown in FIG. 9, first, the pointer P5 is set to the first rule 5-1 in the rule dictionary 46.
And the pointer information is recorded in the work area 28 (S320). Next, the pointer P6 is set to the first item 46a of the rule 5-1 indicating the pointer P5 , and the pointer information is stored in the work area 28 (S322). Next, the pointer P7 is set to the first word “stone” of the kana-kanji conversion result in the conversion result storage area 22 pointed to by the pointer P1 (S324).

Here, the rule pointed by the pointer P6 <U-
Listening: N> and conversion result storage area 2 pointed by pointer P7
Then, the word “stone” in 2 is compared (326). In this case, the rule does not match the word (S326 / NO), and the pointer P5
Is not the last rule in the rule dictionary 46 (S328: NO), the pointer P5 is set to the next rule 5
-2, the pointer information is stored in the work area 28 (S330), and the process returns to S322. Next, the pointer P6
Is set in the first item 47a of the rule 5-2 indicating the pointer P5, and the pointer information is stored in the work area 28 (S322). Next, the pointer P7 is set to the first word "stone" of the kana-kanji conversion result in the conversion result storage area 22 pointed to by the pointer P1 (S324).

Here, the rule pointed by the pointer P6 <U-
Stone: N> is compared with the word “stone” in the conversion result storage area 22 indicated by the pointer P7 (326). In this case, the rule matches the word (S326: YES), and the word "stone" in the conversion result storage area 22 pointed to by the pointer P7 has the learning flag set to "0" indicating OFF, so that the process proceeds to S327. S327: YES). Since the pointer P6 is not the last item (S332: NO), the pointer P7 is changed to the word "ga" next to "stone" stored in the conversion result storage area 22.
And the pointer P6 also moves to the next item <U-: N> (46b) in the rule 5-2 (47b), and stores the pointer information in the work area 28 (S334). Return.

Thereafter, the same procedure is repeated, and the pointer P7 is set to the word "Ken" in the conversion result storage area 22, and the pointer P6 is set to the item <D-method: hard> (4
The process moves to 7c) (S334). The item <D-how: hard> (47c) indicated by the pointer P6 is provided with a D factor and means a match in reading. Therefore, the word "ken" matches the word "ken" supported by the pointer P7 (S326: YES), and the word "ken" in the conversion result storage area 22 indicated by the pointer P7.
Is "0" indicating that the learning flag is OFF, so the flow proceeds to S332 (S327: YES). Since the item 47c indicated by the pointer P6 is not the last item (S3
32), the pointer P6 is set to the next item <U-i: N> in the rule 5-2, and the pointer P7 is set to the conversion result storage area 2.
Then, the process proceeds to the next word “i” in 2 and the pointer information is stored in the work area 28 (S334).

Item <U-I: N> indicated by the pointer P6
Matches the word "i" indicated by the pointer P7 (S326).
(YES), the conversion result storage area 22 indicated by the pointer P7
Since the word “i” in the middle is “0” indicating that the learning flag is OFF, the process proceeds to S332 (S327: YES).
Here, since the pointer information P6 is the last item (S332)
(YES), the rule flag ON is stored in the work area 28 (S336), and the process returns to S32 shown in FIG.

If no matching rule is found (S
326 · NO), or when the word in the conversion result storage area 22 indicated by the pointer P7 is “1” indicating that the learning flag is ON (S327 · NO), the rule indicated by the pointer P5 is the rule dictionary. The pointer P5 is sequentially moved to the next rule until the last rule is reached (S328: NO), and a matching rule is searched (S32).
2 to S330). When the rule indicated by the pointer P5 is the last rule in the rule dictionary (S328: YES), a rule flag OFF indicating that there is no matching rule is stored in the work area 28 (S338).

Here, in S32, the work area 2
8 is ON (S34 · YE
S), a rule rewriting process by the rule rewriting program 38 is started. First, the pointer P2 is set to the first word "stone" of the word string "hard stone" stored in the conversion result storage area 22 pointed to by the pointer P1, and the pointer information of the pointer P2 is stored in the work area 28 (S36). . Next, the pointer P3 is set to “i” at the end of the word string “stone is hard” stored in the conversion result storage area 22 indicated by the pointer P7,
The information of the pointer P3 is stored in the work area 28 (S
38). Subsequently, the pointer P4 is set as the first item of the matched rule 5-2 in the rule dictionary 46, and the pointer information of the pointer P4 is stored in the work area 28 (S4).
0). In the rule 5-2 in the rule dictionary 46, the pointer P
Since the head item <U-stone: N> (47a) indicated by No. 4 has the unchanged marker N (S44: YES), it is left as it is without rewriting, and the process proceeds to S46.

If the deletion marker D is standing at the location of the rewriting information in the item 46b pointed by the pointer P4 (S44 / NO, S48 / YES), the word "stone" indicated by the pointer P2 of the conversion result storage area 22 Is deleted (S5
0), and proceed to S46. Further, item 4 indicated by the pointer P4
If there is a word string at the location of the rewriting information in 7a (S4
(4.NO, S48.NO, S52.YES), the word "stone" pointed to by the pointer P2 in the conversion result storage area 22 is rewritten as the word string (S54), and the process proceeds to S46.

In S46, it is determined whether the word pointed by the pointer P2 is the same as the word pointed by the pointer P3. That is, when are equal word pointed words and pointers P3 indicated by the pointer P2, the pointer P2 is meant that advanced to the last word. In this case, since the “stone” pointed by the pointer P2 is not the last word of the conversion result stored in the conversion result storage area 22 (S46 / NO), the word pointer P2 is moved to the next word “ga”. Then, the pointer P4 is moved to the next item <U-: N> (47b) in the rule 5-2 (47b) (S56), and the process returns to S44.

Here, the item pointed by the pointer P4 <U-
: Since there is no change marker N in N> (S44 · YE
S), leave it as it is without rewriting, and proceed to S46. In this way, the contents of the conversion result storage area 22 are sequentially processed according to the rule rewriting instruction (S44 to S56). When the pointer P2 points to the last word "i" and the pointer P4 points to the last item <U-i: N> 47d (S56),
The rewriting information of the item <U-i: N> pointed by the pointer P4 has the unchangeable marker N (S44: YES), so that the rewriting information is not rewritten and the process proceeds to S46.

Here, the word "i" indicated by the pointer P2
Is the last word stored in the conversion result storage area 22 indicated by the pointer P3 (S46 · YE
S), if the pointer P1 is not at the last word of the word string stored in the conversion result storage area 22 (S58 · N
O), and move the pointer P1 to the next word one by one (S
60), a similar rule search process (S32) is performed by the rule search program 36 again. In this case, the pointer P1
Is moved to the second word “GA” of the character string “Stone is hard” stored in the conversion result storage area 22 (S58 · NO,
S60). Then, the processing of S32 to S60 is repeated.
Finally, when the pointer P1 is the last word in the conversion result storage area 22 (S58: YES), the rule conversion processing ends.

If the rule flag stored in the work area 28 is OFF (S34 / NO), the flow proceeds to S58. Here, if the pointer P1 is not at the last word of the word string stored in the conversion result storage area 22 (S5
8 · NO), the pointer P1 is moved to the next word one by one (S60), and a similar rule search process (S32) is performed again by the rule search program 36. In this case, the pointer P1 is moved to the second word “GA” of the character string “Stone is hard” stored in the conversion result storage area 22 (S58 · N).
O, S60). Then, the processing of S32 to S60 is repeated. Finally, when the pointer P1 is the last word in the conversion result storage area 22 (S58: YES), the rule conversion processing ends.

This result is stored again in the conversion result storage area 22, and the contents of the conversion result storage area 22 are stored in the output buffer area 26 and displayed on the output device 50 (FIG. 6, S16). Thereafter, if the user inputs a confirmation key (S18: YES), the words stored in the conversion result storage area 22 are stored in the word order storage area 29 (S22), and the process ends. If anything other than the enter key is input (S18: NO), the process proceeds to the candidate change process (S20). The result is stored in the conversion result storage area 22 again. Then, the contents of the conversion result 22 are stored in the output buffer area 26 and displayed on the output device 50 (S16). Thereafter, if the user inputs a confirmation key (S18: YES), the words stored in the conversion result storage area 22 are stored in the word order storage area 29 (S18).
22), end.

In the rule conversion processing, since the word used immediately before is stored in the word order storage area 29, when the Kana-Kanji conversion program 34 performs the Kana-Kanji conversion, the word is preferentially converted. Then, even when the rule that matches is searched by rule search program 36, the judging program 37 when the learning word is determined to be used in preference, it does not perform regular rewrite processing by the rule rewriting program 38 Thus, it is possible to provide a conversion result that meets the user's preference.

As described above, in the rule conversion process, even in the case where a rule has conventionally been converted to only a fixed pattern mechanically due to a rule, the process of prioritizing the learning word with the rule is also combined. Accordingly, when the user repeatedly uses the same character string, it is possible to provide a desired conversion result.

The present invention is not limited to a kana-kanji conversion device of a Japanese word processor, but can be applied to various devices involving Japanese input.

[0044]

As is apparent from the above description, the kana-kanji conversion apparatus of the present invention performs a process of giving priority to a learning word with respect to a rule conversion process, thereby preventing a rule conversion unintended by a user and performing a conversion. Efficiency can be improved.

[Brief description of the drawings]

FIG. 1 is a configuration diagram of the present invention.

FIG. 2 is a block diagram of a control unit of the kana-kanji conversion device according to the embodiment.

FIG. 3 is a conceptual diagram of the contents of a conversion result storage area according to the embodiment.

FIG. 4 is a conceptual diagram of the contents of a basic dictionary according to the present embodiment.

FIG. 5 is a conceptual diagram of the contents of a rule dictionary according to the present embodiment.

FIG. 6 is a flowchart of the kana-kanji conversion device of the present embodiment.

FIG. 7 is a flowchart of rule conversion according to the embodiment.

FIG. 8 is a flowchart of rule conversion according to the present embodiment.

FIG. 9 is a flowchart of a rule search subroutine of the embodiment.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 10 Input device 12 Central processing unit 20 RAM 22 Conversion result storage area 24 Reading input buffer area 26 Output buffer area 28 Work area 29 Word order storage area 30 ROM area 32 Program part 34 Kana-Kanji conversion program 36 Rule search program 37 Judgment program 38 Rule Rewriting program 39 Learning processing program 40 Dictionary unit 42 Basic dictionary 44 Connection table 46 Rule dictionary 50 Output device

Claims (1)

(57) [Claims] An input means for inputting a kana reading character string, a basic dictionary storing notation for reading a word, and a word already input and used by the input means.
A kana-kanji conversion unit that stores a kana- reading character string input by the input unit based on the basic dictionary and the word-order storage unit. a kana-kanji converting means for the conversion result storage means for storing Rikanakanji converted result by the the kanji conversion unit, and rules dictionary storing patterns and their rewriting information of the plurality of word strings of the base dictionary, the conversion A rule search unit that searches for a rule that matches a rule in the rule dictionary with respect to the content stored in the result storage unit; and the rule that matches is searched by the rule search unit .
When the content of the conversion result storage means matches the rule
Determining means for determining whether the words stored in the word order storage means part is present only when the word stored in the word order storage means is determined not to exist by the judgment means A rule rewriting means for rewriting the contents of the corresponding conversion result storage means in accordance with a rule rewriting instruction searched for by the rule search means; an output means for outputting the contents of the conversion result storage means as a Kana-Kanji character string; A kana-kanji conversion device, comprising: learning processing means for storing a word having the same content as the output result of the means in the word order storage means.