JPH10198693A - Device and method for address book management - Google Patents

Abstract

PROBLEM TO BE SOLVED: To make it possible to retrieve a zip code from an inputted address and to check the inputted address and its zip code by executing dictionary retrieval in an available range even when the zip code does not completely coincide with the contents of a zip code dictionary. SOLUTION: The management device has a zip code dictionary 28 for storing two different sorts of zip codes having the previously determined numbers of digits and address information corresponding to the zip codes. When corresponding address information can not be obtained at the time of retrieving the dictionary 28 based on the address information of inputted address book data, a zip code retrieving processing part 24 extracts address information coincident with a part of the corresponding address information as a retrieved candidate and stores the extracted candidate in a candidate list storing memory 29. Retrieved candidates stored in the memory 29 are displayed on a display 25 and a user can select required address information out of the displayed candidates.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an address book management device and an address book management method for managing address book data including information such as a postal code and an address in an information processing apparatus such as a word processor and a personal computer. .

[0002]

2. Description of the Related Art Conventionally, an information processing apparatus such as a word processor or a personal computer has an address book management function for managing address book data composed of information such as a postal code and an address input by a user. In addition to management of address book data for each individual, postcard address printing and the like can be performed using the address book data.

[0003] In addition, this type of address book management function usually has a postal code dictionary that stores postal code and address information in accordance with the "Pastal Guide" issued by the post office.
By using the postal code dictionary, for example, a corresponding postal code can be searched from the address input by the user, or it can be checked whether the input address and the postal code are correct.

[0004]

As described above, in the conventional address book management function, a zip code dictionary is used to search for a corresponding zip code from an address input by a user, and to search for an address input by a user. Checking zip codes was done.

[0005] However, the postal code dictionary naturally stores predetermined addresses and postal codes. Therefore, in the case of using this postal code dictionary to search for a postal code from an address, for example, the user obtains a desired postal code unless the target address matches the postal code dictionary and is correctly input. I couldn't do that.

In this case, a perfect match is required. Therefore, when a user enters an incorrect address, such as "1-cho Hamachi, Hamura-shi, Tokyo" (ha-chome is the correct answer), a dictionary search should be performed even if the address partially matches. Can not. Further, even when control information such as a line feed or space is included in the middle of the input address, dictionary search cannot be performed.

[0007] As described above, unless the address is correctly entered by making the postal code dictionary completely match, the dictionary search is not performed. Therefore, the corresponding postal code cannot be obtained by, for example, dictionary search.

Similarly, when checking the input address and the postal code, a correct result cannot be obtained unless the target address is completely matched with the postal code dictionary and input correctly.

At present, a postal code is composed of 5 or 3 digits, but it is not possible to specify an address. Therefore, the postal code, which has been 5 digits (3 digits), is changed to 7 digits, and it is further classified. It is required to do.

The present invention has been made in view of the above points, and it is possible to perform a dictionary search within a possible range even if the dictionary does not completely match the postal code dictionary. It is an object of the present invention to provide an address book management device and an address book management method capable of searching for a zip code or checking an input address and a zip code.

It is another object of the present invention to provide an address book management apparatus and an address book management method capable of converting a postal code attached to an input address from 5 digits (3 digits) to 7 digits. .

[0012]

[Means for Solving the Problems]

(1) An address book management device of the present invention comprises: input means for inputting address book data including postal code and address information;
A postal code dictionary storing two types of postal codes having different predetermined numbers of digits and address information corresponding to the postal codes; and the postal code based on the address information of the address book data input by the input means. A dictionary search means for searching a dictionary; and if the corresponding address information cannot be obtained as a result of the dictionary search means, the address information having a character string up to the middle of the address information of the address book data is used as a search candidate as the search candidate. It comprises a search candidate creating means for extracting from the number dictionary and a display means for displaying the search candidates obtained by the search candidate creating means.

[0013] The information processing apparatus may further include address rewriting means for rewriting address information of the address book data based on address information selected from the search candidates displayed by the display means.

