JPH1069477A - Character processing method and device therefor - Google Patents

Abstract

PROBLEM TO BE SOLVED: To display the sample or the like of a combinational font with minimum system resource consumption without performing complicated operation by a user by temporarily registering unregistered font data, and displaying registered font data and the unregistered font data in combination. SOLUTION: A CPU 101 performs control over the whole device, arithmetic processing, etc., decides whether or not selected KANA (Japanese syllabary) needs to be registered temporarily or whether it is already incorporated in an ordinary font according to registration information in a KANA data file management table in a RAM 103, and requests and obtains an image of characters needed for a sample display from the system to composite KANA. Here, when the KANA is incorporated in the ordinary font, an image is requested from the ordinary font and when the KANA is temporarily registered, the temporarily registered data are requested. Then the sample is displayed on the basis of the obtained character image and when an end button is pressed, the ordinary font and registered font are composited.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a character processing method and a character processing apparatus in a device or system capable of displaying or printing characters, such as a personal computer, a word processor, a DTP device, and a printer.

[0002]

2. Description of the Related Art In recent years, an operating system and a word processor having a function of supplying a plurality of fonts to a document processing system have appeared, and a WYSIWYG (the same output as the screen appearance can be obtained using a display or a printer). It has become common to create documents in).

[0003] In such a system, it is possible to use different fonts for kanji and kana when creating a document. For example, you can use Gothic type for Kanji and Mincho type for Kana. However, for that purpose, it is necessary to provide a document processing system having a function in which a document creator specifies a font for kanji and kana separately, or a function for automatically switching fonts according to whether it is kanji or kana.

[0004] In addition, when a combination of kanji and kana is displayed, it may be necessary to display a combination of typeface data that has not been registered in the system and typeface data that has been registered. Must be registered using a typeface registration program (Windows (registered trademark of Microsoft Corporation) or a control panel, etc.) attached to.

[0005]

The above prior art has the following drawbacks. It takes much time to specify the font.

When a document is moved, the same output format as that of the source cannot be obtained unless the font used in the document is usable at the destination. Therefore, the font used in the document must be moved at the same time.

[0007] Also, when creating a new typeface by combining an already registered typeface with unregistered typeface data, displaying a sample of the combined typeface (Kanji + Kana, etc.) All must be registered in the system in advance, and it has not been possible to realize this without requiring the user to perform complicated operations. Also, registering the typeface data that is deemed necessary in the system in advance leads to unnecessary consumption of system resources. Furthermore, when unregistered typeface data is encrypted or compressed, obtaining a typeface image requires very complicated operations such as decryption processing and decompression processing.

[0008]

SUMMARY OF THE INVENTION The present invention has been made to solve the above-mentioned problem, and obtains an image of a typeface file having typeface data of a specific portion which is not registered in the apparatus. It is an object of the present invention to display a sample of combined fonts and the like with minimal system resource consumption without causing the user to perform complicated operations.

As means for solving the above-mentioned problems, the following arrangement is provided.

In the case of realizing a multi-font environment in which a plurality of types of fonts can be combined and used as one font, an instruction is given to combine and display unregistered typeface data and registered typeface data. Instruction control means, registration control means for temporarily registering unregistered typeface data on the apparatus, and display control means for displaying a combination of registered typeface data and unregistered typeface data based on the instruction. It is characterized by having done.

A multi-font environment in which a plurality of fonts can be combined and used as a single font is realized. A read control means for reading arbitrary character data from a plurality of font data, Selection control means for selecting whether or not to read character data from character data; determination control means for determining whether a character to be read is an undefined pattern when reading character data from the font data selected by the selection means; and the determination control means. Reading control means for controlling whether or not to change the font data to be read based on the determination by

In the case of realizing a multi-font environment in which a plurality of types of fonts can be combined and used as one font, an instruction is given to combine and display unregistered typeface data and registered typeface data. An instruction control step, a registration control step of temporarily registering unregistered typeface data on the device, and a display control step of combining and displaying registered typeface data and unregistered typeface data based on the instruction. It is characterized by having done.

