JPH11306176A - Character processing device and method and medium storing control program of the device and method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To obtain desired KANJI (Chinese character) candidates by converting a divided 1st KANA (Japanese syllabary) character string into its corresponding KANJI string by referring to a prepared dictionary part and extracting the KANJI candidates corresponding to a 2nd KANA character string from the converted KANJI string to show them at a display part. SOLUTION: A dividing part 9 recognizes a 3rd KANA character out of a KANA character string that is inputted via an input part 2 and then divides the KANA character string into the 1st and 2nd KANA character strings based on the recognized 3rd KANA character. Then the 1st KANA character string is converted into its corresponding KANJI string by making reference to a dictionary part 12 which stores a prepared KANA/KANJI conversion dictionary. The KANJI candidates corresponding to the 2nd KANA character string are extracted from the converted KANJI string, and a control program which shows the extracted KANJI candidates at a display part 4 is stored in a storage medium 18. Thus, the desired KANJI candidates can be obtained.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a character processing apparatus and method applied to a Japanese word processor, a DTP, and a portable terminal, and a medium storing a control program therefor.

[0002]

2. Description of the Related Art Conventionally, in the case of inputting a single kanji character "I" using a kana-kanji conversion function of a Japanese word processor, for example, input a reading kana "i" and sequentially convert to search for conversion candidates. If the conversion candidate is not obtained, display the Onkun conversion table from the kana character "i" and select and input it, or display the radical table and select and input it, or change the kana character string "is" to " After converting to "Ise", the desired Kanji "I" was input by deleting the character of "Se". For this reason, when inputting a single kanji character "I", it was necessary to perform a conversion operation in at least two or more steps.

For example, according to the kanji conversion method described in Japanese Patent Application Laid-Open No. Hei 8-212213, a single character conversion process, a single kanji conversion process, and a radical conversion process can be performed by operating a specific function key. Features have been proposed. In particular, in one-character conversion processing, for example, 2
By operating the head conversion key or the tail conversion key from the character conversion result "Ise", the head conversion character "I" or the last conversion character "se" is efficiently obtained.

[0004]

In the conventional kana-kanji conversion function, when "I" of "Ise" is input, it is necessary to perform at least two or more conversion operations. There was a problem that the kanji could not be obtained immediately and the operability was poor. On the other hand, JP-A-8-2122
The kanji conversion method described in Japanese Patent Publication No. 13 can extract the first kanji and the last kanji from the conversion result of two characters, for example, input the reading of "Kinka Kuji" and convert the result of three characters "Kinkakuji" It is not configured to extract the middle kanji character "Kaku" or multiple kanji strings from. Furthermore, there is a problem that a plurality of conversion keys are operated from the determined conversion result.

The present invention has been made in view of the above circumstances, and comprises, for example, reading of a kanji containing a desired kanji candidate, reading of a desired kanji candidate, and a character / symbol separating these two readings. By entering a kana string,
Provided are a character processing device and method capable of obtaining a desired kanji candidate, and a medium storing a control program therefor.

[0006]

According to the present invention, there is provided a first kana character string corresponding to reading of one idiom, a second kana character string corresponding to reading of a part of the idiom, and the first and second kana character strings. An input unit for inputting a kana character string consisting of a third character / symbol that separates the kana character string, and a third character / symbol that is recognized from the kana character string input by the input unit and recognized. A first kana character string divided into a first kana character string and a second kana character string based on the character / symbol, and a first kana character divided by the division unit with reference to a dictionary unit provided in advance. A conversion unit for converting a string into a corresponding kanji string, an extraction unit for extracting a kanji candidate corresponding to a second kana character string from the kanji string converted by the conversion unit, and a kanji candidate extracted by the extraction unit And a display control unit for displaying on the display unit. It is a character processing apparatus.

In the present invention, the input unit can be constituted by an input device such as a keyboard, a pen / tablet, and a mouse. The display unit can be configured by a display device such as an LCD (Liquid Crystal Display), a PD (Plasma Display), a CRT display, and the like. Division part,
The dictionary unit, conversion unit, extraction unit, and display control unit are CPU, RO
It can be configured by a computer including M, RAM, and I / O ports. In particular, the dictionary storage unit stores the RO
M or an external storage device such as a floppy disk, a hard disk, or the like.

