JPH0581238A - 'kana'/'kanji' converter - Google Patents

Abstract

PURPOSE:To more effectively execute rule conversion processing without increasing the memory capacity of a rule dictionary by applying the same information to plural words belonging to the same category and describing the words in a rule item. CONSTITUTION:A 'KANA' (Japanese syllabary) reading character string is inputted from an input means 1 and 'KANA'/'KANJI' (Chinese character) converting means 2 executes the 'KANA'/'KANJI' conversion of the inputted character string based upon a reference dictionary 3 storing notation corresponding to the reading of each word and information expressing the category of the 'KANA'/'KANJI' conversion result is stored in a conversion result storing means 5 and a rule stored in a rule dictionary 6 is compared with the contents stored in the means 5 by a rule retrieving means 7 to retrieve the existence of a role having a word belonging to the same category and coincidence of a pattern for words other than the word. At the time of retrieving a coincident rule, the contents of the means 5 are rewritten by a rule rewriting means 8 in accordance with a retrieved rule rewriting command and a 'KANA'/'KANJI' character string obtained by rewriting the contents of the means 5 is outputted.

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

[0002]

2. Description of the Related Art Conventionally, in this type of kana-kanji conversion device, kana-kanji conversion is performed by referring to a basic dictionary that stores notations such as kanji for reading a word, as disclosed in Japanese Patent Laid-Open No. 3-142658. And the kana-kanji conversion result is stored in the conversion result storage section. Then, a pattern in which a plurality of word string patterns and their rewriting information are stored as a set of rules is used as a rule dictionary, and when a rule that matches a rule in the rule dictionary is searched, the content of the Kana-Kanji conversion result is displayed. It was rewritten and displayed on the display device. Moreover, such a series of actions was called rule conversion.

[0003] For example, when inputting "tegami kagaku" and performing kana-kanji conversion by referring to the basic dictionary, when "each", "nucleus", and "writing" are stored in this order in the basic dictionary Will output the first candidate "each" and "letter each"
Is erroneously converted. Then, the conversion result “each letter” is stored in the conversion result storage unit.

Next, when the rule conversion is performed by referring to the rule dictionary, <U-letter: N><U- is: N><D in the rule dictionary.
-Writing: If the pattern of writing, Ku> is stored,
The U factor means perfect matching with reading and notation, and the D factor means matching with reading. Therefore, "write" the "each" part of "each letter" stored in the conversion result storage unit. It was rewritten into the correct conversion result of "writing a letter". Here, the N marker at the position of the rewriting information in the rule item represents that the rewriting is not performed.

[0005]

However, when performing the rule conversion, <U-letter: N><U-:N>.
The rule <D-Writing: Writing, Ku> is “each letter”,
It is applied only to the incorrect conversion of "letter to core" etc., and separately to the incorrect conversion of "each document" and "document to core".
It was necessary to prepare a rule of document: N><U-:N><D-write: write, ku>. Therefore, the capacity of the rule dictionary in the memory is large, and the effort for creating the rule dictionary is large.

The present invention has been made in order to solve the above-mentioned problems. Words that belong to the same category are given the same information and described in rule items, so that words that match one rule An object of the present invention is to provide a kana-kanji conversion device that can perform rule conversion processing more effectively without increasing the memory capacity of the rule dictionary by expanding the range of columns.

[0007]

In order to solve this problem, a kana-kanji conversion device of the present invention, as shown in FIG. 1, has an input means for inputting a kana-reading character string and a notation for reading a word. A basic dictionary that stores information indicating the category of the word, a kana-kanji conversion means that performs kana-kanji conversion based on the basic dictionary, a conversion result storage means that stores the conversion result by the kana-kanji conversion means, and the basic dictionary. With respect to the contents of the conversion result storage means and the rule dictionary that stores a rule having a word string pattern consisting of information such as word reading, notation, and category, and rewriting information, the words of the same category of the rule dictionary are stored. Have,
And the content of the corresponding conversion result storage means based on the rewriting information of the rule of the pattern when the rule search means that searches for a pattern other than the word that matches and the matching pattern is searched by the rule search means And rule output means for outputting the contents of the conversion result storage means as a kana-kanji character string.

