WO2005064494A1

WO2005064494A1 - Character processing execution program and recording medium

Info

Publication number: WO2005064494A1
Application number: PCT/JP2004/019445
Authority: WO
Inventors: Haruhiko Yoshimeki; Takashi Igarashi
Original assignee: Konica Minolta Photo Imaging, Inc.
Priority date: 2003-12-25
Filing date: 2004-12-17
Publication date: 2005-07-14

Abstract

A program causes a computer to execute a method for processing characters C1, C2 assigned by arbitrary character codes CD and constituting an encoded character set. There is provided a database DB containing attribute information D2, D4, D6, D7, D8 for judging the attribute of each of the characters, which attribute information are correlated to the character codes CD in advance. The program causes the computer to wait for input of a character code for selecting a plurality of characters from the encoded character set whose attribute is stored in the database DB, read from the database DB, the attribute information on the plurality of characters selected by the input of the character code, judge the attributes of the characters according to the attribute information read in, and decide the sequence order of the characters according to the judgment result.

Description

Statement character processing method,

Character processing execution program and recording medium

The present invention relates to a character processing method suitable for character search processing and sorting processing by an information processing device such as a computer, a program for causing a computer to execute the method, and a computer-readable recording recording the program. About media. Background art

Conventionally, character processing in an information processing device such as a computer is performed based on a code number assigned to a glyph (glyph). The code number is a JIS kanji code. A character code (encoded character set) standardized by a public standard such as JIS X 0208: 1997) is used.

In the character code standardized by the official standard, characters necessary for accurately describing a person's name, a place name, and the like are lacking. Such characters are synonymous with the so-called common kanji included in the JIS kanji code, but there are a number of kanji whose character forms are not common but have a variant relationship (hereinafter referred to as variant characters). Is added as an external character to the user-defined area (free area) that is not used by the specified character code.

It is easy to detect differences between such a large number of variants, and multiple An information processing method has been developed that can improve the character processing efficiency of computers and the like by reducing the time required to select external characters from body characters (see Japanese Patent Application No. 2003-155787).

In a computer in which multiple variants are installed by the information processing method described in the above-mentioned gazette,-a member as shown in Fig. 8 (a) using conventional table creation software and database construction software, etc. Name, reading of this member name When performing sort processing on character information with data delimiters such as Spread 'Sheet P11 that lists kana and member number, as shown in Fig. 8 (b) In addition, the sort range IP was selected and the sort method was specified.

As a sorting method, for example, if “Sound-reading” is specified as the highest priority key to determine the sort order (array order) and “Member number” is specified as the second key, as shown in Fig. 9 (a) As a result, L11 is displayed as a result of sorting the member names whose readings are "Otahashi" in order of the member number. With this sorting method, the kanji notation of the member name is not regular, and the list display P12 is not unified.

Also, for example, if you specify “reading aloud” as the highest priority key and “letter code” as the second key, as shown in Fig. 9 (b), the member name whose reading aloud is “OK” will be displayed as the character code L 1 2 is displayed as a result of sorting based on. Even in this sorting method, the kanji notation of the member name is irregular and the list is displayed as P 13.

In general, in a sorting process based on a character code, a JIS first-level kanji code or a JIS second-level kanji code, which is a character code standardized by a public standard, is referred to. The JIS Level 1 Kanji code is a set of coded Kanji that is composed by adding character codes in the order of reading aloud to common kanji. An encoded kanji set composed of kanji with character codes assigned in the order of the number of strokes according to radicals.

Although there is an opportunity (review) once every five years for the JIS standard, there is almost no increase in the number of characters in the JIS first and second level Kanji codes. For this reason, variant characters (related characters) added as external characters in the free space of the JIS first and second level kanji codes do not maintain the regularity for determining the sort order. Therefore, when a character code is specified as a key for the sorting process, as shown in Fig. 9 (b), a plurality of member names including kanji related to variant characters are displayed in an irregularly sorted manner. Therefore, there was a problem that it was not possible to sort and display the character sequences with high significance. Disclosure of the invention

The present invention solves this problem, and provides a character processing method capable of rearranging a plurality of characters in a highly significant arrangement order determined without depending on a character code, and a method for causing a computer to execute the method. It is an object of the present invention to provide a program and a computer-readable recording medium on which the program is recorded.