In a multi-font environment in which a plurality of fonts can be combined and used as one font, a read control step of reading arbitrary character data from a plurality of font data, A selection control step of selecting whether to read out character data from the font data, a determination control step of determining whether a character to be read is an undefined pattern when reading character data from the font data selected by the selection control step, A read control step of controlling whether or not to change the typeface data to be read based on the determination in the step.

[0014]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, the present invention will be described in detail with reference to the drawings.

Before describing an embodiment of the present invention in detail, a basic flow until a program is executed will be described below with reference to FIG.

FIG. 1 is a block diagram showing a basic configuration for operating the present system. In FIG. 1, reference numeral 101 denotes a CPU, that is, a central processing unit, which controls the entire apparatus, performs arithmetic processing, and the like. Reference numeral 102 denotes a ROM, a read-only memory, which is a storage area for a system startup program, character pattern data, and the like. The character pattern is usually used as a system font and used for displaying a menu or the like. The system font is ROM
The typeface data (such as a 16-dot bitmap font Mincho) on the file 102 or a typeface specified by the user in advance may be used. 103 is a RAM, that is, a random access memory. It is a data area with no usage restriction, and is an area where each program and data represented by the flowcharts described below are loaded and executed for various processes. A KBC or keyboard control unit 104 receives key input data from the KB or keyboard 105 and transmits the data to the CPU 101. Reference numeral 106 denotes a CRT, that is, a display device, which receives data from the CRTC 106 and displays the data. Reference numeral 109 denotes an external storage device such as an FD or a floppy disk device or an HD or a hard disk device, which stores programs and data, and refers to or loads them into the RAM as needed at the time of execution. 110 is a PRTC, that is, a printer control unit;
1 is a PRT, that is, a printer device. Reference numeral 112 denotes a system bus, which should serve as a data path between the above-described components. The program shown in the flowchart described later is stored in the RAM 103 or the hard disk 1 described above.
4 is supplied to the work station shown in FIG. 1 through an external memory such as a CD-ROM or the like in which a part of the font information and the program are stored, and is stored in the hard disk 14 or the RAM 10.
3 is stored. Alternatively, the data may be read from the storage unit of the supply source instead of the CD-ROM, and supplied from a remote place via a line.

(Detailed Description of Embodiment 1) First, before describing the present invention in detail, a combined typeface will be described. Here, the registered kanji represents a normal typeface data file having data of all characters, and the unregistered kana represents a typeface data file having only typeface data of a kana portion.

FIG. 2 shows an example in which registered kanji and unregistered kana are combined. A) shows an example in which all characters are displayed in a registered typeface (Mincho style). B) shows an example in which only the kanji portion is displayed in a registered typeface (Mincho type). C) shows an example in which only the kana portion is displayed in an unregistered kana typeface. D) is an example in which B) and C) are combined, and is a sample in which this occurs when a registered typeface is combined with an unregistered kana.

Here, an example of a combination of kanji and kana is used for convenience. However, there is no particular limitation on this combination. Combinations are possible and the invention is applicable to all of them.

Next, the file structure of typeface data will be described with reference to FIG. Here, for convenience, the description will be made using a normal typeface data file and a kana data file. However, it goes without saying that a file having a part of character data does not have to be a kana.

A is a simplified representation of the structure of a normal typeface data file. Normal typeface data includes half-width alphabet typeface data, symbol typeface data,
Kana typeface data, kanji typeface data (some cases do not include the second level), etc.
It has enough data to display all characters. B simply represents the structure of a kana data file that is usually incorporated into a typeface. The kana data file has only the typeface data of the kana portion, and has no other character data. The kana data file may be encrypted so that it cannot be used as it is, or the same format as a normal typeface may be used without encryption.

Hereinafter, a detailed description will be given by using normal typeface and kana data as a target to be combined.

