JPH03210627A - Electronic computer - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

[Detailed Description of the Invention] Field of Industrial Application] The present invention provides a method for sorting the same character type as the same character in a character system in which different character codes form the same character type in an electronic computer. Regarding.

[Prior Art] FIG. 6 is a flowchart for converting data into keys for sorting in conventional sorting. First, extract one piece of data 611. Convert that data into a key code using a conversion code table, table, etc., without examining the relationship between the data before and after 62. For all data, there is a one-to-one correspondence between the data before conversion and the key after conversion, such as creating a 1-byte key from 1-byte data, or always creating a 2-byte key from 1-byte data. Convert it to

Then, set the value obtained by the conversion as a key63. Repeat this until the key is completed.

[Problems to be Solved by the Invention] However, in the above-mentioned conventional technology, even if the character type is the same, data with completely different character codes, such as numbers in a 1-byte code and numbers in a 2-byte code, is When sorting, the keys were converted to different keys and could not be converted to the same key code. Therefore, even if it is necessary to treat them as the same character and sort them in the same order, it is impossible to sort them in the same position as desired because the key codes are different. Also, if the long sound symbol is used in hiragana or katakana, for example, "o-kii"
, ``Ookii'', etc., even if you wanted to sort them in the same order, the problem was that the long characters would be converted into keys as minus signs, resulting in them being sorted in completely different orders. Similarly, regarding the voiced sound and semi-voiced sound symbols, "bas" which is made up of two letters, and "ha1su" which is made up of three letters, which is a composite voiced sound character with the ``Ha'' and the voiced sound symbol, are treated as the same data. Even if you wanted to sort the characters, there was a problem that the characters ``haj'' and the voiced sound symbol were converted into keys separately and were sorted in different positions. The purpose of this invention is to provide a means for sorting to the same sort position.

[Means for Solving the Problems] The present invention includes a data input device, a data output device, a data storage device, a means for classifying the input data into the same character type, and converting the data into a new key code. The present invention is characterized by comprising means for sorting based on the new key code, a storage device for the new key code, and a means for sorting based on the new key code.

[Operation] In the present invention, characters of the same character type but with different codes, which exist in both 1-byte code and 2-byte code, are converted into codes of a new code system, and that code is used as a key code. Allows sorting to the same position. Furthermore, in addition to the converted key code, by adding data called weight used for comparison as a key, different key codes converted to the same key code can be
Further ordering becomes possible. In other words, even among the same character types that are converted into the same key code, it is possible to put the 1-byte code first and the 2-byte code last. In addition, data analysis is performed on the long sound symbol, and if it is deemed to be a long sound, instead of converting it to the key as a minus sign, the long sound symbol is replaced with the corresponding vowel, and the vowel is changed to the same vowel, such as "A". ” code to a key code. In this case as well, the order can be determined by adding weight data of another value to distinguish it from the key code converted from the character code of the normal character "a". The same is true for voiced sounds and semi-voiced sounds, and if data analysis indicates that they are codes that form part of a composite character as a voiced sound or semi-dakuon symbol, they will be combined with the previous character and become one piece of data. Therefore, convert the synthesized data into a key code. Also, in this case, you can set a weight of another value and specify the order of composite characters and non-composite characters in order to distinguish them from characters that are converted to the same key code independently without being composited. can.

With this method, it is possible to sort characters that can be recognized as the same character type in the same position, and it is also possible to order the characters even within the same character type.

[Example] Embodiments of the present invention will be described below based on the drawings.

(Embodiment 1) FIG. 1 is a block diagram of the present invention, in which a data storage device 1
3, a storage device 14 for keys created for sorting, a device 11 for inputting data, and a device 12 for outputting sorted data, and further categorizes the input data by the same character type. means 15 for converting data of the same character type into a new code for a sort key, and means 17 for performing sorting.