In order to solve the above problem, a first character processing method according to the present invention is a method for processing a character which is provided with an arbitrary character code and constitutes a coded character set, wherein a plurality of characters are Attribute information for identifying the attribute to be provided and the character code are stored in association with each other, and a plurality of characters are selected from a coded character set in which the attribute information is stored. Attribute information is read for a plurality of characters selected by input, and the attributes of each of the plurality of characters are determined based on the read attribute information. Determine the sequence order.

A second character processing method according to the present invention is a method for processing a character that is provided with an arbitrary character code and that constitutes an encoded character set, and includes an attribute for determining an attribute of each of a plurality of characters. Information and the character code are stored in association with each other, and the input of the character code for selecting a character from the coded character set in which the attribute information is stored is waited for, and the attribute information regarding the character selected by inputting the character code is waited for. Is read, the attribute of this character is determined based on the attribute information read in here, a character common to the determined attribute and the attribute is searched, and the character common to the searched attribute is assigned to the character searched here. Character codes are output.

A program for causing a computer to execute the first character processing method according to the present invention includes an attribute provided in each of a plurality of characters for processing a character to which an arbitrary character code is added and which constitutes an encoded character set. A database is provided in which attribute information and character codes are stored in a manner corresponding to each other in advance, and a character code for selecting a plurality of characters from a coded character set in which attribute information is stored in this database is awaited. Attribute information is read from the database for a plurality of characters selected by inputting the character code, and the attributes of the plurality of characters are determined based on the read attribute information. The arrangement order is determined for characters.

A program for causing a computer to execute the second character processing method according to the present invention includes an attribute provided in each of a plurality of characters for processing a character which is provided with an arbitrary character code and forms an encoded character set. A database is provided in which attribute information and character codes are stored in association with each other in order to determine the character code. Waiting for input of a character code for selecting a character from a coded character set in which the attribute information is stored in this database, The attribute information for the character selected by inputting the character code is read from the database, the attribute of the character is determined based on the attribute information read here, and the character common to the determined attribute and the attribute is stored in the database. And outputs the character code assigned to the searched attribute common character.

According to a computer-readable recording medium on which a program for causing a computer to execute the first character processing method according to the present invention is provided, the computer can execute the first character processing method according to the present invention. The program is recorded on a computer-readable recording medium. Therefore, when a computer is used to process characters constituting an encoded character set with an arbitrary character code, a plurality of characters are arranged in an arrangement order determined based on attribute information without depending on the character code. Since it is possible to change the order, it is possible to avoid an unnecessary change in the order of arrangement due to the addition of a new character to the character set. Brief Description of Drawings

FIG. 1 is a diagram showing a configuration example of a database provided in a program according to the present invention.

FIG. 2 is a diagram showing an example of a character arrangement before sorting.

FIG. 3 is a diagram showing an example of a character arrangement based on attribute information by the first program according to the present invention.

FIG. 4 is a diagram showing an example of sorting based on variant character information by the first program according to the present invention.

FIG. 5 is a flowchart showing a first example of character processing according to the present invention.

FIG. 6 shows a display example of the attribute common character list by the second program according to the present invention. FIG.

FIG. 7 is a flowchart showing a second example of character processing according to the present invention.

FIG. 8 (a) is a diagram for explaining a conventional sorting example, and is a diagram showing an example of character information having a data break.

FIG. 8 (b) is a diagram for explaining a conventional sorting example, and is a diagram showing a sorting range selection example.

FIG. 9 (a) is a diagram for explaining a conventional sorting example, and is a diagram showing an example of sorting by member number.

FIG. 9 (b) is a diagram for explaining a conventional sorting example, and is a diagram showing a sorting example using character codes. BEST MODE FOR CARRYING OUT THE INVENTION

Hereinafter, the best mode for implementing a character processing method according to the present invention, a program for causing a computer to execute the method, and a computer-readable recording medium storing the program will be described with reference to the accompanying drawings. I do.

[1] First Embodiment

A program for causing a computer to execute the first character processing method according to the first embodiment includes a plurality of characters for processing a character to which an arbitrary character code is added to form an encoded character set by the computer. A database is provided in which attribute information for identifying the attributes of each character and a character code are stored in advance in correspondence with each other, and based on the attribute information stored in the database, the attributes of each of the plurality of characters are determined. The arrangement order is determined for these multiple characters according to the result. As a result, the array determined based on the attribute information without depending on the character code It is possible to sort multiple characters in order. .

