JP3017095B2 - External character registration management method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an external character registration management system in a Japanese system for controlling a computer having an external character registration function.

[0002]

2. Description of the Related Art Conventionally, this type of external character registration management system is used for searching for a registered character pattern in a short time and easily. It is used to eliminate unnecessary access and reduce time loss.

One example of a conventional external character registration management system is described in Japanese Patent Application Laid-Open Nos. 60-27926 and 4-330557.

In the external character registration management system described in Japanese Patent Application Laid-Open No. Hei 4-330557, a simpler external character dictionary is required, especially because of the large number of external characters registered at the time of local government resident registration. 1 shows a computer system configured to be able to use standard characters according to a standard and registered external characters. The system includes a dictionary file for storing external character readings, punctuation codes, data relating to similar standard characters, a means for inputting the data into the dictionary file, and a search result obtained by searching data in the dictionary file. And a means for converting the external character to the similar standard character if desired. The registered external character can be easily searched by reading or the like, and if necessary, the standard character similar to the external character can be obtained. And supplying the data to an external system.

The external character registration management system described in Japanese Patent Application Laid-Open No. 60-27926 discloses a comparatively simple logic which takes into account the frequency of use of a registered character pattern.
Eliminate unnecessary access to the main unit with external character pattern requests,
An object of the present invention is to provide an external character management method for a terminal device that reduces a time loss, has an external character memory in which an external character code and an external character pattern corresponding to the code are stored, and requests an external character pattern issued to the main body. In the terminal device which sends out the corresponding pattern and manages the deletion order of the external character pattern and updates the contents of the external character memory to obtain a desired registration pattern, the registration number of the external character pattern to be deleted is set next. The register and the external character pattern having the highest erasure order are indicated by a special code, a chain memory in which registration numbers are set in order of frequency for erasure, and a position where the special code is stored by referring to the chain memory. Search and change the content to the registration number of the currently used external character pattern, and at the same time correspond to the changed number A means for updating the contents of the chain memory to a special code, and performing the maintenance of the deletion order by the above means each time a registered external character pattern is used, and a useless character pattern request requiring access to the main body. And that time loss can be reduced. In this way, every time a registered external character pattern is used, the deletion order is maintained so that the external character pattern is positioned at the bottom of the deletion order.

[0006]

However, there is a problem that the search processing time for a frequently used external character pattern and the search processing time for an infrequently used external character pattern are constant. The reason is that the conventional external character registration management system does not consider the frequency of use at all.

SUMMARY OF THE INVENTION It is an object of the present invention to provide an external character registration management system capable of retrieving a frequently used external character pattern at high speed.

[0008]

According to the external character registration management method of the present invention, when an external character code is found, an external character registration management list in which a search order is chained is searched.

The method for registering and managing external characters according to the present invention is a method for registering and managing external characters in a Japanese system for controlling a computer having an external character registration function. When a code is found, a search is started from the head list of the chain information in the external character registration management list, and when the character code is not detected, the search is sequentially performed according to the chain information, and the search is performed when a tail list is reached. The external character code in the middle is replaced with the last list and registered as the head list of the chain information. When the external character code is detected, the external character code is registered in the head list of the chain information.

According to the present invention, in a method for managing and registering an external character in a Japanese system for controlling a computer having an external character registration function, an external character registration management list including chain information is stored in a storage means, and an external character is registered based on input data. When a code is found, the external character code is compared with the external character code in the head list of the chain information in the external character registration management list, and when the external character code is not detected, the external character code is sequentially compared according to the chain information, and the last character is compared. When the list is reached, the external character code being searched is registered in the last list as the head list of the chain information, and when the external character code is detected, the external character code is extracted from the list of the chain information, and the external character code is extracted from the chain information list. It is characterized by being registered as a head list. Further, in this external character registration management method, the chain information includes a preceding list pointer and a following list pointer.

More specifically, there is provided a means for starting with comparison of the most recently used external character registration management list with an external character registration management list, and a pointer to the end of the external character registration management list when the external character codes do not match. Means to move the search target to the registered list and, if the external character code matches, means to update the pointer to the back and the pointer to the front of the external character registration list, and as a result of the search, If not, there is a means for updating the pointer to the back of the external character registration list, the pointer to the front, and the external character code. Means for starting the comparison of the external character code from the most recently used external character makes it easier to find a frequently used external character code.

When the external character codes do not match, the means for moving the search target to the list pointed to by the pointer after the external character registration management list is to move the search target from the frequently used external character code to the low external code. I can go.

