JPH05181837A - Character converter - Google Patents

Abstract

PURPOSE:To easily convert a KANJI (Chinese character) mixed charater-string inputted by handwriting to a KANJI. CONSTITUTION:In a dictionary table stored in a dictionary memory 9, a KANJI (Chinese character) idiom having a meaning is registered (stored) as a KANJI character-string. Also, for instance, to a KANJI idiom 'do-shil' (comrade), (same) is divided into cases of a KANJI 'do' and a KANA (Japanese syllabary) (reading) 'do' as its conversion pair, 'shi' (mind) is divided into cases of a KANJI 'shi' and a KANA (reading) 'shi' and four reading character-strings 'do-shil' (KANA), 'do-shi' (KANA and KANJI, 'do-shi' (KANJI and KANA), and 'do-shi' (KANJI) obtained by combining the KANJI 'do' and the KANA 'do', and the KANJI 'shi' and the KANA 'shi' are registered.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a character conversion device suitable for use in, for example, an electronic notebook device (portable computer) capable of inputting a character string in which kana and kanji are mixed.

[0002]

2. Description of the Related Art FIG. 13 shows an example of a kana-kanji conversion process in a conventional portable computer. For example, when a handwritten character is input on the tablet with the input pen 1 on the character input display screen in which a tablet formed of a transparent member is arranged on the front surface of the LCD, L
The trace trace by the input pen 1 is displayed on the CD. This trace trajectory is further pattern recognized, and as a result,
The obtained characters are displayed on the LCD again instead of being traced. In this example, the above operation is repeated, and the character string “change” is input and displayed (FIG. 13).
(A)).

By the way, since the user inputs characters by handwriting, for example, kanji characters that are not remembered by the user or kanji characters with a large number of strokes that are troublesome to input are input in, for example, hiragana.
After that, it is often converted to Kanji. In such a case, the user specifies the portion "kan" of the character string input and displayed, which is to be converted into kanji, with the input pen 1 (Fig. 13 (b)), and is further displayed at the bottom of the screen. After the conversion key 11 being operated is operated (instructed), Kanji conversion of the designated portion "Kan" is performed (FIG. 13 (d)).

[0004]

In the conventional device, in order to convert a character string in which, for example, hiragana is mixed with kanji into kana-kanji, the part (range) to be converted into kanji must be specified. However, there is a problem that makes the user feel annoyed.

Further, as shown in FIG. 13 (c), when there are many Kanji candidates corresponding to the portion "Kan" designated to be converted into Kanji, the designated portion "Kan" is A kanji that has "kan" as a reading, for example, is converted into "ma", and a meaningless idiom "henma" is displayed. Therefore, it is necessary to select a desired kanji from these kanji candidates, and there is a problem that makes the user feel more troublesome.

The present invention has been made in view of such a situation, and is to make it possible to easily convert a character string input by handwriting into kanji.

[0007]

A character conversion device of the present invention is a character conversion device for converting a character string input by handwriting into kanji, and for recognizing the input character string, for example, processing steps S21 to S24 of a program. And a detecting means for detecting a meaningful kanji character string including a kanji part of the recognized character string, for example, processing steps S31 to S36 or S41 to S53 of the program, and the detected kanji character It is characterized in that it is provided with a display means such as an LCD 7 for displaying columns.

[0008]

In the character conversion device having the above structure, when converting a character string input by handwriting into Kanji, the input character string is recognized, and a meaningful Kanji character including the Kanji part of the recognized character string. Detects a column and displays the detected Kanji character string. Therefore, the character string input by handwriting can be easily converted into Kanji.

[0009]

1 is a block diagram showing the configuration of an embodiment of a portable computer to which the character conversion device of the present invention is applied. The tablet 8 has an X-axis direction (horizontal direction)
For example, with 512 electrodes, Y-axis direction (vertical direction)
In addition, it has, for example, 342 electrodes and detects 512 × 342 pixels. The clock generation circuits 8a and 8b are controlled by the tablet controller 3 and supply clock signals to the 342 electrodes in the Y-axis direction and the 512 electrodes in the X-axis direction of the tablet 8 at predetermined timings.