Next, referring to FIG. 4, a general example of an operation for allowing a user to specify a combination of normal typeface and kana data will be described. Here, it represents a scene that specifies the combination in a program that combines normal typeface and kana data, and as shown in the figure, a dialog box of a window system may be used,
Any device that can realize the interface as shown in the figure may be used. Is a list box representing a list of kana data that can be incorporated into a normal typeface (here, Mincho) in which kana is specified in some way. The user can select arbitrary kana data from these. What is displayed in the list may be the font name or the file name of the kana data, and may be anything as long as the data can be determined.
In the part, a combination sample of kana data selected with a normal typeface is displayed.

Next, the flow until the screen of FIG. 4 is displayed and the flow of processing when displaying the combination sample will be described in detail with reference to FIG.

In step S501, a normal typeface incorporating kana data is determined by some method. For the determination method, a typeface name, a file name, or other information may be used, and the method is not particularly described. Here, for convenience, the font name and the file name are used, and the information as shown in FIG.
03.

Next, in S502 and S503, it is checked whether or not there are kana data files that can be referred to in the environment in which this program is operating, and a loop process is performed for the number of existing kana data files. A kana data file management table is created on the RAM 103, and the information is embedded. In S504, the information of the kana data file already incorporated in the normal typeface selected in S501 is extracted, and the information is added to the kana data file management table shown in FIG. In S505, based on the information in the kana data file management table of FIG. 7,
Information that can determine a kana data file is listed in the list of FIG. The information to be listed may be a typeface name, a file name, or other information. S506
Then, the user selects a kana in the list by the operation of the user. In S507, information about the kana selected in S506 is obtained from the kana data file management table in FIG. In S508, it is determined whether or not a previously temporarily registered kana data file exists in the system based on the temporary registration information in FIG. S if there is a temporary registration
The process proceeds to 509, and if not, the process proceeds to S510. S
At 509, based on the contents of the temporary registration information table of FIG.
Delete the temporarily registered kana data file from the system. The temporary registration information table shown in FIG. 8 has information on kana names and file names for convenience, but if it holds information capable of deleting a temporarily registered kana data file from the system, Often, the type of information is not specified. For example, it is an address. Also, it is a method of deleting the temporary registration typeface,
It only needs to be able to be deleted from the system, and there is no particular mention on the method. In S510, it is determined whether the kana selected in S506 requires temporary registration or is already incorporated in a normal font based on the registration information in the kana data file management table. If it is already incorporated in the normal typeface, it is possible to obtain an image of the kana by accessing the normal typeface, and there is no need to perform temporary registration.
Proceed to 12. In S511, the selected kana is temporarily registered in the system, and an image of the kana is made available. No particular mention is made of how to register typefaces to the system. It is also assumed that all information necessary for font registration in the system is included in the kana data file management table in FIG. If the information is insufficient depending on the system, the kana data file management table in FIG. The temporarily registered information is set in the temporary registration information table in FIG. In S512, the system requests and obtains an image of a character required for sample display. Here, in the case of kana incorporated in a normal typeface, an image is requested for the normal typeface, and in the case of temporary registration, data of the temporarily registered kana is requested. In S513, a sample is displayed in the area of FIG. 4 based on the character image acquired in S512. S514
Then, an inquiry is made as to whether or not to end the combination selection processing. If the processing is not to be ended, the flow proceeds to S506, and if the end button in FIG. 4 is pressed, the flow proceeds to S515. S51
In S5, the normal typeface selected in S501 and the kana selected in S506 are combined, and the process ends. The procedure for synthesizing typefaces will be described in detail with reference to FIG.

A procedure for synthesizing a plurality of font files to create a new font file will be described with reference to the flowchart of FIG.