[0008]

In the kana-kanji conversion device of the present invention having the above-mentioned structure, the kana-reading character string is input from the input means and stored in the basic dictionary storing the notation corresponding to the reading of the word and the information representing the category of the word. Based on this, kana-kanji conversion is performed by the kana-kanji conversion means. 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 a rule that matches the item stored in the conversion result storage means. At this time, the rule search means compares the rules stored in the rule dictionary with the contents stored in the conversion result storage means, has words in the same category, and patterns other than the words Search for a match.

Then, when the rule retrieving means retrieves a rule that matches the contents of the conversion result storing means, the rewriting in the conversion result storing means is performed according to the rule rewriting instruction retrieved by the rule rewriting means. The output means outputs the kana-kanji character string of the contents of the conversion result storage means.

[0010]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An 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 for Kana-Kanji conversion is connected to a central processing unit (CPU) 12 for controlling the entire device.
The RAM 20 as a storage means is connected to the CPU 12,
A conversion result storage area 22 for storing the result of kana-kanji conversion, a reading input buffer area 24 for storing the input kana reading character string, and a conversion result storage area 22.
An output buffer area 26 for storing the contents of the above as a kana-kanji character string and a work area 28 for recording pointer information are stored.

As shown in FIG. 3, the conversion result storage area 22 stores the entire conversion result with information added word by word, and identifies each word stored in a basic dictionary 42 described later. Word ID2 that is a unique numerical value for
2a, word reading length 22b, word notation 22c,
The same-sound word start ID 22d, the same-sound word end ID 22e, and the meaning code 22f are stored as data for each word.

The same-sound word head ID 22d is the input device 1
It shows the same sound as the character string (word) input from 0, and the smallest numerical value of the word ID 42a stored in the basic dictionary 42. Also, the end of homophone ID22e
Indicates a character having the same sound as the character string (word) input from the input device 10 and having the largest numerical value of the word ID 42a stored in the basic dictionary 42.

The meaning code 22f is a code assigned to each word in the basic dictionary 42 according to the meaning classification. Those having the same meaning code belong to the same meaning concept. For example, if a meaning code of "145" is assigned to the meaning concept of illness, "headache""cold""abdominalpain"
All words such as have the meaning code of [145] as meaning information.

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

The rule retrieval program 36 and the rule rewriting program 38 are collectively referred to as rule conversion processing.

The dictionary unit 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 a meaning code 42f are stored.

The connection table 44 is stored as data that defines the connection relationship between words by the part-of-speech information.

In the rule dictionary 46, as shown in FIG. 5, rule items are generally written in the form of <search factor-word pattern: rewriting information>, and one rule is created by combining these items. It works. The search factor indicates the type of rule conversion rewriting method, and includes a U factor, a D factor, a Y factor, a UM factor, and a DM factor, and the U factor represents a word stored in the conversion result storage area 22. It means a perfect match with the reading and the notation, and the D factor means the reading of a word stored in the conversion result storage area 22, that is, the word has the same sound. Also,
The Y factor means that it matches the reading of the word string (may be one word) stored in the conversion result storage area 22. The UM factor means that it matches the meaning code of the word stored in the conversion result storage area 22. The DM factor means to match a word having the same meaning code among all the homophones of the reading of the word stored in the conversion result storage area 22. Word pattern 4
6a to 46c indicate the corresponding words of each item of the rule, and the reading or notation of the words or the meaning code is entered here.