[0014] The present invention is further characterized by further comprising a zip code conversion means for converting the number of digits of zip code information of the address book data based on a search result of the dictionary search means. According to such a configuration, when the postal code dictionary is searched based on the input address, even if the corresponding address is not obtained, an address that partially matches is extracted as a search candidate. Therefore, even if the contents do not completely match the contents of the postal code dictionary, it is possible to perform a dictionary search to the extent possible, for example, searching for the corresponding postal code from the input address, or inputting the address. And you can check if the zip code is correct.

Further, by using the result obtained by the dictionary search based on such replacement, if the input postal code is 5 (3) digits, the postal code is converted into 7 digits and registered. You can also.

(2) The address book management device according to the present invention comprises an input means for inputting address book data consisting of information on a postal code and an address, and two kinds of postal codes having different predetermined numbers of digits. A postal code dictionary storing information on addresses corresponding to postal codes; and skip determining means for determining whether there is control information that can be skipped in the address information of the address book data input by the input means. As a result of the skip determining means, if there is control information that can be skipped in the address information of the address book data, the postal code dictionary is searched based on the address information excluding the control information. A dictionary search means.

[0017] Further, there is further provided a postal code conversion means for converting the number of digits of postal code information of the address book data based on a search result of the dictionary search means. According to such a configuration, when the input address has skippable control information such as a line feed or space, the postal code dictionary is searched with the address excluding the control information. Therefore, even if the contents do not completely match the contents of the postal code dictionary, it is possible to perform a dictionary search to the extent possible, for example, searching for the corresponding postal code from the input address, or inputting the address. And you can check if the zip code is correct.

Further, by using the result obtained by the dictionary search based on the replacement, if the input postal code is 5 (3) digits, the postal code is converted into 7 digits and registered. You can also.

[0019]

Embodiments of the present invention will be described below with reference to the drawings. FIG. 1 is a block diagram showing a basic circuit configuration of the address book management device of the present invention. The present apparatus is realized by a computer which reads a program recorded on a recording medium such as a magnetic disk, and whose operation is controlled by the program.

In FIG. 1, a CPU 11 activates a program (ROM 12, ROM,
M13) is accessed to control the entire apparatus, and here, an address book management process is executed.

The ROM 12 has a program area 12a in which a program for activating the CPU 11 is stored.
Here, a postal code dictionary area 12b is provided. The postal code dictionary area 12b stores a postal code dictionary in which two types of postal codes having different predetermined numbers of digits and information on addresses corresponding to the postal codes are stored. In addition, 2
One type of postal code is a postal code consisting of 5 (3) digits, and the other is a postal code consisting of 7 digits. For example, $ 060 and $ 060-0000.

The RAM 13 has an address book data area 13
a, a one-entry temporary save area 13b, a screen display message area 13c, and a candidate list area 13d are provided.
The address book data area 13a stores therein address book data including postal code and address information for each individual input by the user. One entry temporary save area 13b stores one entry of address book data to be checked. The screen display message area 13c stores message data to be notified to the user. Candidate list area 13d
Stores address information obtained as search candidates when searching the postal code dictionary.

The input device 14 is composed of, for example, a keyboard, and inputs and issues address book data. Display device 15
Are, for example, LCD (Liquid Crystal Display) and CRT
(Cathode Ray Tube), etc., for displaying address book data. The external storage device 16 is composed of a storage device such as a floppy disk device (FDD) or a hard disk device (HDD), and is used when file management of address book data and application software are installed. The printing device 17 includes, for example, a serial printer, and is used when performing address printing based on address book data.

Hereinafter, embodiments of the present invention realized by the apparatus shown in FIG. 1 will be described. (First Embodiment) FIG. 2 is a block diagram showing a functional configuration of an address book management device according to a first embodiment of the present invention. The apparatus includes a keyboard 21, an address book access processing section 22, a postal code check processing section 23, a postal code search processing section 24, a display 25, an address book data storage section 26,
One entry temporary save area 27, postal code dictionary 28, candidate list storage memory 29, screen display message area 30
Is configured.