The RAM includes a reading data buffer for temporarily storing a kana character string input from the input unit,
A first kana character example buffer for temporarily storing a kana character string of
A second kana character string buffer for temporarily storing the divided second kana character string, a first conversion result buffer for temporarily storing the conversion result (kanji string) of the first kana character string, and an extracted second kana character string Function as a second conversion result buffer for temporarily storing the conversion result (Kanji candidate), a display data buffer for temporarily storing display data to be displayed on the display unit, and an editing buffer for temporarily storing edited text.

According to the present invention, by inputting a kana character string consisting of a reading of a idiom containing a desired kanji candidate, a reading of a desired kanji candidate, and a character / symbol separating these two readings, Candidates can be obtained.

For example, by inputting a kana character string "Ise noi", a kanji candidate "I" can be obtained, and by inputting a kana character string "Ise nose", a kanji candidate "se" can be obtained. That is, by specifying the reading of a desired kanji candidate after the character / symbol "no", a kanji or a kanji string at an arbitrary position can be obtained regardless of the first character or the last character. Therefore, a single kanji can be input by a simple key operation without pressing the conversion key many times to obtain a desired kanji, or once converting a idiom containing the desired kanji and deleting unnecessary kanji. In particular, it is effective for kana-kanji conversion of personal names, place names, company names, store names, etc., which are not registered in the kana-kanji conversion dictionary.

The dictionary unit stores a kanji character string corresponding to a first kana character string, divides the first kana character string into a plurality of kana character strings, and divides the kanji string into a plurality of kana character strings. It may be configured to be stored so that it can be divided into candidate kanji.

According to the above arrangement, the kana-kanji conversion dictionary is
Since the kanji string and its delimiter information and the kanji string reading delimiter information are added and stored, a kanji candidate corresponding to a part of the kanji string reading can be extracted without increasing the memory capacity of the kanji conversion dictionary.

A kanji character string corresponding to the first kana character string converted by the conversion part;
The extracting unit extracts a kanji candidate corresponding to a second kana character string from the kanji string determined by the determining unit, and the display control unit displays the kanji string and the extracted kanji candidate on the display unit. The display may be configured.

According to the above configuration, the converted kanji string is determined, and the kanji corresponding to the reading of a part of the kanji string is extracted, thereby increasing the conversion rate of the kanji candidate.

According to another aspect of the present invention, a first kana character string corresponding to reading of one idiom, a second kana character string corresponding to reading of a part of the idiom, and first and second kana character strings. A kana character string consisting of a third character / symbol separating the kana character string is input by the input unit, and a third character / symbol is recognized from the kana character string input by the input unit, and the recognized third character / symbol is recognized. The first kana character string and the second
Into a kana character string, and refer to a dictionary provided in advance.
The divided first kana character string is converted into a corresponding kanji string, a kanji candidate corresponding to a second kana character string is extracted from the converted kanji string, and the extracted kanji candidate is displayed on a display unit. Is provided.

According to still another aspect of the present invention, there is provided a medium storing a program for controlling a character processing device by a computer, the computer comprising: a first kana character string corresponding to reading of one idiom; When a kana character string consisting of a second kana character string corresponding to reading of a part of the idiom and a third character / symbol separating the first and second kana character strings is input by the input unit, A third character / symbol is recognized from the kana character string input by the unit, and is divided into a first kana character string and a second kana character string based on the recognized third character / symbol. With reference to the provided dictionary unit, the divided first kana character string is converted into a corresponding kanji string, and a kanji candidate corresponding to a second kana character string is extracted from the converted kanji string, Display the extracted Kanji candidates Medium storing a character processing apparatus control program to be displayed on is provided. According to the above configuration, a control program for controlling the character processing device is provided in a Japanese word processor, a DTP, a mobile terminal, or the like.
By installing M. on a floppy disk, the kana-kanji conversion function of the present invention can be obtained.

[0017]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, the present invention will be described in detail based on an embodiment shown in the drawings. The present invention is not limited by this.

FIG. 1 is a block diagram showing the overall configuration of the kana-kanji conversion device of the present invention. In FIG. 1, 1 is CP
A CPU 1 of a computer including a U, a ROM, a RAM, and an I / O port is shown. The CPU 1 controls the entire apparatus by a control program stored in the ROM. 2 is a keyboard,
Indicates an input unit consisting of a pen / tablet etc., various characters,
The user inputs a conversion instruction, a confirmation instruction, and the like. Reference numeral 3 denotes a printing unit including a thermal printer, a laser printer, and the like, which prints input characters and edited text. Reference numeral 4 denotes a display unit including an LCD (liquid crystal display), a plasma display, a CRT display, and the like, and displays an input kana character string, a conversion candidate, a text being edited, and the like.

