JPH05120265A - Japanese syllabary to chinese character conversion device - Google Patents

Abstract

PURPOSE:To improve the degree of freedom of the conversion of the KANA (Japanese syllabary) to KANJI(Chinese character) conversion device. CONSTITUTION:A KANA pronounced character string is inputted from an input device and a KANA-KANJI conversion program performs the KANA- KANJI conversion according to a basic dictionary. A rule retrieval program retrieves a rule matching the contents of a conversion result storage area in a rule dictionary. A rule rewriting program rewrites the contents of the corresponding conversion result storage area by referring to the rule dictionary according to the matching rule. Then when a next candidate key is operated, a next candidate conversion program converts the result of rule conversion into a new candidate. Then an output device displays the contents of the conversion result storage area as a KANA-KANJI character string.

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 such as a Japanese word processor.

[0002]

2. Description of the Related Art Conventionally, a kana-kanji conversion device of this type has been disclosed in Japanese Patent Laid-Open No. 3-142658.
Kana-Kanji conversion is performed based on a basic dictionary that stores notations such as Kanji for reading a word, the Kana-Kanji conversion result is stored in the conversion result storage unit, and a pattern of a plurality of word strings and its rewriting information are combined into a set. What is stored as a rule is used as a rule dictionary, and when a rule matching the 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 operations was called rule conversion.

For example, in the case where "Atama wo ku wa" is input, in the normal Kana-Kanji conversion, "the head is each" may be output as the conversion result.

Next, when the rule conversion is performed with reference to the rule dictionary, <U-head: N><U- is: N><D in the rule dictionary.
-When the pattern of "writ: scratch" is stored, the U factor means a perfect match with the reading and the notation, the D factor means a match with the reading, and further as rewriting information in the rule item. If there is an N marker, it means that the rewriting is not performed, and if there is a word string, it means that the word is rewritten. Therefore, the "each" portion of "the head is each" stored in the conversion result storage unit. Was changed to "scratch" to obtain the correct conversion result of "scratching the head".

[0005]

However, when the rule conversion process is performed, even if the candidate intended by the user is "write head", the rule conversion is always performed as "scratch head". Therefore, the user has the word "scratch"
Was erased, the kana character "kaku" was input again, and it was converted to the word "write". In this way, when the result of the rule conversion is not what the user desires, there is no means to convert the candidate again immediately, it is necessary to erase the character string and re-input it to convert it, which is troublesome and operable. Was not good.

The present invention has been made to solve the above problems, and provides a process for converting a word string subjected to rule conversion processing into the next candidate similar to the normal kana-kanji conversion. The purpose is to do.

[0007]

In order to achieve this object, the 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 word reading. A stored basic dictionary, a kana-kanji conversion means for performing kana-kanji conversion based on the basic dictionary, a conversion result storage means for storing the conversion result by the kana-kanji conversion means, a plurality of word string patterns in the basic dictionary, and rewriting information thereof. With respect to the contents of the conversion result storage means, a rule search means for searching a rule having a matching pattern from the rule dictionary, and a search when a matching rule is searched by the rule search means. The rule rewriting means that rewrites the contents of the conversion result storage means that match the written rule and the character string rewritten by the rule rewriting means. Te comprises a next candidate converting means for re-converting, and output means for outputting the contents of the conversion result storage means as the kana-kanji text.

When performing the re-conversion by the next candidate conversion means, it is also possible to provide a candidate re-output means for outputting the character string rewritten by the rule rewriting means as the first candidate when there is no re-conversion candidate.

[0009]

In the kana-kanji conversion device of the present invention having the above-mentioned structure, the kana-kanji character string is input from the input means, and the kana-kanji conversion means is operated by the kana-kanji conversion means based on the basic dictionary storing the reading of the word and the notation corresponding to it. To be converted. 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 contents stored in the conversion result storage means.

When the rule retrieval means retrieves a rule that matches the contents of the conversion result storage means, the rule rewriting means rewrites the conversion result storage means in accordance with the rule rewriting instruction retrieved by the rule rewriting means. .. The next candidate conversion unit reconverts the conversion result storage unit rewritten by the rule rewriting unit when the user instructs the reconversion. Then, the output means outputs the contents of the conversion result storage means.

