JPH0883274A - Character processing device and its chinese character conversion method - Google Patents

Abstract

PURPOSE: To obtain new standards of sequencing of KANJI(Chinese character) conversion candidates by sequencing the conversion candidates on the basis of the degrees of relation between reference information and the respective conversion candidates as priority levels. CONSTITUTION: The conversion candidates for a KANJI string or KANA (Japanese syllabary) mixed KANJI string to be converted are sequenced while related to calendar information clocked by a timer 3. For the purpose, KANJI and season information is entered into a KANJI dictionary 11A while made to correspond to readings (KANA character). This KANJI dictionary 11A is used to perform KANJI conversion processing. Namely, this is a procedure which is previously stored in a ROM 2 and executed by a CPU 1 when a character string is inputted from a keyboard 6, and a date and time are obtained from the timer 13. Then a reading string (KANA string) from a keyboard controller 5 is inputted. Conversion candidates in KANJI are generated for the inputted readings. Further, a 1st candidate is determined among the conversion candidates on the basis of the date and time and a paragraph as the 1st candidate is outputted to a CRT 8.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a character processing device for converting kana characters into kanji and a kanji conversion method thereof.

[0002]

2. Description of the Related Art Conventionally, in a character processing device having a kanji conversion function, such as a word processor or a personal computer, when a kana character string is input as a reading from a keyboard, the kana character string is referred to by the kana character string in the character processing device. Convert to a string (including one Kanji) or Kana-Kanji character string. At this time, when there are many homonyms, those phrases, that is, conversion candidates are displayed and selected by the user.
Normally, the display order of the conversion candidates is displayed in descending order of frequency of use of the word.

For example, when the user inputs "oyster" as a kana character string, the character processing device displays "below", "summer season", "summer season", "persimmon", and "oyster" as conversion candidates in the order of frequency of use. . When the user specifies "below", "below" is inserted or added in the created document. Further, the character processing device adds the number of times of use of "below" by "1".

[0004]

As described above, by ranking the conversion candidates according to the frequency of use, the user can
Although the selection of conversion candidates has become easier, the frequency of use of conversion candidates changes in the use start state of the character processing device, and accordingly, the display order of conversion candidates also changes significantly.

In view of the above, the present invention provides a character processing device and a character processing device capable of providing a new kanji conversion process that does not depend on the frequency of use for ranking kanji conversion candidates in order to alleviate the above-mentioned problems. It is to provide a kanji conversion method.

[0006]

In order to achieve such an object, the invention as set forth in claim 1 is a character processing device for converting a reading into a kanji corresponding to the reading, and When there are a plurality of homonyms in a character processing device that outputs the plurality of homonyms in the order of priority as conversion candidates for Kanji, the degree of association between predetermined reference information and each conversion candidate is acquired. And a second arithmetic processing means for ranking the conversion candidates with the obtained degree of association as the priority.

According to a second aspect of the present invention, in addition to the first aspect of the invention, the reference information is seasonal information, and the first arithmetic processing means includes a time measuring means for measuring a month and day indicating a season, and a reading. It has a Chinese character as a conversion result and a Chinese character dictionary in which information indicating the season related to the Chinese character is written, and the first arithmetic processing means compares the season indicated by the timekeeping means with the season obtained from the Chinese character dictionary. It is characterized in that the degree of the relation is acquired.

According to a third aspect of the present invention, in addition to the first aspect of the invention, the reference information is information indicating an area, and the area indicated by the kanji converted from the reading and the area indicated by the reference information are included. It is characterized in that the distance between them is the degree of the relation.

In addition to the invention of claim 3, the invention of claim 4 further comprises a storage means for storing the frequency of conversion from reading to kanji for each kanji, and the first operation The processing means regards the frequency as the name recognition degree of the area, and acquires the degree of association from the name recognition degree and the distance.

According to a fifth aspect of the present invention, there is provided a character processing device for converting a phonetic reading into a kanji character corresponding to the phonetic reading. When there are a plurality of homonyms in the conversion result, the plural homonyms are used. In a kanji conversion method of a character processing device that outputs words as conversion candidates into kanji in accordance with a priority order, a degree of association between predetermined reference information and each conversion candidate is acquired by an information processing device, and the acquired association The information processing apparatus is characterized in that the conversion candidates are ranked with the degree as the priority.

According to a sixth aspect of the invention, in addition to the fifth aspect of the invention, the reference information can be changed.

[0012]

In the inventions of claims 1 and 5, reference information is prepared,
The degree of association between the reference information and the conversion candidates is examined, and the conversion candidates are ranked according to the degree of association.

