JPH10124500A - Kana-Kanji conversion device - Google Patents

Abstract

(57) [Problem] To provide a Kana-Kanji conversion apparatus capable of efficiently performing Kana-Kanji conversion processing by searching for a rule also at the time of next candidate conversion, thereby eliminating unnecessary candidates. SOLUTION: A normal kana-kanji conversion process is performed on the entire reading of a phrase to be subjected to the next candidate conversion, and the conversion result is replaced with the target phrase in the conversion result storage area 22 (S52). Next, the target phrase in the conversion result storage area 22 is compared with a rule having a next candidate selection flag in the rule dictionary (S54). If there is a matching rule (S56: YES), A process of not selecting the target phrase in the conversion result storage area 22 as the next candidate is performed (S58).

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 device used for a Japanese word processor or the like.

[0002]

2. Description of the Related Art Conventionally, a kana-kanji conversion device of this kind has been disclosed in Japanese Patent Application Laid-Open No. 3-142658.
Performs Kana-Kanji conversion based on a basic dictionary that stores notation such as Kanji for reading words, stores the Kana-Kanji conversion result in the conversion result storage unit, and stores a set of word string patterns and their rewriting information as a set. The rules stored as rules are used as a rule dictionary, and when a rule that matches a rule in the rule dictionary is searched, the contents of the Kana-Kanji conversion result are rewritten and displayed on a display device. Such a series of actions was called rule conversion.

Further, Japanese Patent Application Laid-Open No. 5-120265 provides a next candidate conversion process for re-converting a kana-kanji conversion result rewritten by rule conversion.

[0004] For example, when "Goryushin ni Ai" is input, "Love to parents" may be output as a conversion result in normal kana-kanji conversion. If this is done by using rule conversion, <U-go: N><U-
If the pattern of "Parents: N><U-:N><D-Ai:Meeting" is stored, the part of "Love" of "Love my parents" is rewritten to "Meet" and "Meet my parents" can be the correct conversion result. Furthermore, the part of "meet" can be changed to "meet" by the next candidate conversion without deleting the character string as it is.

[0005]

However, when the processing of the next candidate conversion is performed, it is considered that the character string will not be used. Was sometimes displayed. For example, if the rule conversion converts "meet parents", but the next candidate conversion process is performed to convert "parents" to "parents" again, the prefix "go" This is a case where a character string "dormitory" is created because the noun "dormitory" and the suffix "heart" are connected and displayed as the next candidate.
For this reason, the user has to handle unnecessary character strings as candidates, and it takes time to find a desired conversion candidate, and there is a problem that the usability is poor.

SUMMARY OF THE INVENTION The present invention has been made to solve the above-mentioned problem. Even during the conversion to the next candidate, a rule is searched to identify an unnecessary character string and remove the character string from the candidate, thereby shortening the character string. It is an object of the present invention to provide an easy-to-use kana-kanji conversion device capable of efficiently performing a desired kana-kanji conversion process in a short time.

[0007]

In order to achieve this object, a kana-kanji conversion device according to the present invention comprises an input means for inputting a kana reading character string, a basic dictionary storing at least a notation for reading a word, and A kana-kanji conversion means for performing kana-kanji conversion of a kana reading character string input by the input means based on the basic dictionary, and a conversion result storage means for storing a conversion result by the kana-kanji conversion means,
A pattern consisting of a combination of a plurality of words of information such as word reading and notation stored in the basic dictionary,
A rule dictionary storing rules having rewriting information for rewriting words in the pattern, and a rule having a pattern matching the conversion result stored in the conversion result storage means are searched from the rule dictionary. Rule retrieving means, a rule rewriting means for rewriting the conversion result in accordance with rewriting information of the rule when a rule having a matched pattern is retrieved by the rule retrieving means, and processing by the rule retrieving means and the rule rewriting means And a next candidate conversion means for re-converting the character string displayed as a candidate as a result of the execution.