The keyboard 21 is used to input and issue address book data. The address book access processing unit 22 extracts address book data for one entry from the address book data storage unit 26 and stores it in the one-entry temporary save area 27. The postal code check processing unit 23 checks the postal code information of the address book data (address book data input by the user) stored in the one-entry temporary save area 27.

The postal code search processing unit 24 searches the postal code dictionary 28 based on the address book data (address book data input by the user) stored in the one-entry temporary save area 27. At this time, in the first embodiment, if the corresponding address information is not obtained as a result of searching the postal code dictionary 28, address information having a character string up to the middle of the address information of the address book data is searched for. Extracted from the postal code dictionary 28 and stored in the candidate list storage memory 29.

The address book data storage section 26 stores address book data including postal code and address information for each individual input by the user. 1-entry temporary save area 2
7 stores only one entry of address book data to be checked. The postal code dictionary 28 stores two types of postal codes of 5 (3) digits and 7 digits and information of an address corresponding to the postal code.

The candidate list storage memory 29 stores address information extracted from the postal code dictionary 29 as search candidates. The screen display message area unit 30 stores message data created based on the search result of the postal code search processing unit 24. The display 25 displays address book data, message data, and the like.

Next, the operation of the first embodiment will be described.
Here, when checking whether the postal code and the address of the input address book data are correct, the operations of (a) dictionary search processing and (b) postal code conversion processing will be described separately.

(A) Dictionary Search Process FIG. 3 is a flowchart showing the operation of the dictionary search process in the first embodiment. It is now assumed that address book data to be checked (address book data input by the user) is stored in the one-entry temporary save area 27. The postal code check processing unit 23 captures the postal code information of the address book data stored in the one-entry temporary save area unit 27 and passes it to the postal code search processing unit 24 (Step A11). The postal code search processing unit 24 searches whether or not there is corresponding postal code information in the postal code dictionary 28 (step A12). As a result, if the postal code information does not exist in the postal code dictionary 28 (step A1).
2), the postal code search processing unit 24 creates message data indicating that there is an error in the postal code information of the input address book data in the screen display message area unit 30 and displays it on the display 25. The user is notified (step A21).

On the other hand, if the corresponding postal code information is present in the postal code dictionary 28 (Yes in step A12), the postal code search processing section 24 extracts the address information corresponding to the postal code information from the postal code dictionary 28. (Step A1
3). In this case, since the address is searched from the postal code, some candidates are obtained.

Here, the postal code search processing section 24 extracts the address information from the address book data, and
(Step A14).
As a result, if there is a perfect match between the two, or if there is a relationship that is included from the front (Yes in step A14), the postal code search processing unit 24
Determines that the postal code information and the address information of the input address book data are correct, creates message data to that effect in the screen display message area 30, and displays it on the display 25 to notify the user ( Step A1
9).

On the other hand, if there is no match between the two, that is, if the corresponding address information is not in the postal code dictionary 28 (No in step A14), the postal code search processing unit 24 returns It is checked whether or not address information having a character string up to the middle of the address information exists in the postal code dictionary 28 (step A15). As a result, if there is address information that matches partway (Ye in step A15)
s) The postal code search processing unit 24 extracts the address information from the postal code dictionary 28 and stores it in the candidate list storage memory 29 as a search candidate (step A16). Then, the postal code search processing unit 24 displays a list of search candidates stored in the candidate list storage memory 29 on the display 25 (step A17).

Here, when the user selects desired address information from the search candidates displayed on the display 25,
The postal code search processing unit 24 rewrites the address information of the address book data with the selected address information (step A1).
8).

In step A15, if there is no address information that matches partway (N in step A15)
o), the postal code search processing unit 24 determines that the postal code information and the address information of the input address book data are unmatched, and creates message data to that effect in the screen display message area unit 30; The information is displayed on the display 25 to notify the user (step A20).