In step S1301, an original file, a pseudonym file, and a new file are opened so that data can be read or written in the subsequent processing. Here, the original file is the original font file, and here, JIS X 0208
It is assumed that character data of all characters defined in is stored. A kana file is a file containing kana character data to be replaced, and stores any number of kana character data. The new file is a font file to be created, in which the pseudonym part of the original file is replaced with the pseudonym in the pseudonym file. The file is usually stored in 102 ROM or 109 HD. In step S1302, the code range of the kana character is obtained. Here, for simplicity, if it is limited to hiragana, for example, in JIS X 0208, 242
1 to 2473. As a method of obtaining the code range of the kana character, the code range may be stored in the original file or the kana file in advance. In step S1303, one kana character code is obtained. Step S1302
It is assumed that the codes of the kana characters obtained in are obtained in ascending order. In step S1304, it is determined whether or not the character data of the character code obtained in S1303 exists in the kana file. If there is, go to S1305; if not, S130
Proceed to 7. Here, it is assumed that the character data is stored in a format generally called outline data in which the shape of the character is represented by an outline composed of straight lines and curves. Step S
In 1305, the kana file is used to execute step S130.
The character data of the code obtained in step 3 is obtained. Step S130
In step S6, it is determined whether the character data obtained in step S1305 is blank.
If not, go to step S1308. In step S1307, the character data of the code obtained in step S1303 is obtained from the original file. Step S13
In 08, the kana character data obtained in S1305 or S1307 is added to the new file. Step S130
In step 9, it is determined whether there is any character code that has not been processed. If there is, the process proceeds to step S1303, and if not, the process proceeds to step S1310. In step S1310, non-kana characters are acquired from the original file and added to the new file. Assuming that the kana character code obtained in step S1303 is a hexadecimal code from 2421 to 2473, all the characters other than those defined in JIS X 0208 are added to the new file. Step S13
In step 11, all files opened in step S1301 are closed. As a result, the processing performed in this flowchart is reflected in the new file, and 103RA
M or 109HD.

In this embodiment, an example is described in which outline data is stored in a font. However, the present invention can be modified to process a font that stores bitmap data instead of outline data. Also,
Although the replacement range was limited to kana characters, the present invention has been changed so that all characters defined in the original file are checked for replaceability and only replaceable characters are replaced without limiting the range. It is possible to In addition, although an example of replacing a kana character has been described, the present invention can change a replacement target to a special character, a numeral, a Roman character, a Greek character, a Russian character, a Chinese character, a ruled line fragment, or the like. In addition, JIS X0 is used as the character code.
Although the example using the C.208 is described, the present invention
It can be changed to encode in S, EUC, Unicode, or the like.

[Other Embodiments] (Detailed Description of Embodiment 2) This embodiment shows an example in which a file to be incorporated is encrypted in addition to Embodiment 1. In this example, the description will be made assuming that the kana data file is encrypted. As a matter of course, the description will be made using a kana data file as an example for convenience, but it goes without saying that the type of the data file does not have to be a kana.

Next, the flow until the screen of FIG. 4 is displayed and the flow of the processing for displaying the combination sample will be described in detail with reference to FIG.

In step S901, a normal typeface incorporating kana data is determined by some method. For the determination method, a typeface name, a file name, or other information may be used, and the method is not particularly described. Here, for convenience, the font name and the file name are used, and the information as shown in FIG.
03.