The input pen 1 outputs a voltage generated between a predetermined electrode on the tablet 8 and the input pen 1 when pressed by the tablet 8. Amplifier 2 is input pen 1
The output voltage is amplified and supplied to the tablet controller 3. Since the tablet controller 3 controls the clock generation timings of the clock generation circuits 8a and 8b, the tablet controller 3 is pressed by the input pen 1 from the voltage output from the input pen 1 via the amplifier 2 and the clock generation timing. The position coordinates on the tablet 8 are detected.

The dictionary memory 9 stores a dictionary table for performing kana-kanji conversion processing and character data for pattern recognition of characters handwritten by the input pen 1. The CPU 4 recognizes the pressing locus of the input pen 1 from the position coordinates on the tablet 8 pressed by the input pen 1 supplied from the tablet controller 3, and recognizes the recognized locus and the character data stored in the dictionary memory 9. Performs pattern recognition for comparison. As a result of the pattern recognition, when it is determined that the pressing path of the input pen 1 is a character, the input pen 1 causes the conversion key 11 (LCD as shown in FIG. 2 to be displayed.
7) is operated, the dictionary table stored in the dictionary memory 9 is referred to, and the kana-kanji conversion processing is performed. Further, the CPU 4 controls external blocks such as the tablet controller 3 and the LCD controller 5.

The LCD 7 corresponds to the tablet 8 and the X
It has 512 electrodes in the axial direction and 342 electrodes in the Y-axis direction, and displays 512 × 342 pixels. The LCD controller 5 is the input pen 1 recognized by the CPU 4.
A signal corresponding to the pressing locus of No. 2 or a signal corresponding to, for example, image data stored in the memory (VRAM) 6 is supplied to the drive circuits 7a and 7b. The drive circuits 7a and 7b are controlled by the LCD controller 5 and apply a voltage corresponding to a signal supplied from the LCD controller 5 to 342 electrodes in the Y-axis direction and 512 electrodes in the X-axis direction of the LCD 7. ..

Next, the operation when the character string "same" is handwritten by the input pen 1 and the kana-kanji conversion processing is performed will be described. In the tablet controller 3, the position coordinates on the tablet 8 pressed by the input pen 1 are detected and supplied to the CPU 4. In the CPU 4, the pressing locus of the input pen 1 is recognized from the position coordinates supplied from the tablet controller 3. In the LCD controller 5, a signal corresponding to the pressing locus of the input pen 1 recognized by the CPU 4 is supplied to the drive circuits 7a and 7b. In the drive circuits 7a and 7b, the voltage corresponding to the signal supplied from the LCD controller 5 is applied to the 342 electrodes in the Y-axis direction and the 512 electrodes in the X-axis direction of the LCD 7, and the LCD 7 receives the voltage of the input pen 1. The pressing track is displayed.

Further, in the CPU 4, the pressing locus of the input pen 1 is compared (pattern recognition) with the character data stored in the dictionary memory 9, and the resulting character is the pressing locus of the input pen 1. Is displayed instead of (FIG. 2 (a)).

When the conversion key 11 is operated by the input pen 1 in order to convert the character string obtained by repeating such operations into kana-kanji (FIG. 2 (b)), the CPU 4 stores the dictionary memory 9 in the dictionary memory 9. The stored dictionary table is referenced, the kanji (kanji compound words) that are candidates for conversion are detected,
Character data corresponding to the kanji is output. In the LCD controller 5, a signal corresponding to the character data output from the CPU 4 is supplied to the drive circuits 7a and 7b, and the Y of the LCD 7 is displayed in the drive circuits 7a and 7b.
A voltage corresponding to a signal supplied from the LCD controller 5 is applied to the electrodes in the axial direction and the electrodes in the X-axis direction,
A kanji character string "Doshi", which is the kanji-kanji converted character string "doshi" input from the input pen 1, is displayed on the LCD 7 (FIG. 2 (c)).

Next, referring to the flowchart of FIG.
The operation when the kana-kanji conversion processing is performed for the character string “same” in which hiragana and kanji are mixed will be described. First,
In step S21, a handwritten character is input by the input pen 1, and in step S22, the locus of the handwritten character is recognized, and the character data stored in the dictionary memory 9 corresponding to the recognition result is detected. Further, since the handwritten character input in step S21 is often a peculiar character of the user such as Maru character, whether the detected character data is the input character,
It is confirmed and confirmed in step S22. In step S23, the confirmed character (character data) is L
It is displayed on CD7.