FIGS. 4 and 5 show specific examples. First, 3
A case where a digit zip code is input will be described. Now, for example, as shown in FIG.
It is assumed that the user has input address book data such as "1-chome Hamachi, Hamura-shi, Tokyo" (1-chome is correct). At this time, the contents of the postal code dictionary 28 are as shown in FIG.

In this case, since the postal code dictionary 28 does not have a completely matching address (including the postal code), as a result of the dictionary search, the postal code dictionary 2 finds a partially matching address as a candidate.
8 and a candidate list screen as shown in FIG. In this example, the character strings up to “$ 205 Hamura-shi, Hamura-shi, Tokyo” are used to express “$ 205 Haha-shi, Hamura-shi, Tokyo”, “$ 205 Hato, Hamura-shi, Tokyo”, and “$ 205”.
Addresses such as “Hanaka, Hamura-shi, Tokyo”, “〒205, Hakami, Hamura-shi, Tokyo”, and “〒205, Hakanishi, Hamura-shi, Tokyo” will be listed as search candidates.

Here, when the user is the first candidate “〒
205 "Hamura-shi, Tokyo,"
The original address book data such as “05 1 Hamachi, Hamura-shi, Tokyo” is converted to “# 205 1-chome, Hamura-shi, Tokyo”.

Next, a case where a seven-digit postal code is input will be described. Now, as shown in FIG.
For example, it is assumed that the user inputs address book data such as "1-205 Hamachi, Hamura-shi, Tokyo 205-0001" (1-chome is correct). At this time, the contents of the postal code dictionary 28 are as shown in FIG.

In this case, since the postal code dictionary 28 does not have a completely matching address (including the postal code), as a result of the dictionary search, the postal code dictionary 2 finds a partially matching address as a candidate.
8 and a candidate list screen as shown in FIG. In this example, addresses such as “$ 205 Hamura-shi, Hamura-shi, Tokyo” are displayed as a list of search candidates in a character string up to “$ 205-0001 Ha, Hamura-shi, Tokyo”.

Here, if the user is the first candidate “〒
205 "Hamura-shi, Tokyo,"
The original address book data such as “05-0001 1-chome Hamachi, Hamura-shi, Tokyo” is converted to “1-chome 1-chome, Hamura-shi, Tokyo 205-0001”.

(B) Postal code conversion processing FIG. 6 is a flowchart showing the operation of the postal code conversion processing in the first embodiment. It is now assumed that address book data to be checked (address book data input by the user) is stored in the one-entry temporary save area 27. The postal code check processing section 23 takes in the postal code information of the address book data stored in the one-entry temporary save area section 27 and passes it to the postal code search processing section 24 (step B11). The postal code search processing unit 24 searches whether or not there is the corresponding postal code information in the postal code dictionary 28 (step B12).

The corresponding postal code information is stored in the postal code dictionary 28
Is present (Yes in step B12), the postal code search processing unit 24 extracts the address information corresponding to the postal code information from the postal code dictionary 28 (step B13).
In this case, since the address is searched from the postal code, some candidates are obtained.

Here, the postal code search processing section 24 extracts the address information from the address book data, and retrieves the postal code dictionary 28
(Step B14).
As a result, if there is a perfect match between the two or if there is a relationship that is included from the front (Yes in step B14), the postal code search processing unit 24
Determines that the postal code information and the address information of the input address book data are correct, converts the number of digits of the postal code information from 5 (3) digits to 7 digits with reference to the postal code dictionary 28, and The data is re-registered in the recorded data storage unit 26 (step B19).

That is, for example, in the case of address book data of “$ 205, 1-chome, Hamura-shi, Tokyo”, the postal code information in the address book data is changed from “$ 205” to “$ 205-001”.
2 ", and register the converted address book data.