Reference numeral 5 denotes a display buffer comprising a RAM,
Display data in which an input kana character string, a conversion candidate, a text being edited, and the like are developed for display are stored. Reference numeral 6 denotes an editing buffer composed of a RAM, which stores a text being edited. Reference numeral 7 denotes a position buffer for storing a cursor pointer indicating a position (cursor position) where data is currently input on the display buffer 5 and the edit buffer 6.

Reference numeral 8 denotes a read buffer consisting of a RAM.
A first kana character string corresponding to the reading of one idiom, a second kana character string corresponding to the reading of a part of the idiom, and a third kana character connecting the first and second kana character strings (for example, When a reading composed of a particle ("") is input by the input unit 2, the input reading (a kana character string) is stored.

Reference numeral 9 denotes an RO in which a division control program is stored.
M represents a division unit composed of M characters, and recognizes a third kana character from the kana character string input by the input unit 2 and recognizes the recognized third kana character.
Is divided into a first kana character string and a second kana character string. Reference numeral 10 denotes a first kana character string buffer formed of a RAM, and stores a first kana character string corresponding to reading of a idiom. Reference numeral 11 denotes a second kana character string buffer composed of a RAM, and stores a second kana character string corresponding to the reading of a kanji candidate to be converted.

Reference numeral 12 denotes a dictionary unit composed of a ROM or FD (floppy disk) or HD (hard disk), and stores a kana-kanji conversion dictionary for converting an inputted kana character string into kanji. Reference numeral 13 denotes a conversion unit composed of a ROM in which a conversion control program is stored. The conversion unit 13 refers to the kana-kanji conversion dictionary of the dictionary unit 12 and converts the first kana character string into a corresponding kanji string.

Reference numeral 14 denotes an R in which the extraction control program is stored.
FIG. 2 illustrates an extraction unit including an OM, and extracts a kanji candidate (final conversion result) corresponding to a second kana character string from a conversion result (kanji string) of a first kana character string. Reference numeral 15 denotes a first conversion result buffer including a RAM, which stores a conversion result of a first kana character string. Reference numeral 16 denotes a second conversion result buffer composed of a RAM, which stores the conversion result of the second kana character string.
Reference numeral 17 denotes a display control unit composed of a ROM in which a display control program is stored. I do.

Reference numeral 18 denotes a storage medium for storing the control program and data of the present invention, such as an IC memory, an FD (floppy disk), an HD (hard disk), and a CD-RO.
M, MD, etc. Reference numeral 19 denotes a storage medium reading unit that can read the storage medium 18 and install it in the RAM of the computer. Reference numeral 20 denotes a bus for transferring character codes, control data, addresses, and the like.

The first kana character string corresponding to reading of one idiom, the second kana character string corresponding to reading of a part of the idiom, and the first and second kana character strings are connected to the computer 1. When a kana character string composed of a third kana character is input by the input unit 2, a third kana character is recognized from the kana character string input by the input unit 2, and the recognized third kana character is recognized. The first kana character string is divided into a first kana character string and a second kana character string based on the column, and the divided first kana character string is converted into a corresponding kanji string with reference to the dictionary unit 12 provided in advance. A control program for causing a kanji candidate corresponding to a second kana character string to be extracted from the converted kanji string and displaying the extracted kanji candidate on the display unit 4 is stored in the storage medium 18. Is also good.

A control program stored in a storage medium 18 such as an FD, a CD-ROM, or a hard disk is installed in a RAM or a floppy disk of various devices such as a Japanese word processor, a DTP, or a portable terminal by a storage medium reading unit 19. Thus, the kana-kanji conversion function of the present invention is obtained.

FIG. 2 is a diagram showing an example (1) of the data configuration of the kana-kanji conversion dictionary according to the present embodiment. As shown in FIG. 2, as a data configuration example (1) of the kana-kanji conversion dictionary, for example, first reading data 211, 221, 231 and conversion data (idioms) 212, 222, 2,
32 and second reading data 213, 22 having a delimiter
3 and 233 are stored. Therefore, the second character having a delimiter corresponding to each kanji composing the idiom
Since the second reading data is added, the second reading data can be utilized as a second kanji character string corresponding to a kanji or a kanji string to be converted for single kanji conversion or kanji string conversion.

FIG. 3 is a diagram showing a data configuration example (2) of the kana-kanji conversion dictionary according to the present embodiment. As shown in FIG. 3, as a data configuration example (2) of the kana-kanji conversion dictionary, first reading data 311, 321 and 331 having delimiters are provided.
And corresponding conversion data (idioms) 312, 32
2 and 332 are stored. According to this dictionary configuration, since the first reading data corresponding to the idiom has a delimiter corresponding to each kanji, it can be utilized for single kanji conversion or kanji string conversion without substantially changing the conventional dictionary structure. Increase can be suppressed.

FIG. 4 is an explanatory diagram showing the procedure of the kana-kanji conversion process according to this embodiment. As shown in FIG. 4, for example,
The division unit 9 reads the read data “Iseinoi” indicated by the cursor pointer from the read buffer 8 and converts the delimiter code (particle) “no” into a first kana character string and a second kana character string. As the third connecting kana character,
Based on the recognized delimiter code, the full-read data “Ise” of the idiom is divided as a first kana character string, and the partial read data “I” of the idiom is divided as a second kana character string. The division unit 9 stores the full reading data “Ise” of the idiom in the first kana character string buffer 10 and stores the partial reading data “I” of the idiom in the second kana character string buffer 11.

The conversion section 13 searches the kana-kanji conversion dictionary (shown in FIGS. 2 and 3) of the dictionary section 12 and corresponds to the first reading data “Ise” stored in the first kana character string buffer 10. Search for idioms to get "Ise". First conversion result
The result is stored in the conversion result buffer 15. The extraction unit 14 extracts a kanji candidate “I” corresponding to the second reading data “i” stored in the second kana character string buffer 11 and stores the candidate in the second conversion result buffer 16.

FIG. 5 is an explanatory diagram showing a display example (1) of the kana-kanji conversion process according to the present embodiment. In FIG. 5, the input of “Shinjuku Park Taiwan” is completed (D51), and then “Kaku” is entered.
Is input, the kana character string “Kinka Kuji no Kaku” is input (D52), and the “shift” key and the “convert” key are pressed (D53), and the idiom “Kinkakuji” as the first conversion result is obtained. Further, a double underline is displayed on the “kaku” as the second conversion result (D53). Next, if there is any key input including character input, "Kaku" is displayed (D54).
For example, when "kaku" is derived from the input kana character string "kinkakuji no kaku", "kaku" may be directly displayed as the direct display mode in D53 without displaying "kinkakuji" (see FIG. 6). .

FIG. 6 is an explanatory diagram showing a display example (2) of the kana-kanji conversion process according to the present embodiment. In FIG. 6, D6
FIG. 1 shows an example in which a kanji candidate “I” is directly displayed from an input kana character string “Iseinoi”. D62 is an example in which the kanji candidate “Kaku” is directly displayed from the input kana character string “Kinka Kuji no Kaku”. In D63, the input kana character string "Konokako" is sequentially converted into Kanji candidates "Effective", "High", and "Down".

FIG. 7 is a flowchart showing the procedure (1) of the kana-kanji conversion process according to this embodiment. FIG. 9 is a diagram showing an example of a kana character string and a kanji candidate stored in each buffer according to the present embodiment. In the present embodiment, the delimiter code is described as “no” (shift JIS code 82CC) as an example, but other kana characters (eg, “no”) or symbols (eg, “/”) may be used.

In FIG. 7, after a kana character string is input, when a key input is made while waiting for a key input (S70).
1) It is determined whether the key is a key for performing single kanji conversion according to the present embodiment (S702). If the "shift" key and the "conversion" key are not pressed at the same time, it is determined whether the key is a "character" key (S703). When the key is the "character" key, one character is added to the reading buffer 8 (S704). When the key is not the "character" key, processing such as error display is performed, and the process returns to key input waiting (S705).