When the external character codes match, the means for updating the pointer to the back and the pointer to the front of the external character registration list can create a chain that can be searched from the frequently used external character codes to the low external character codes.

If the external character codes do not match up to the end as a result of the search, the means for updating the pointer to the back of the external character registration list, the pointer to the front of the external character registration list, and the external character codes deletes the least frequently used external character codes. An external character code that has not been registered can be newly registered.

[0015]

BEST MODE FOR CARRYING OUT THE INVENTION

[First Embodiment] Next, an embodiment of the present invention will be described in detail with reference to the drawings. FIG. 1 shows a configuration of a computer system according to the present embodiment, wherein 1 is a display device such as a CRT, 2 is an input device such as a keyboard and a mouse, and 3
Reference numeral denotes a printer for printing out, and reference numeral 4 denotes a main control device having a function of processing standard characters conforming to, for example, JIS standards and a function of registering and processing external characters, which are constituted by a CPU or the like.
Reference numeral 5 denotes storage means such as a ROM and a RAM for storing frequently used data and application programs, etc., and reference numeral 6 denotes a hard disk, a floppy disk, and a magnetic disk such as a magneto-optical disk for storing an external character dictionary file or a kanji dictionary. It is. The main controller 4 may include an external character dictionary management unit that manages an external character dictionary file. The external character dictionary file constitutes a registered external character dictionary. Making (Kana), Kuten code, Similar JIS code, Similar JIS
A data record composed of kanji, registered external characters, and the like is stored.

FIG. 2 is a diagram showing the external character registration management list 105 of this embodiment and a memory area used for searching.
The external character registration management list 105 includes a front pointer area 101 for storing a forward pointer for one external character,
Back pointer area 102 for storing a backward pointer
And the external character code area 1 for storing the external character code
.., 1042,...
.. 104n are provided for a fixed number of external characters. Also, 1
Reference numeral 06 denotes an external character code input from the input device, and may be a specific code indicating a characteristic point in the external character code area 103. The external character code area 103 stores data records including, for example, record numbers, readings, kana characters, punctuation codes, similar JIS codes, similar JIS kanji, registered external characters, and the like. Also,
Each of the code-based management lists 1041, 1042,... 104n has a paired relationship with each of the external characters in the external character registration management list 105.
The external character dictionary may be managed by the external character dictionary management unit or may be included in the external character registration management list 105 and managed. The external character registration management list 105 may be stored in a magnetic disk such as a hard disk or a floppy disk or an external storage device in the computer system. preferable.

The chain information of another external character is written in the front pointer area 101 and the rear pointer area 102 to form a chain structure. Further, a head pointer area 100 for storing a pointer for starting comparison first is also provided.

Next, the operation of the embodiment of the present invention will be described.
This will be described in detail with reference to FIG. When an external character code is found from the character code input from the input device 2 (A1), the external character code of the code-specific management list 1041, 1042,... (A2), step A
3, if the two external character codes match, the front pointer area 101, the rear pointer area 102, and the
Previous pointer area 1 of code-specific management list 104 pointed to by
01 and the previous pointer area 101 of the code-specific management list 104 pointed to by the first pointer area 100 are rewritten and updated (A6). If the external character codes do not match in step A3, it is checked whether or not the code-based management list 104 is the last list (A4). If it is the last list, the front pointer area 101, the rear pointer area 102, the external character code area 103, and the rear pointer area 10 of the code-based management list 104 pointed to by the front pointer area 101 of the code-based management list 104 currently pointed to.
2 and a code-based management list 10 pointing to the start pointer
4 to rewrite and update the previous pointer area 101 (A
7, A8). If it is not the last list in step A4, the control moves to the code-based management list 104 pointed to by the point area 102 after the code-based management list 104 currently pointed, and manages the external character code in the last direction. Compare with the external character of list 104 (A5).