In the present embodiment, in order to cause a computer to execute the first character processing method, the above-described program is recorded in a computer-readable recording medium in advance. The computer-readable recording medium includes a magnetic recording medium such as a hard disk (HD), an optical recording medium such as a compact disk (CD), and an electronic recording medium such as a semiconductor memory. By installing the above program, this program is saved (stored) in a hard disk drive (HDD) built in this computer. This allows the computer to execute the first character processing method according to the present invention.

FIG. 1 is a diagram showing a configuration example of a database DB provided in a program for causing a computer to execute a first character processing method according to the present invention. This database DB includes a character code CD assigned to a plurality of characters C constituting an arbitrary coded character set, and attribute information D for determining an attribute of each of the plurality of characters. Attribute information D is output in response to a request without depending on the application that refers to the database DB.

Here, the attribute information D is, for example, a radical information D 1 for determining a radical C 11 of the kanji C 1 as an attribute included in the kanji (character) “Lotus” C 1, and a kanji C Element information D 2 for discriminating the elements C 1 2 and C 1 3 of 1, the part other than the radical C 11 of this kanji C 1, that is, the total number of strokes of the elements C 1 2 and C 13 Information on the number of strokes in the radical D3, variant information D4 to determine the kanji C2 that is in a variant relationship with this kanji C1, and total stroke information to determine the total number of strokes in this kanji C1 D5, the actual name information D6 to determine the actual use of this kanji C1 It is composed of place name result information D7 for determining the use result of the kanji C1 in the place name, and regional result information D8 for determining the use result of the kanji C1 in each region. As described above, the database DB includes, as attribute information D, character component information (element information) D2 for determining the component (element) of this kanji C1, variant character information D4, and personal name result information D 6, and the actual name information D 7 and the local result information D 8 are stored (stored) in correspondence with the character code “4F 7B” previously assigned to the kanji C 1. The element information D 2 does not merely determine the element but also includes variant information and related information of the element.

In the person name result information D 6 and the place name result information D 7, for example, “1” is stored as a use result of a person or a place name, and “0” is stored as a use result of no character as a use result of each character. That is, if the kanji C1 is used as a personal name, the database DB stores the character code “4F7B” of the kanji C1 in association with the actual name information “1”, and stores the kanji. When C1 is used as a place name character, the character code “4 F 7 B” of this kanji C 1 and the place name actual information “1” are stored in association with each other. Of course, if this kanji C1 is not used for personal name and place name characters, the character code “4F7B” of this kanji C1 and the actual name information “0” and the actual place name information “0” And save it.

In the regional performance information D8, prefectures are adopted as regional units, and the number of prefectures that have been used is stored as regional performance information D8. For example, if Kanji C1 has been used as a family name or place name in 47 prefectures, the database DB will use the kanji C1 character code `` 4F7B '' and regional performance information `` 47 '' And save them.

Therefore, applications such as Kana-Kanji conversion system and table creation software When the character code “4F7B” is selected to select the vague character “Lotus” C1 via the sort processing engine provided by the application, the attribute information corresponding to this character code “4F7B” D can be output from the database DB to the sorting engine. Therefore, the sort processing engine or the like reads the attribute information D output from the database DB, and can determine the attribute included in the kanji “Lotus” C1 based on the attribute information D.

The sort processing engine, etc. is, specifically, an attribute included in the kanji “Lotus” C1. It is a radical C1 1 force S “canopy”, and the elements C1 2, C1 3 force S “Nosurai” And `` car '', the number of strokes in the radical is `` 9 '', the character is in a variant relationship with the kanji C2 assigned the character code `` 5G6A '', the total number of strokes is `` 1 2 '', It can be determined from the attribute information D that there is a place name record and the regional record is “47” prefectures. In a database DB configured in this way, many kanji (characters) with multiple variants are stored in advance, and as a method of arranging these kanji, radical information D 1 is specified as the highest priority key. If you specify the number of strokes information D 3 in the second key and the total number of strokes information D 5 in the third key, for example, a plurality of kanji whose radical is `` canopy '' is shown in Fig. 2. Are arranged as follows.

In this character array example, variant characters E2 to E8 of kanji E1, variant character F2 of kanji F1, variant character G2 of kanji G1, and variant characters HI to H3 of kanji "Waka" are adjacent. It is difficult to find a variant relationship between these kanji characters because they are not arranged in a sequence.