In step S702, when the "shift" key and the "conversion" key are pressed simultaneously, it is determined that the function is a single kanji conversion function by electronic message input, which is one of the kana kanji conversion functions of the present embodiment. It is determined whether or not the read data stored in the read buffer 8 is all the kana character strings (S706). If the read data is not all the kana character strings, an error is displayed and the process returns to the key input wait (S707).

When the read data is all the kana character strings, the read data shown by 901 in FIG. 9 and the number of characters m shown by 902 in FIG. 9 are obtained (S711), and the pointer value n of the read buffer 8 is set to 1. (S712).

Next, it is determined whether or not the character P (n) indicated by the pointer is "" (S713). If not, the pointer value is incremented by 1 and the determination is made again (S71).
5). When the delimiter code is “no”, first, it is determined whether or not the pointer value is 1 (S714). If the pointer value is 1, the pointer value is incremented by 1 and the process returns to the determination of the delimiter code (S715). Therefore, as shown by 903 in FIG. 9 and 904 in FIG.
If there is, it is not used as a delimiter code.

Next, the pointer value n is compared with the number of characters m (S716). When n ≧ m, that is, the last character (FIG. 9)
If there is a "" in 905), an error display etc. is performed,
The process returns to waiting for key input (S717). In S716, n <m
, The character string from P (1) to P (n−1), that is, the front part separated by “” is stored in the first kana character example buffer 10 (S 721), and P (n + 1) to P (n + 1) (M)
Character string up to, that is, the second part separated by "no"
It is stored in the kana character string buffer 11 (S722). FIG.
The reading data “Issei no” shown in 906 is “Ise”
And "i" read data. At this time, the pointer value (separation position) n is 3, and the number m of characters is 4.