According to the second aspect of the invention, by using the season as the reference information, it is possible to automatically give priority to the Kanji conversion candidate that matches the current season.

According to the third aspect of the present invention, the reference information is information indicating a region, for example, information indicating a prefecture, so that the kanji conversion candidates close to the region indicated by the reference information can be automatically prioritized.

According to the invention of claim 4, when a plurality of conversion candidates are located in the same area, the ranking can be performed.

According to the sixth aspect of the present invention, the reference information can be changed so that the season and the area can be changed, and the environment of use of the user can be met.

[0017]

Embodiments of the present invention will be described in detail below with reference to the drawings.

FIG. 1 shows a first embodiment and a second embodiment described below.
A system configuration common to the embodiments is shown.

In FIG. 1, a CPU (Central Processing Unit) 1 executes an application program and a Kanji conversion program according to the present invention according to a system processing program stored in a ROM (Read Only Memory) 2.

In addition to the above system processing program, the ROM 2 stores data values used for system control. A RAM (readable / writable memory) 3 is used as a work memory, and temporarily stores document information such as a created document and a printed document, and a kana character string input from the keyboard (KB) 6. The external ROM 4 is a removable ROM, and stores font information for display, additional system programs, and the like. The keyboard controller (KBC) 5 is the information input from the keyboard 6, that is, the CPU 1.
CPU for character information related to operation instructions and document editing
Transfer to 1. The keyboard 6 is provided with an operation instruction to the CPU 1, for example, a key for instructing character processing such as kanji conversion for document creation, a key for inputting kana characters, English characters, and numbers.

The CRT controller (CRTC) 7 is an R
The display data of AM3 is read (or received from CPU1) and transferred to CRT (cathode ray tube display) 8.

The disk controller 9 includes a floppy disk storage device (FD) 10 and a hard disk storage device (H).
D) Read / write data is transferred between 11 and the CPU 1.

The floppy disk storage device 10 mainly reads / writes a document with respect to the mounted floppy disk. The hard disk storage device 11 stores an application program and a temporary storage document in a built-in hard disk. Kanji dictionaries (to be described later) 11A and 11B according to the present invention are stored in advance on the hard disk 11. The printer (PRT) 12 is set to R by the instruction of the CPU 1.
Print the print data on AM3.

The timer 13 clocks calendar information about the date and time.

(First Embodiment) The first embodiment is characterized in that the conversion candidates of the Kanji / Kanji string to be converted or the Kana / Kanji string to be converted are ranked in association with the calendar information measured by the timer 13. .

For this reason, in the present embodiment, the kanji and season information is described in the kanji dictionary 11A of FIG. 1 in correspondence with the reading (kana characters) as shown in FIG.
The conventional Kanji information is shown in FIG. 3 for reference.

The seasonal information used in this embodiment includes information representing the four seasons (indicating the range of months) and information representing a specific month.

FIG. 2 shows a kanji conversion processing procedure to be performed using such a kanji dictionary 11A.

This processing procedure is stored in advance in the ROM 2, and when the character string is input from the keyboard 6, the CPU
1 is a procedure executed by the step S11 for acquiring the date and time from the timer 13, and the keyboard controller 5
Step S1 for inputting a reading row (kana row) from
2, step S13 of creating a conversion candidate for Kanji for the input reading, step S14 of determining the first candidate based on the date and time from the conversion candidates,
Step S15 of outputting the candidate clauses to the CRT 8
Consists of

A more specific kanji conversion process will be described. The user uses the character keys of the keyboard 6 to input the reading “scrap”. The input reading is the keyboard controller 5
Stored in. When the user operates the return key indicating the end of reading, the CPU 1 follows the control procedure of FIG.
First, from the timer 13, the current date and time "'93 -08-25
8:25 ”is acquired (step S11). Next CP
U1 is an input character string, that is, the keyboard controller 8
The "oysters" stored in the RAM are transferred to the RAM 3 as a read string (step S12).

The CPU 1 refers to the Kanji dictionary 11A and refers to the conversion candidates "following", "summer season", "summer season",
Create "persimmon" and "oyster" in RAM3 (step S
13).