[0008] In particular, the rule dictionary of the present invention includes a pattern composed of a combination of a plurality of words of information such as word reading and notation stored in the basic dictionary, and a notation of a word in the pattern. Rewriting information for rewriting and a next candidate rule having flag information designating that it is used at the time of next candidate conversion are stored in advance, and the character string stored in the conversion result storage means is rewritten by the next candidate means. When the rule having a pattern that matches the conversion result, based on the flag information,
There is provided a next candidate rule search unit that searches from the next candidate rule in the rule dictionary and does not select the character string as a next candidate when a next candidate rule having a matching pattern is searched.

According to the kana-kanji conversion apparatus of the present invention, the rule is searched for during the conversion of the next candidate, and when a rule having a matching pattern is searched, the next candidate can be excluded from the candidates. Candidates can be reduced and kana-kanji conversion can be performed efficiently in a shorter time.

[0010]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of a kana-kanji conversion device according to the present invention will be described below with reference to the drawings.

FIG. 1 is a block diagram showing a schematic electrical control configuration of the kana-kanji conversion device.

As shown in FIG. 1, the kana-kanji conversion apparatus according to the present embodiment has a keyboard or the like for inputting a character string for kana-kanji conversion and for performing various instructions such as conversion and re-conversion. The device 10 is connected to a central processing unit (CPU) 12 for controlling the entire device. The RAM 20 is connected to the CPU 12 and stores a conversion result storage area 22 for storing a result of the Kana-Kanji conversion, a reading input buffer area 24 for storing an input Kana reading character string, An output buffer area 26 for storing the contents as a Kana-Kanji character string, and a work area 28 for recording pointer information, flag information, and the like are provided. The input device 10 constitutes the input means of the present invention, and the conversion result storage area 22
It constitutes the conversion result storage means of the present invention.

The conversion result storage area 22 stores an input kana reading character string in a basic dictionary 62 and a connection table 6 described later.
The result of the Kana-Kanji conversion using No. 4 is stored with information attached in word units, and this content is further referenced and updated at the time of rule conversion or next candidate conversion.

The ROM 40 is connected to the CPU 12 and includes a program section 42 for storing various programs and a dictionary section 60 for storing a plurality of dictionaries. The program unit 42 includes a kana-kanji conversion program 44, a rule search program 46, and a rule rewriting program 48
, A next candidate conversion program 50, and a next candidate rule search program 52.

The rule search program 46 constitutes rule search means of the present invention, and the rule rewriting program 48 constitutes rule rewrite means of the present invention. Is called rule conversion processing.

The kana-kanji conversion program 44
Constitute the kana-kanji conversion means of the present invention, and the next candidate conversion program 50 constitutes the next candidate conversion means of the present invention.

Also, the next candidate rule search program 52
It constitutes the next candidate rule search means of the present invention.

The dictionary section 60 stores a basic dictionary 62, a connection table 64, and a rule dictionary 66.

The basic dictionary 62 stores reading of each word, kanji notation of the word, part of speech information of the word, and meaning code information indicating a category to which the word belongs.

The connection table 64 stores data for determining whether or not there is a connection relationship between words based on part of speech information. For example, information that a noun can be connected to a case particle and information that a verb cannot be connected to a case particle are stored as table data.

The rule dictionary 66, as shown in FIG. 2, stores rule items 66a to 66e and a next candidate rule selection flag 66f as one set. Generally, rule items are stored in the form of <search factor-word pattern: rewrite information>, and a combination of these items is used to create one rule. What are search factors?
Indicates the type of method that the conversion result matches with the rule.
There are a U factor, a D factor, an M factor, and the like. The U factor means reading and notation of a word stored in the conversion result storage area 22 and a perfect match, and the D factor is a conversion result storage area 22.
Means the reading of the word stored in. Further, the M factor means that they match with the meaning code of the word stored in the conversion result storage area 22. The word pattern indicates a word that matches the rule with an item in the conversion result storage area 22, and includes a word reading or notation, a meaning code, or a word group. 66e is a word group
"5 lines of P lines" indicates that all the endings of the utilization of 5 lines of lines are used.

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 of the conversion result storage area 22 corresponding to the item of the rule dictionary 66 is stored. Indicates that the words inside are not changed and are not rewritten. Also, delete marker D
Indicates that the item is to be deleted. When there is a word string as rewriting information, it indicates that a word in the conversion result storage area 22 that matches an item of the rule dictionary 66 is rewritten to the word string. The word string referred to here is a plurality of words (only one word may be stored) stored in the rule dictionary 66. In practice, address information or the like for indicating a word in the basic dictionary 62 is set. Based on the address information, the basic dictionary 62
Utilized by referring to In FIG. 2, words are read or represented by notation for easy understanding.