Next, division of read data when there are a plurality of "" s, such as a delimiter code "", as shown at 907 and 908 in FIG. 9 will be described. It is determined whether the reading of the divided second kana character example is present in the first kana character string (S723). If the second kana character example is not read, the pointer value is incremented by 1, and the process returns to the routine of S713 for determining the delimiter code “of” (S714).

For example, when the first “of” the reading data “Azumino Nozumi” shown at 907 in FIG. 9 is used as a delimiter code, the second kana character string “Nozumi” becomes the first kana character string “Azumi”. Check if there is. In this case, since "no" is not included, the pointer value is incremented by 1 and the second "no" shown at 908 in FIG. 9 is obtained as the next delimiter code. At this time, it is checked whether or not the second kana character string “Zumi” is present in the first kana character string “Azumino”. In this case, since it is included in “Azumino”, it is determined as a delimiter code, and FIG.
The routine proceeds to the routine of the flowchart shown in FIG. In this way, even when there are a plurality of "" characters in the read data, the position of the delimiter code "" can be determined.

FIG. 8 is a flowchart showing the procedure (2) of the kana-kanji conversion process according to this embodiment. In FIG. 8, the divided first kana character string is determined as the reading data to be converted (S731), and a conversion candidate is searched with reference to the kana-kanji conversion dictionary (S732). If there is no conversion candidate, the process returns to the routine of the flowchart shown in FIG. If there is a conversion candidate, the conversion candidate is stored in the first conversion result buffer 1
5 (S734), the first kana character string buffer 10
Is divided into readings for each kanji (S73)
5). Next, the first conversion result is stored in the display buffer 5 (S736). In addition, the number of kanji characters m ′ of the first conversion result is obtained for search (S737), and the first kana character string buffer 1
The pointer value n of 0 is set to 1 and set at the beginning (S73).
8).

Next, of the idioms of the conversion candidates (first conversion results) read by the dictionary search, some of the idioms (second conversion results) are read.
A procedure for extracting a kanji character that matches the kana character string reading) will be described. Currently, the first kana character string with the pointer
It is determined whether there is the same reading as the reading of the kana character string (S
739) If there is not the same reading, the pointer value is incremented by 1 (S740). If not, the process returns to S739 for extracting kanji candidates (S741).

In S741, when the first kana character string has the same reading as the reading of the second kana character string, a conversion candidate corresponding to the reading of the second kana character string is extracted and stored in the second conversion result buffer 16. (S742). The attribute of the character corresponding to the conversion candidate (extracted kanji) extracted from the first conversion result stored in the display buffer 5 is changed (S743). It is determined whether or not the display mode is the direct display mode (S744). If there is no direct display mode, the extracted kanji whose character attribute has been changed is displayed in the first conversion result (S745).