Next, in steps S902 and S903, it is checked whether there are kana data files that can be referred to in the environment in which this program is operating, and loop processing is performed for the number of kana data files that exist. A kana encrypted data file management table is created on the RAM 103 and the information is embedded. At this time, it is checked whether the kana data file has been encrypted, and information about the encryption is set. In step S904, the information of the kana data file already incorporated in the normal typeface selected in step S901 is extracted, and the information is added to the kana encrypted data file management table shown in FIG. S90
5 lists information for determining the kana data file in the list of FIG. 4 based on the information of the kana encrypted data file management table of FIG. The information to be listed may be a typeface name, a file name, or other information. In step S906, the user is caused to select a kana in the list. In S907, information about the kana selected in S906 is obtained from the kana encrypted data file management table in FIG. In step S908, it is determined whether or not the previously temporarily registered kana data file exists in the system.
Is determined based on the temporary registration information. If a temporarily registered item exists, the process advances to step S909; otherwise, the process advances to step S910. In step S909, the temporarily registered kana data file is deleted from the system from the contents of the temporary registration information table in FIG. Further, based on the information in the Kana encrypted data file management table of FIG. 10, the encryption processing is performed on the originally encrypted file. No particular provisions are made regarding the encryption method. The temporary registration information table shown in FIG. 8 has information on kana names and file names for convenience, but if it holds information capable of deleting a temporarily registered kana data file from the system, Often, the type of information is not specified. The method of deleting the temporarily registered typeface is not particularly limited as long as it can be deleted from the system. In S910, S906
Whether the kana selected in the above requires temporary registration or is already included in normal typeface,
The determination is made based on the registration information in the kana encryption data file management table. If it is already incorporated in the normal typeface, it is possible to acquire an image of the kana by accessing the normal typeface, and the process proceeds to S914 because there is no need to perform temporary registration. In S911, it is determined whether or not the kana selected in S906 is encrypted by referring to the kana encrypted data file management table in FIG. If it is encrypted, the process proceeds to S912, and if it is not encrypted, the process proceeds to S913. In step S912, a decryption process for the encrypted kana data file is performed. Note that a method relating to encryption and decryption is not specified. S
In step 913, the selected kana is temporarily registered in the system, and an image of the kana is obtained. No particular mention is made of how to register typefaces to the system. It is also assumed that all information necessary for typeface registration in the system is included in the kana encrypted data file management table in FIG. If the information is insufficient depending on the system, the kana encrypted data file management table in FIG. The temporarily registered information is set in the temporary registration information table in FIG. In step S915, the system requests and obtains an image of a character required for sample display. Here, in the case of kana incorporated in a normal typeface, an image is requested for the normal typeface, and in the case of temporary registration, data of the temporarily registered kana is requested. In S915, a sample is displayed in the area of FIG. 4 based on the character image acquired in S913. S916
Then, it is inquired whether or not to terminate the combination selection processing. If the processing is not to be terminated, the process proceeds to S906, and if the end button in FIG. 4 is pressed, the processing is terminated.

(Detailed Description of Embodiment 3) In this embodiment,
An example in which a file to be embedded is compressed in addition to the second embodiment will be described. In this example, the description will be made assuming that the kana data file is compressed. As a matter of course, the description will be made using a kana data file as an example for convenience, but it goes without saying that the type of the data file does not have to be a kana.

Next, the flow until the screen of FIG. 4 is displayed and the flow of processing for displaying the combined sample will be described in detail with reference to FIG.

In step S1101, a normal typeface incorporating kana data is determined by some method. For the determination method, a typeface name, a file name, or other information may be used, and the method is not particularly described. Here, the font name and the file name are used for convenience, and the information as shown in FIG.
103.