When there is no reconversion candidate when reconversion is performed by the next candidate conversion means, the character string rewritten by the rule rewriting means by the candidate reoutput means is output as the first candidate.

[0012]

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

The structure of the entire 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, a previous candidate storage buffer 27 for storing the immediately preceding candidate when performing reconversion, and a clause storage buffer 28 for storing the candidate rewritten by rule rewriting. , And a work area 29 for recording pointer information and flag information.

In the conversion result storage area 22, as shown in FIG. 3, the entire conversion result is stored with information added word by word, and each word stored in a basic dictionary 42 described later is identified. 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, the meaning code 22f, the phrase start flag 22g, and the phrase end flag 22h are stored as data for each word.

The same-sound head ID 22d corresponds to 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.

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 retrieval program 36, a rule rewriting program 38, and a next candidate conversion program 39.

The process performed by the rule retrieval program 36 and the rule rewriting program 38 is called a rule conversion process.

The dictionary unit 40 comprises a basic dictionary 42, a connection table 44, a rule dictionary 46, and a notation dictionary 48. As shown in FIG. 4, the basic dictionary 42 includes a word ID 42a that is a unique identification number of the word, a reading 42b of the word, a kanji notation 42c of the word, phrase information 42d of the word, and the word information of the word. The part of speech 42e and the meaning code 42f representing the category to which the word belongs are stored. The phrase information 42d includes a phrase head flag that means that the word is at the beginning of the phrase and a phrase tail flag that means that the word is at the end of the phrase. Each bunsetsu flag has a function of generating a punctuation, and when a word before the word sequence has a bunsetsu end flag and a word after it has a bunsetsu head flag, it is inserted between words. Is information that creates a segment break.

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

As shown in FIG. 5, the rule dictionary 46 stores a set of rule items 46a to 46d as one rule. In general, rule items are written in the form of <search factor-word pattern: rewriting information>, and one rule is created by combining these items. The search factor indicates the type of method in which the conversion result and the rule match, and there are U factor, D factor, Y factor, and M factor, and U factor is a word stored in the conversion result storage area 22. Of the word stored in the conversion result storage area 22, that is, the same as the word. Further, the Y factor means that it matches the reading for a word string of one or more words stored in the conversion result storage area 22. The M factor means that the meaning codes of the words stored in the conversion result storage area 22 match. The word pattern refers to a word whose rule matches an item in the conversion result storage area, and the reading or notation or the meaning code of the word is entered here.

The rewriting information is either the unchanged marker N, the deleted marker D, or the word string. When the unchanged marker N is stored, the rewriting information matches the item in the rule dictionary 46 in the conversion result storage area 22. Indicates that the word is left as it is and is not rewritten. When the deletion marker D is stored, it means that the item is deleted.
When there is a word string as rewriting information, the rule dictionary 46
The word in the conversion result storage area 22 that matches the item of is rewritten to the word string. The word string referred to here is a plurality of words (may be only one word) stored in the rule dictionary 46 by a word ID, and is converted by referring to the basic dictionary 42 based on this word ID. The word reading length 22b of the result storage area 22 and the homophone head I
D22c, homonym end ID22d, etc. can be set. In addition, in FIG. 5, for easy understanding, the word ID is
The part of is indicated by reading or notation instead of numerical value.

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 ga Sakudarou" is input from the input device 10, the kana character code is stored in the reading input buffer area 24 of the RAM 20 (S10). After that, the basic dictionary 42 and the connection table 4 are converted by the kana-kanji conversion program 34 of the ROM 30.
4, the kana character code stored in the reading input buffer area 24 is converted into a kanji / kana mixed sentence, and the word ID and the like are stored in the conversion result storage area 22. For example, if the normal kana-kanji conversion is performed based on the basic dictionary, the kanji-kana mixed sentence may be converted to "an unfinished nose is a good idea." Then, the word ID is stored in the conversion result storage area 22 (S12).