As described above, after one character handwritten by the input pen 1 is processed, step S2 is performed.
At 4, the input pen 1 determines whether or not the next input (handwriting input) is being performed. Step S2
If it is determined in step 4 that the next input is being performed by the input pen 1, the process returns to step S22 and the above-described processing is executed. The processes of steps S22 to S24 are repeated until it is determined in step S24 that the next input has not been performed. In this embodiment, FIG.
As shown in (a), the character string “same” is displayed in step S2.
It is displayed on the LCD 7 by the processes of 1 to S24.

If it is determined in step S24 that the next input has not been performed, the process proceeds to step S25,
Conversion key 1 to convert Kana-Kanji character string
It is determined whether 1 has been operated. When it is determined in step 25 that the conversion key 11 has not been operated, the process proceeds to step S26, and after other processing is performed, the process returns to step S25 again. When it is determined in step S25 that the conversion key 11 has been operated (see FIG. 2).
(B)), and proceeds to the conversion processing subroutine S27. Details of this conversion processing subroutine S27 are shown in FIG.

In the conversion processing subroutine shown in FIG. 4, first, in step S31, the pointer indicating the address of the dictionary table (FIG. 6) stored in the dictionary memory 9 indicates (points to) the start address of the dictionary table. Is initialized as follows (initialization of search position).

FIG. 6 is a diagram showing the configuration of an embodiment of the dictionary table stored in the dictionary memory 9. In this dictionary table, meaningful Kanji phrases are registered (stored) as Kanji character strings.
For the kanji compound word "Doshi", as the conversion pair,
Divide "same" into kanji "same" and hiragana (reading) "do", and divide "shi" into kanji "shi" and hiragana (reading) "shi"
The four reading character strings “doushi”, “doushi”, “doshi”, and “doshi” that combine the kanji “do” and hiragana “do”, and the kanji “shi” and hiragana “shi”. Is registered.

After the search position is initialized in step S31, the process proceeds to step S32, and the reading character string stored at the address of the dictionary table stored in the dictionary memory 9 and pointed by the pointer is input. The (displayed) string "same" is compared. Step S33
In, in the reading character string compared in step S32,
When it is determined that the input character string “same” is the same (matches), the process proceeds to step S34, and the kanji character string “comrade” corresponding to the reading character string is the input character string “ It is registered (memorized) as a kana-kanji conversion candidate for "Same". After the kana-kanji conversion candidates (kanji candidates) of the input character string “same” are registered (stored) in step S34,
In step S35, the pointer indicating the address of the dictionary table stored in the dictionary memory 9 is incremented, and the process proceeds to step S36. If it is determined in step S33 that the reading character string compared in step S32 and the input character string "same" are not the same (does not match), step S34 is skipped and the step is skipped. The process proceeds to S35, the pointer is incremented, and the process proceeds to step S36.

In step S36, the pointer indicating the address of the dictionary table stored in the dictionary memory 9 becomes
It is determined whether it points to the last address of the dictionary (the address where the termination symbol is stored). Step S3
In Step 6, steps S32 to S36 are performed until it is determined that the pointer indicating the address of the dictionary table stored in the dictionary memory 9 points to the last address of the dictionary.
The process of is repeated. When it is determined in step S36 that the pointer indicating the address of the dictionary table stored in the dictionary memory 9 points to the last address of the dictionary, the process of the conversion process subroutine is ended.

Returning to FIG. 3, after the processing of the subroutine S27 is completed, the process proceeds to step S28, and the Chinese character candidates "comrade", "mutual" ... Registered (stored) in step S34 of the conversion processing subroutine S27. , Is displayed at the bottom of the LCD 7, and in step S29, the first candidate “comrade” among the kanji candidates is LC in step S23.
LCD instead of the character string "Same" that is confirmed and displayed on D7
7 is displayed and the process ends.

Next, FIG. 7 is a diagram showing the configuration of the second embodiment of the dictionary table stored in the dictionary memory 9. The dictionary table in the present embodiment includes a kanji dictionary table (FIG. 7 (a)) in which kanji (kanji characters) and hiragana (reading character string) indicating reading of the kanji are registered, and kanji registered in the kanji dictionary. It is composed of a idiom dictionary table (FIG. 7B) in which the meaningful idioms used are registered.