On the other hand, as a method of arranging these kanji, the radical information D 1 is specified as the highest priority key, the radical stroke number information D 3 is specified as the second key, and the variant character information D 4 is specified as the third key. Is inserted, and the total number of strokes information D5 is specified as the fourth key, the plurality of kanji whose radical is "canopy" are sorted as shown in FIG. In the example of the character arrangement based on the attribute information D, the variant character relationship of a plurality of kanji is determined based on the variant character information D4, and the arrangement order is determined for the plurality of kanji according to the determination result. Therefore, variants E2 to E8 of kanji E1, variants F2 of kanji F1, variants G2 of kanji G1, and variants HI to H3 of Kanji `` Waka '' are adjacently arranged. As a result, it is easy to find a variant relationship between these kanji.

In this character arrangement example, as the arrangement order (sort order), the radical information D1 is specified as the highest priority key, the radical stroke number information D3 is specified as the second key, and the variant key is specified as the third key. In the example described above, character information D4 was specified and total stroke count information D5 was specified as the fourth key.As a sort order, for example, radical information D1 was specified as the highest priority key and the second key was specified. Specify the element information D 2 for the key, the radical key information D 3 for the third key, the variant character information D 4 for the fourth key, and the total stroke information D 5 for the fifth key. By specifying, it is possible to reflect the heterogeneity relationship between the elements that compose multiple kanji characters in the sort order, so that many kanji characters are arranged in a more significant sequence in the variant character order (related character order). Can be sorted. Thus, for example, it is possible to add a function of extracting a plurality of vague characters having a variant and a related relationship from a large number of kanji and creating a new dictionary to the kanji database. This is extremely effective for database management.

When the character arrangement method based on the attribute information D is applied to the character information P11 having the above-described data delimiter, the input device such as a keyboard connected to a computer has the highest priority as a sorting method. If the key is set to "on-reading" and the second key is specified for variant character information D4, as shown in Fig. 4, the member name whose on-reading is "Okuhashi" contains kanji related to variant characters. An array L that is in contact with each member's name. The unified member list P1 can be displayed.

Therefore, regularity can be given to the kanji notation of the member name, and a highly significant character sorting order can be obtained. This method of arranging characters is convenient and useful for sorting lists and managing kanji databases.

Next, as an embodiment of the first character processing method according to the present invention, an example of character processing by a program including the database DB will be described with reference to a flowchart shown in FIG.

In this character processing example, when processing characters forming an encoded character set given an arbitrary character code, the attribute information D and the character code CD for discriminating the attributes of a plurality of characters are provided. Are stored in the database DB in advance, and it is assumed that a program provided with the database DB is installed on a computer. This program is started as a part of the Kana-Kanji conversion system, etc., for causing a computer to execute character processing with software for table creation, etc., and causes the computer to execute character processing according to the flowchart shown in FIG. Shall be assumed.

Under this assumption, when the table creation software or the like is started by the computer, character processing by the computer is started, and in step S1 of the flowchart shown in FIG. 5, the computer stores the attribute information D in the database DB. Waiting for the input of a character code CD for selecting a plurality of characters from the encoded character set, and when the sorting range IP is selected in the member list P11, it is determined that the character code is CD input and the process proceeds to step S2.

In step S2, the character code CD of the selected sorting range IP is copied to the work file and input, and in step S3, it is determined whether or not the sorting method is specified. here, As a sorting method, for example, when “sound reading” is specified as the highest priority key and “variant” is specified as the second key, the process proceeds to step S4 to refer to the database DB. In the next step S5, the attribute information D corresponding to the specified key "variant character", i.e., the variant character information D4, for a plurality of characters selected by the character code CD transcribed in the work file is stored in the database DB. Read from.

In step S6, based on the read variant character information D4, a variant character relationship is determined as an attribute of each of a plurality of characters, and the arrangement order is determined in step S7 according to the determination result. Then, in step S8, the characters are rearranged (sorted) so that the variant characters are adjacent to each other according to the arrangement order, and arranged in step S9. In step S9, the member list is reflected by reflecting the arrangement result L1. Display the list P1.

As described above, according to the first character processing method according to the present invention, the database DB in which the character code CD and the sort order value serving as the reference for determining the arrangement order are stored as independent separate information is referred to. This database DB executes input / output, update, search, etc. of character code CD and centrally manages attribute information D. Therefore, even if new characters are added to this database DB, Regularity can be maintained. .