The rewriting information is one of the unchanged marker N, the deleted marker D, the word string, and the meaning code. When the unchanged marker N is stored, the conversion result memory that matches the item of the rule dictionary 46 is stored. The word in the area 22 is left as it is and is not rewritten. When the deletion marker D is stored, it means to delete the item, and when it is a word string, the word in the conversion result storage area 22 that matches the item of the rule dictionary 46 is rewritten to the word string. In the case of the meaning code, it means rewriting to a word having the same meaning code as a homophone among the words stored in the basic dictionary 42. The word string here means
A plurality of words (may be only one word) is the rule dictionary 46.
Is stored in the conversion result storage area 22 by referring to the basic dictionary 42 based on this word ID.
It is possible to set c, the same-sound ending ID 22d, and the like. still,
In FIG. 5, the word ID portion is not read as a numerical value but is read or written for easy understanding.

Next, the operation of the kana-kanji conversion device configured as described above will be described with reference to the flowchart of FIG.

For example, when the reading character string "Mikan no Hana" 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). Thereafter, the kana-kanji conversion program 34 of the ROM 30 refers to the basic dictionary 42 and the connection table 44 to convert the kana-character code stored in the reading input buffer area 24 into a kanji-kana mixed sentence, and the kanji-kana mixed sentence "unfinished Nose ”. Then, the meaning code 22f is stored in the conversion result storage area 22 together with the word ID (S12). Then, the rule retrieval program 36 and the rule rewriting program 38 of the ROM 30 perform the rule conversion process with reference to the content of the conversion result storage area 22 and the rule dictionary 46 (S14).

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

First, the pointer P1 is set to the first word "unfinished" of the "unfinished nose" stored in the conversion result storage area 22, and the 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 the 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 head item 46a of the rule 5-1 which points 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 "unfinished" of the kana-kanji conversion result in the conversion result storage area 22 pointed to by the pointer P1 (S324).

Here, the rule indicated by the pointer P6 <UM
-135: 135> is compared with the word "incomplete" in the conversion result storage area 22 pointed to by the pointer P7 (326). In this case, the rule and the word do not match (S326 / NO), and the rule 5-1 indicated by the pointer P5 is not the last rule in the rule dictionary 46 (S328 / NO), so the pointer P5 is set to the next rule 5-. 2 and move pointer information to work area 28
(S330), the process returns to S322. Next, the first item 4 of the rule 5-2 that points the pointer P6 to the pointer P5
7a, and pointer information is stored in the work area 28 (S322). Next, the pointer P7 is set to the first word "unfinished" of the kana-kanji conversion result in the conversion result storage area 22 pointed to by the pointer P1 (S324).

Here, the rule indicated by the pointer P6 <DM
-144: 144> is compared with the word "incomplete" in the conversion result storage area 22 pointed to by the pointer P7 (326). In this case, since the DM factor is added, the word “tangerine” in the basic dictionary 42, which is a homonym word of the reading “Mikan” of “incomplete” and having the meaning code 144 (representing a plant). Are matched in the meaning code, the rule and the word are matched (S326, YES), and the pointer P6 is not the last item (S332, NO). Therefore, the pointer P7 is stored in the conversion result storage area 22 as "unfinished". Move to the word "no" next to "," and the pointer P6 also moves to rule 5-2 (47b).
It moves to the next item <U-: N> (46b) and stores the pointer information in the work area 28 (S33).
4) Return to 326.

Here, the item indicated by the pointer P6 <U-
No: N> (47b) is attached with a U factor and means agreement in reading and notation. Therefore, the word "no" indicated by the pointer P7 matches (S326, YES), and the pointer P
The item 47c indicated by 6 is not the last item (S332).
-NO), the pointer P6 is set to the next item <D in rule 5-2.
-Hana: Hana>, and move the pointer P7 to the conversion result storage area 22.
The process advances to the next word "nose" in the middle and stores the pointer information in the work area 28 (S334).

Item <D-hana: flower> indicated by pointer P6
Has a D factor indicating a match in reading, and therefore matches the word “nose” indicated by the pointer P7 (S326.YE
S) and S332 (YES in S327). here,
Since the pointer information P6 is the last item (S332.YE
S), the rule flag ON is stored in the work area 28 (S
336), and the process returns to S32 shown in FIG.