Next, the rule retrieval program 3 in the ROM 30
6 and the rule rewriting program 38, the rule conversion process is performed with reference to the contents of the conversion result storage area 22 and the rule dictionary 46 (S14).

The specific processing of the rule conversion processing will be described below 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 may be a measure" stored in the conversion result storage area 22, and the pointer information of the pointer P1 is RA.
It is stored in the work area 29 of M20 (S30).

Next, it is searched whether or not the rule matching the word pointed by the pointer P1 is present 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 7-1 in the rule dictionary 46.
And the pointer information is recorded in the work area 29 (S320). Next, the pointer P6 is set to the head item 46a of the rule 7-1 pointed to by the pointer P5, and the pointer information is stored in the work area 29 (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 <U-
Hearing: N> and conversion result storage area 2 pointed to by pointer P7
The word "incomplete" in 2 is compared (326). In this case, the rule and the word do not match (S326 / NO), and the rule 7-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 7-. 2 and move pointer information to work area 29
(S330), the process returns to S322. Next, the pointer P6 is set to the head item 47a of the rule 7-2 indicated by the pointer P5, and the pointer information is stored in the work area 29 (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 item <pointer P6 points to
D-Mikan: Mandarin orange> 47a is compared with the word “incomplete” in the conversion result storage area 22 pointed to by the pointer P7 (32
6). In this case, the rule matches the word (S326.YE
S), the pointer P6 is not the last item (S332)
NO), the pointer P7 is moved to the word "NO" next to the "unfinished" stored in the conversion result storage area 22, and the pointer P6 also moves the next item <U-: N in rule 7-2. > (4
7b) and move the pointer information to work area 2
9 (S334), and the process returns to S326.

Here, the rule item <U pointed by the pointer P6
-No: N> 47b is compared with the word "no" in the conversion result storage area 22 pointed to by the pointer P7 (326). In this case, the rule matches the word (S326, YES), and the pointer P6 is not the last item (S332, NO), so the pointer P7 is set to the next word of the word "no" stored in the conversion result storage area 22. The pointer "P6" is moved to the word "nose", the pointer P6 is also moved to the next item <D-hana: flower> 47c in the rule 7-2, and the pointer information is stored in the work area 29 (S334). Return to.

Here, the rule item <D indicated by the pointer P6
-Hana: A flower> 47c is compared with the word "nose" in the conversion result storage area 22 pointed to by the pointer P7 (326). In this case, the rule matches the word (S326, YES), and the item 47c indicated by the pointer P6 is the last item (S332).
-YES), the rule flag ON is stored in the work area 29 (S336), and the process proceeds to S34 shown in FIG.