The operation in the case of performing the kana-kanji conversion processing using the dictionary table having such a configuration will be described with reference to the flowchart of FIG. Here, the flowchart of FIG. 5 corresponds to the conversion processing subroutine S2 of the flowchart of FIG.
It corresponds to 7. Therefore, first, in step S21 in FIG. 3, a handwritten character is input by the input pen 1, and in step S22, the locus of the handwritten character is recognized and stored in the dictionary memory 9 corresponding to the recognition result. Character data is detected. Further, in step S22, it is confirmed and confirmed whether or not the character data is the input character. In step S23, the confirmed character (character data) is L
It is displayed on CD7.

After the processing of one handwritten character input by the input pen 1 is performed as described above, it is determined in step S24 whether the next input (handwritten input) is performed by the input pen 1. Is determined. Step S
In step 24, the processes of steps S22 to S24 are repeated until it is determined that the next input has not been performed. Also in the present embodiment, as shown in FIG. 2A, the character string “same” is changed to L by the processing of steps S21 to S24.
It is displayed on CD7.

If it is determined in step S24 that the next input has not been made, the process proceeds to step S25.
Conversion key 1 to convert Kana-Kanji character string
It is determined whether 1 has been operated. When it is determined in step 25 that the conversion key 11 has not been operated, the process proceeds to step S26, and after other processing is performed, the process returns to step S25 again. When it is determined in step S25 that the conversion key 11 has been operated (see FIG. 2).
(B)), and proceeds to the conversion processing subroutine S27 shown in FIG.

In the conversion processing subroutine shown in FIG. 5, first, in step S41, the hiragana part "shi" is detected from the input character string "do". next,
In step S42, the kanji dictionary table (see FIG.
The Kanji table pointer indicating the address of (a)) is initialized to indicate (point to) the start address of the Kanji dictionary table (initialization of the search position of the Kanji dictionary).

In step S42, after the search position of the kanji dictionary is initialized, the process proceeds to step S43, and the reading character string stored in the address of the kanji dictionary table pointed to by the kanji table pointer and detected in step S41. The hiragana part "shi" of the generated character string "soshi" is compared. If it is determined in step S44 that the reading character string compared in step S43 and the hiragana part “shi” of the character string “same” are the same (match), the process proceeds to step S45. The kanji character corresponding to the reading character string, for example, "Zhi", is input character string "Same"
The character string "comrade" replaced with the hiragana part "shi"
Is generated.

Further, in step S46, the idiom table pointer indicating the address of the idiom dictionary table (FIG. 7B) is initialized to indicate (point to) the start address of the idiom dictionary table (search position of the idiom dictionary). In step S47, the idiom stored at the address of the idiom dictionary table pointed to by the idiom table pointer is compared with the character string "comrade" generated in step S45. In step S48, step S4
When it is determined that the idiom compared in 7 and the character string "comrade" are the same (match), the process proceeds to step S49, and the idiom "comrade" registered in the idiom dictionary is the input character. It is registered (stored) as a kana-kanji conversion candidate in the column “same”.

In step S49, after the kana-kanji conversion candidates (kanji candidate) of the input character string "same" are registered (stored), the process proceeds to step S50, the phrase table pointer is incremented, and the process proceeds to step S51. Also,
When it is determined in step S48 that the phrase compared in step S47 and the character string “comrade” are not the same (does not match), step S49 is skipped, the process proceeds to step S50, and the phrase table pointer is changed. The value is incremented, and the process proceeds to step S51.

In step S51, it is determined whether or not the idiom table pointer points to the last address of the idiom dictionary. The processes in steps S47 to S51 are repeated until it is determined in step S51 that the phrase table pointer points to the last address in the dictionary.

Here, in step S45, if the kanji character replaced with the hiragana part "shi" of the input character string "do" is, for example, "word", and the character string "syllable" is generated, this The meaningless character string “synonyms” is not registered in the idiom dictionary table, so step S49.
In, the character string “synonyms” is not registered (stored) as a kana-kanji conversion candidate (kanji character candidate) of the input character string “same”.

When it is determined in step S51 that the idiom table pointer points to the last address of the idiom dictionary, the process proceeds to step S52, the kanji table pointer is incremented, and the process proceeds to step S53.
In step S53, it is determined whether or not the kanji table pointer points to the last address of the kanji dictionary. The processes of steps S43 to S53 are repeated until it is determined in step S53 that the kanji table pointer points to the last address of the kanji dictionary.
If it is determined in step S53 that the Kanji table pointer points to the last address of the Kanji dictionary, the process of the conversion process subroutine shown in FIG. 5 is terminated.