When a matching rule is not searched (S
(326 / NO) moves the pointer P5 to the next rule in sequence (S330) until the rule pointed to by the pointer P5 is the last rule in the rule dictionary (S328 / NO) and searches for a matching rule (S330). S322-S330). Pointer P
When the rule indicated by 5 is the last rule in the rule dictionary (S328, YES), the 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
Since the rule flag of No. 8 is ON (S34 ・ YE
S) Then, the rule rewriting process by the rule rewriting program 38 starts. First, the pointer P2 is set to the first word "unfinished" of the word string "unfinished nose" 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 conversion result storage area 22 in which the pointer P3 points to the pointer P3
The word string "unfinished nose" stored in the above is set to "nose" at the end, and the information of the pointer P3 is stored in the work area 28 (S38). Then, the pointer P4 is set to the head item of the matched rule 5-2 in the rule dictionary 46, and the pointer P4 is set.
The pointer information of No. 4 is stored in the work area 28 (S4
0). Pointer P in rule 5-2 in rule dictionary 46
4 <DM-144: 144> (47a)
Since the rewriting information of has the meaning code 144 (S44.
NO, S46 / NO, S48 / NO, S50 / YE
S), the word stored in the basic dictionary 42 is "unfinished"
Is rewritten as the word “tangerine” having the meaning code 144 in the same phoneme (S51), and the process proceeds to S54.

In S54, the word pointed by the pointer P2 and the word pointed by the pointer P3 are compared to see if they are the same. That is, when the word pointed by the pointer P2 and the word pointed by the pointer P3 are equal, it means that the pointer P2 has advanced to the last word. In this case, the "tangerine" pointed to by the pointer P2 is not the last word that matches the conversion result rule stored in the conversion result storage area 22 (S54.N).
O), the word pointer P2 is moved to the next word “NO”, and the pointer P4 is moved to the next item <U-: N> in the rule 5-2.
While moving to (47b) (S56), the process returns to S44.

Here, the item <U-pointed by the pointer P4
No: Since there is no change marker N in N> (S44 ・ YE
S), without rewriting, it is left as it is, and the process proceeds to S54.

If the deletion marker D is set at the location of the rewriting information in the item 47b pointed to by the pointer P4 (S44 / NO, S46 / YES), the word "of the pointer P2 in the conversion result storage area 22" Is deleted (S5
0), and proceeds to S54. Item 4 pointed to by pointer P4
When there is a word string at the location of the rewriting information in 7a (S4
4 · NO, S46 · NO, S48 · YES), the word “no” pointed to by the pointer P2 in the conversion result storage area 22 is rewritten with the word string (S52), and the process proceeds to S54.

In S54, the word pointed to by the pointer P2 and the word pointed by the pointer P3 are compared to see if they are the same. That is, when the word pointed by the pointer P2 and the word pointed by the pointer P3 are equal, it means that the pointer P2 has advanced to the last word. In this case, "no" pointed by the pointer P2
Is not the last word of the conversion result stored in the conversion result storage area 22 (S54, NO), the word pointer P2 is moved to the next word "nose" and the pointer P4 is set to rule 5.
The next item <D-hana: flower> in -2 is moved to (47c) (S56), and the process returns to S44.

Here, the item <D-pointed by the pointer P4
Hana: Because there is the word “flower” in the rewriting information for flower> (S4
4 · NO, S46 · NO, S48 · YES), the word “nose” indicated by the pointer P2 is rewritten with the word “flower” in the rewriting information indicated by the pointer P4 (S52), and the process proceeds to S54.