If no matching rule is found (S326, NO), the pointer P5 is sequentially moved to the next rule until the rule pointed to by the pointer P5 is the last rule in the rule dictionary (S328, NO). Then, the matching rule is searched for (S330) (S322 to 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 29 (S338).

Next, the rule rewriting process shown in FIGS. 7 and 8 will be described.

In the rule search process of S32, the rule flag of the work area 29 is ON (S34.
YES), the rule rewriting program 38 starts the rule rewriting process. First, the pointer P2 is set to the first word "unfinished" of the word string "unfinished nose would be a measure" 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 29. Do (S
36). Next, "the unfinished nose is probably a measure" that is stored in the conversion result storage area 22 pointed to by the pointer P3.
The word string "nose" at the end of the part of the word string that matches the rule is set, and the information of the pointer P3 is set in the work area 2
9 (S38). Then, the pointer P4 is set to the head item of the matched rule 7-2 in the rule dictionary 46, and the pointer information of the pointer P4 is stored in the work area 29 (S40).

In the rule 7-2 in the rule dictionary 46, the first item <D-tangerine: mandarin orange> 47a pointed to by the pointer P4.
Has a word string as rewriting information (S44.N
O, S46, NO, S48, YES), and the word "unfinished" in the conversion result storage area 22 indicated by the pointer P2 is rewritten with the rewriting information "Tangerine" of the rule item <D-tangerine: tangerine> 47a indicated by the pointer P4 ( It progresses to S50) and S52.

If the deletion marker D is added to the location of the rewriting information in the item pointed to by the pointer P4 (S44, NO, S48, YES), the word "unfinished" pointed to by the pointer P2 in the conversion result storage area 22. Is deleted (S5
6) and proceeds to S52.

In S52, it is compared whether the word pointed by the pointer P2 and the word pointed by the pointer P3 are the same.
That is, when the word indicated by the pointer P2 and the word indicated by the pointer P3 are the same, it means that the pointer P2 has advanced to the last word of the word string that matches the rule. In this case, "unfinished" pointed by the pointer P2 is the conversion result storage area 2
Since it is not the last word of the conversion result stored in No. 2 (S52, NO), the word pointer P2 is moved to the next word "NO" stored in the conversion result storage area 22, and the pointer P4 is moved according to rule 7. -2 next item <-2 of <U-: N> 47b
(S54), and returns to S44.

Here, the item <U-pointed by the pointer P4
No: Since there is an unchanged marker N in N> 47b (S44
-YES), without rewriting, leave as it is, and proceed to S52. In this case, since the "no" pointed by the pointer P2 is not the last word of the conversion result stored in the conversion result storage area 22 (S52, NO), the word pointer P2 is moved to the next word "nose". , The pointer P4 is moved to the next item <D-hana: flower> 47c in the rule 7-2 and (S5
4) and returns to S44.

Here, the rule item <pointer P4 points
D-hana: Hana> 47c has a word string as rewriting information (S44 / NO, S46 / NO, S48 / YE).
S), rewriting the word "nose" in the conversion result storage area 22 indicated by the pointer P2 with the rewriting information "flower" of the rule item <D-hana: flower> 47c indicated by the pointer P4 (S50),
Proceed to S52.

Here, since the word pointed to by the pointer P2 is the last word of the part of the word string stored in the conversion result storage area 22 that matches the rule indicated by the pointer P3, the process proceeds to S58 ( S52 / YES).

If the pointer P1 is not located at the end word of the word string stored in the conversion result storage area 22 (S58, NO), the pointer P1 is moved to the next word one by one (S60), The same rule search process (S3 again)
2) is performed by the rule search program 36. In this case, the pointer P1 is moved to the second word "no" of the character string stored in the conversion result storage area 22. And S3
The processes of 2 to S60 are repeated.

Next, the pointer P1 indicates the conversion result storage area 2
When moving to the word "flower" in 2 (S60), the pointer information of the pointer P1 is the work area 29 of the RAM 20.
(S30).

Next, it is searched whether or not the rule matching the word indicated by the pointer P1 is present 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 7-1 in the rule dictionary 46.
And the pointer information is recorded in the work area 29 (S320). Next, the pointer P6 is set to the head item 46a of the rule 7-1 pointed to by the pointer P5, and the pointer information is stored in the work area 29 (S322). Next, the pointer P7 is set to the word "flower" 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 <U-
Hearing: N> and conversion result storage area 2 pointed to by pointer P7
The word "flower" in 2 is compared (326). in this case,
The rule and the word do not match (S326, NO), and the pointer P
Since the rule 7-1 indicated by 5 is not the last rule in the rule dictionary 46 (S328, NO), the pointer P5 is moved to the next rule 7-2, and the pointer information is stored in the work area 29 (S330). , S322.

Next, the pointer P6 is set to the head item 47a of the rule 7-2 indicated by the pointer P5, and the pointer information is stored in the work area 29 (S322). Next, the pointer P7 is set to the first word "flower" 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 <D-
Mandarin orange: Mandarin orange> 47a is compared with the word “flower” 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 7-2 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 7-. 3, the pointer information is stored in the work area 29 (S330), and the process returns to S322.

Next, the pointer P6 is set to the head item 48a of the rule 7-3 indicated by the pointer P5, and the pointer information is stored in the work area 29 (S322). Next, the pointer P7 is set to the word "flower" of the kana-kanji conversion result in the conversion result storage area 22 pointed to by the pointer P1 (S324).

