JPH07160701A - Address information retrieval device - Google Patents

Abstract

PURPOSE:To provide the address information retrieval device which considerably reduces the number of input operations in the retrieval processing of ZIP code or address information and changes a dictionary part in the case of the change of the zip code. CONSTITUTION:When address information is inputted from an input means 101, it is stored in an input information storage means 103. Since a ZIP code dictionary for ZIP code retrieval is so constituted that keywords to classify the address information into respective hierarchies of metropolis, district, prefecture, city, ward, country, town, village, section, block, and number are provided and a discrimination bit indicating whether the next keyword exists or not is added to each keyword and the ZIP code is stored at the time of non-existence of the next keyword, a ZIP code recognizing means 105 reads out keywords from address information stored in the input information storage means 103 and successively retrieves coinciding keywords based on keywords stored in the ZIP code dictionary and added discrimination bits, thereby recognizing the ZIP code.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an address information retrieving apparatus, and more particularly, to an address information retrieving apparatus in a Japanese word processor, personal computer or the like capable of retrieving zip code and address information.

[0002]

2. Description of the Related Art Conventionally, for example, a Japanese word processor having an address information search processing function already has a function of displaying / registering corresponding address information by inputting a zip code. FIG. 12 shows a conventional zip code dictionary 1
It is explanatory drawing which shows the structure of. Further, FIG. 13 is a display example showing a search process of address information using the conventional zip code dictionary 1. As shown in FIG. 12, a dictionary is created in which address data (address information) corresponding to the postal code is registered as one record, and the address data is retrieved from the input postal code as shown in FIG. It is a function to display.

FIG. 14 is an explanatory diagram showing the structure of a conventional zip code dictionary 2. As shown in FIG. 14, the address data is categorized in advance by the prefecture name, city / ward county name, town / village name, hierarchized, and the operator (user) selects each address to make the postal code from the address data. There is already a method of recognizing. Further, FIG. 15 is a display example showing a postal code search process using the conventional postal code dictionary 2. Figure 15
As the procedure is briefly shown, first, when the prefecture name to be input is selected from the prefecture name selection window, the city / ward county name corresponding to the prefecture name is displayed and selected.
Next, the desired city / ward name is selected from this city / ward name selection window, the town / village name corresponding to the selected city / ward name is displayed, and selection is made. By going down the hierarchy in this way, the postal code can be searched from the selected address data.

Address data is divided into three layers (first layer: city / province / prefecture / prefecture, second layer: city / county / special ward / designated city, third layer).
(Layer: town / village / ward), prepare a dictionary with zip codes at the lowest level, and match the input place name data with the place name data in the dictionary from the highest level to the lowest level. A postal code conversion device has been proposed that retrieves postal codes by sequentially taking up to a hierarchy (Japanese Patent Laid-Open No. 2-890441).
(See the official gazette).

As a conventional example of displaying the corresponding address information by inputting the reading of the address information, a Japanese word processor for inputting the same reading as the reading stored in the address information dictionary and converting it into the address data. It is commercially available (see Matsushita Electric U1 Pro Series Operation Manual). In addition, a large number of address information should be treed in advance in a linear file format for each address item and filed, and the first character of each treed address character, for example, "NA", should be input using the keyboard of the full character array. Has proposed an address information input device for displaying the candidate "Nara Prefecture" (see Japanese Patent Laid-Open No. 55-74633).

[0006]

However, in the conventional postal code search processing using the postal code dictionary 2, by inputting the postal code, the corresponding address data is displayed / registered or the address data is registered. The postal code can be recognized (displayed / registered) by selecting each division of prefecture / city / town / town / village, but this is an effective technique for data entry, The zip code cannot be searched from the entered address data, and the zip code must be searched from the correspondence table of the address and zip code published in the "Postal Guide" issued by the Ministry of Posts and Telecommunications. There's a problem.

Further, in JP-A-2-289041, the postal code cannot be determined by classifying the address data into three levels: prefecture, city / ward, and town / village. Figure 1
6 is an explanatory view showing a part of the “Postal Guide” issued by the Ministry of Posts and Telecommunications. For example, as shown in FIG. 16, one zip code cannot be determined by only these three layers, and is also classified by the address data after that. For example,
Several postal codes are set under "Ashida-cho, Fukuyama-shi". Moreover, there are also classifications such as “other” and “other than the above”. Therefore, one postal code cannot be confirmed for the address data that has already been entered, and eventually there is a problem that some postal code candidates must be selected by referring to the "Postal guide" etc. To do.

In the Japanese word processor of U1 Pro series manufactured by Matsushita Electric, for example, it was necessary to input all the readings of the place name, which was not efficient. Also, the function to narrow down by reading must be specified after displaying the list. Since candidates are output in the order in which they are stored in the dictionary, in the case of an area stored behind the dictionary, it was necessary to input a large number of [conversion / next candidate] keys. Regardless of new input / correction input, it was necessary to input from the prefecture name, which was more efficient. When the previously input data is used again, it is necessary to delete the unnecessary data because all the previously input data is transferred.