In the above-described example of character processing, variant character information D 4 is used as attribute information D.For example, by specifying regional performance information D 8 as attribute information D, required characters for each region, such as for each prefecture, etc. (Kanji) can be easily extracted. For this reason, it is possible to create a coded character set composed of kanji required for each region, and to provide a compact dictionary with a limited number of characters so that code points can be saved.

Thus, the first character processing method according to the present invention, According to a program to be executed by a computer and a computer-readable recording medium on which the program is recorded, a plurality of characters can be rearranged in an arrangement order determined based on attribute information without depending on a character code. Therefore, it is possible to avoid an unnecessary change in the arrangement order due to the addition of a new character to the encoded character set.

Therefore, the regularity of the arrangement order based on this attribute information can be maintained, and character processing can be performed so that a plurality of characters are rearranged without impairing the significance of the arrangement order. It is possible to quickly extract a desired character from a plurality of characters and easily generate a new encoded character set.

The type and the order of the attribute information specified as the sort order are not particularly limited, and the attribute information can be arbitrarily selected and changed according to the purpose of sorting the plurality of characters. The following pattern can be realized. '

As the sort order, for example, the radical information D 1 is specified as the highest priority key, the element information D 2 is specified as the second key, the radical stroke number information D 3 is specified as the third key, and the fourth By specifying the variant character information D4 for the key and the total stroke count information D5 for the fifth key, multiple kanji characters are arranged in order to reflect the variant relationship (association relationship) between character components. Since multiple kanji can be arranged in the order of variant characters (order of related characters) with higher significance, the desired variant characters can be extracted more efficiently.

[2] Second embodiment

A program for causing a computer to execute the second character processing method according to the second embodiment is provided with an arbitrary character code to constitute an encoded character set. In order to process characters by computer, a database is provided in which attribute information for identifying attributes of a plurality of characters and character codes are stored in advance in correspondence with each other, and determination is performed based on the attribute information stored in the database. Outputs the character code assigned to the character that is common to the attribute and attribute of the given character. Thus, the input character and the character having the common attribute can be arranged.

In the present embodiment, in order to cause the computer to execute the second character processing method, the above-described program is pre-recorded on a computer-readable recording medium, and is installed in the computer. Save this program on the HDD etc. This allows the computer to execute the second character processing method according to the present invention as in the first embodiment described above.

The database included in the program according to the second embodiment can be configured in the same manner as the database DB included in the program according to the first embodiment. Therefore, detailed description of the database DB will be omitted.

The program according to the second embodiment is started as a partial program such as a kana-kanji conversion system for character processing. For example, an application such as a kanji “ren” C 1 character code “4F7B” I kana-kanji conversion system When input via the, this program determines the variant C2 of kanji C1 as a character with common attributes and outputs the character code "5G6A" of this variant C2 from the database DB. Can be done.

Therefore, the variant character C2 having the same attribute and high selection probability as the input kanji C1 can be preferentially displayed side by side with the kanji C1 as a conversion candidate character. Select the desired kanji from among multiple variants that are difficult to select It can be easily found and converted to kanji.

A program for causing a computer to execute the second character processing method is installed on the computer, and character input is performed from a keyboard or the like connected to the computer. When re-conversion is requested, the kana-kanji conversion system refers to the database DB stored on the HDD and reads the character code CD and the attribute information D corresponding to the kanji “side” in advance. Based on the attribute information D read here, the attribute of the kanji “side” is determined, and characters common to this attribute and the genre “I” are searched and displayed in a list.

In this way, in the kana-kanji conversion system that displays conversion candidate characters with reference to the database DB, the variant character information D 4 is read as the attribute information D by designating in advance that the conversion candidate characters are to be displayed with priority on the variant characters. For example, if re-conversion is requested for the kanji “side”, the display is switched to the attribute common character list display screen P2 as shown in FIG.

The attribute common character list display screen P2 includes a representative character “side” Ml selected by inputting a character code CD from the keyboard, a character M2 having the same attribute as the representative character “side” Ml, Buttons B1 to B5 for selecting an arrangement method of the character M2 having the common attribute, a "Convert" button B6 for converting the character M2 having the common attribute, and a common attribute having a smaller number of strokes A button B7 for displaying characters, a button B8 for displaying characters having a greater number of strokes and a common attribute, and a check box B9 for selecting a desired character from the characters M2 having the same attribute. And are displayed.