Here, the direct display mode is a mode in which the first conversion result (idiom) is not displayed, and the second conversion result (only the kanji to be converted) is directly displayed. For example, as shown at D53 in FIG. 5, the first conversion result is underlined, and the extracted Chinese characters (the Chinese characters to be converted) are displayed as double underlines. Further, in the present embodiment, the first conversion result (idiom) and the second conversion result are distinguished and displayed by a combination of underscores and double underscores. However, another distinction display is conceivable.

Next, the kanji candidates (extracted kanji) stored in the second conversion result buffer 16 are stored in the display buffer 5 (S746). It is determined whether or not the display mode is the direct display mode (S747). In the direct display mode, the extracted kanji stored in the display buffer 5 is displayed (S74).
8) (see display example in FIG. 6).

Here, the extracted kanji is waiting for confirmation as to whether it is the desired kanji. If it is not the desired kanji, the "next candidate" key or the "shift" key and the "convert" key are pressed. It is determined whether the “next candidate” key or the “shift” key and the “convert” key have been pressed (S749), and when pressed, the pointer value is increased by 1 (S752).
Next, it is determined whether the character pointed to by the pointer is the last character (S753). If it is the last character, the process returns to the routine of S732 for searching the kana-kanji conversion dictionary again. If the character pointed to by the pointer is not the last character, the flow returns to the kanji extraction processing of S739.

In S749, if any key other than the "next candidate" key or the "shift" key and the "convert" key is pressed,
In other words, when a character input or a control key other than the "next candidate" key or the "shift" key and the "conversion" key is pressed, it is determined whether or not the display mode is the direct display mode (S750). No operation is performed because the extracted kanji is displayed, but when not in the direct display mode, the extracted kanji is displayed (S751). As an example of this display, as shown in D53 of FIG. 5, when "de" is input, the extracted kanji is displayed. Next, other processing such as storing the extracted kanji in another memory buffer is performed, and the process returns to the routine of the flowchart shown in FIG.

According to the above embodiment, the following effects can be obtained. (1) A desired kanji candidate can be obtained by inputting a kana character string consisting of a reading of a idiom containing a desired kanji candidate, a reading of a desired kanji candidate, and a character / symbol separating these two readings. .

For example, by inputting a kana character string "Ise noi", a kanji candidate "I" can be obtained, and by inputting a kana character string "Ise nose", a kanji candidate "se" can be obtained. That is, by specifying the reading of a desired kanji candidate after the character / symbol "no", a kanji or a kanji string at an arbitrary position can be obtained regardless of the first character or the last character. Therefore, a single kanji can be input by a simple key operation without pressing the conversion key many times to obtain a desired kanji, or once converting a idiom containing the desired kanji and deleting unnecessary kanji. In particular, it is effective for kana-kanji conversion of personal names, place names, company names, store names, etc., which are not registered in the kana-kanji conversion dictionary.

(2) Since the kana-kanji conversion dictionary is stored by adding a kanji string and its delimitation information to the reading of the kanji string, without increasing the memory capacity of the kanji conversion dictionary,
Kanji candidates corresponding to reading of a part of the kanji string can be extracted. (3) The converted kanji string is determined, and a kanji corresponding to a part of the kanji string read is extracted, so that the conversion rate of the kanji candidate is increased.

When the voice input technology spreads in the future, in FIG. 1, a voice input unit for inputting voice information, a voice character conversion dictionary for converting the input voice information into a character code, and a voice character conversion dictionary And a voice conversion unit that converts voice information input with reference to a character code.When the kana-kanji conversion method of the present invention is applied to a character processing device having a voice input function, a desired kanji candidate is determined. When voice input is made of character information consisting of readings of idioms including, readings of desired kanji candidates, and readings of “no” separating these two readings,
It is possible to convert the input voice into the character code very effectively.

[0052]

According to the present invention, by inputting a kana character string consisting of a reading of a kanji containing a desired kanji candidate, a reading of a desired kanji candidate, and a kana character connecting these two readings. Kanji candidates can be obtained.

[Brief description of the drawings]

FIG. 1 is a block diagram showing an overall configuration of a kana-kanji conversion device of the present invention.

FIG. 2 is a diagram illustrating a data configuration example (1) of a kana-kanji conversion dictionary according to the present embodiment.

FIG. 3 is a diagram illustrating a data configuration example (2) of a kana-kanji conversion dictionary according to the present embodiment.