Here, the rule item <pointer P6 points to
D-Hana: A flower> 48a is compared with the word "flower" in the conversion result storage area 22 pointed to by the pointer P7 (326). In this case, the rule matches the word (S326, YES), and the pointer P6 is not the last item (S332, N).
O), the pointer P7 is moved to the word "ga" next to "flower" stored in the conversion result storage area 22, and the pointer P7
6 is the next item <U- is: N> (48b) in Rule 7-2.
The pointer information is stored in the work area 29 (S334), and the process returns to S326.

Here, the rule item <U pointed by the pointer P6
-Ga: N> 48b is compared with the word "ga" in the conversion result storage area 22 pointed to by the pointer P7 (326). In this case, the rule matches the word (S326, YES), and since the pointer P6 is not the last item (S332, NO), the pointer P7 is moved to the next word "ga" stored in the conversion result storage area 22. Move to the word "measure", and the pointer P6 also moves to the next rule item <D-saku: bloom> 48c in rule 7-3.
The pointer information is stored in the work area 29 (S334), and the process returns to S326.

Here, the rule item <D indicated by the pointer P6
-Saku: Bloom> 48c is compared with the word "measure" in the conversion result storage area 22 pointed to by the pointer P7 (326). In this case, the rule matches the word (S326, YES), and the item 47c indicated by the pointer P6 is the last item (S33).
2. YES), the rule flag ON is stored in the work area 29 (S336), and the process proceeds to S34 shown in FIG.

Next, the rule rewriting process shown in FIGS. 7 and 8 will be described.

In the rule retrieval process of S32, the rule flag of the work area 29 is ON (S34.
YES), the rule rewriting program 38 starts the rule rewriting process. First, the pointer P2 is set to the word "flower" in the word string "Tangerine flower is a good idea" 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 29. Do (S
36). Next, "the mandarin orange flower is a good idea" stored in the conversion result storage area 22 pointed by the pointer P3.
In the word string "measure" at the end of the part that matches the rule, the information of the pointer P3 is set in the work area 2
9 (S38). Then, the pointer P4 is set to the head item of the matched rule 7-3 in the rule dictionary 46, and the pointer information of the pointer P4 is stored in the work area 29 (S40).

In the rule 7-3 in the rule dictionary 46, the first item <D-hana: flower> 48a pointed to by the pointer P4 has a word string as rewriting information (S44, NO, S).
46 · NO, S48 · YES), and the word “flower” in the conversion result storage area 22 indicated by the pointer P2 is rewritten with the rewrite information “flower” of the rule item <D-hana: flower> 47a indicated by the pointer P4 (S50). ), And proceeds to S52.

In S52, it is compared whether the word pointed by the pointer P2 and the word pointed by the pointer P3 are the same.
That is, when the word indicated by the pointer P2 and the word indicated by the pointer P3 are the same, it means that the pointer P2 has advanced to the last word of the word string that matches the rule. In this case, the “flower” pointed by the pointer P2 is the conversion result storage area 22.
Since it is not the last word of the conversion result that matches the rule stored in (S52, NO), the word pointer P2 is moved to the next word "ga" stored in the conversion result storage area 22, and the pointer P4 is moved. Next item in Rule 7-3 <U-
Moves to N> 48b (S54), and at the same time as S4.
Return to 4.

Here, the item <U-pointed by the pointer P4
： Because there is no change marker N in N> 48b (S44
-YES), without rewriting, leave as it is, and proceed to S52. In this case, since the "ga" pointed to by the pointer P2 is not the last word of the conversion result that matches the rule stored in the conversion result storage area 22 (S52, NO), the pointer P
2 to the next word "measure" and move the pointer P4 to rule 7-
While moving to the next item <D-saku: Bloom> 47c in 3 (S54), the process returns to S44.

Here, the rule item <pointer P4 points
D-Saku: Bloom> 48c has a word string as rewriting information (S44 / NO, S46 / NO, S48 / Y).
ES), the rule item <D-frame which the word “measure” in the conversion result storage area 22 indicated by the pointer P2 indicates by the pointer P4:
Bloom> Rewrite information of 48c Rewrite as "bloom" (S5
0), and proceeds to S52.