According to Japanese Patent Laid-Open No. 55-74633, the address information can be changed by inputting the reading information in the abbreviated conversion and the input operation can be reduced, but there is no learning function and the change candidates are in a predetermined order, and the number of operations is large. It cannot be said that it is reduced to.

The present invention has been made in consideration of the above circumstances, and can greatly reduce the number of input operations in the search processing of postal code and address information, and can change the dictionary section when the postal code is changed. The present invention provides a simple address information search device.

[0011]

FIG. 1 is a block diagram showing the basic configuration of the invention of claim 1. In FIG. The invention according to claim 1 of the present application, as shown in FIG. 1, is an input means 1 for inputting various instructions for inputting address information and zip code search.
01 and display means 1 for displaying address information and zip code
02, the input information storage means 103 for storing the input address information, and the address information for the capital, road, prefecture, prefecture, city, ward, group,
A keyword for classifying each hierarchy of town, village, chome, number, and number is provided, and an identification bit indicating whether or not the next keyword exists is added to each keyword and the zip code is stored where the keyword does not exist. A keyword is read from the zip code dictionary 104 configured as described above and the address information stored in the input information storage means 103, and a keyword that matches the keyword stored in the zip code dictionary 104 is sequentially searched for based on the added identification bit. By providing the zip code, the zip code recognizing means 105 is provided, and the zip code recognizing means 105 automatically recognizes the zip code from the already input address information, and the displaying means 102.
It is an address information search device characterized by outputting to.

The zip code recognizing means 105 is preferably configured to automatically recognize the zip code by searching the zip code dictionary 104 for a keyword that matches the keyword of the input address information.

Further, when the zip code recognizing means 105 recognizes the zip code from the input address information, the zip code recognizing means 105 searches for a keyword from the beginning of the address information or the end of the sentence according to the instruction of the input means 101. ,road,
It is preferable that the prefecture, prefecture, city, ward, group, town, village, chome, number, and number are recognized.

FIG. 2 is a block diagram showing the basic configuration of the invention of claim 4. The invention according to claim 4 of the present application is shown in FIG.
As shown in FIG. 2, the input means 2 for inputting the reading information for searching the address information or the leading character and various instructions.
01, a display means 202 for displaying address information and its reading information, and the address information together with the reading information are coded and memorized by classifying them into respective levels of prefecture name, city / ward county name, town / village name. The address information dictionary 203 and the second address information dictionary 204 in which the address information of the adjacent area names are coded together with the reading information and classified and stored in a plurality of groups.
And referring to the first address information dictionary 203 and the second address information dictionary 204 on the basis of the address reading information or the first character input from the input means 201, sequentially search and read for each layer and output to the display means 202. Candidate conversion means 205 and a confirmation means 206 for confirming desired address information from the conversion candidates displayed on the display means 202.
And the confirmed address information and the reading information for each layer are stored in the fixed information storage means 207. The candidate conversion means 206 stores the address when the first character of the reading information is input from the input means 201. It is searched whether or not the conversion candidate corresponding to the first character of the information is stored in the fixed information storage unit 207. If the conversion candidate is stored, the fixed address information is read from the fixed information storage unit 207, and the conversion candidate is determined. This is an address information search device characterized by reading conversion candidates from the first address information dictionary 203 and the second address information dictionary 204 if not stored.

Further, the candidate conversion means 206 sets the priority of the conversion candidates obtained from the first address information dictionary 203 to the second priority.
It is preferable that the address information dictionary 204 rearranges the conversion candidates of the adjacent area names and outputs them to the display unit 202.

Further, an input information processing means 208 for processing each information inputted from the input means 201 is further provided, and the input information processing means 208 is provided with the input means 20.
When the reading information of the address information is input from 1, the reading information stored in the fixed information storage unit 207 is searched to determine whether the reading information is new reading information or correction reading information. If the reading information is new, the candidate conversion unit 205 is instructed to process it as the reading information of the prefecture name, and if it is the corrected reading information, the determined address information is the prefecture name, city. It is preferable that each level of the district name and town name is read from the fixed information storage unit 207 and output to the display unit 202.

Further, the input information processing means 208, when processing the corrected address information, includes the prefecture name, city / ward county name,
It is preferable that the processing is performed by importing from any hierarchy of the town name.

In the present invention, the input means 101,
As 201, a keyboard device, a pen input tablet device, or an input device such as a pointing device or an OCR device is used. As the display means 102, 202, a display device such as a CRT display device, an LCD (liquid crystal display) device, an EL display device or the like is used. Input information storage means 103, zip code dictionary 10
4, postal code recognition means 105, first address information dictionary 20
3, the second address information dictionary 204, the candidate conversion means 205, the confirmation means 206, the confirmation information storage means 207, and the input information processing means 208 include a CPU, a ROM, a RAM, and an I / O.
It is preferable to use a microcomputer having a port. Input information storage means 103 and confirmed information storage means 20
As for 7, a RAM therein is usually used. Further, as the zip code dictionary 104, the first address information dictionary 203, and the second address information dictionary 204, the ROM therein is used. Further, the input information storage means 103, the zip code dictionary 104, the first address information dictionary 203, and the second address information dictionary 2
04, an external storage device such as an FD (floppy disk) device or an HD (hard disk) device is used to expand the storage area of the fixed information storage means 207.