FIG. 4 is an explanatory diagram showing a procedure of a kana-kanji conversion process according to the embodiment.

FIG. 5 is an explanatory diagram showing a display example (1) of a kana-kanji conversion process according to the embodiment.

FIG. 6 is an explanatory diagram showing a display example (2) of the kana-kanji conversion process according to the embodiment.

FIG. 7 is a procedure (1) of a kana-kanji conversion process according to the embodiment.
It is a flowchart which shows.

FIG. 8 shows a procedure (2) of a kana-kanji conversion process according to the embodiment.
It is a flowchart which shows.

FIG. 9 is a diagram illustrating an example of a kana character string and a kanji candidate stored in each buffer according to the present embodiment.

[Explanation of symbols]

 Reference Signs List 1 CPU 2 input unit 3 printing unit 4 display unit 5 display buffer 6 editing buffer 7 position buffer 8 reading buffer 9 division unit 10 first kana character string buffer 11 second kana character string buffer 12 dictionary unit 13 conversion unit 14 extraction unit 15 First conversion result buffer 16 Second conversion result buffer 17 Display control unit 18 Storage medium 19 Storage medium reading unit 20 Bus

Claims (7)

[Claims] 1. A first kana character string corresponding to reading of one idiom, a second kana character string corresponding to reading of a part of the idiom, and a third kana character string separating the first and second kana character strings. An input unit for inputting a kana character string consisting of characters / symbols of
A division for recognizing a third character / symbol from the kana character string input by the input unit and dividing the kana character string into a first kana character string and a second kana character string based on the recognized third character / symbol. A conversion unit that converts the first kana character string divided by the division unit into a corresponding kanji string with reference to a dictionary unit provided in advance, and a second kanji string converted from the kanji string converted by the conversion unit. A character processing apparatus comprising: an extraction unit that extracts a kanji candidate corresponding to a kana character string of the above; and a display control unit that causes a display unit to display the kanji candidate extracted by the extraction unit. 2. The dictionary unit stores a kanji character string corresponding to a first kana character string, divides the first kana character string into a plurality of kana character strings, and divides the kanji string into a plurality of kana character strings. 2. The character processing apparatus according to claim 1, wherein the character processing apparatus stores the kanji candidate corresponding to the character string. A kanji character string corresponding to the first kana character string converted by the conversion part, wherein the extracting part determines a second kanji character string from the kanji character string determined by the determining part. The character processing device according to claim 1, wherein a kanji candidate corresponding to a kana character string is extracted, and the display control unit causes the display unit to display the kanji character string and the extracted kanji candidate. 4. A first kana character string corresponding to the reading of one idiom, a second kana character string corresponding to the reading of a part of the idiom, and a third kana character string separating the first and second kana character strings. A kana character string consisting of characters / symbols is input by the input unit, and a third character / character is input from the kana character string input by the input unit.
A symbol is recognized, divided into a first kana character string and a second kana character string based on the recognized third character / symbol, and the divided first kana character string is referred to with a dictionary provided in advance. Is converted into a corresponding kanji string, a kanji candidate corresponding to a second kana character string is extracted from the converted kanji string, and the extracted kanji candidate is displayed on a display unit. Character processing method. 5. A kanji string corresponding to a first kana character string is stored in the dictionary section, the first kana character string is divided into a plurality of kana character strings, and the kanji string is divided into a plurality of kana character strings. 5. The character processing method according to claim 4, wherein said character processing method is stored so as to be divided into corresponding kanji candidates. 6. A kanji character string corresponding to the converted first kana character string is determined, and a kanji candidate corresponding to a second kana character string is extracted from the determined kanji character string. The character processing method according to claim 4, wherein the extracted kanji candidates are displayed on the display unit. 7. A medium storing a program for controlling a character processing device by a computer, wherein the computer stores a first kana character string corresponding to reading of one idiom and a reading of a part of the idiom. When a kana character string including a second kana character string and a third character / symbol separating the first and second kana character strings is input by the input unit,
A third character / symbol is recognized from the kana character string input by the input unit, and divided into a first kana character string and a second kana character string based on the recognized third character / symbol. , By referring to a dictionary unit provided in advance,
A character processing device for converting a kana character string of the character string into a corresponding kanji character string, extracting a kanji candidate corresponding to a second kana character string from the converted kanji character string, and displaying the extracted kanji character candidate on a display unit A medium that stores a control program.