In the attribute common character list display screen P2, when the element information D2 is selected by the "element" button B1 as an arrangement method of the attribute common character M2, the arrangement of the attribute common character M2 becomes The variant information (related information) of the element in the letter Sorted to reflect. When the variant character information D4 is selected by the "variant character" button B2, similarly, the arrangement of the characters M2 having the common attribute is sorted so as to reflect the variant character relationship between these characters.

In the attribute common character list display screen P2, when the person name result information D6 is selected with the "person name result" button B3, the character having the person name use result is displayed preferentially from the attribute common character M2. Is done. Similarly, by selecting the place name result information D 7 or the region result information D 8 using the “Place name result” button B 4 or “Region result” button B 5, the place name use result or the region use is similarly selected from the characters M 2 with the common attribute. Proven characters will be displayed preferentially.

Therefore, at the time of character input, conversion candidate characters can be called and displayed in a list according to the attribute of the character to be input. Therefore, even when a plurality of similar variants exist for the input character, A conversion candidate character having a high selection probability can be displayed preferentially. Therefore, the character input efficiency can be improved.

Next, as an embodiment of the second character processing method according to the present invention, a second example of character processing by this program will be described with reference to the flowchart shown in FIG.

In this second example of character processing, when processing a character which is provided with an arbitrary character code and constitutes a coded character set, attribute information D and a character code CD for discriminating attributes of a plurality of characters are provided. It is assumed that these are stored in a database DB in a manner corresponding to each other in advance, and that a program provided with this database DB is installed on a computer. This program is activated to cause a computer to execute character processing in a kana-kanji conversion system or the like, and causes the computer to execute character processing according to a flowchart shown in FIG. Under this assumption, when an application that uses the Kana-Kanji conversion system for character processing is started, character processing by a computer is started. In step S10 of the flowchart shown in FIG. 7, this computer has an attribute in the database DB. Waits for the input of a character code CD for selecting a character from the coded character set in which the information D is stored. When the character code CD is input from the keyboard, the flow advances to step S11 to refer to the database DB.

In the next step S12, the attribute information D is read from the database DB for the character "side" Ml selected by inputting the character code CD, and based on the attribute information D read here, the step S1 is executed. In step 3, the attribute of the character "edge" Ml is determined.

In step S 14, the character M 2 that is common to the attribute determined here is searched in the database DB, and in step S 15, the character M 2 that is searched for is assigned to the character M 2 that is common to the attribute Output character code CD from database DB.

In step S16, the kana-kanji conversion system displays the attribute-common character M2 as in an attribute-common character list display screen P2 based on the character code CD output from the database DB. At this time, by calling the flowchart shown in FIG. 5 and inputting the character code output from the database DB and executing the processing of steps S1 to S9, the character M2 having the common attribute can be regularly formed. Display array and exit.

As described above, according to the program for causing the computer to execute the second character processing method according to the present embodiment, the input character and the character having the common attribute can be arranged, so that the arrangement having high significance is achieved. Multiple characters can be arranged in order. Therefore, a character that has the same attribute and high selection probability as this character has priority as a selection candidate character. Can be easily displayed in a short time. Further, even when a new character is added to the encoded character set, the character can be processed while maintaining the regularity of the selection candidate character display. Therefore, a desired character can be quickly extracted and a new encoded character set can be easily generated.

In the present embodiment, the character input using the kana-kanji conversion system has been described as an example. However, according to the second character processing method according to the present invention, an OCR (Optical) capable of converting an image into a character string (text) is used. 'Character Reader: Optical character reader. It can be applied to software etc. With this OCR, for example, when reading personal name information such as a business card, it is possible to preferentially display a list of variant characters having a personal name record as conversion candidate characters for characters that could not be determined by the OCR. The efficiency of character string conversion in OCR can be improved.

The embodiments of the present invention and the effects thereof have been described above in detail. However, the present invention is not limited to the configurations of the first and second embodiments, and the claims attached to the present specification are not limited thereto. Any configuration that can achieve the functions of the configuration of the above-described embodiment can be applied without departing from the application range of the present invention defined by the scope. Industrial applicability

INDUSTRIAL APPLICABILITY The present invention is very suitably applied to character search processing and sort processing by an information processing device such as a computer.

According to the present invention, a plurality of characters can be rearranged in an arrangement order determined based on attribute information without depending on a character code. Unnecessary changes in the order of the array due to the addition of characters can be avoided.