Here, since the word pointed to by the pointer P2 is the last word of the part of the word string stored in the conversion result storage area 22 that matches the rule indicated by the pointer P3, the process proceeds to S58 ( S52 / YES).

If the pointer P1 is not located at the last word of the word string stored in the conversion result storage area 22 (S58, NO), the pointer P1 is moved to the next word one by one (S60). The same rule search process (S3 again)
2) is performed by the rule search program 36. In this case, the pointer P1 is moved to the last word "Darou" of the character string "Tangerine flower will bloom" stored in the conversion result storage area 22. Then, the processing of S32 to S58 is repeated.

Since the word indicated by the pointer P1 is the last word stored in the conversion result storage area 22 (S
58. YES), and the rule conversion process ends. Then, the conversion result "Tangerine flower will bloom" is output by the candidate output (S16) shown in FIG. 6 (S16).

When the rule flag stored in the work area 27 is OFF (NO in S34), the process proceeds to S58. Here, if the pointer P1 is not at the end word of the word string stored in the conversion result storage area 22 (S58, NO), the pointer P1 is moved to the next word one by one (S60), and again the above-mentioned. The same rule search process (S32) is performed by the rule search program 36.

The contents of the conversion result storage area 22 are as follows:
It is stored in the output buffer 26 and displayed on the output device 50. (S16) After that, when the user inputs anything other than the enter key (S18, NO), the next candidate conversion program 39 performs the next candidate conversion process (S20).

Next, the next candidate conversion process (S20) by the next candidate conversion program 39 when the user wants to reconvert the conversion result obtained by the rule conversion will be described with reference to FIG.

When performing the next candidate conversion process (S20), the phrase cursor is first moved to the word string to be converted.
The phrase is determined by the phrase information in the basic dictionary 42. In other words, the connecting portion between the word having the clause end flag and the word having the clause start flag becomes the break of the clause. The space between the breaks is displayed as one clause cursor (S510). This phrase cursor is moved to the word string to be converted, and the next candidate conversion process is performed by inputting the next candidate key.

The user inputs "Mikan no Hanagasa Kuroda." And the rule conversion results in "Tangerine flower will bloom." (S16), but the word "Tangerine" is the next candidate. Suppose you want to convert it.

First, the phrase cursor is moved to the word string "Tangerine" (S512, YES). At this time, the next candidate flag OFF is stored in the work area 29 (S514). Then, the phrase cursor is displayed at the position of the word string “Tangerine” (S510), and when the next candidate key is input (S512 / NO, S516 / YES), the phrase candidate “Tangerine” is displayed. Are all stored in the phrase storage buffer 28 (S520, NO, S522). Then, the phrase conversion processing is performed (S524). Phrase conversion processing (S524)
Is a process of reading the character string “Mitsukan no” in the phrase and returning it to “Mikan no” and referring to the basic dictionary 42 and the connection table 44 to perform Kana-Kanji conversion. As a result, the candidate “not completed” is selected (S524), and the ON of the next candidate flag is stored in the work area 29 (S526). Next, it is determined whether or not this new candidate “unfinished” is the same as the first candidate “tangerine” stored in the phrase storage buffer 28 (S528).

Since they are not the same here (S528.N
O), and then determine whether it is the same as the previous candidate previously selected as the next candidate (S530). In this case, since the previous candidate does not yet exist, it is not the same (S530N
O), the new candidate “unfinished” is stored in the previous candidate storage buffer 27 (S532). Then, "unfinished" is displayed as the next candidate (S534). This becomes the previous candidate, and becomes a comparison target when a new candidate is selected as the next complement (S530).

The processing up to this point is the processing when the next candidate key is pressed and the next candidate conversion is performed after the post-rule conversion processing 14 is completed.

The following processing is performed when the displayed candidate “unfinished” is further continued without wishing and the next candidate conversion is performed for the same phrase cursor.