After the processing of the conversion processing subroutine shown in FIG. 5 is completed, the process proceeds to step S28 shown in FIG. 3, and the Chinese character candidates “comrade”, “mutual” ... Registered (stored) in step S49 are displayed on the LCD 7. In step S29, the first candidate “comrade” among the kanji candidates is displayed on the LCD 7 in place of the character string “same” which is fixedly displayed on the LCD 7 in step S23.

Next, FIG. 8 is a diagram showing the configuration of the third embodiment of the dictionary table stored in the dictionary memory 9. The dictionary table in the present embodiment is a kanji table (FIG. 8 (a)) in which kanji (kanji characters) and hiragana (reading character string) indicating the reading of the kanji are registered, and a kanji word composed of a conversion pair of yomi and kanji. It is composed of a table (FIG. 8B). In this idiom table FIG. 8B, meaningful Kanji idioms are registered (stored) as Kanji character strings, and, for example, for the Kanji idiom "Tsuji", it is generally used as a conversion pair. In addition to the reading, "Between",
"Do" is divided into a normal reading "do" in this idiom and a reading "ona" registered in the kanji table in FIG. 8 (a), and "Mr." , And the reading “uji” registered in the kanji table in FIG. 8 (a), the four reading character strings combining the reading “do” and “ona” and the reading “shi” and “uji”. "Onaji",
"Tale", "how to" and "to each other" are registered.

The operation when the kana-kanji conversion processing is performed using the dictionary table having such a configuration will be described with reference to the flowchart of FIG. Here, the flowchart of FIG. 9 corresponds to the conversion processing subroutine S of the flowchart of FIG.
It corresponds to 27. Therefore, first of all, FIG.
In step S21, the handwriting character is input by the input pen 1, and in step S22, the locus of the handwriting character is recognized, and the handwriting character is recognized.
The character data stored in the dictionary memory 9 is detected. Further, in step S22, it is confirmed and confirmed whether or not the character data is the input character. In step S23, the confirmed character (character data) is displayed on the LCD 7.

After the processing of one handwritten character input by the input pen 1 is performed as described above, in step S24, it is determined whether or not the next input (handwriting input) is performed by the input pen 1. Is determined. Step S
In step 24, the processes of steps S22 to S24 are repeated until it is determined that the next input has not been performed. Also in the present embodiment, as shown in FIG. 2A, the character string “same” is changed to L by the processing of steps S21 to S24.
It is displayed on CD7.

If it is determined in step S24 that the next input has not been performed, the process proceeds to step S25,
Conversion key 1 to convert Kana-Kanji character string
It is determined whether 1 has been operated. When it is determined in step 25 that the conversion key 11 has not been operated, the process proceeds to step S26, and after other processing is performed, the process returns to step S25 again. When it is determined in step S25 that the conversion key 11 has been operated (see FIG. 2).
(B)), and proceeds to the conversion processing subroutine S27.

In the conversion processing subroutine shown in FIG. 9, first, in step S61, a subroutine for generating a reading character string from the character string instructed to be converted is executed. The details of this subroutine are shown in FIG.

In the reading character string generation subroutine shown in FIG. 10, first, in step S71, the character pointer indicating (pointing to) one character in the character string designated for conversion is designated for conversion. It is initialized to indicate (point to) the beginning of the character string. Next, in step S72, it is determined whether or not the character pointed to by the character pointer is a kanji character. If it is a kanji character, the process proceeds to step S73, and if not, the process proceeds to step S80.

In step S73, the Kanji table pointer indicating the address of the Kanji table (FIG. 8A) is initialized to indicate (point to) the start address of the Kanji table (initialization of the search position of the Kanji dictionary). ). Next, in step S74, the kanji character stored at the address of the kanji table pointed to by the kanji table pointer,
The Kanji character pointed to by the character pointer (in this case, the first character in the character string specified for conversion) is compared.

Next, in step S75, step S7
If it is determined that the compared characters are equal in step 4, the process proceeds to step S76, the kanji characters determined to be equal in step S74 are stored, and the process proceeds to step S77. That is, in the case of the present embodiment, the Chinese character “Same” is stored. In step S77, the reading character string stored at the address of the kanji table pointed to by the kanji table pointer is stored. That is, in the case of the present embodiment, the reading character string of “on” is stored.