On the other hand, if there is no match between the two, that is, if the corresponding address information is not in the postal code dictionary 28 (No in step B14), the postal code search processing unit 24 returns It is checked whether or not address information having a character string up to the middle of the address information exists in the postal code dictionary 28 (step B15). As a result, if there is address information that matches partway (Ye in step B15)
s) The postal code search processing unit 24 extracts the address information from the postal code dictionary 28 and stores it as a search candidate in the candidate list storage memory 29 (step B16). Then, the postal code search processing unit 24 displays a list of search candidates stored in the candidate list storage memory 29 on the display 25 (step B17).

Here, when the user selects desired address information from the search candidates displayed on the display 25,
The postal code search processing unit 24 rewrites the address information of the address book data with the selected address information (step B1).
8). Thereafter, the postal code search processing unit 24 converts the number of digits of the postal code information of the rewritten address book data from 5 (3) digits to 7 digits with reference to the postal code dictionary 28 and stores the address book data. The information is re-registered in the unit 26 (step B19).

(Second Embodiment) Next, a second embodiment of the present invention will be described. The second embodiment is characterized in that, when an input address includes skippable control information such as a line feed or space, the control information is skipped and a dictionary search is performed.

FIG. 7 is a block diagram showing a functional configuration of the address book management device according to the second embodiment of the present invention. The basic configuration is the same as that of FIG. 2, and the same portions are denoted by the same reference numerals and description thereof will be omitted.

The configuration of FIG. 7 differs from that of FIG.
In the address information of the address book data (address book data input by the user) stored in the address book data storage unit 26,
That is, control information that can be skipped, such as a line feed or a space, is included.

Next, the operation of the second embodiment will be described.
Here, when checking whether the postal code and the address of the input address book data are correct, the operations of (a) dictionary search processing and (b) postal code conversion processing will be described separately.

(A) Dictionary Search Process FIG. 8 is a flowchart showing the operation of the dictionary search process in the second embodiment. It is now assumed that address book data to be checked (address book data input by the user) is stored in the one-entry temporary save area 27. The postal code check processing unit 23 takes in the postal code information of the address book data stored in the one-entry temporary save area 27, and passes it to the postal code search processing unit 24 (step C11). The postal code search processing unit 24 searches whether or not there is corresponding postal code information in the postal code dictionary 28 (step C12). As a result, if the corresponding postal code information is not in the postal code dictionary 28 (step C1).
2), the postal code search processing unit 24 creates message data indicating that there is an error in the postal code information of the input address book data in the screen display message area unit 30 and displays it on the display 25. The user is notified (step C20).

On the other hand, when the corresponding postal code information is present in the postal code dictionary 28 (Yes in step C12), the postal code search processing section 24 extracts the address information corresponding to the postal code information from the postal code dictionary 28. (Step C1
3). In this case, since the address is searched from the postal code, some candidates are obtained.

Here, the postal code search processing section 24 extracts address information from the address book data (step C14). Then, the postal code search processing section 24 determines whether or not the address information includes control information that can be skipped, such as a line feed or a space (step C15). If there is control information that can be skipped in the address information (step C15)
Yes), the postal code search processing unit 24 removes the control information from the address information and packs it (step C1).
6). The prohibition information can be skipped, but page breaks and continuous line breaks cannot be skipped.

When the control information is removed from the address information of the address book data in this manner, the postal code search processing section 24 compares the address information with the address information obtained from the postal code dictionary 28, and If there is a match (Yes in step C17), the postal code search processing unit 24 determines that the postal code information and the address information of the input address book data are correct, and displays the message data to that effect on the screen display message. After being created in the area 30, this is displayed on the display 2.
5 to notify the user (step C18).

On the other hand, if there is no match between the two (No in step C17), the postal code search processing unit 24 determines that the postal code information and address information of the input address book data are unmatched, After the message data to that effect is created in the screen display message area section 30, this is displayed on the display 25 to notify the user (step C19).