[0019]

According to the invention of claim 1 of the present application, when address information is input from the input means 101 in FIG.
The input address information is stored in the input information storage means 103. Also, a zip code dictionary for searching zip codes 1
04 is the address information of the capital, road, prefecture, prefecture, city, ward, group, town,
A keyword for classifying each level of village, chome, number, and number is provided, and an identification bit indicating whether or not the next keyword exists is added to each keyword so that the zip code is stored where the keyword does not exist. Since it is configured, the zip code recognizing means 105 is
The zip code can be recognized by reading the keyword from the address information stored in No. 3 and sequentially searching for a keyword that matches the keyword stored in the postal code dictionary 104 based on the added identification bit.

According to the above configuration, the postal code search means 10
No. 5 automatically recognizes the zip code by searching the zip code dictionary 104 for a keyword that matches the keyword of the input address information, so that omission of the zip code can be prevented. Also, the postal code search means 105
When searching the zip code from the entered address information,
By searching the keyword from the beginning of the address information or the end of the sentence according to the instruction of the input means 101,
Since the road, prefecture, prefecture, city, ward, group, town, village, chome, number, and number can be recognized respectively, the search function can be enhanced.

According to the invention of claim 4 of the present application, in FIG. 2, address information is coded in the first address information dictionary 203 together with its reading information, and the prefecture name, city / ward name,
The town name is classified and stored in each hierarchy, and the second address information dictionary 204 stores the address information of the adjacent area name together with its reading information and is coded into a plurality of groups. The candidate conversion unit 205 determines whether to read the address reading information input from the input unit 201 or the first character based on the reading information.
By referring to the address information dictionary 203 and the second address information dictionary 204, sequentially searching and reading for each layer and outputting to the display means 202, desired address information is determined from the conversion candidates displayed on the display means 202. When confirmed by 206, the confirmed address information and its reading information are stored in the confirmed information storage unit 207 for each layer. Therefore, the candidate conversion unit 206, when the first character of the reading information is input from the input unit 201, searches whether or not the conversion candidate corresponding to the first character of the address information is stored in the fixed information storage unit 207. If the conversion candidate is stored, the fixed address information is read from the fixed information storage unit 207, and if the conversion candidate is not stored, the conversion candidate is read from the first address information dictionary 203 and the second address information dictionary 204 and displayed. It can be output to the means 202.

According to the above configuration, the candidate conversion means 20
5 rearranges the priority of the conversion candidates obtained in the first address information dictionary 203 into the conversion candidates of the adjacent area names in the second address information dictionary 204 and outputs them to the display means 202, so that the conversion efficiency can be improved. it can.

Further, since the input information processing means 208 for processing each information inputted from the input means 201 is further provided, the input information processing means 208 inputs the reading information of the address information from the input means 201. When
The reading information stored in the defined information storage unit 207 is searched to determine whether the reading information is new reading information or correction reading information. The candidate conversion unit 206 is instructed to process as name reading information, and when it is the correction reading information, the fixed address information is stored for each layer of the prefecture name, the city / ward name, and the town / village name. Since it is read from the means 207 and outputted to the display means 202, when processing the corrected address information, it can be taken in from any hierarchy of the prefecture name, city / ward county name, town / village name and processed.

[0024]

The present invention will be described in detail below based on the embodiments shown in the drawings. The present invention is not limited to this. Further, the present invention is suitable for use in, for example, a Japanese word processor, and each component achieves the “postal code and address information search processing function” of the present invention.
The explanation will be given assuming that it has the functions of a normal Japanese word processor.

FIG. 3 is a block diagram showing the first embodiment of the present invention. In FIG. 3, 1 is a control unit including a CPU for controlling the apparatus, 2 is an input unit such as a keyboard for inputting address data and a series of operations, and 3 is an LCD (liquid crystal display) for displaying address data and a series of operations. A display unit such as a device, 4 is an address data buffer including a RAM for editing address data input by an operator (user), and 5 is an FD (floppy) for storing the address data edited by the address data buffer 4. The address data storage unit includes an external storage device such as a disk device or an HD (hard disk) device.

Reference numeral 6 is a zip code dictionary accumulating data for recognizing the zip code from the input address data. Reference numeral 7 is a zip code recognizing unit that functions as a zip code recognizing unit for recognizing a zip code by referring to a zip code dictionary from input address data. Here, the input address data is divided by keywords, The zip code is automatically recognized from the address data by searching for a keyword that matches the address data in the zip code dictionary 6. Reference numeral 8 denotes an address data division buffer for storing division data when the address data is divided using a keyword. 9
Is a printing unit such as a thermal printer or a laser printer for printing document data and address data.

FIG. 4 is an explanatory diagram showing an example of the structure of the zip code dictionary. The first embodiment of the present invention will be described from the structure of a dictionary for recognizing a postal code from address data.
In Figure 4, how to retrieve this dictionary data (how to search)
Is usually structured according to the way people pull "Postal guide (postal code book)" issued by the Ministry of Posts and Telecommunications.