On the other hand, when it is determined in step S75 that the character stored in the address of the kanji table is different from the kanji character pointed to by the character pointer, the process proceeds to step S78, in which the kanji table pointer indicates the next address. It is incremented to point and the process proceeds to step S79. In step S79, the kanji table pointer is
It is determined whether or not it points to the last address of the kanji table. If the kanji table pointer does not point to the last address of the kanji table, the process returns to step S74 and the subsequent processing is continued.

On the other hand, when it is determined in step S79 that the kanji table pointer points to the last address of the kanji table, the process proceeds to step S80, and the character pointed to by the character pointer (the character being referred to) is stored.

When the processing of either step S77 or step S80 is completed, the process proceeds to step S67, where the character pointer is incremented so as to point to the next character in the character string designated for conversion. Next, in step S82, it is determined whether or not the character pointer points to the end of the character string designated for conversion. If it does not point to the end, the process returns to step S72 and the processing from there is repeated.

On the other hand, when it is determined in step S82 that the character pointer points to the end of the character string designated for conversion, this subroutine is terminated, the process returns to the process of FIG. 9, and the process is continued from step S62.

In step S62, a subroutine for retrieving the phrase table (FIG. 8B) is executed by using the reading character string generated in step S61 as a key.
The details of this subroutine are shown in FIG.

In step S91 of FIG. 11, the dictionary table pointer pointing to the phrase table (FIG. 8B) is initialized to point to the start address of the phrase table (initialization of the search position of the dictionary table).

Next, in step S92, the reading character string stored at the address of the phrase table indicated by the dictionary table pointer is compared with the reading character string stored in step S77 (FIG. 10). Next, when it is determined in step S93 that the reading character strings compared in step S92 match, the process proceeds to step S94,
In step S94, the Kanji character string stored at the address of the phrase table indicated by the dictionary table pointer is registered (stored) as a Kana-Kanji conversion candidate. In step S94, Kana-Kanji conversion candidates are registered (stored).
After that, the process proceeds to step S95, the dictionary table pointer is incremented, and the process proceeds to step S96. If it is determined in step S93 that the results compared in step S92 are not equal, step S94
Skip to step S95, the dictionary table pointer is incremented, and then step S96 is performed.

In step S96, it is determined whether the dictionary table pointer points to the last address in the dictionary. If the dictionary table pointer does not point to the last address of the dictionary, step S92.
When the last address is pointed to, the subroutine is terminated, the process returns to the flowchart of FIG. 9, and the process from step S63 is continued.

In step S63, a subroutine for deleting the ineligible kana-kanji conversion candidates by comparing the kanji characters saved in step S61 with the kana-kanji conversion candidates registered (stored) in step S62. Run. The details of this subroutine are shown in the flowchart of FIG.

In the subroutine of FIG. 12, first in step S101, the candidate pointer is initialized to point to the first kana-kanji conversion candidate obtained in step S62. Next, in step S102, the candidate pointer is examined to determine whether there is a candidate. If there is no candidate, the process of this subroutine ends, and the process returns to the process of FIG. 9 and step S28 of FIG. If there are candidates, the process proceeds to step S103.
In step S103, the candidate character pointer is initialized to point to the first character of the candidate character string. Step S1
At 04, the Kanji character pointer is initialized to point to the first Kanji character stored in step S61. Next, in step S105, the Kanji character pointer is inspected to determine whether a Kanji character is included. If a Chinese character exists, the process proceeds to step S106, and if no Chinese character exists, the process proceeds to step S108.

In step S106, the candidate character pointer is examined to determine if the candidate character string has ended. When the candidate character string is over, the process proceeds to step S107, at which time the candidate pointed to by the candidate pointer is deleted from the kana-kanji conversion candidates, and then the process proceeds to step S108. On the other hand, if the candidate character string is not finished yet, the process proceeds to step S109.

In step S108, the address is incremented so that the candidate pointer points to the next candidate, and then the processing from step S102 is repeated.

On the other hand, in step S109, the character pointed to by the kanji character pointer is compared with the character pointed to by the candidate character pointer. In step S110, step S
The judgment result of 109 is monitored, and when the character pointed by the kanji character pointer and the character pointed by the candidate character pointer match in the judgment of step S109, the process proceeds to step S111. In step S111, the Kanji character pointer is updated to point to the next character in the Kanji characters stored in step S61, and then the process proceeds to step S112. In step S112, the candidate character pointer is updated to point to the next character in the candidate character string pointed to by the candidate pointer.
Next, the process returns to step S105, and the processing from there is repeated.