[Specific Embodiment] Next, an example showing a specific operation of the present embodiment will be described in detail with reference to FIG. At present, as shown in FIG. 4A, the code-based management list 104 is set to “1” and the external character registration management list 105
"NULL" in the front pointer area 101, "2" in the rear pointer area 102, and the external character code area 103
"7422" in the first pointer area 100
"1" is registered. Further, “1” to “100” are registered in the code-specific management list 104. First, when the external character code “7435” is found from the character code input from the input device 2, the first pointer area 1
A comparison is made with the external character code area 103 “7422” which is “1” in the code-specific management list 104 indicated by 00. Here, since they do not match, the pointer is moved to the code-based management list 104 “2” pointed to by the rear pointer area 102 and compared with the external character code area 103 “7423” of the code-based management list 104. This operation is repeated, but it does not match up to the last code-based management list 104 (when the rear pointer area 102 is “NULL” indicating the last code), so it is necessary to newly register it. in this case,
The current pointer “10” pointed by the code-specific management list 104
Code pointer management list 104 pointed by the previous pointer area 101 pointed to “0” 101
Is written with the last code "NULL". Based on this last code “NULL”, it is determined that the pointer is the last pointer of the code-specific management list 104 that can be searched.

Further, in the external character code area 103 of the code-based management list 104 pointed to by the current pointer, the external character code “7435” is stored in the external character code area 103, “NULL” indicating the first code in the previous pointer area 101, and the rear pointer area 1.
2 by writing “1” indicating the head pointer code and “100” indicated by the head pointer area 100 indicating the 100th of the code-based management list 104.
The external character registration management list 105 shown in FIG. With this operation, the external character code “7455” is newly registered, and the external character code is searched first when the next external character code is found. That is, in this state, if the external character code “7435” is found again from the input character code, the search starts from the 100th in the code-specific management list 104, and the external character code “7435” in the external character code area 103. Is found first, and the search ends.

Next, when the external character code “7423” is found from the input character code, it is compared with “7435” of the external character code area 103 of the code-specific management list 104 pointed to by the first pointer area 100. . Here, since they do not match, the pointer is moved to the code-based management list 104 “1” pointed to by the subsequent pointer area 102 and is compared with “7422” in the external character code area 103 of the code-based management list 104. When this operation is repeated one more time, the external character code “7435” becomes “742” in the external character code area 103 of the code-specific management list 104 “2”.
3 ". In this case as well, the storage area storing the external character code" 7423 "can be found quickly.
As shown in FIG. 4C, “NULL” is written in the front pointer area 101 of the code-based management list 104 pointed to by the found current pointer “2”, and the external character code “ 7423, the number "100" of the code-based management list 104 for which the search was started was written, and the code-based management list 10 for which the search was started first.
Pointer area 101 before “100” of pointer 4
List 104 by code retrieved from "NULL"
After rewriting the pointer "2" of the pointer "2" of the retrieved code-based management list 104 to the pointer "2", the content of the pointer area 102 of the retrieved pointer "102" of the pointer "2" of the retrieved code-based management list 104 is rewritten. The pointer "3" indicating the pointer "3" next to the pointer "3" after the pointer "3" is rewritten to "3" indicating the pointer "3" located next to the pointer "2" in the searched management list 104 by code.
From "1" to "1". In this way, the head code “NULL” is written in the front pointer area 101 and the head pointer code “100” is written in the rear pointer area 102 of the code-specific management list 104 currently pointed to, and “100” of the head pointer area 100 is pointed to. “2” is written in the previous pointer area 101 of the code-specific management list 104, and the current pointer code “2” is written in the head pointer area 100. As a result, the external character registration management list 105 shown in FIG. By this operation, the external character code "7423" is searched first when the next external character is found, and then the external character code "7435" found immediately before is searched.

[Second Embodiment] A second embodiment of the present invention will be described with reference to the drawings. The hardware configuration according to the present embodiment is the same as that of the first embodiment, and a description thereof will be omitted. An object of the invention according to the present embodiment is to enable a user to easily manage the registration status of an external character in a Japanese-language processing system that controls a device having an external character registration function, and to search for a frequently used external character at high speed.

That is, in order to store information on external characters registered in the computer system, a list-structured structure (external character registration management list) is created, and the use order chain information is incorporated. When checking whether the external character code has been registered in the system among the input character codes and data, a procedure is provided for searching the most recently used character according to the chain information.

FIG. 5 is a flowchart showing a procedure for registering and retrieving the external character code. When an external character code is found in the data (A11), the external character dictionary management unit 4a checks the external character registration management list 105 to check whether the target external character pattern is registered in the external character storage unit of the external character dictionary file 5 in the system. (A13) is searched for the external character code of
At this time, the comparison is started from the leading list, that is, from the most recently used external character code (A12). If the external character code registered in the external character registration management list 105 does not match the external character code to be searched (A13), the search target is moved to the list pointed to by the pointer after the external character registration management list 105. (A15). The search proceeds one after another, and even if the search ends at the last management list (A1
4) If the target external character code has not been registered, it is newly registered, and the external character code recorded in the last list is deleted and replaced with the target external character code (A17). Insert before list (A1
8). If the target external character code is registered in the external character registration management list 105 (A13), the list is extracted (A16) and inserted before the head list (A18).
In this way, the latest external character code is registered in the top list,
When the search for the external character code is started, it is first determined whether or not the external character code matches.