Since the word pointed to by the pointer P2 has become the last word stored in the conversion result storage area 22 indicated by the pointer P3 (YES in S54), the pointer P1 is stored in the conversion result storage area 22. If it is not at the end word of the stored word string (S60, NO), pointer P
One is moved to the next word (S62), and the same rule search process (S32) is performed again by the rule search program 36. In this case, the pointer P1 is set to the conversion result storage area 2
It moves to the second word "no" of the character string "tangerine flower" stored in 2 (S60, NO, S62). And
The processing of S32 to S62 is repeated. Finally the pointer P1
Is the last word in the conversion result storage area 22 (S60
-YES), and the rule conversion process ends.

If the rule flag stored in the work area 28 is OFF (NO in S34), the process proceeds to S60. Here, if the pointer P1 is not at the last word of the word string stored in the conversion result storage area 22 (S6).
0 * NO), the pointer P1 is moved to the next word one by one (S62), and the same 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 "no" of the character string "unfinished nose" stored in the conversion result storage area 22 (S60N).
O, S62). Then, the processing of S32 to S62 is repeated. Finally, when the pointer P1 is the last word in the conversion result storage area 22 (S60, YES), the rule conversion process 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 (S16 in FIG. 6). After that, if the confirmation key is input by the user (S18, YES), the word stored in the conversion result storage area 22 is confirmed and the process ends. If anything other than the Enter key is entered (S18, NO),
Proceed to the candidate change process (S20). The result is stored again in the conversion result storage area 22. And the conversion result 2
The contents of No. 2 are stored in the output buffer area 26 and displayed on the output device 50 (S16). After that, if the confirmation key is input by the user (S18, YES), the word stored in the conversion result storage area 22 is confirmed and the process ends.

As described above, by describing the meaning code in the rule item in the rule dictionary 46, for example, one rule <DM-144: 144><U-:N><D
-Hana: Hana> can be applied to the conversion result of "(the homonym of the word having the plant meaning code 144) + nose", so that one rule can be widely applied.

When the rule rewriting program 38 performs the rule rewriting process, when the rule item matching the word string stored in the conversion result storage area 22 has a meaning code, the same meaning code in the basic dictionary 42 is used. Since the rewriting process is performed with the homonym having, the rule conversion process can be correctly performed with respect to the erroneous conversion "unfinished nose" as "tangerine flower". INDUSTRIAL APPLICABILITY The present invention is not limited to the kana-kanji conversion device of a Japanese word processor, but can be applied to various devices that require Japanese input.

[0043]

As is apparent from the above description, the kana-kanji conversion device of the present invention uses the categories such as semantic information in the rule conversion process so that the words to which the rule conversion is applied are the words having the same category information. Not only is it extended to other homophones with the same category information.
Therefore, the rule conversion processing can be performed more efficiently,
The data capacity of the rule dictionary can also be reduced.

[Brief description of 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 present embodiment.

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

FIG. 4 is a conceptual diagram of contents of a basic dictionary of this embodiment.

FIG. 5 is a conceptual diagram of contents of a rule dictionary of this 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 present exemplary embodiment.

FIG. 8 is a flowchart of rule conversion of this embodiment.

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

[Explanation 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 30 ROM Area 32 Program Part 34 Kana-Kanji Conversion Program 36 Rule Search Program 38 Rule Rewriting Program 40 Dictionary Part 42 Basic Dictionary 44 connection table 46 rule dictionary 50 output device

Claims (1)

[Claims] 1. A kana-kanji conversion is performed based on an input means for inputting a kana-yomi character string, a notation for reading a word, and a basic dictionary storing information indicating the category of the word, and the basic dictionary. A rule having kana-kanji conversion means, conversion result storage means for storing a conversion result by the kana-kanji conversion means, a pattern of a word string consisting of information such as reading, notation, and categories of words in the basic dictionary, and rewriting information thereof. And a rule search means for searching the contents of the conversion result storage means for words having the same category of the rule dictionary and having a pattern matching other than the word, and the rule search means. When a matching pattern is searched by, the contents of the corresponding conversion result storage means are written based on the rewriting information of the rule of the pattern. A kana-kanji conversion device, comprising: a rule rewriting means for changing and a means for outputting the contents of the conversion result storage means as a kana-kanji character string.