Next, in S1102 and S1103, it is checked whether or not there are kana data files that can be referred to in the environment in which this program is operating, and loop processing is performed for the number of existing kana data files. Show Kana encrypted compressed data file management table in RAM
103 and embed the information. At this time, it is checked whether the kana data file is encrypted or compressed, and information about encryption compression is set. In S1104, the information of the kana data file already incorporated in the normal typeface selected in S1101 is extracted, and the information is added to the kana encrypted data table management table shown in FIG. In S1105, FIG.
Based on the information in the 2 kana encrypted data file management table, information that can determine the kana data file is listed in the list of FIG. The information to be listed may be a typeface name, a file name, or other information. S
In step 1106, a kana in the list is selected by a user operation. In S1107, information about the kana selected in S1106 is obtained from the kana-encrypted compressed data file management table in FIG. In S1208,
It is determined whether or not a previously registered kana data file exists in the system based on the temporary registration information in FIG. If a temporarily registered item exists, the process advances to step S1109; otherwise, the process advances to step S1110. In S1109, the temporarily registered kana data file is deleted from the system from the contents of the temporary registration information table of FIG. Further, based on the information in the kana-encrypted compressed data file management table of FIG. 12, the encryption processing is performed on the originally encrypted file, and the compression processing is performed on the originally compressed file. There are no particular restrictions on encryption and compression processing. The temporary registration information table shown in FIG. 8 has information on kana names and file names for convenience, but if it holds information capable of deleting a temporarily registered kana data file from the system, Often, the type of information is not specified. The method of deleting the temporarily registered typeface is not particularly limited as long as it can be deleted from the system. In S1110, it is determined whether the kana selected in S1106 requires temporary registration or is already incorporated in a normal typeface based on the registration information in the kana encrypted data file management table.
If it is already incorporated in the normal typeface, it is possible to obtain an image of the kana by accessing the normal typeface, and there is no need to perform temporary registration.
Proceed to 6. In step S1111, based on the information in the kana encrypted data file management table in FIG.
At 1106, it is determined whether or not the selected kana is compressed. If the result of the determination is that the data is compressed, S
Proceed to 1112, and if not compressed, S11
Proceed to 13. In S1112, a decompression process of the selected kana file is performed. The method of decompressing the file is not specified. In S1113, it is determined whether or not the kana selected in S1106 is encrypted by referring to the kana-encrypted data file management table in FIG. If it is encrypted, the process proceeds to S1114, and if it is not encrypted, the process proceeds to S1115. In S1114, a decryption process of the encrypted kana data file is performed.
Note that a method relating to encryption and decryption is not specified.
In step S1115, the selected kana is temporarily registered in the system, and an image of the kana is obtained. No particular mention is made of how to register typefaces to the system. Further, it is assumed that all information necessary for typeface registration in the system is included in the kana-encrypted data management table shown in FIG. When the information is insufficient depending on the system, the kana-encrypted data management table in FIG. The information of the temporary registration is stored in the RAM 103
8 is set in the temporary registration information table shown in FIG. S111
In step 6, a character image required for sample display is requested from the system and acquired. Here, in the case of kana incorporated in a normal typeface, an image is requested for the normal typeface, and in the case of temporary registration, data of the temporarily registered kana is requested. In S1117, a sample is displayed in the area of FIG. 4 based on the character image acquired in S1116. In step S1118, an inquiry is made as to whether or not to end the combination selection process.
Then, if the end button in FIG. 4 has been pressed, the process ends.

[0038]

According to the present invention, a typeface that has already been registered,
When creating a new typeface by combining unregistered typeface data, etc., automatically delete and register a typeface file with a specific part of typeface data that has not been registered in the device as necessary. By doing so, it is possible to obtain an image of a font file having font data of a specific portion, and it is possible to display a sample of a combined font.

Further, according to the present invention, the number of fonts required to maintain the appearance of a document is reduced, the trouble of specifying a font at the time of creating a document is reduced, and character missing in a character pattern in a font is prevented. It becomes possible.

[Brief description of the drawings]

FIG. 1 is a diagram showing a basic configuration.

FIG. 2 is a diagram illustrating an example of a combination typeface.

FIG. 3 is a diagram illustrating a structure of a typeface file.

FIG. 4 is a diagram illustrating an operation example of designating a combination of a normal typeface and a kana;

FIG. 5 is a diagram illustrating a flow of a process according to the first embodiment.

FIG. 6 is a diagram illustrating a normal typeface information table;

FIG. 7 is a diagram illustrating a kana data file management table.

FIG. 8 is a diagram showing a temporary registration information table.

FIG. 9 is a diagram illustrating a flow of a process according to a second embodiment.

FIG. 10 is a diagram illustrating a kana encrypted data file management table.

FIG. 11 is a diagram illustrating a flow of a process according to a third embodiment.

FIG. 12 is a diagram illustrating a kana encrypted data file management table.

FIG. 13 is a diagram illustrating a flow of a synthesis procedure of a normal typeface and a kana.

──────────────────────────────────────────────────続 き Continuation of the front page (51) Int.Cl. ⁶ Identification number Agency reference number FI Technical display location G06T 1/00 G06F 15/20 562P 15/66 450

Claims (16)