In S536, the enter key is not pressed (S536, NO), and the next candidate key is input (S5).
16, YES), since the next candidate flag in the work area 29 is stored as ON (S520, YES),
Next candidate conversion processing is performed (S538). In the next candidate conversion process, the basic dictionary 42 and the connection table 44 are referred to and conversion is performed from the end of the clause. Specifically, the homonym is searched for from the last word "no" of the phrase "uncompleted" based on the basic dictionary 42 (S538). In this case, in the basic dictionary 42,
Since the homonym of the word "no" is not found, the homophone of "incomplete" is searched next (S538).

Here, the homonym "tangerine" is searched and "unfinished" is converted to "tangerine" (S538). Since there is a next candidate (YES in S540), it is determined whether the new candidate "Tangerine" obtained as a result of the next candidate conversion is the same as the first candidate stored in the phrase storage buffer 28 in S522 (S528). In this case, since it matches the “tangerine” stored in S522 (YES in S528), no candidate display is performed. Then, the process returns to S520 again, the next candidate conversion is performed (S538), and a new candidate “Mikan no” is obtained in the same manner as described above (S540: YES). This is different from “Tangerine” stored in the phrase storage buffer 28 (S
528 · NO) and since it does not match the previous candidate “unfinished” (S530 · NO), this new candidate “Mikanno” is stored in the previous candidate storage buffer 27 (S532) and displayed on the output device 50 (S534). ).

Here, if the user inputs the enter key (S536, YES), this process ends. Also, S
If there is no next candidate at 538 (S540 / YE
S), the candidate “tangerine” stored in the phrase storage buffer 28 in S522 is displayed again as a conversion candidate, and the next candidate flag in the work area 29 is stored as OFF (S5).
42).

In this way, by performing the next candidate conversion process by the next candidate conversion program 39, even for the word string rewritten by the rule conversion process, another candidate can be obtained without re-inputting the kana character string. Can be converted. Therefore, it is possible to easily change / correct the result of the rule conversion. Moreover, when there is no next candidate in the next candidate conversion, the result of the rule conversion based on the rule dictionary is displayed as the first candidate, so that the user can perform the next candidate conversion without confusion and improve the conversion efficiency. You can

[0074]

As is apparent from the above description, the kana-kanji conversion device of the present invention can perform the next candidate conversion for converting the rule-converted word string into another candidate, and the degree of freedom of the rule conversion processing is increased. improves.

[Brief description of drawings]

FIG. 1 is a diagram showing a configuration 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.

FIG. 10 is a flowchart of a next candidate conversion process of the present invention.

[Explanation of symbols]

 10 Input Device 12 CPU 20 RAM 22 Conversion Result Storage Area 24 Reading Input Buffer Area 26 Output Buffer Area 27 Previous Candidate Storage Buffer 28 Clause Storage Buffer 29 Work Area 30 ROM Area 32 Program Section 34 Kana-Kanji Conversion Program 36 Rule Search Program 38 Rule Rewriting Program 39 Next candidate conversion program 40 Dictionary part 42 Basic dictionary 44 Connection table 46 Rule dictionary 50 Output device

Claims (2)

[Claims] 1. A kana-kanji conversion means for performing kana-kanji conversion based on the input means for inputting a kana-reading character string, a basic dictionary storing notations for reading the words, and the basic dictionary, and the kana-kanji conversion means. A conversion result storage unit that stores a conversion result, a rule dictionary that stores a rule having patterns of a plurality of word strings in the basic dictionary and rewriting information thereof, and the contents of the conversion result storage unit are matched from the rule dictionary. A rule retrieving means for retrieving a rule having a pattern, a rule rewriting means for rewriting the contents of the conversion result storing means that matches the retrieved rule when the matching rule is retrieved, and the rule rewriting means The next candidate conversion means for re-converting the character string rewritten by Kana-kanji conversion apparatus characterized by comprising output means for outputting a kanji character string, the. 2. When performing the re-conversion by the next candidate conversion means, the re-conversion means further comprises a candidate re-output means for outputting the character string rewritten by the rule rewriting means as a first candidate when there is no re-conversion candidate. Claim 1
Kana-Kanji conversion device described.