Next, the CPU 1 compares the seasonal information of each conversion candidate with the date and time information acquired from the timer 13 to detect a word that matches the condition. In the case of this example, since the month indicated by "summer season" and "summer season" and the date and time information is August, a kanji string that meets the conditions (see FIG. 4) can be obtained.
In accordance with the description order of 1A, "summer season" is determined as the first conversion candidate (see FIGS. 5 and 6), and "summer season" is determined as the second conversion candidate. For the kanji strings that do not meet the conditions, the conversion candidates are ranked according to the description order of the kanji dictionary 11A (steps S13 to S15). The first candidate determined in this manner is first displayed as a conversion candidate while the document is displayed on the CRT 8, and thereafter, the display is switched to the second conversion candidate ... In response to the user's switching instruction.
Thereafter, the user determines a Kanji string used in the document by selecting a desired candidate in a conventional manner.

The ranking criteria used in this embodiment are as follows.

1) When the month information indicated by the timer is included in the period indicated by the seasonal information (seasonal information of "summer" in FIG. 4 (such as June to August), the case of the above item 1) Except
Give priority to the Kanji string.

2) The kanji strings having the same priority are ranked according to other decision criteria, for example, the order of writing in the kanji dictionary or the frequency of use.

According to such a standard, when the month counted by the timer 13 is March, "following" is selected and output as the first conversion candidate for the reading "oyster" of the input (Fig. 7, see FIG. 8).

When the month counted by the timer 13 is October, "oyster" is selected and output as the first conversion candidate (see FIGS. 9 and 10).

If the month measured by the timer 13 is December, "oyster" is selected and output as the first conversion candidate (see FIGS. 11 and 12).

As an application form of the first embodiment, a state in which the frequency of use and the seasonal information are combined will be described.

In this example, the likelihood is used as a criterion for ranking.
Likelihood, that is, likelihood

[0041]

[Expression 1] W ₁ × “frequency of use” + W ₂ × “seasonal value” Here, W ₁ and W ₂ are weighted counts. The seasonal value is "+1" when the seasonal information assigned to the Chinese character matches the season indicated by the time value of the timer 13, "-1" when the seasonal information does not match, and "0" when the seasonal information is no season.
FIG. 13 shows an example of a Kanji dictionary used to calculate such likelihood. The seasonal information shown in FIG. 13 is "summer",
It is represented by "winter", and the frequency of use is represented by a frequency level determined according to the number of times of use.

The word "tango" is input to the character processing device using such a kanji dictionary, and the timer 13
The date is "'93 -06-25 8:25" (Month is 6
In the case of "Month", the CPU 1 acquires "word", "dango", ... As conversion candidates from the Kanji dictionary.

As is apparent from FIG. 13, the seasonal information of "word" is "no season" and the seasonal value is "0". The frequency is “5”. The seasonal information of "Tango" is "May", the seasonal value is "1", and the frequency is "3". When each of the weighting factors W ₁ and W ₂ is set to “1”, “5” of “word” is obtained as the maximum likelihood value, and “word” is determined as the first conversion candidate as shown in FIG. Is output.

(Second Embodiment) In the second embodiment, a regional attribute is added to a kanji string written in a kanji dictionary. When a kanji conversion candidate is created, the distance between the area indicated by the area attribute and a predetermined reference place name is calculated, and the kanji candidate with the shortest distance is set as the first candidate.

Therefore, in this embodiment, the Kanji dictionary 11B (see FIG. 1) is constructed as shown in FIG. More specifically, it is added to a kanji string (place name) corresponding to reading, and the area name to which the place name belongs and the frequency of use information are written in the kanji dictionary 11B. For reference, the contents of the conventional place name dictionary are shown in FIG.

The system operation of the character processing apparatus of FIG. 1 in the second embodiment will be described below. FIG. 16 shows a basic processing procedure in the character processing of the second embodiment. This processing procedure is stored in the ROM 2 in advance and is executed when a series of character strings (including one character) is input from the keyboard 6 with the return key. That is, the user first operates the priority area setting key according to the present invention to perform the above-described reference area setting processing. When the CPU 1 determines the operation of the priority area setting key, the user's setting is accepted in steps S112 and S113 of FIG.

In this step, the user operates the keyboard 8 to give a place name, for example, "Tokyo" to the apparatus as a reference place name. The given reference place name information is stored and stored in the HDD 11.

After that, in the character processing mode, when a character string (reading) to be converted into Kanji and a Kanji conversion instruction are input from the keyboard 6, the CPU 1 proceeds to step S111.
→ S112 → Kanji conversion processing of the character string input by the procedure of S114 is executed. FIG. 17 shows a processing procedure of a portion related to the present invention in this processing procedure. In FIG. 17, when the user inputs, for example, “Misakicho” reading (step S121), the CPU 1 refers to the kanji dictionary 11B on the HDD 11 (see FIG. 20) and selects “Misaki Town” and “Cape” as conversion candidates. The "town" and "Misaki town" are acquired (step S122). The dictionary data of FIG. 20 includes not only the notation corresponding to reading but also the region name (region attribute) indicating the position and the frequency of use when the notation is a place name.

The CPU 1 also acquires these area names in association with the acquisition of conversion candidates. The CPU 1 obtains the distance between the reference point (Tokyo in this example) and the regional attribute of each conversion candidate using the distance table (see FIG. 21) prepared in advance on the HDD 11 (step S131 to FIG. 18). S133). The distance table of FIG. 21 shows the distance between two regional attributes at the numerical level. The conversion candidates "Misaki Town" have "Ehime" and "Tokyo" as the regional attributes. For the conversion candidate "Cape Town", "Chiba" and "Osaka" are obtained as regional attributes. In addition, “slogan” is obtained as a regional attribute for the conversion candidate “Misaki Town”.