This is to check the page in which the data of the prefecture is posted based on the prefecture name of the address data to be searched, and then search for the city / ward name. That is, structurally, they are classified and organized for each level of prefecture / city / ward / town / village. A block of data in each layer is called a table, and one data is called a record.

Here, at the head of one record, a bit for identifying whether or not there is a layer below it is provided (lower layer presence / absence bit). In this device, the bit is 0
Indicates that there is a lower layer, and that the bit is 1 and there is no lower layer. Next, the classification name (prefecture name / city / ward / ward name / town / village name) in that hierarchy is stored, and recognition is performed based on whether or not this matches the address data to be recognized. If the lower layer bit is 0 (lower layer exists), the head offset value of the table of the lower layer is stored after that, and if the lower layer bit is 1 (no lower layer), the mail Stores number data.

The final record stores data for processing when the address data for recognition does not match. If the postal code is specified for an area other than the classification name (when "Other than above ..." is stated in the "Postal guide"), the lower hierarchy bit is 1 (no lower hierarchy), The classification name is set to "FFFFFF" and the postal code data specified at the end of the record is stored. If not specified, "FFFF" is stored at the end of the record and an error is judged.

FIG. 5 is a flow chart showing the procedure of the postal code search process. Further, FIG. 5 shows processing steps for determining the postal code from the address data by using the postal code dictionary 6. Step S101: Record No. as a counter for searching records. Is cleared to 0. Step S102: It is judged whether the record to be searched is the last record in the table. This uses the fact that "FFFFFFFF" is stored in the classification name of the final record, and it is determined whether the classification name is "FFFFFFFF". Step S103: If it is not the final record, the target character string in the address data is compared with the character string of the classification name in the zip code dictionary to determine whether they match. The target character string in the address data here is a character string obtained by subdividing the address data into keywords (divided into prefecture / city / district / town / town name) (details will be described later). Step S104: If they do not match, the record number. Is incremented by 1 and compared with the next record.

Step S105: If the record is the last one in step S102, the lower hierarchy presence / absence bit of the record is referred to. Step S106: If the lower layer presence / absence bit is other than 1,
If it is determined that there is no corresponding data in the postal code dictionary, error processing (display such as "not applicable") is performed. Step S107: If the bit is 1 (no lower layer),
Confirm with the zip code stored at the end of the record. This process is a process for the case where the postal code is defined for an area other than the classification name (when "other than above ..." is described in the "Postal guide").

Step S108: If the target character string in the address data and the character string of the classification name in the zip code dictionary match in step S103, the lower hierarchy presence / absence bit of the record is referred to. Step S109: If the bit is 0 (no lower layer),
Offset (offs stored at the end of the record
et) search the table in the lower hierarchy according to the value. Step S110: If the bit is 1 (no lower layer),
Confirm with the zip code stored at the end of the record.

In this way, the address data is divided into prefecture / city / ward / town / village name, etc., and the hierarchical data structure is adopted, so that the correspondence between the address data and the postal code is changed / expanded. Even in such a case, it is possible to cope with the change / expansion of the zip code dictionary without changing the configuration of the program. The change / expansion of the zip code dictionary here may be replacement of the FD when supplied by an FD (floppy disk) device. In the case of HD (hard disk) supply, it may be reinstalled. In addition, the flash memory that has recently become popular may be rewritten. Therefore,
By using this configuration, it is possible to sufficiently cope with the expansion of the postal code, which will be implemented in 1996.

FIG. 6 is an explanatory diagram showing a processing example 1 in which address data is divided by keywords. Next, a method for subdividing the address data into keywords (divided into prefecture / city / ward / town / town name) will be described. In order to correspond to the structure of the zip code dictionary 6, address data needs to be divided into prefecture / city / ward / country name / town / village name in the same manner as the dictionary structure. The delimiter is "~ prefecture" / "~ city" /
It is considered that the words are separated by certain words (keywords) such as "~ machi". Therefore, these keywords are detected from the character string of the address data, and the address data is divided there.

As a feature of the address description, the prefecture name,
The names are written in the order of town and village name. Therefore, when dividing the address data from the beginning, the keywords are limited as follows. Keyword for detecting the prefecture name: "Miyako"
"Road""Prefecture""Prefecture" Keywords for detecting city / district name: "City""District""County" Keywords for detecting town / town name: "Town"
"Village" Other keywords: "Chome", "street address", "go", etc.

That is, it is searched from the beginning of the buffer storing the address data whether any of the characters "tou", "road", "prefecture", and "prefecture" is present, and the searched area is designated as the prefecture name. To do. Next, "city" after that position (pointer)
Search whether there is any of the characters "ku" or "gun",
The search is performed in a procedure in which up to the searched place is the city / ward name (see FIGS. 6-1 and 6-2).