Therefore, the regularity of the arrangement order based on the attribute information can be maintained, and character processing can be performed so as to rearrange a plurality of characters without impairing the significance of the arrangement order. For this reason, a desired character can be quickly extracted from a plurality of rearranged characters, and a new character set can be easily generated.

In addition, since the input character and the character having the common attribute can be arranged, a plurality of characters can be arranged in a highly meaningful arrangement order. Therefore, a character having a high selection probability and having the same attribute as the character can be preferentially displayed as a selection candidate character, so that a desired character can be easily found in a short time. Also, even when a new character is added to this encoded character set, the character can be processed while maintaining the regularity of the selection candidate character display. Therefore, a desired character can be quickly extracted and a new encoded character set can be easily generated.

Claims

The scope of the claims

1. A method for processing characters constituting an encoded character set to which an arbitrary character code is assigned,

Attribute information provided for each of the plurality of characters and the character code are stored in association with each other,

Waiting for input of a character code for selecting a plurality of the characters from the encoded character set in which the attribute information is stored,

Reading the attribute information for the plurality of characters selected by inputting the character code;

The attribute of each of the plurality of characters is determined based on the read attribute information, and according to the determination result! /, A character processing method for determining an arrangement order for a plurality of the characters.

2. A method for processing a character which is provided with an arbitrary character code and constitutes an encoded character set,

Waiting for input of a character code for selecting the character from the coded character set in which the attribute information is stored,

Reading the attribute information for the character selected by inputting the character code;

Determining the attribute of the character based on the read attribute information;

Search for characters common to the attribute and the determined attribute, A character processing method for outputting a character code assigned to the searched character common to the attributes.

3. In order to process characters that are given an arbitrary character code and constitute an encoded character set,

A database in which attribute information of each of the plurality of characters and the character codes are stored in advance in correspondence with each other;

Waiting for input of a character code for selecting a plurality of the aforementioned characters from the encoded character set in which the attribute information is stored in the database,

Reading the attribute information from the database for the plurality of characters selected by inputting the character code,

A program for causing a computer to execute a character processing method of determining an attribute included in each of a plurality of characters based on the read attribute information and determining an arrangement order for the plurality of characters according to the determination result.

4. The program according to claim 3, wherein the database stores character component information as the attribute information.

5. The program according to claim 3, wherein the database stores variant character information as the attribute information.

6. The program according to claim 3, wherein the database stores personal name performance information as the attribute information.

7. The program according to claim 3, wherein the database stores place name performance information as the attribute information.

8. The program according to claim 3, wherein the database stores regional performance information as the attribute information.

9. In order to process characters that are given an arbitrary character code and constitute an encoded character set,

Waiting for input of a character code for selecting the character from the coded character set in which the attribute information is stored in the database,

Reading the attribute information from the database for the character selected by inputting the character code;

A program for causing a computer to execute a character processing method of searching the database for characters having the same attribute as the determined attribute and having a common attribute, and outputting a character code assigned to the searched character having the common attribute.

10. The program according to claim 9, wherein the database stores character component information as the attribute information.

11. The program according to claim 9, wherein the database stores variant character information as the attribute information.

12. The program according to claim 9, wherein the database stores personal name performance information as the attribute information.

13. The program according to claim 9, wherein the database stores place name result information as the attribute information. 14. The program according to claim 9, wherein the database stores regional performance information as the attribute information.

15. A computer-readable recording medium on which the program according to claim 3 is recorded.

16. The recording medium according to claim 15, wherein the database stores character component information as the attribute information.

17. The recording medium according to claim 15, wherein the database stores variant character information as the attribute information.

18. The recording medium according to claim 15, wherein said database stores personal name performance information as said attribute information. 18.

19. The recording medium according to claim 15, wherein the database stores place name performance information as the attribute information. 20. The recording medium according to claim 15, wherein said database stores regional performance information as said attribute information.

21. A computer-readable recording medium on which the program according to claim 9 is recorded.

22. The recording medium according to claim 21, wherein said database stores character component information as said attribute information.

23. The recording medium according to claim 21, wherein said database stores variant character information as said attribute information.

24. The recording medium according to claim 21, wherein said database stores personal name performance information as said attribute information. 25. The recording medium according to claim 21, wherein said database stores place name performance information as said attribute information.

2 6. The database stores regional performance information as the attribute information. 21. The recording medium according to item 21.