The CPU 1 obtains the distance between the area attribute thus obtained and the reference point. According to the distance table of FIG. 21, for example, a level “10” is obtained for the distance between “Tokyo” and “Ehime”, and “Tokyo (regional attribute of kanji conversion candidate)” and “Tokyo (reference point)” are obtained. A level "0" is obtained for the distance between and.

When the distances between the regional attributes and the reference points for all conversion candidates are obtained in this way, the CPU 1 detects the conversion candidate having the minimum distance. In the case of this example, "Misaki Town" having the level value "0" is determined as the first candidate for kanji conversion and is output for display on the CRT 8 (FIG. 18).
Step S134, see FIGS. 22 and 23). In this way, the first candidate of conversion candidates is determined and output by the series of processing in FIG. 18 (S123 → S12 in FIG. 17).
4).

In the above example, the reference point, that is, the priority area is "Tokyo", but when the reference point is "Shiga",
"Cape Town" was obtained as the first candidate.

In addition to the second embodiment described above, the following example can be obtained.

1) The determination method for determining the first candidate is the place name,
The name recognition of a word such as a building name is determined in relation to the distance. The popularity of a word is represented by the frequency of use, and the above-mentioned distance information is combined, that is, the likelihood as the first candidate is used as a determination criterion. A word having a large “likelihood” = W ₁ × “frequency” −W ₂ × “distance value” is determined. When the weighting factor W ₁ is 1 and the weighting factor W ₂ is 1, and the regional information set in step S113 is “Okayama”, 6 and 4 are “Misaki town” and 2 are “Misaki town” as distance values. And 7, "Misaki Town" gets 1.

Since the frequency of "Misaki-cho" is 2 and the distance is 1, the "likelihood" of "Misaki-cho" is 1, and since the frequency of "Misaki-cho" is 5 and the distance is 2, "likelihood" of "Misaki-cho" Becomes 3, and "Misaki Town" is decided as the first candidate. In this example, as in the conventional case, when the kanji to be converted is determined from the kanji conversion candidates, the frequency of use is counted by the CPU 1, and the counting result is stored in the corresponding kanji part of the kanji dictionary 11B on the HD 11. I'll do it.

2) In this embodiment, the distance between the reference point and the area (place name) indicated by the conversion candidate kanji is acquired using the distance table of FIG. As another method of obtaining the distance, the longitude and latitude of the place name are described in the kanji representing the place name in the kanji dictionary 11B, the reference information is also given by the longitude and latitude, and the distance is obtained from these longitude and latitude.

3) In the present embodiment, an example in which the reading is converted into Kanji has been shown, but this Kanji is notation information for display, printing, etc., and it should include characters such as hiragana and katakana, and kana-kanji mixed characters. Needless to say.

[0058]

As described above, according to the first and fifth aspects of the invention, the reference information is prepared, the degree of association between the reference information and the conversion candidates is examined, and the conversion candidates are ranked according to the degree of association. I do.

According to the second aspect of the present invention, by using the season as the reference information, it is possible to automatically prioritize the Kanji conversion candidates that match the current season.

According to the third aspect of the present invention, the reference information is information indicating an area, for example, information indicating a prefecture, so that a kanji conversion candidate close to the area indicated by the reference information can be automatically prioritized.

According to the invention of claim 4, when a plurality of conversion candidates are located in the same area, the ranking can be performed.

According to the sixth aspect of the invention, it is possible to change the season and area by making the reference information changeable, and it is possible to correspond to the environment of use by the user. This enables ranking based on various criteria without relying on conventional ranking based on frequency of use only. Further, it is possible to obtain an effect that desired ranking can be performed from the start of using the device.