FIG. 7 is a flow chart showing the procedure of division processing of address data by keywords. Further, FIG. 8 is an explanatory diagram showing a processing example 2 in which the address data is divided by keywords. In FIG. 7, step S201: First, a pointer is set at the head of the address data buffer in order to search from the head of the address data. Step S202: It is compared whether or not the character is a keyword for detecting a prefecture name (“capital”, “road”, “prefecture”, “prefecture”). Step S203: If different, the character is determined to be a part of the prefecture name and is stored in the prefecture name storage buffer 8a. Step S204: The pointer is incremented by 1, and the process returns to step S202 to compare the next character. Further, in step S702, if it matches the keyword for searching the prefecture name, the process proceeds to the search for the city / ward name. In the example of FIG.
At this time, "Hiroshima" is stored in the prefecture name storage buffer 8a in the address data division buffer 8.

Step S205: When the prefecture name is detected in agreement with the prefecture name detection keyword, the pointer is moved up by one to skip the prefecture name detection keyword, and the next character is compared. And Step S206: It is compared whether or not the character to be compared is a keyword for city / gun name detection (“city”, “ward”, “county”). Step S207: If different, the character is determined to be a part of the city / ward county name and is stored in the city / ward county storage buffer 8b. Step S208: The pointer is incremented by 1 and the next character is compared. In step S706, if it matches with the keyword for city / district name detection, the process moves to the search for a town / village name. In the example of FIG. 8, at this time, the city / ward / gun name storage buffer 8
“Mihara” is stored in b.

Step S209: When the city / gun name is searched in agreement with the city / gun name detection keyword, the pointer is moved up by one to skip the city / gun name detection keyword and move to the next character. Is the comparison target. Step S210: It is compared whether or not the character to be compared is a keyword for detecting a town name (“town” “village”). Step S211: If different, the character is determined to be a part of the town and village name and stored in the town and village name storage buffer 8c. Step S212: The pointer is moved up by 1 and the next character is compared. In step S210, if it matches with the keyword for town name detection, the process proceeds to search for other data. In the example of FIG. 8, “Kosaka” is stored in the town and village name storage buffer 8c at this time.

Step S213: When the town name is detected in agreement with the town name detection keyword, the pointer is moved up by one to skip the town name detection keyword, and the next character is compared. Step S214: Here, it is determined whether or not the address data ends, and if it ends, the process ends. Step S215: Next, the character to be compared is a keyword word for searching other data (“chome” “address”).
"No." etc.) is compared. Step S216: If different, the character is determined to be a part of other data and stored in the other data storage buffers 8d and 8e. Step S217: The pointer is incremented by 1 and the next character is compared.

Step S218: If the keyword for detecting other data matches in step S215, there is a possibility that other data will subsequently exist. Therefore, the buffer for storing the data is changed, and the processing is performed on the address data. Continue until buffer 4 is finished. In the example of FIG. 8, at this time, "23" is stored in the other data storage buffer 8d.
9 "and" 10 "are stored in the other data storage buffer 8e. In this way, by dividing the address data by the keyword, it is possible to easily search the zip code dictionary 6 having a hierarchical structure.

However, when the address data is divided by using the keyword, if the keyword is detected from the beginning of the address data, inconvenience occurs in the case of the address data as shown in FIG. 6B. This is because the keyword "gun", which is a keyword for detecting the "country" of "Yamato Koriyama City" (reading: Yamato Koori Yamashi) in the city name, is detected. This is because the subsequent "Minosho, Yamaichi" will be divided as the name of the town. To avoid such inconvenience, when dividing address data using keywords, the keyword is not detected from the beginning direction (sentence direction) of the address data, but from the end (sentence end direction) of the address data. Propose to do detection. The flow of processing in this case is shown in FIG.

FIG. 9 is a flow chart showing the procedure for dividing the address data from the end of the sentence. First, prepare some buffers for storing other data after the town name, and number the buffers. Step S301: First, the buffer number is set. Step S302: The pointer is set at the end of the address data buffer. Step S303: Check if the character is another keyword. If they match, it is determined that the previous data is other data, and the process proceeds to step S307.

Step S307: In this case, the number is changed to change the buffer to be stored. Step S308: The matched keyword is skipped by moving the pointer down. Step S309: The data before the keyword is stored in the buffer. Step S310: Move the pointer down to step 30
Returning to 3, the next character is set as a comparison target.