FIGS. 9 and 10 show specific examples. For example, as shown in FIG. 9A, if there is a space 31 in an address, it can be skipped, and a dictionary search can be performed using an address consisting of a character string excluding the space as a key. Similarly, as shown in FIG. 7B, a non-continuous line feed 31 in the address can be skipped, and a dictionary search is performed using the address consisting of a character string excluding the line feed 31 as a key. be able to. However, if there is a continuous line feed 31 in the address as shown in FIGS. 3C and 3D, it cannot be skipped. That is, it is not a target of dictionary search.

Further, the prohibition information 33 as shown in FIG. 10 can be skipped, and a dictionary search can be performed using an address consisting of a character string excluding the information as a key. (B) Postal code conversion processing FIG. 11 is a flowchart showing the operation of the postal code conversion processing in the second embodiment. Now, the address book data to be checked (address book data input by the user) is 1
It is assumed that it is stored in the entry temporary save area 27. The postal code check processing unit 23 takes in the postal code information of the address book data stored in the one-entry temporary save area 27 and passes it to the postal code search processing unit 24 (step D11). The postal code search processing unit 24 searches whether or not there is the corresponding postal code information in the postal code dictionary 28 (step D12).

The corresponding postal code information is stored in the postal code dictionary 28
(Step D12: Yes), the postal code search processing unit 24 extracts the address information corresponding to the postal code information from the postal code dictionary 28 (step D13).
In this case, since the address is searched from the postal code, some candidates are obtained.

Here, the postal code search processing section 24 extracts address information from the address book data (step D14). Then, the postal code search processing unit 24 determines whether or not the address information includes control information that can be skipped, such as a line feed or a space (step D15). If there is control information that can be skipped in the address information (step D15)
Yes), the postal code search processing unit 24 removes the control information from the address information and packs it (step D1).
6). The prohibition information can be skipped, but page breaks and continuous line breaks cannot be skipped.

When the control information is removed from the address information of the address book data in this way, the postal code search processing unit 24 compares the address information with the address information obtained from the postal code dictionary 28, and If there is a match (Yes in step D17), the postal code search processing unit 24 determines that the postal code information and the address information of the input address book data are correct, and changes the number of digits of the postal code information to postal code. Number dictionary 2
Referring to FIG. 8, 5 (3) digits are converted to 7 digits and re-registered in the address book data storage unit 26 (step D18).

That is, for example, in the case of address book data of “$ 205, 1-chome, Hamura, Tokyo, Tokyo”, the postal code information in the address book data is changed from “$ 205” to “$ 205-001”.
2 ", and register the converted address book data.

As described above, it is possible to perform a dictionary search within a possible range. For example, it is possible to correctly determine whether or not the postal code and address of the input address book data are correct.

If the input postal code is 5 (3) digits, the postal code can be converted to 7 digits and registered after a dictionary search. In each of the above embodiments, the description has been made on the assumption that the user inputs both the postal code and the address and determines whether or not the postal code is correct or not by a dictionary search. Even when the corresponding postal code is obtained by dictionary search, the same method as described above can be applied.