[Brief description of drawings]

FIG. 1 is a block diagram showing a system configuration common to an embodiment of the present invention.

FIG. 2 is a flowchart showing a processing procedure executed by a CPU 1 of FIG.

FIG. 3 is an explanatory diagram showing contents of a conventional Kanji dictionary.

FIG. 4 is an explanatory diagram showing the contents of a Kanji dictionary of the first embodiment.

FIG. 5 is an explanatory diagram showing the contents of determination of Kanji conversion candidates of the first embodiment.

FIG. 6 is an explanatory diagram showing the contents of determination of Kanji conversion candidates of the first embodiment.

FIG. 7 is an explanatory diagram showing the contents of determination of Kanji conversion candidates of the first embodiment.

FIG. 8 is an explanatory diagram showing the contents of determination of Kanji conversion candidates of the first embodiment.

FIG. 9 is an explanatory diagram showing the contents of determination of Kanji conversion candidates of the first embodiment.

FIG. 10 is an explanatory diagram showing the contents of determination of Kanji conversion candidates of the first embodiment.

FIG. 11 is an explanatory diagram showing the contents of determination of Kanji conversion candidates of the first embodiment.

FIG. 12 is an explanatory diagram showing the contents of determination of Kanji conversion candidates of the first embodiment.

FIG. 13 is an explanatory diagram showing other contents of the Kanji dictionary of the first embodiment.

FIG. 14 is an explanatory diagram showing the contents of determination of Kanji conversion candidates of the first embodiment.

FIG. 15 is an explanatory diagram showing the contents of determination of Kanji conversion candidates of the first embodiment.

FIG. 16 is a flowchart showing a processing procedure of the CPU 1 of the second embodiment.

FIG. 17 is a flowchart showing a processing procedure of the CPU 1 of the second embodiment.

FIG. 18 is a flowchart showing a processing procedure of the CPU 1 of the second embodiment.

FIG. 19 is an explanatory diagram showing the contents of a conventional kanji dictionary.

FIG. 20 is an explanatory diagram showing the contents of a Kanji dictionary of the second embodiment.

FIG. 21 is an explanatory diagram showing the contents of a distance table according to the second embodiment.

FIG. 22 is an explanatory diagram showing the contents of determination of Kanji conversion candidates of the second embodiment.

FIG. 23 is an explanatory diagram showing the contents of determination of Kanji conversion candidates of the second embodiment.

[Explanation of symbols]

 1 Central Processing Unit (CPU) 2 ROM 3 RAM 4 External ROM 5 Keyboard Controller (KBC) 6 Keyboard (KB) 8 CRT 11 Hard Disk Storage (HD) 12 Printer (PRT) 13 Timer

Claims (6)

[Claims] 1. A character processing device for converting a reading into a kanji corresponding to the reading, wherein when there are a plurality of homonyms in the conversion result, the plurality of homonyms are candidates for conversion to kanji. In the character processing device for outputting according to the priority order, the first calculation processing means for acquiring the degree of association between the predetermined reference information and each conversion candidate, and the conversion degree of the conversion candidate with the acquired degree of association as the priority. Second ranking
A character processing device comprising: arithmetic processing means. 2. The reference information is seasonal information, and the first arithmetic processing means stores timekeeping means for timing the month and day indicating the season, kanji as reading and conversion results, and seasons related to the kanji. And a Kanji dictionary in which information indicating
2. The character processing device according to claim 1, wherein the arithmetic processing means acquires the degree of association by comparing the season indicated by the timekeeping means with the season obtained from the kanji dictionary. 3. The reference information is information indicating an area,
The character processing device according to claim 1, wherein a distance between an area indicated by a Chinese character converted from reading and an area indicated by the reference information is set as the degree of association. 4. A storage means for storing the frequency of conversion from reading to kanji for each kanji, wherein the first arithmetic processing means regards the frequency as the name recognition of the area,
The character processing device according to claim 3, wherein the degree of association is acquired from the name recognition degree and the distance. 5. A character processing device for converting a reading into a kanji corresponding to the reading, and when there are a plurality of homonyms in the conversion result, the plurality of homonyms are candidates for conversion into kanji. In the kanji conversion method of the character processing device for outputting according to the priority order, the degree of association between the predetermined reference information and each conversion candidate is acquired by the information processing device, and the acquired degree of association is converted as the priority order. A kanji conversion method for a character processing device, characterized in that the information processing device ranks the candidates. 6. The kanji conversion method for a character processing device according to claim 5, wherein the reference information is changeable.