The next candidate rule selection flag 66f constitutes flag information of the present invention, and is set to "0" for processing when reconversion is instructed and a character string in the conversion result storage area 22 is rewritten. Based on the value of “1”, a rule to be used in the next candidate rule search process described later is selected. This next candidate rule selection flag 66f is set in advance,
The rule is set to a combination of unnecessary words.

Next, the operation of the kana-kanji conversion device configured as described above will be described with reference to the flowchart of FIG. The storage status in the rule dictionary 66 is shown in FIG.
It is assumed that the state is as shown in FIG.

When a key is input from the input device 10 (S1)
(Steps 0 and S are the same in the following.) It is determined whether or not the input is a reading character (S12). If the input is a reading character (S12: YES), the kana character code is RA.
It is stored in the read input buffer area 24 of M20 (S1
4). For example, when “Reading character string” is input as a reading character string, the kana character code is stored in the reading input buffer area 24. Then, it waits for a key input. On the other hand, if the input key is not a reading character (S12: NO), it is determined whether the input key is a conversion key (S16). If the input key is not a conversion key (S16: NO), Other processing is performed (S1
8). Then, it waits for a key input.

When the input key is a conversion key (S16: YES), kana-kanji conversion is performed, and
The kana-kanji conversion program 44 of the OM 40 converts the kana character code stored in the reading input buffer area 24 into a kana-kanji mixed sentence based on the basic dictionary 62 and the connection table 64, and stores each word in the conversion result storage area 22. Is performed (S20).

For example, when ordinary kana-kanji conversion is performed based on the basic dictionary, the sentence “kana kana mixed” may be converted to “love your parents”. And each word,
“Go”, “Parents”, “Ni”, and “Love” are stored in the conversion result storage area 22.

Next, the rule search program 4 in the ROM 40
6, a search process is performed to determine whether or not a rule having a combination of word patterns matching the combination of words in the conversion result storage area 22 exists in the rule dictionary 66 (S22). If the rule to be found does not exist (S
24: NO), the rule conversion process is terminated, and the contents of the conversion result storage area 22 are stored in the output buffer area 26 and displayed on the output device 70 (S28).

If the rule to be found exists (S24:
YES), the rule rewriting program 48 of the ROM 40 performs a process of rewriting, in accordance with the rule rewriting information, a word combination part that matches a rule word pattern combination among words in the conversion result storage area 22. (S26). This completes the rule conversion processing, and the contents of the conversion result storage area 22 rewritten by the rule conversion processing are stored in the output buffer area 26 and displayed on the output device 70 (S28).

For example, of the words in the conversion result storage area 22, “go”, “parents”, “ni”, and “love” correspond to the word patterns of the rules 66 a to 66 e in the rule dictionary 66. If a match is found, "love" is rewritten to "me" or "i" according to the rewriting information of the rule, and the display of the conversion result is "meet my parents".

Thereafter, an instruction by a key input from the user is received (S30), and it is determined whether or not the input key is a determination key for instructing determination (S32). (S32: YES), a determination process for determining the conversion result displayed on the output device 70 is performed (S34). If the input key is not the final key, it is further determined whether or not it is the next candidate key for instructing reconversion (S36). If it is the next candidate key (S36: YES), The next candidate conversion process, which will be described later, is performed on the phrase where the phrase cursor is located (S40). If it is not the next candidate key (S3
6: NO), and other processing such as movement of the phrase cursor is performed (S38). Then, it waits for a key input.

Next, the details of the next candidate conversion process will be described with reference to the flowchart shown in FIG.

When the next candidate key is pressed, the next candidate conversion process starts. First, the target phrase is read from the reading input buffer area 24 of the RAM 20 and stored in the work area 28 (S50). Then, a normal kana-kanji conversion process is performed on the entire reading, and the conversion result is replaced with that of the target phrase in the conversion result storage area 22 (S52).