Next, the flow of the above-mentioned flowchart will be specifically described. The contents are the same as those in FIG. For example, suppose that the character code is registered as shown in FIG. 4A and the external character code “7435” is found in the input character code and data (A11). From list 1 pointed to by the first pointer, search is performed by following pointers “2” to “100” to the last list 100 (A12 → A1).
3 → A14 → A15), since the external character codes do not match, the external character codes of the list 100 are changed from “74A3” to “7”.
435 "(A17), and the chain information of the last list 100, the preceding list 99 and the first list 1 is rewritten as shown in FIG. 4 (B).
The newly registered list 100 becomes the top list (A1
8).

Next, it is assumed that an external character code "7423" is found in the input character code and data (A1).
1). From the list 100 pointed to by the head pointer,
When the pointers to the rear are traced to list 1 and list 2 (A12 → A13 → A14 → A15), since the external character codes match, the list before and after list 2 (list 1) as shown in FIG. And the chain information of the list 3), and the top list 100 and the list 2 are rewritten. This extracts list 2 (A16) and inserts it at the beginning (A
18) has been implemented.

By repeating the above operations, frequently used external characters are always near the top, and on the other hand, infrequently used external characters move backward, thereby improving the efficiency of retrieval. Further, since the registered external character codes are managed in a list, the processing is not complicated and is easy to understand.

In the present embodiment, the code-based management list 104
Are simply described as a list n, but are substantially the same, and the list is logically paired with the external character registration management list 105, but is physically a different recording medium. Is also good.

[0029]

According to the present invention, in particular, an external character registration management list is provided, a search order is chained, and when a new external character code is found, the chain code of the external character code is arranged at the top. However, since the external character code chain code is also updated at the same time, the frequently used external character codes are always located in the higher search order, and the less frequently used external character codes are located in the lower search order. It is. As a result, the external character search efficiency is improved.

[Brief description of the drawings]

FIG. 1 is a configuration block diagram of a computer system according to the present invention.

FIG. 2 is an external character registration management list of the present invention.

FIG. 3 is a flowchart of an external character registration management system of the present invention.

FIG. 4 is an external character registration management list according to an embodiment of the present invention.

FIG. 5 is a flowchart of another external character registration management system according to the present invention.

[Explanation of symbols]

 REFERENCE SIGNS LIST 1 display device 2 input device 3 printing device 4 main control device 5 high-speed memory 6 magnetic disk 100 start pointer area 101 front pointer area 102 rear pointer area 103 external character code area 104 code management list 105 external character registration management list

──────────────────────────────────────────────────続 き Continuation of the front page (56) References JP-A-57-103535 (JP, A) JP-A-6-130933 (JP, A) (58) Fields investigated (Int. Cl. ⁷ , DB name) G06F 17/21-17/28

Claims (3)

(57) [Claims] 1. A method for registering and managing an external character in a Japanese system for controlling a computer having an external character registration function, wherein an external character registration management list including chain information is stored in storage means, and an external character code is found from input data. In the case, the search for the external character code is started from the head list of the chain information in the external character registration management list, and the search is performed.
If you do not detect the external character codes by chords external character codes in the search when reached sequentially searched last list in accordance with the chain information by replacing the tail list registered as the first list of the chain information, the external character A method for managing and registering an external character, wherein when the code is detected, the external character code is registered in a leading list of the chain information. 2. A external character in the external character registration management method of Japanese system for controlling a computer system having a registration function, external character registration management list stored in the storage means, external character code of the search object from the input data including chain information If found, the registration of the first list of the chain information of the external character code of the search objects the external character registration management list
The comparison starts from the external character code that has been set. If the external character code for the search purpose is not detected, the comparison is performed sequentially according to the chain information.
A target external character code is registered as a head list of the chain information in the last list, and when the external character code of the search purpose is detected, the registered external character code is extracted from the chain information list and the head of the chain information is extracted. An external character registration management method characterized by registering as a list. 3. The external character registration management method according to claim 1 or 2, the external character registration management method characterized by including a list pointers to and after the list pointer to before the chain information.