On the other hand, in step S110, if it is determined in step S109 that the two characters are different, the process proceeds to step S113. In step S113, the candidate character pointer is updated to point to the next character in the candidate character string pointed to by the candidate pointer, and then in step S106.
The process from is repeated.

As described above, according to the processing of FIG. 9, step S6
A reading character string is obtained from the character string input by 1, and a candidate character corresponding to this reading is searched in step S62. Among the searched candidate characters, the candidate character string that does not include the kanji in the input character string is deleted in step S63, and as a result, an appropriate candidate character string for the input character string is obtained. After the processing of the conversion processing subroutine shown in FIG. 9 is completed, the process proceeds to step S28 shown in FIG. 3, and an appropriate Chinese character candidate “Tsuji” ... Of the candidates registered in step S94 is displayed at the bottom of the LCD 7, Further, in step S29, the first candidate "Tsuji" among the kanji candidates is displayed on the LCD 7 instead of the character string "same" which is fixedly displayed on the LCD 7 in step S23.

As described above, when converting a kana-kanji character string containing a mixture of hiragana and kanji, the kanji characters included in the character string are included without specifying the part (range) for kana-kanji conversion of the character string. Only meaningful idioms,
Since it is displayed as a kana-kanji conversion candidate, many kana-kanji conversion candidates are not displayed unlike the conventional word processor, for example, and a desired idiom can be easily obtained.

It is to be noted that if a character string (i.e., a compound word) obtained by such a method is subjected to a process of adding adjectives such as inflectional endings and postpositional particles, and this process is repeated, then even in a consecutive phrase, You can perform Kana-Kanji conversion processing.

[0061]

As described above, according to the character conversion device of the present invention, in a character conversion device for converting a handwritten character string into kanji, the input character string is recognized and the recognized character string is recognized. Detects a meaningful Kanji character string that includes the Kanji part of, and displays the detected Kanji character string. Therefore,
A character string input by handwriting can be easily converted into Kanji.

[Brief description of drawings]

FIG. 1 is a block diagram showing the configuration of an embodiment of a portable computer to which a character conversion device of the present invention is applied.

FIG. 2 is a diagram illustrating an operation in which kana-kanji conversion processing is performed in the embodiment of FIG.

FIG. 3 is a flowchart illustrating an operation in which kana-kanji conversion processing is performed in the embodiment of FIG.

FIG. 4 is a flowchart illustrating a first embodiment of processing in a conversion processing subroutine S27 of the flowchart of FIG.

FIG. 5 is a flowchart illustrating a second embodiment of the processing in the conversion processing subroutine S27 of the flowchart in FIG.

FIG. 6 is a diagram showing a configuration of an embodiment of a dictionary table used for processing in the embodiment of FIG.

7 is a diagram showing the configuration of an embodiment of a dictionary table used for the processing in the embodiment of FIG.

8 is a diagram showing a configuration of an embodiment of a dictionary table used for the processing in the embodiment of FIG.

FIG. 9 is a flowchart illustrating a third embodiment of the processing in the conversion processing subroutine S27 of the flowchart in FIG.

FIG. 10 is a subroutine S61 of the flowchart of FIG.
6 is a flowchart illustrating the processing of step S1.

FIG. 11 is a subroutine S62 of the flowchart of FIG.
6 is a flowchart illustrating the processing of step S1.

FIG. 12 is a subroutine S63 of the flowchart of FIG.
6 is a flowchart illustrating the processing of step S1.

FIG. 13 is a diagram showing an example of operation of kana-kanji conversion processing in a conventional portable computer.

[Explanation of symbols]

 1 Input Pen 3 Tablet Controller 4 CPU 5 LCD Controller 6 Memory (VRAM) 7 LCD 7a, 7b Drive Circuit 8 Tablet 8a, 8b Clock Generation Circuit 9 Dictionary Memory

Claims (1)

[Claims] 1. A character conversion device for converting a character string input by handwriting into Chinese characters, including a recognition unit for recognizing the input character string, and a Chinese character portion of the character string recognized by the recognition unit. A character conversion device comprising: a detection unit that detects a meaningful Kanji character string; and a display unit that displays the Kanji character string detected by the detection unit.