The normal kana-kanji conversion process performed in the next candidate conversion process is a next candidate extraction process generally performed in a field such as a word processor, and a detailed description thereof will be omitted.

Next, the next candidate rule search program 42 in the ROM 40 has a combination of word patterns that match the combination of words of the target phrase in the conversion result storage area 22, and has a next candidate rule selection flag. A search is performed to determine whether or not a rule exists (S54). If there is no matching rule (S56: NO), the rule is stored in the output buffer area 26 and displayed on the output device 70 (S56).
60). On the other hand, if there is a matching rule (S5
6: YES), the combination of words of the phrase targeted in the conversion result storage area 22 is not selected as the next candidate (S:
58) Then, the next candidate is extracted.

For example, by specifying the "parents" part of the conversion result "meet parents", the next candidate is converted, and "go",
It is assumed that “dormitory” and “heart” are extracted as next candidates. With respect to the extracted conversion result, a rule having a matching word combination is searched from the rules with the next candidate rule selection flag set in the rule dictionary 66, and the matching rule (66
x to 66z), the words “go”, “dormitory”, and “heart” are deleted according to the rewriting information for each word of the rule and the deletion marker D, and are not adopted as the next candidate, and further, Are extracted as the next candidate.

As described above, according to the kana-kanji conversion device of the present embodiment, unnecessary rules can be obtained by adding a rule having a next candidate rule selection flag to the rule dictionary and performing a rule search process during the next candidate conversion. Since candidates can be eliminated, a desired conversion result can be obtained more quickly.

[0038]

As is apparent from the above description, according to the kana-kanji conversion apparatus of the present invention, a rule search process is performed during the conversion of the next candidate using the next candidate rule stored in the rule dictionary in advance. As a result, unnecessary character strings can be excluded from candidates, so that kana-kanji conversion processing can be performed efficiently in a shorter time.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a schematic electrical control configuration of a kana-kanji conversion device according to the present embodiment.

FIG. 2 is a schematic diagram showing stored contents of a rule dictionary.

FIG. 3 is a flowchart showing an operation of the kana-kanji conversion device of the present embodiment.

FIG. 4 is a flowchart showing the operation of the kana-kanji conversion device of the present embodiment.

[Explanation of symbols]

 Reference Signs List 10 input device 12 CPU 20 RAM 22 conversion result storage area 24 reading input buffer area 26 output buffer area 40 ROM 42 program unit 44 kana-kanji conversion program 46 rule search program 48 rule rewriting program 50 next candidate conversion program 52 next candidate rule search program 60 Dictionary unit 62 Basic dictionary 66 Rule dictionary

Claims (1)

[Claims] An input unit for inputting a kana reading character string; a basic dictionary storing at least a notation for reading a word; and a kana reading character string input by the input unit based on the basic dictionary. Kana-Kanji conversion means for performing Kana-Kanji conversion, conversion result storage means for storing the conversion result of the Kana-Kanji conversion means, and a pattern comprising a combination of a plurality of words of information such as word reading and notation stored in the basic dictionary When,
A rule dictionary storing rules having rewriting information for rewriting words in the pattern; and a rule having a pattern matching the conversion result stored in the conversion result storage means is searched from the rule dictionary. Rule retrieving means, a rule rewriting means for rewriting the conversion result according to rewriting information of the rule when a rule having a matched pattern is retrieved by the rule retrieving means, processing by the rule retrieving means and the rule rewriting means The kana-kanji conversion device provided with a next candidate conversion means for re-converting a character string displayed as a candidate as a result of the execution of the rule dictionary, wherein the rule dictionary includes information such as reading and notation of words stored in the basic dictionary. A pattern consisting of combinations of multiple words in The replacement candidate information and the next candidate rule having flag information designating that it is used at the time of the next candidate conversion are stored in advance, and the character string stored in the conversion result storage unit is rewritten by the next candidate conversion unit. When, the rule having a pattern that matches the conversion result is searched from the next candidate rule in the rule dictionary based on the flag information,
When a next candidate rule with a matching pattern is found,
A kana-kanji conversion device comprising a next candidate rule search unit that does not select the character string as a next candidate.