FIG. 3 is a flow chart of data to key code and weight conversion according to the present invention. 1 byte katakana, 2
A code system is assumed in which three types of katakana exist: katakana, which is a single-byte code half-width character, and katakana, which is a double-byte code and full-width character, and a collection of data records in which these three types of characters are mixed are sorted in alphabetical order. Read the data, divide it into fixed-length or variable-length data records separated by delimiters, and write each data record.
Create a key for the code. First, extract the data in order starting from the beginning of the position specified as the key.
1) Analyzing whether the 1-byte code is Katakana, 2-byte code half-width, or 2-byte code full-width < (32)
After analyzing the type of character, the code is converted into a new code to be used as a key according to the type (33), and the weight is obtained (34).

If you want to sort data in the same character type in the order of 1-byte code, 2-byte full-width, and 2-byte half-width, set the weight used for comparison as a key to the newly converted new code. do. This weight value is determined and set so that it becomes heavier in the order of 1-byte code, 2-byte full-width, and 2-byte half-width. That is, as shown in FIG. 2, data 01 is key-converted to obtain key 01 and weight 01, and these are set at the key position and weight position, respectively.

For example, the key code for the character "A" is set to 01 for both 1-byte and 2-byte characters, and for 1-byte, the weight is determined to be 10.2-byte full-width is 20.2-byte half-width is 30. The key code for the character "A" is 03, and the weight is the same value as for "A". In this way,
Determine the converted key code for all characters from ``A'' to ``N'', and through analysis, convert the data classified into 1-byte or 2-byte full-width etc. into new codes and weights, and use them as keys. shall be. Then, compare those keys and sort them. Let's arrange them in order. The new key and weight after key conversion of these data are the second
Arrange them as shown. In other words, the new key code string obtained from the data is placed in the first half of the key record, and the weights obtained at the same time are arranged in the second half of the key record (35).

For example, if "a" is converted to 01, "i" to 03, and "tsu" to 05, the 1-byte code "1 iu" will be 0.
1.03.05.10.10,10, 2-byte full-width "aiu" is 01.03.05.20.20,20,
2-byte full-width "aaaa" is 01.01.01.20.
It becomes 20.20.

If these key records are compared and arranged in ascending order, the order will be 2-byte full-width "aaa", 1-byte full-width "fuiu", and 2-byte full-width "aiu". In this way, convert it to a key record, compare and sort this key record. As a result, the data records are sorted in ascending order, and the result is output.

(Embodiment 2) Long symbol processing is further added to the above embodiment. Figure 4 shows
It is a flowchart in which long sound symbol processing is added to the above embodiment. Sort the 1-byte code "key", the 2-byte full-width "key", and the 2-byte full-width "key" in descending order. However, the long sound symbol shall come after the letter of the same vowel. Furthermore, if the character strings are of the same character type, the 1-byte code is assumed to come before the 2-byte full-width code. Extract the data 41) and check whether it is a long sound (42). Both the 1-byte code "-" and the 2-byte full-width "-" can be treated as long sound symbols because the preceding character is katakana. Replace it with a vowel as (
43), the vowel of "r ki" is "i", so in both cases, the key code is the converted character string "kii" (4
4), ``r ki'' becomes OCl ``i'' becomes the key code 03, and in addition, if the original data is a long sound, the weight is 15 if it is a 1-byte code, and 25 if it is a 2-byte code full-width. shall be. Then, the key code converted from each data is 1 byte code "key" is 0
C103, 10, 15, 2 byte code full-width "key"
is 0C103, 20, 20, and the 2-byte code full-width "key" is 0C103, 20, 25 (45). By sorting based on this key record, the order after sorting is the 1-byte code "key". ", 2-byte full-width "key", 2-byte full-width "key",
Sorting ends.