The method described in each of the above-described embodiments is, for example, a magnetic disk (floppy disk, hard disk, etc.), an optical disk (CD-ROM,
It is also possible to write the data on a recording medium such as a DVD or a semiconductor memory and apply it to various devices, or to transmit it via a communication medium and apply it to various devices. A computer that realizes the present apparatus reads the program recorded on the recording medium, and executes the above-described processing by controlling the operation of the program.

[0066]

As described above, according to the present invention, the contents of the postal code dictionary can be completely obtained by setting an address that matches partway as a search candidate, or skipping a line feed or space (including prohibited information). Even if it does not match, you can search the dictionary as much as possible, for example, you can search for the postal code from the input address, or check whether the input address and the postal code are correct . In addition, by using the result obtained by the dictionary search by such replacement, the input postal code can be converted from 5 (3) digits to 7 digits and registered.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a basic circuit configuration of an address book management device of the present invention.

FIG. 2 is a block diagram showing a functional configuration of the address book management device according to the first embodiment of the present invention.

FIG. 3 is a flowchart illustrating an operation of a dictionary search process according to the first embodiment.

FIG. 4 is a diagram for specifically explaining a dictionary search process according to the first embodiment;

FIG. 5 is a diagram for specifically explaining a dictionary search process according to the first embodiment;

FIG. 6 is a flowchart illustrating the operation of a postal code conversion process according to the first embodiment.

FIG. 7 is a block diagram showing a functional configuration of an address book management device according to a second embodiment of the present invention.

FIG. 8 is a flowchart illustrating an operation of a dictionary search process according to the second embodiment.

FIG. 9 is a diagram for specifically explaining a dictionary search process according to the second embodiment;

FIG. 10 is a diagram for specifically explaining a dictionary search process according to the second embodiment;

FIG. 11 is a flowchart illustrating the operation of a postal code conversion process according to the second embodiment.

[Explanation of symbols]

 11 CPU 12 ROM 12a Program area 12b Postal code dictionary area 13 RAM 13a Address book data area 13b 1-entry temporary save area 13c Screen display message area 13d Candidate list area 14 Input device 15 Display Apparatus 16 External storage device 17 Printing device 21 Keyboard 22 Address book access processing unit 23 Postal code check processing unit 24 Postal code search processing unit 25 Display 26 Address book data storage unit 27 One entry temporary save Area part 28 ... Postal code dictionary 29 ... Candidate list storage memory 30 ... Screen display message area part

Claims (10)

[Claims] An input means for inputting address book data comprising postal code and address information, and storing two kinds of postal codes having different predetermined numbers of digits and address information corresponding to the postal code. A postal code dictionary, a dictionary search means for searching the postal code dictionary based on the address information of the address book data input by the input means, and a case where no corresponding address information is obtained as a result of the dictionary search means. A search candidate creating unit for extracting address information having a character string up to the middle of the address information of the address book data as a search candidate from the postal code dictionary; and displaying the search candidates obtained by the search candidate creating unit. An address book management device comprising a display unit. 2. An address rewriting means for rewriting address information of the address book data based on address information selected from the search candidates displayed by the display means. Address book management device as described. 3. The address book according to claim 1, further comprising a postal code conversion means for converting the number of digits of postal code information of said address book data based on a search result of said dictionary search means. Management device. 4. Input means for inputting address book data comprising postal code and address information, and storing two kinds of postal codes having different predetermined numbers of digits and address information corresponding to the postal code. A postal code dictionary, and a skip determination unit that determines whether there is any control information that can be skipped in the address information of the address book data input by the input unit. As a result of the skip determination unit, When there is control information that can be skipped in the address information of the address book data, dictionary search means for searching the postal code dictionary based on the address information excluding the control information is provided. Address book management device. 5. The address book according to claim 4, further comprising a postal code conversion means for converting the number of digits of postal code information of said address book data based on a search result of said dictionary search means. Management device. 6. An address book management method for managing address book data comprising postal code and address information, comprising: two kinds of postal codes having different predetermined numbers of digits; and address information corresponding to the postal codes. The postal code dictionary is stored based on the address information of the address book data. The postal code dictionary is searched based on the address information. If the corresponding address information cannot be obtained as a result of the dictionary search, the An address book management method, comprising extracting address information having a character string up to the middle of the address information from the postal code dictionary as a search candidate, and displaying the extracted search candidate. 7. The address book management method according to claim 6, wherein the address information of the address book data is rewritten based on the address information selected from the displayed search candidates. 8. The address book management method according to claim 6, wherein the number of digits of postal code information of the address book data is converted based on a search result of the postal code dictionary. 9. An address book management method for managing address book data including postal code and address information, comprising: two kinds of postal codes having different predetermined numbers of digits; and address information corresponding to the postal codes. It is determined whether or not there is control information that can be skipped in the address information of the address book data, and as a result of this determination, the address information of the address book data has If there is control information that can be skipped, an address book management method characterized by searching the postal code dictionary based on address information excluding the control information. 10. The address book management method according to claim 9, wherein the number of digits of postal code information of the address book data is converted based on a search result of the postal code dictionary.