[Claims] 1. A case of realizing a multi-font environment in which a plurality of fonts can be combined and used as one font, wherein unregistered typeface data and registered typeface data are displayed in combination. Instruction control means for instructing, registration control means for temporarily registering unregistered font data on the device, display control means for displaying a combination of registered font data and unregistered font data based on the instruction, A character processing device comprising: 2. The unregistered typeface data is encrypted, and decrypts the encrypted unregistered typeface data based on an instruction from the instruction control means to temporarily register the type in the device. 2. The character processing apparatus according to claim 1, wherein by performing the display, the registered typeface data and unregistered typeface data are combined and displayed. 3. The unregistered typeface data is compressed, and the compressed unregistered typeface data is decompressed and temporarily registered in an apparatus based on an instruction from the instruction control means. The character processing apparatus according to claim 1, wherein the registered typeface data and unregistered typeface data are displayed in combination. 4. A multi-font environment in which a plurality of types of fonts can be combined and used as one font is realized, wherein read control means for reading arbitrary character data from a plurality of typeface data, Selection control means for selecting whether to read character data from the font data, when reading character data from the font data selected by the selection means, determination control means for determining whether a character to be read is an undefined pattern or not. A reading control unit that controls whether or not to change the font data to be read based on the determination by the unit. 5. The method according to claim 4, wherein, when reading character data from the font data selected by the selection unit, if the character to be read is determined to be an undefined pattern, the font data to be read is changed. Character processor. 6. When character data is read from the font data selected by the selection means, if the character to be read is determined to be an undefined pattern, the character data is read from the other font data. Claim 5
3. The character processing device according to 1. 7. The character processing device according to claim 5, wherein the undefined character pattern is a blank character. 8. A case of realizing a multi-font environment in which a plurality of types of fonts can be combined and used as one font, wherein unregistered typeface data and registered typeface data are displayed in combination. An instruction control step of instructing, a registration control step of temporarily registering unregistered typeface data on the device, a display control step of displaying a combination of registered typeface data and unregistered typeface data based on the instruction, A character processing method comprising: 9. The unregistered typeface data is encrypted, and the encrypted unregistered typeface data is decrypted and temporarily registered in the device based on an instruction from the instruction control step. 9. The character processing method according to claim 8, wherein by performing the display, the registered typeface data and unregistered typeface data are combined and displayed. 10. The unregistered typeface data is compressed, and the compressed unregistered typeface data is decompressed and temporarily registered in a device based on an instruction from the instruction control step. 9. The character processing method according to claim 8, wherein the registered typeface data and the unregistered typeface data are displayed in combination. 11. A multi-font environment in which a plurality of fonts can be combined and used as a single font. A read control step of reading arbitrary character data from a plurality of typeface data. A selection control step of selecting whether to read character data from the font data; a determination control step of determining whether a character to be read is an undefined pattern when reading character data from the font data selected by the selection control step; A read control step of controlling whether to change the font data to be read based on the determination by the determination control step. 12. The method according to claim 11, wherein when reading character data from the font data selected in the selection control step, if the character to be read is determined to be an undefined pattern, the font data to be read is changed. The character processing method described. 13. When reading character data from the font data selected by the selection control step, if the character to be read is determined to be an undefined pattern, character data is read from the other font data. 13. The character processing method according to claim 12, wherein: 14. The character processing device according to claim 12, wherein the undefined character pattern is a blank character. 15. A case of realizing a multi-font environment in which a plurality of types of fonts can be combined and used as one font, wherein unregistered typeface data and registered typeface data are displayed in combination. An instruction control step of instructing, a registration control step of temporarily registering unregistered typeface data on the device, and a display control step of combining and displaying registered typeface data and unregistered typeface data based on the instruction. A storage medium storing a computer-readable program characterized by storing the program. 16. A multi-font environment in which a plurality of types of fonts can be combined and used as one font. A read control step of reading arbitrary character data from a plurality of typeface data. A selection control step of selecting whether to read character data from the font data; a determination control step of determining whether a character to be read is an undefined pattern when reading character data from the font data selected by the selection control step; And a read control step of controlling whether to change the font data to be read based on the determination by the determination control step.