(Example 3) In addition to the above-mentioned Example 2, a voiced sound process, a semi-darkened sound process, a synthetic voiceless sound process, and a synthetic semi-voiced sound process are added. FIG. 5 is a flowchart in which the above-mentioned embodiment is added with voiced sound processing, semi-darkened sound processing, synthetic voiceless sound processing, and synthetic semi-voiced sound processing. ”, “<Shira”, “<Shiro”. The key after key conversion of each data is OD for "<", 11 for "shi", and 11 for "shi".
"ra" is 2F, "ro" is 33. Also, the key has three characters. Since "<shiro" is all clear sounds, the key record is OD, 11.33.20.20.20. “<
The ``ji'' in ``jira'' is a voiced sound. In the case of a voiced sound, the key is set to the same value as that of a clear sound, and the weight is set to a value different from that of a clear sound. For a 1-byte code, it is determined as 17. For a 2-byte full-width code, it is 27. For a 2-byte half-width code, it is determined as 37. Extract the data 51) and check whether it is a synthetic voiced sound, a synthesized semi-voiced sound, a single voiced voice, or a single voiced voice (51).
2) After each classification, a weight is obtained (53), a new code is obtained (54), and the key code and weight are set in the key record (55).

Then, the key record for "Kushira" is OD, 11.2
F, 20.27.20. In r<t, 'ra, "shi" is a composite character of the clear sound "shi" and a voiced sound symbol, so the voiced sound symbol is treated as a part of the character that composes "ji" and cannot be used as a key alone. I don't.

Synthetic dakuon characters are separated from individual dakuon characters, and if they are to be sorted after the individual dakuon characters, the weight value should be increased. That is, in the case of a 2-byte full-width synthetic voiced sound, a value larger than 27, for example 28, is used. In such a case, “<S1UJ(7)4-1/:7-Code is
OD, 11.2F, 2o, 28.20. If you arrange the key records of ``＜shiro'', ``kushira'', and ``＜shi'ra'' in ascending order, you will get ``kujira'', ``＜shira'', and ``＜shiro'', which can be arranged in ascending order. . Semi-voiced sounds,
In the case of synthesized semi-voiced sounds, the weight is determined in the same way as for voiced sounds.
Check for single semi-voiced characters and composite semi-voiced characters,
If it can be considered as a semi-voiced sound, perform the respective processing.

The value of the key can be arbitrarily determined by considering the order after sorting. Furthermore, the weights and key codes for 1-byte characters, voiced sounds, long sounds, etc. are not limited to those in the above embodiment, but may be any value as long as they are determined so that they are arranged in the desired order. Further, the position within the data designated as a key and the number of keys to be used as sorting criteria are arbitrary.

[Effect of the Invention 1] According to the present invention described above, even if there is a large amount of data with the same character type and different internal codes, all the data with the same character type can be converted into the same key code. You can now sort them as the same character. In addition, if you want to determine the ordering within the same character type based on the data size of the character, long sound, voiced sound, synthetic voiced sound, etc., determine the weight for each case, and put the weight at the end of the key. Sorting is possible by adding weights and comparing them using the weight values as keys. In addition, by freely determining this weight, it is possible to perform free sorting, such as placing synthetic dakuon before individual dakuon, or sorting long consonant data before vowel data. It has the advantage of being

[Brief explanation of drawings]

FIG. 1 is a block diagram showing the configuration of an electronic computer according to the present invention. FIG. 2 is a diagram showing the structure of a key record. FIG. 3 is a flowchart for converting the same character type with different codes into the same new code. FIG. 4 is a flowchart for converting the same character type including a long sound symbol into a new code. FIG. 5 is a flowchart for converting the same character type including voiced sounds and semi-voiced sounds into new codes. FIG. 6 is a flowchart showing means for creating keys in conventional sorting. 1 2 3 4 5 6 Data input device Data output device Data storage device Key storage device Means for classifying by the same character type Means for converting data into a new key code 7 Means for executing sorting

Claims (1)

[Claims] a data input device, a data output device, a data storage device, means for classifying the input data into the same character type, a means for converting the data into a new key code, and a storage device for the new key code. , means for executing sorting based on the new key code.