Step S304: If it does not match any of the other keywords in step S303, it is checked whether or not it matches the keyword for town name detection. This is when there is no other data after the town name ("~
This is a process for dealing with address data in the case of an address ending with "town" or "to village". Step S305: If there is also a mismatch here, it is
The data is considered to be a part of the other data and is stored in the buffer for storing the other data. Step S306: The pointer is moved down, and the next character is compared.

Step S311: In step S304, if it matches the keyword for town name detection,
The pointer is moved down, the keyword for town name detection is skipped, and the next character is compared. Step S312: If they match, it is determined that the data before that is the data of the town name, and the data is stored in the buffer for the town name. Step S313: Next, it is checked whether or not the newly compared character matches the keyword for city / district name detection. If they do not match, the process returns to step S312,
It judges that the data is still the name of the town and village, and stores it in the buffer for storing the name of town and village. Step S314: When they match, the pointer is moved down, the keyword for city / district name detection is skipped, and the next character is compared. Step S315: It is judged that the data before that is the data of the city / gun name, and the data is stored in the buffer for storing the city / gun name.

Step S316: Next, it is checked whether or not the newly compared character matches the keyword for detecting the prefecture name. If they do not match, the process returns to step S315, it is determined that the data is still the city / ward name, and the data is stored in the city / gun name storage buffer. Step S318: If they match, the pointer is moved down, the keyword for detecting the prefecture name is skipped, and the next character is compared. Step S319: It is judged that the data before that is the data of the prefecture name, and it is stored in the buffer for storing the prefecture name. When the address data buffer is finished in step S317, the process is finished. FIG. 10 is an explanatory diagram showing a processing example in which the address data of FIG. 6-2 is divided from the sentence beginning direction, and FIG. 11 is an explanatory diagram showing a processing example of dividing the address data in FIG. 6-2 from the sentence end direction.

FIG. 17 is a block diagram showing a second embodiment of the present invention. In FIG. 12, 11 is a C for controlling this device.
A control unit composed of a PU, 12 is an input unit such as a keyboard for inputting address information (address data) and a series of operations, 13 is a display unit such as an LCD (liquid crystal display) device for displaying address data and a series of operations, 14 Is an external storage device such as an FD (floppy disk) device or an HD (hard disk) device for registering address data. 15a
Is a first address information dictionary that stores address data and address codes, and 15b is a second address information dictionary that stores address data and address codes of adjacent areas. Reference numeral 16 is an input buffer formed of a RAM for converting address data input by an operator (user), 17 is a learning buffer for storing information for learning address data, and 18 is an address data memory for storing address data. The control unit 11 determines the first address information dictionary 15a based on the input reading information.
And a candidate conversion means for referring to the second address information dictionary 15b to output conversion candidates of address information, a confirmation means for determining desired address information from the conversion candidates, and an input information processing means for processing each input information. Function as. The learning buffer 17 also functions as a fixed information storage unit that stores the fixed address information and its reading information for each layer.

[Dictionary Structure and Overall Processing Flow] FIG.
FIG. 3 is an explanatory diagram showing an example of the structure of an address information dictionary of the present invention. The second embodiment of the present invention will be described from the structure of the first and second address information dictionaries. As shown in FIG. 19, the conventional dictionary has a tree structure and does not have information relating to each branch data. However, as shown in FIG. It is equipped with a first address information dictionary 15a to which an address code is added, and a second address information dictionary 15b having, as adjacent information, grouped data of address data (prefectures) of adjacent areas.
This is because when the address data is input, the data of the same area is often input repeatedly, and the learning function is activated to improve the conversion efficiency.

FIG. 20 is an explanatory diagram showing an example of the structure of the learning buffer of the present invention, and FIG. 21 is an explanatory diagram showing an example of the structure of the input buffer. In FIG. 21, an input buffer 16 is a flag indicating whether the address code is a prefecture name, a city / ward group name, or a town / village name, a candidate buffer that stores a candidate code, and a search buffer display unit 1 that stores reading information of a search.
3 is composed of an input display buffer for storing the address code displayed in 3.

FIG. 22 is a flow chart showing the procedure for inputting address data. In FIG. 22, step S410: When the address data is input from the input unit 12, the control unit 11 checks whether it is a new input,
In the case of a new one, the prefecture name is input, and in the case of a correction, it is judged to what extent the data has been entered, and the place of the prefecture / city / town / village is switched and the address data in the address data memory 18 is changed. Transfer to the input buffer 16. Step S420: The control unit 11 (CPU) waits for key input. Input is made from the input unit 12.

Step S430: The control unit 11 uses the input unit 1
When the 2 key is input, the key code is determined, and if it is a character code (reading code), the character code is transferred to the search buffer in the input buffer 16. Step S440: If it is an execution key, the one being converted is confirmed. At this time, if the prefecture name is input, the flag is switched to the input of city / ward (the input state flag of the input buffer 16 is fixed). Step S450: When the conversion key is pressed, if the conversion is in progress, the next data in the candidate buffer is taken out and the candidates are displayed. Step S460: If conversion is not in progress, a candidate including the reading code in the search buffer is searched (transferred to the candidate buffer in the input buffer 16). Step S470: When reading is not input and the conversion key is pressed, a list is displayed, and when reading is input, candidates are displayed (the contents of the input buffer 16 are transferred to the display unit 13).

[Abbreviated Input Processing] As shown in the structure of the input buffer in FIG. 21, considering that the address data is in the form of a tree, it is determined which level of input processing is currently being performed, and the reading information By inputting the first character, the corresponding place name candidate is output. FIG. 23 is a flowchart showing an address data search routine. In FIG. 23, step S510: It is checked whether reading has been input to the search buffer in the input buffer 16. Step S520: Check the input flag of the input buffer 16. Step S530: The corresponding candidates are taken out from the first address information dictionary 15a and rearranged in the second address information dictionary 15b in the order in which the address codes of adjacent regions are closer. Step S
540: Transfer the result to the candidate buffer in the input buffer 16. FIG. 24 is an explanatory diagram showing an example of shortening input and conversion processing. 24-1 and 24-2, an example of candidates for prefectures, cities, and groups that have undergone conversion processing when "na", "a", and "ya" are input as the first characters of reading information Indicates. FIG. 25 is an explanatory diagram showing a comparative example of input conversion of address data. In FIG. 25, for example, in order to obtain the address data of “Minosho Town, Yamato Gunyama City, Nara Prefecture”, it is normally 22
It shows that the number of key operations is reduced to the number of 9 key operations. Therefore, unlike the conventional case, the place name reading information is not completely entered or entered in the list, so that the key operation can be greatly reduced.

[Learning Function] In general, as shown in the structure of the learning buffer in FIG. 20, the learning buffer 17 stores candidates (address data) converted and selected by the address code, and learns candidates for the converted place name. However, the learning function of the present apparatus can further output candidates by giving priority to adjacent place names in addition to the converted and selected place names. Figure 24-1,
The candidate output when the learning function operates on the shortened input shown in 24-2 is the first address information dictionary 1 as shown in FIG. 24-3.
The priority order of the candidates obtained in 5a is the second address information dictionary 15
Sorted from b. Further, FIG. 26 shows an example in which when one area (Nara prefecture) is selected, the areas are rearranged in the order close to the address code. FIG. 26 is an explanatory diagram showing an example of rearrangement processing of adjacent areas in the second address information dictionary. Therefore, when inputting address data, data of the same area is often input repeatedly, and efficient input can be performed by activating the learning function.

[Address Data Check] FIG. 27 is a flowchart showing the address data check routine.
In FIG. 27, when the address data is input, it is checked whether it is a new input or correction of the address data, and the dictionary is searched for up to what level the input is made. Step S610: For the prefecture data, it is checked whether the contents of the input buffer 16 are in the dictionary 15a. Step S620: The code corresponding to the prefecture code area of the input buffer 16 is set. Step S630: It is checked whether the contents of the input buffer 16 in the city / ward group data are in the dictionary 15a. Step S640: A code corresponding to the city / ward group code area of the input buffer 16 is set. Step S650: Input buffer 1 for town and village data
It is checked whether the contents of 6 are in the dictionary 15a. Step S660: The code corresponding to the area of the town code of the input buffer 16 is set. FIG. 28 is an explanatory diagram showing a display example of checking address data. Address data that has already been entered can be checked for each prefecture, city group, or town / village.

[Calling Operation for Same Address Data] FIG. 29 is an explanatory diagram showing an example of a calling operation for the input address data. As shown in FIG. 29, when the function key is pressed, the previous input data is transferred to the input display buffer, and the flag of the input state and the place name code are set according to the function. Therefore, it is possible to select the display level of the input address data by displaying in the function (window) to what level the data should be transferred to the input display buffer.

[0058]

According to the invention of claim 1 of the present application, the following effects can be obtained. The postal code can be easily recognized from the address data that has already been input, and the omission of the postal code is eliminated. By constructing the dictionary structure for zip code recognition similar to that published in the "Postal Guide" issued by the Ministry of Posts and Telecommunications, it is as if the "Postal Guide" was subtracted from the address data. Can recognize the number. The postal code may change from time to time, but by changing the postal code dictionary to a new one, it is possible to automatically change to the latest postal code without re-entering the address data. This can correspond to the extension of the postal code that is scheduled to be implemented in 1996 (the current maximum postal code of 5 digits is converted to a town name by a maximum of 8 digits).

According to the invention of claim 4 of the present application, the following effects can be obtained. Since the address data can be obtained by inputting the first character of the place name reading information, the conversion candidate efficiency is improved. In addition, even if the reading is difficult to understand, conversion is possible. The learning function is enabled in the case of an area stored in the back of the dictionary, and the number of times the [Convert / next candidate] key is operated can be reduced. Input / conversion can be performed from a necessary place regardless of new input and correction input. Only necessary data can be taken in, eliminating the need to erase unnecessary data. As described above, since the number of key touches is small and the input is possible, the load on the operator can be reduced and the efficiency can be improved.

[Brief description of drawings]

FIG. 1 is a block diagram showing a basic configuration of the invention of claim 1.

FIG. 2 is a block diagram showing the basic configuration of the invention of claim 4;

FIG. 3 is a block diagram showing a first embodiment of the present invention.

FIG. 4 is an explanatory diagram showing an example of the structure of a postal code dictionary.

FIG. 5 is a flowchart showing a procedure of a postal code search process.

FIG. 6 is an explanatory diagram showing a processing example 1 in which address data is divided by keywords.

FIG. 7 is a flowchart showing a procedure of division processing of address data by a keyword.

FIG. 8 is an explanatory diagram showing a second processing example in which address data is divided by keywords.

FIG. 9 is a flowchart showing a procedure of dividing address data from the end of a sentence.

FIG. 10 is an explanatory diagram showing a processing example in which the address data of FIG. 6-2 is divided from the sentence head direction.

FIG. 11 is an explanatory diagram showing a processing example in which the address data of FIG. 6B is divided from the sentence end direction.

FIG. 12 is an explanatory diagram showing the structure of a conventional postal code dictionary 1.

FIG. 13 is a display example showing a search process of address information using the conventional zip code dictionary 1.

FIG. 14 is an explanatory diagram showing a structure of a conventional zip code dictionary 2.

FIG. 15 is a display example showing a search process of address information using the conventional zip code dictionary 2.

FIG. 16 is an explanatory diagram showing a part of “Postal guide” issued by the Ministry of Posts and Telecommunications.

FIG. 17 is a block diagram showing a second embodiment of the present invention.

FIG. 18 is an explanatory diagram showing an example of the structure of the address information dictionary of the present invention.

FIG. 19 is an explanatory diagram showing an example of the structure of a conventional address information dictionary.

FIG. 20 is an explanatory diagram showing an example of a structure of a learning buffer.

FIG. 21 is an explanatory diagram showing an example of the structure of an input buffer.

FIG. 22 is a flowchart showing an input processing procedure of address data.

FIG. 23 is a flowchart showing a search routine for address data.

FIG. 24 is an explanatory diagram showing an example of shortening input and conversion processing.

FIG. 25 is an explanatory diagram showing a comparative example of input conversion of address data.

FIG. 26 is an explanatory diagram showing an example of rearrangement processing of adjacent areas in the second address information dictionary.

FIG. 27 is a flowchart showing a routine for checking address data.

FIG. 28 is an explanatory diagram illustrating a display example of checking address data.

FIG. 29 is an explanatory diagram showing an example of a calling operation of input address data.

[Explanation of symbols]

 1, 11 control unit 2, 12 input unit 3, 13 display unit 4 address data buffer 5 address data storage unit 6 postal code dictionary 7 postal code recognition unit 8 address data division buffer 9 printing unit 14 external storage device 15a first address Information dictionary 15b Second address information dictionary 16 Input buffer 17 Learning buffer 18 Address data memory

Claims (6)

[Claims] 1. An input means for inputting various instructions for inputting address information and a zip code search, a display means for displaying address information and a zip code, and an input information storage means for storing the input address information. And the address information,
A keyword for classifying each level of prefecture, city, ward, group, town, village, chome, number, and issue is provided, and an identification bit indicating whether or not the next keyword exists is added to each keyword. A zip code dictionary configured to store a zip code where it does not exist, and a keyword is read from the address information stored in the input information storage means, and is matched based on the keyword stored in the zip code dictionary and the added identification bit. A zip code recognizing means for recognizing a zip code by sequentially searching for a keyword is provided, and the zip code recognizing means automatically recognizes the zip code from already input address information and outputs it to the display means. Address information retrieval device characterized by. 2. The zip code recognizing means automatically recognizes a zip code by searching a zip code dictionary for a keyword that matches the keyword of the input address information. Address information retrieval device. 3. The zip code recognizing means, when recognizing the zip code from the input address information, searches for a keyword from the beginning or end of the address information according to the instruction of the input means. , Prefecture, prefecture, city, ward,
2. The address information search device according to claim 1, wherein each group, town, village, chome, number, and number is recognized. 4. An input means for inputting reading information or its leading characters and various instructions for searching address information, a display means for displaying the address information and the reading information, and a code for the address information together with the reading information. The first address information dictionary, which is categorized into prefectures, city / ward / town names, and town / village names and stored, and the address information of adjacent area names are coded together with their reading information to be categorized into multiple groups. Based on the second address information dictionary stored in memory and the reading information of the address input from the input means or the first character thereof.
Candidate conversion means for sequentially searching and reading out conversion candidates for each layer by referring to the address information dictionary and the second address information dictionary and outputting them to the display means, and desired address information from the conversion candidates displayed on the display means. A confirming means for confirming
The fixed address information and its reading information are provided for each layer of the fixed information storage means, the candidate conversion means, when the leading character of the reading information is input from the input means, to the leading character of the address information Whether or not the corresponding conversion candidate is stored in the confirmed information storage means is searched, and if the converted candidate is stored, the confirmed address information is read from the confirmed information storage means. If the converted candidate is not stored, the first conversion information is read. An address information search device, which reads conversion candidates from an address information dictionary and a second address information dictionary. 5. The candidate conversion means rearranges the priorities of the conversion candidates obtained in the first address information dictionary into conversion candidates of adjacent area names in the second address information dictionary, and outputs them to the display means. The address information search device according to claim 4, characterized in that. 6. An input information processing means for processing each information input from the input means is further provided, wherein the input information processing means determines the reading information of the address information when the reading information of the address information is input from the input means. By reading the reading information stored in the information storage means, it is determined whether the reading information is new reading information or correction reading information, and if it is new reading information, the reading of the prefecture name is performed. The candidate conversion means is instructed to process it as information, and when it is the correction reading information, the fixed address information is read out from the fixed information storage means for each level of prefecture name, city / ward county name, town / village name. The address information retrieval device according to claim 4, wherein the address information retrieval device outputs the information to a display means.