JP3199093B2 - Address information search device - Google Patents

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 for a Japanese word processor, a personal computer, etc. capable of retrieving postal codes and address information.

[0002]

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

FIG. 14 is an explanatory view showing the structure of a conventional postal code dictionary 2. As shown in FIG. As shown in FIG. 14, the address data is classified in advance by the name of prefecture, city, district, and town, and is hierarchized. There are already methods for recognizing this. FIG. 15 is a display example showing a postal code search process using the conventional postal code dictionary 2. FIG.
First, when a prefectural name to be input is selected from the prefectural name selection window, the name of the city, district and county corresponding to the prefectural name is displayed, and the selection is made.
Next, the desired city / county / county name is selected from the city / county / county name selection window, and the name of the town / village corresponding to the city / county / county name is displayed and selected. By going down the hierarchy in this way, a zip code can be searched from the selected address data.

[0004] Address data is stored in three layers (first layer: city, prefecture, prefecture, prefecture, second layer: city, county, special ward, designated city, third layer).
Layer: town / village / ward), prepare a dictionary with postal 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 that retrieves postal codes by sequentially taking up layers has been proposed (Japanese Patent Laid-Open No. 2-2899041).
Reference).

[0005] Further, as a conventional example of displaying the corresponding address information by inputting the address information reading, a Japanese word processor that inputs the same reading as the reading stored in the address information dictionary and converts the same into address data is known. It is commercially available (see Matsushita Electric U1 Pro Series instruction manual). In addition, a large number of pieces of address information are formed into a file in the form of a tree in a linear file for each address item in advance, and the first character of each of the tree-formed address characters, for example, "NA" is input using a keyboard having a full character array. Has proposed an address information input device that displays the candidate "Nara prefecture" (see Japanese Patent Application Laid-Open No. 55-74633).

[0006]

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

In Japanese Patent Application Laid-Open No. 2-28941, a postal code cannot be determined to the extent that address data is classified into three levels of prefectures, municipalities, and towns and villages. FIG.
FIG. 6 is an explanatory diagram showing a part of the “Pastal Guide” issued by the Ministry of Posts and Telecommunications. For example, as shown in FIG. 16, one postal code cannot be determined only by these three layers, but is classified by address data thereafter. For example,
Several postal codes are set under "Ashida-cho, Fukuyama". In addition, there are classifications such as "other" and "other than the above". Therefore, one postal code cannot be determined for address data that has already been entered, and a problem arises in that it is necessary to select a postal code candidate from several postal code candidates after referring to a "Passual Guide". I do.

In the Japanese word processor of the U1 pro series manufactured by Matsushita Electric, for example, it is necessary to input all the readings of place names, which is not efficient. Also, the function of narrowing down by reading must be specified after the list is displayed. 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 is necessary to input a large number of [conversion / next candidate] keys. Regardless of the new input / correction input, it is necessary to input from the prefecture name, and the efficiency has been improved. When the previously input data is used again, unnecessary data must be erased because all the previously input data is transferred.

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

[0010] The present invention has been made in view of the above circumstances, the number of input operations in the search process of postal code and address information can be greatly reduced, and the dictionary unit can be changed when the postal code is changed. It is intended to provide a simple address information search device.

[0011] The present invention provides a housing for retrieving address information.
Enter the reading information of the place or the first character of the reading information
Input means, and the address information with its read information and address code
It is classified into prefecture, city, and town names.
From the first address information dictionary stored and stored,
Reading information of the input address or the first sentence of the reading information
By referring to the first address information dictionary based on characters,
The reading information of the address or the first character of the reading information is
The corresponding address information is output as a conversion candidate for each layer.
Conversion means for converting, and the conversion output by the candidate conversion means.
Display means for displaying replacement candidates; and
Determining means for determining the desired address information from the converted conversion candidates
To learn the address information determined by the determination means.
In the address code of the determined address information,
Information storage means to store the address information and the address code of the address information
For each address, the address information of the address information
And a second address information dictionary storing grouped codes
The conversion candidate output by the candidate conversion means,
The address information of the address code stored in the fixed information storage means is
If it exists, the candidate conversion means outputs the second address
Stored in the determined information storage means while referring to the information dictionary
With the address information of the address code
The address information that is adjacent to the address information
In the order of conversion, and rearrange the address information of conversion candidates.
Providing an address information retrieval device characterized by
It is. FIG. 1 is a block diagram illustrating a basic configuration of the address information search device according to the first embodiment. As shown in FIG. 1, an address information search device according to the first embodiment includes an input unit 10 for inputting various instructions for inputting address information and searching for a postal code.
And display means 10 for displaying address information and postal code
2, input information storage means 103 for storing the input address information, and the city, road, prefecture,
A keyword for hierarchically classifying the notations of prefecture, city, ward, group, town, village, chome, address, and issue is provided, and an identification bit indicating whether or not the next keyword exists is added to each keyword. The postal code dictionary 104 configured to store the postal code where the keyword does not exist, and a keyword read out from the address information stored in the input information storage means 103 are added to the keyword stored in the postal code dictionary 104. And a postal code recognizing means 105 for recognizing postal codes by sequentially searching for matching keywords based on the identification bits.

Further, the postal code recognition means 105 is
Serial is preferably configured to output a keyword that matches the keyword on the display unit 102 the postal code automatically recognized and by searching the zip code dictionary 104 included in the address information.

The postal code recognition means 105 is
When the postal code is recognized from the address information, the input means 10
By searching for a keyword from the beginning or end of the sentence of the address information according to the instruction of 1, the administrative division city,
Road, prefecture, county, city, district, group, town, village, chome, address, issue of each
Preferably, it is configured to recognize each notation .

FIG. 2 is a block diagram showing the basic configuration of the address information search device according to the second embodiment . As shown in FIG. 2, the
The address information search device according to the second embodiment includes input means 201 for inputting reading information for searching for address information or its leading character and various instructions, display means 202 for displaying address information and its reading information, First address information dictionary 203 which codes information together with its reading information and stores the information classified into prefectures, municipalities and counties, and towns and villages.
A second address information dictionary 204 which codes address information of an adjacent area name among the address information together with the read information and stores the codes in a plurality of groups;
The conversion candidate is sequentially searched and read for each layer by referring to the first address information dictionary 203 based on the address reading information or the leading character inputted from the address 01 and the second address information.
Based on the dictionary 204, the conversion candidate
A candidate conversion unit 205 that rearranges in order and outputs it to the display unit 202; a determination unit 206 that determines desired address information from the conversion candidates displayed on the display unit 202; and a determination information storage section 207 for storing each hierarchy, the candidate converting means 2
06, when the first character of the reading information is input from the input unit 201, it is searched whether a conversion candidate corresponding to the first character of the address information is stored in the fixed information storage unit 207, and the conversion candidate is stored. If so, the fixed information storage means 20
Read address information determined from 7, the conversion candidates are Suyo configured read out a conversion candidate from the first address information dictionary 203 and the second address information dictionary 204 not stored
You.

Further, the candidate converting means 205, the probability
The priority of the obtained conversion candidates in the first address information dictionary 203 stored in the constant data memory means 207, display rearranges the order of the conversion candidates in the adjacent region name based on the second address information dictionary 204 means Preferably, it is configured to output to 202.

Further, the apparatus further comprises an input information processing means 208 for processing each information input from the input means 201, and the input information processing means 208
When the reading information of the address information is inputted from 1, the reading information stored in the fixed information storage means 207 is searched to determine whether the reading information is new reading information or correction reading information. Judgment is made, and if it is new reading information, the candidate conversion means 205 is instructed to process it as the reading information of the prefecture name. It is preferable to read out from the fixed information storage means 207 and output it to the display means 202 for each level of the ward / county name and the town / village name.

The input information processing means 208, when processing the corrected address information, specifies the name of the prefecture,
It is preferable to be configured to take in and process from an arbitrary layer of the town name.

Note that the address information search device of the first and second embodiments
As the input means 101 and 201, input devices such as a keyboard device, a pen input tablet device, a pointing device, and an OCR device are used. As the display units 102 and 202, display devices such as a CRT display device, an LCD (liquid crystal display) device, and an EL display device are used. Input information storage means 103, postal code dictionary 104, postal code recognition means 1
05, first address information dictionary 203, second address information dictionary 20
4. The candidate conversion unit 205, the determination unit 206, the determination information storage unit 207, and the input information processing unit 208
It is preferable to use a microcomputer including a U, a ROM, a RAM, and an I / O port. Input information storage means 1
03. As the fixed information storage means 207, a RAM therein is usually used. Further, as the postal code dictionary 104, the first address information dictionary 203, and the second address information dictionary 204, ROMs in them are used. Also, input information storage means 103, postal code dictionary 104, first address information dictionary 2
03, second address information dictionary 204, fixed information storage means 20
An external storage device such as an FD (floppy disk) device or an HD (hard disk) device is used to extend the storage area of the storage device 7.

[0019]

According to the present invention, the input of address data is the same.
Learning is often done by repeatedly entering local data
By using the function, efficient input can be performed.
it can. According to the address information search device of the first embodiment shown in FIG.
The keyword indicating each notation of the administrative division is read out from the address information stored in the address code 03, and a keyword matching the keyword stored in the postal code dictionary 104 and the identification bit added thereto is sequentially searched. The corresponding zip code can be automatically recognized. In addition, since the postal code is automatically recognized, omission of the postal code can be prevented. In addition, since the keyword can be searched from the beginning or end of the sentence of the address information according to the instruction of the input means 101, the function of searching for the postal code can be enhanced.

Therefore, the address information of the first embodiment shown in FIG.
According to the search device, the following operation and effect can be obtained. (1) From the address data that has already been entered,
You can easily recognize it and omit the postal code
Disappears. (2) The dictionary structure for postal code recognition is issued by the Ministry of Posts and Telecommunications.
Configuration similar to that described in the “Pastal Guide”
By building, as if drawing a "Passual Guide"
As if the postal code could be recognized from the address data
Wear. (3) Postal code may change from time to time.
Address data by changing the issue dictionary to a new one.
Automatically change to the latest zip code without having to enter it again
can do. This is expected to be implemented in 1996.
Extension of specified postal code (postal code of up to 5 digits at present)
Is converted to a symbol of the name of the town, and the maximum is 8 digits)
Can also respond.

An address information retrieval apparatus according to the second embodiment shown in FIG .
According to the above, the candidate conversion means 205 is
When the first character of the reading information is input from the, the conversion candidate corresponding to the first character of the address information is determined by the fixed information storage unit 207.
In the case where the conversion candidate is stored, the determined address information is read out from the determined information storage means 207. If the conversion candidate is not stored, the first address is stored.
Conversion candidates can be read from the address information dictionary 203 and the second address information dictionary 204 and output to the display means 202.

Further , the candidate conversion means 205 outputs the
The priority of the obtained conversion candidates in the first address information dictionary 203 stored in the constant data memory means 207, the order of the conversion candidate locality name adjacent on the basis of the second address information dictionary 204
And output it to the display means 202, so that the conversion efficiency can be improved. The input information processing means 2
08 indicates that the reading information of the address information is
When input, the reading information is new reading information
Or the reading information of the correction
In some cases, it will be processed as reading information of the prefecture name
Instructs the candidate conversion means 205, and if the
In this case, the confirmed address information is
Read from the fixed information storage means 207 for each layer of the village name
And outputs the corrected address information to the display means 202.
When processing, any prefecture, city, county, or town name
It can be captured and processed from the hierarchy.

Accordingly, the address information of the second embodiment shown in FIG.
According to the search device, the following operation and effect can be obtained. (1) By entering the first character of the place name reading information
Since conversion address data is obtained, conversion candidate efficiency is improved.
Conversion is also possible when reading is difficult to understand. (2) Learning machine in the case of the area stored behind the dictionary
Function is enabled, and the [Convert / Next candidate] key is
Can be reduced. (3) Necessary information regardless of new input and correction input
Input / conversion becomes possible from the beginning. (4) Only necessary data can be captured,
There is no need to erase unnecessary data.

[0024]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, the present invention will be described in detail based on an embodiment shown in the drawings. Note that the present invention is not limited by this. In addition, 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 description will be made assuming that it has a function of a normal Japanese word processor.

FIG. 3 is a block diagram showing Embodiment 1 of the present invention. In FIG. 3, reference numeral 1 denotes a control unit including a CPU for controlling the apparatus, 2 denotes an input unit such as a keyboard for inputting address data and a series of operations, and 3 denotes an LCD (liquid crystal display) for displaying address data and a series of operations. A display unit 4 such as a device has an address data buffer composed of a RAM for editing address data inputted by an operator (user), and an FD (Floppy) for storing address data edited by the address data buffer 4. It is an address data storage unit including an external storage device such as a (disk) device or an HD (hard disk) device.

Reference numeral 6 denotes a postal code dictionary which stores data for recognizing postal codes from input address data. Reference numeral 7 denotes a postal code recognizing unit that functions as a postal code recognizing unit for recognizing a postal code by referring to a postal code dictionary from input address data. Here, the input address data is divided by a keyword. By searching for a keyword that matches the address data in the postal code dictionary 6, the postal code is automatically recognized from the address data. Reference numeral 8 denotes an address data dividing buffer for storing the divided data when the address data is divided using the keyword. 9
Reference numeral denotes 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 postal code dictionary. Embodiment 1 of the present invention will be described from the structure of a dictionary for recognizing postal codes from address data.
In FIG. 4, how to look up this dictionary data (how to search)
Is usually structured to conform to the way people pull in the “Passal Guide (Postal Code Book)” issued by the Ministry of Posts and Telecommunications.

In this method, first, a page on which data of a prefecture is listed is searched from the name of the prefecture of the address data to be searched, and then the name of a city, district, or the like is searched. That is, structurally, it is classified and arranged for each hierarchy of prefecture name / city / ward / county / town / village name. A block of data in each layer is called a table, and one piece of data is called a record.

Here, at the head of one record, a bit is provided for identifying whether or not there is still a layer below it (a lower layer presence / absence bit). In this device, the bit is 0
Indicates that there is a lower layer, the bit is 1 and there is no lower layer. Next, the classification name (prefecture name / city / county name / town / village name) at that level is stored, and recognition is performed based on whether or not this matches the address data to be recognized. After that, if the lower layer bit is 0 (there is a lower layer), the head offset value of the table of the lower layer is stored, and if the lower layer bit is 1 (there is no lower layer), the postal offset is stored. Number data is stored.

The last record stores data for processing when the address data does not match the address data to be recognized. If the postal code is specified for an area other than the classification name (when "other than the above ..." is described in the "Pastal Guide"), the lower layer bit is set to 1 (no lower layer), The classification name is "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 determined.

FIG. 5 is a flowchart showing the procedure of the postal code search process. FIG. 5 shows processing steps for determining a postal code from address data using the postal code dictionary 6. Step S101: Record No. as a counter for searching records. Is cleared to 0. Step S102: It is determined whether the record to be searched is the last record in the table. This makes use of the fact that "FFFFFFFF" is stored in the classification name of the last record, and a determination is made based on whether the classification name is "FFFFFFFF". Step S103: If it is not the last record, the target character string in the address data is compared with the character string of the classification name in the postal code dictionary to determine whether or not they match. Here, the target character string in the address data is a character string obtained by subdividing the address data into keywords (divided into prefecture names / city / county names / town / village names) (details will be described later). Step S104: If no match, record No. Is incremented by one and compared with the next record.

Step S105: If the record is the last in step S102, the lower hierarchy presence / absence bit of the record is referred to. Step S106: If the lower hierarchy existence bit is other than 1,
It is determined that there is no corresponding data in the postal code dictionary, and an error process (display such as “not applicable”) is performed. Step S107: If the bit is 1 (there is no lower layer),
Confirm with the postal code stored at the end of the record. This process is a process for a case where a postal code is specified for an area other than the classification name (when “other than the above.” Is described in the “Portal Guide”).

Step S108: If the target character string in the address data matches the character string of the classification name in the postal code dictionary 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 stored at the end of the record (offs
et) According to the value, the table in the lower hierarchy is searched. Step S110: If the bit is 1 (there is no lower hierarchy),
Confirm with the postal code stored at the end of the record.

As described above, by dividing the address data into the names of prefectures / city / county / town / village, and adopting a hierarchical data structure, the correspondence between the address data and the postal code is changed / expanded. Even in this case, it is possible to cope with the change / extension of the zip code dictionary without changing the configuration of the program. The change / expansion of the postal code dictionary here may be replaced by an FD when the zip code is supplied by a floppy disk (FD) device. In the case of supply by HD (hard disk), it may be reinstalled. In addition, a flash memory that has recently become popular may be rewritten. Therefore,
With this configuration, it is possible to sufficiently cope with the extension of postal codes that are scheduled to 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 description will be given of a method of subdividing address data into keywords (division into prefecture names / city / county / town / town / village names) by keywords. In order to cope with the structure of the postal code dictionary 6, it is necessary to divide the address data into the names of prefectures / city / county / town as well as the dictionary structure. The delimiter is "~ prefecture" / "~ city" /
It is considered that the words are separated by certain words (keywords) such as "-town". Therefore, these keywords are detected from the character string of the address data, and the address data is divided there.

The features of the address description include the name of the prefecture,
Since the names of the towns and villages are described in this order, the keywords are limited as follows when dividing from the beginning of the address data. Keyword for detecting prefecture name: "Tokyo"
"Road", "Fu", "Prefecture" Keyword for detecting municipal name: "City", "Ward", "County" Keyword for detecting municipal name: "Town"
"Village" Other keywords: "Chome,""Address,""No.," etc.

That is, a search is made from the beginning of the buffer in which the address data is stored to determine whether any of the characters "capital", "road", "fu", and "prefecture" is present. I do. Next, the city after that position (pointer)
Search for any of the characters "ku" and "gun"
A search is performed according to a procedure in which the name up to the searched place is set as a city / ward / county name (see FIGS. 6-1 and 6-2).

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

Step S205: When the name of the prefecture matches with the keyword for detecting the name of the prefecture, the keyword for detecting the name of the prefecture is skipped by increasing the pointer by one, and the next character is compared. And Step S206: It is compared whether or not the character to be compared is a keyword for detecting a city / ward / county name (“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 / name storage buffer 8b. Step S208: Increase the pointer by one and compare the next character. In step S706, if the keyword matches the keyword for detecting the name of a city, a district, the process proceeds to a search for a town / village name. In the example of FIG. 8, at this time, the municipal county name storage buffer 8
“Mihara” is stored in b.

Step S209: After searching for a city / county / county name that matches the keyword for city / county / county name detection, the pointer is incremented by one to skip the keyword for city / county / county name detection, and the next character Is a comparison target. Step S210: A comparison is made as to whether the character to be compared is a keyword for detecting the name of a town or village ("town" or "village"). Step S211: If different, the character is judged to be a part of the town name, and is stored in the town name storage buffer 8c. Step S212: Increase the pointer by one and compare the next character. In step S210, if the keyword matches the keyword for detecting the name of the town or village, the process proceeds to another data search. In the example of FIG. 8, "Kosaka" is stored in the town name storage buffer 8c at this time.

Step S213: When the name of the town and village is detected in agreement with the keyword for town and village name detection, the keyword for town and village name detection is skipped by increasing the pointer by one, and the next character is set as a comparison target. Step S214: Here, it is determined whether or not the address data is completed, and if it is completed, the processing is completed. Step S215: The character to be compared next is a keyword word for other data search (“chome”, “address”).
"", Etc.). 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: Increase the pointer by one and compare the next character.

Step S218: In step S215, if the keyword matches another keyword for data detection, there is a possibility that another data may subsequently exist. Therefore, the buffer for storing the data is changed, and the processing is performed for address data. It continues until the buffer 4 ends. In the example of FIG. 8, at this time, "23"
9 "and" 10 "are stored in the other data storage buffer 8e. In this manner, by dividing the address data by the keyword, it is possible to easily search the postal code dictionary 6 having a hierarchical structure.

However, if the keyword is detected from the beginning of the address data when the address data is divided using the keyword, a problem occurs in the case of the address data as shown in FIG. 6B. This is because "Yamato Koriyama" (read: Yamato Koori Yamashi) is detected as "County (Gun)" which is a keyword for detecting the "County (Koori)" in the city name. This is because the following "Mino City Minozo" is divided as the town and village name. In order to avoid such inconvenience, when dividing the address data using the keyword, instead of detecting the keyword from the head direction (the head of the sentence) of the address data, the keyword is detected from the end of the address data (the end of the sentence). It is proposed to perform detection. FIG. 9 shows a processing flow in this case.

FIG. 9 is a flowchart showing a procedure for dividing the address data from the end of the sentence. First, several buffers for storing other data after the town name are prepared, and the buffers are numbered. Step S301: First, a buffer number is set. Step S302: Set a pointer at the end of the address data buffer. Step S303: Check whether 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 matching keyword is skipped by moving down the pointer. Step S309: Data before the keyword is stored in the buffer. Step S310: Decrease the pointer and step 30
Returning to 3, the next character is compared.

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

Step S311: If it is determined in step S304 that the keyword matches the keyword for detecting the name of a town or village,
The pointer is moved down, the keyword for detecting the town name 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 and village name, and the data is stored in the town and village name buffer. Step S313: It is checked whether or not the character to be newly compared matches the keyword for detecting the name of a city, a county or a county. If they do not match, the process returns to step S312,
It is determined that the data is still the data of the town name, and the data is stored in the buffer for storing the town name. Step S314: If there is a match, the pointer is moved down, the keyword for detecting the name of city / ward / county is skipped, and the next character is set as a comparison target. Step S315: It is determined that the data before that is the data of the city, district and county name, and stores the data in the buffer for storing the city, county and county name.

Step S316: Next, it is checked whether or not the newly compared character matches the keyword for detecting the name of prefecture. If they do not match, the process returns to step S315, where it is determined that the data is still the data of the city and district name, and the data is stored in the buffer for storing the city and district name. Step S318: If they match, the pointer is moved down, the keyword for detecting the name of the prefecture is skipped, and the next character is set as a comparison target. Step S319: It is determined that the data before that is the data of the prefecture name, and the data is stored in the buffer for storing the prefecture name. If the address data buffer has ended in step S317, the process ends. FIG. 10 is an explanatory diagram showing a processing example in which the address data of FIG. 6-2 is divided from the beginning of the sentence, and FIG. 11 is an explanatory diagram showing a processing example in which the address data of FIG.

FIG. 17 is a block diagram showing a second embodiment of the present invention. In FIG. 12, reference numeral 11 denotes C for controlling the apparatus.
A control unit comprising a PU; 12 an input unit such as a keyboard for inputting address information (address data) and a series of operations; 13 a display unit such as an LCD (liquid crystal display) device for displaying the address data and a series of operations; 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 storing address data and address codes, and 15b is a second address information dictionary storing address data and address codes of adjacent areas. Reference numeral 16 denotes an input buffer comprising a RAM for converting address data input by an operator (user), 17 a learning buffer for storing address data learning information, and 18 an address data memory for storing address data. The control unit 11 determines the first address information dictionary 15a from the input reading information.
Conversion means for outputting a conversion candidate for address information with reference to the second address information dictionary 15b, a determination means for determining desired address information from the conversion candidates, and an input information processing means for processing input information Function as Further, the learning buffer 17 functions as a confirmed information storage unit that stores the decided address information and its read information for each layer.

[Dictionary Structure and Overall Processing Flow] FIG.
FIG. 3 is an explanatory diagram showing an example of the structure of the address information dictionary of the present invention. Embodiment 2 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-like structure and does not have information relating to the data of the respective branches. However, as shown in FIG. And a second address information dictionary 15b having data obtained by grouping address data (prefectures) of neighboring areas as adjacent information.
This is because when inputting address data, data of the same area is often input repeatedly, and the conversion efficiency is improved by operating the learning function.

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 candidate buffer for storing a flag indicating a prefectural name, a municipal group name, or a town / village name and a candidate code, and a search buffer display unit 1 for storing search reading information.
3 comprises an input display buffer for storing an address code to be displayed.

FIG. 22 is a flowchart showing a procedure for inputting address data. In FIG. 22, Step S410: When address data is input from the input unit 12, the control unit 11 checks whether or not it is a new input,
In the case of a new one, it is determined from the input of the prefecture name, and in the case of a correction, it is determined how far the data has been input, and the input of the prefecture / city / town / village is switched. Transfer to the input buffer 16. Step S420: The control unit 11 (CPU) waits for a key input. Input is performed through the input unit 12.

Step S430: The control unit 11 determines whether the input unit 1
When the key 2 is input, the key code is determined. If the key code is a character code (reading code), the character code is transferred to a search buffer in the input buffer 16. Step S440: If it is an execution key, the one being converted is determined. At this time, if the name of the prefecture is input, the flag is switched to the input of the city, district, and count (the input state flag of the input buffer 16 is determined). Step S450: When the conversion key is pressed, if the conversion is being performed, the next data in the candidate buffer is taken out and the candidate is displayed. Step S460: If conversion is not being performed, search for a candidate including the read code in the search buffer (transfer to the candidate buffer in the input buffer 16). Step S470: If the conversion key is pressed without reading, the list is displayed, and if the 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 FIG. 21, the address buffer has a tree-like shape, and it is determined which level of input processing is currently being performed. By inputting the first character, the corresponding place name candidate is output. FIG. 23 is a flowchart showing the address data search routine. In FIG. 23, step S510: It is checked whether a 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 extracted from the first address information dictionary 15a, and are rearranged in the second address information dictionary 15b in the order of the nearest address code of the adjacent area. Step S
540: Transfer the result to a candidate buffer in the input buffer 16. FIG. 24 is an explanatory diagram showing an example of a shortened input and a conversion process. In FIGS. 24-1 and 24-2, for example, when "na", "a", and "ya" are input as the first characters of the reading information, an example of the prefecture, city, and group candidates converted Is shown. 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-cho, Yamato Gunyama-shi, Nara", usually, 22
This indicates that the number of key operations is reduced to nine key operations. Accordingly, unlike the related art, there is no need to completely input place name reading information or to input information in a list, so that key operations can be greatly reduced.

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

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

[Call operation of the same address data] FIG. 29 is an explanatory diagram showing an example of a call operation of 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 an input state flag and a place name code are set according to the function. Therefore, the function (window) indicating to what level the data is to be transferred to the input display buffer can be displayed, and the display of the input address data can be selected.

[0058]

According to the present invention, it is possible to provide an address information retrieving apparatus capable of greatly reducing the number of input operations in a postal code or address information retrieving process. Also, address data
Can be entered repeatedly for the same region
In many cases, efficient input can be achieved by using the learning function
It can be carried out.

[0059]

[Brief description of the drawings]

FIG. 1 is a block diagram illustrating a basic configuration of an address information search device according to a first embodiment .

FIG. 2 is a block diagram illustrating a basic configuration of an address information search device according to a second embodiment .

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 illustrating a procedure of a postal code search process.

FIG. 6 is an explanatory diagram showing a first processing example in which address data is divided by a keyword;

FIG. 7 is a flowchart illustrating a procedure of a process of dividing address data by a keyword.

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

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

FIG. 10 is an explanatory diagram showing an example of processing in which the address data of FIG.

FIG. 11 is an explanatory diagram showing a processing example of dividing the address data of FIG. 6-2 from the end of the sentence.

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

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

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

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

FIG. 16 is an explanatory diagram showing a part of the “Passal 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 the structure of a learning buffer.

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

FIG. 22 is a flowchart showing a procedure for inputting address data.

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

FIG. 24 is an explanatory diagram showing an example of shortened 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 a process of rearranging 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 showing a display example of address data check.

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

──────────────────────────────────────────────────続 き Continuation of the front page (56) References JP-A-57-34239 (JP, A) JP-A-2-28941 (JP, A) JP-A-55-74633 (JP, A) JP-A 63-34 91774 (JP, A) JP-A-2-309450 (JP, A) JP-A-4-278664 (JP, A) JP-A-1-293463 (JP, A) JP-A-2-52078 (JP, A) JP-A-1-214968 (JP, A) JP-A-1-214969 (JP, A) JP-A-1-214970 (JP, A) JP-A-62-226369 (JP, A) JP-A-62-166557 (JP, U) Tsuzuki Takumi, “Address Input Support System Address AID”, Electronics Life No. 724, Japan Broadcasting Publishing Association, 1992 (Heisei 04-12-01), pp. 110-112 (58) Field surveyed (Int. Cl. ⁷ , DB name) G06F 17/30 G06F 17/22 JICST file (JOIS)

Claims (1)

(57) [Claims] [Claim 1] address information address of reading information to search for or said read and input means for inputting the first character of the viewing information, together with the reading information and address code of the address information,, state, municipal district group name A first address information dictionary classified and stored in each layer of the town and village name, and the first address information dictionary based on the reading information of the address input from the input means or the first character of the reading information. By referring to the address reading information, or a candidate conversion unit that outputs address information corresponding to the first character of the reading information as a conversion candidate for each of the layers, a conversion candidate output by the candidate conversion unit. Display means for displaying, determining means for determining desired address information from the conversion candidates displayed on the display means, and learning the address information determined by the determining means,
Fixed information storage means for storing the address code of the determined address information for each of the layers; and for each address code of the address information, grouping and storing the address codes of the address information locally adjacent to the address information. A second address information dictionary, wherein, when the conversion candidate output by the candidate conversion means includes address information of the address code stored in the confirmed information storage means, the candidate conversion means includes: With reference to the second address information dictionary, the address information of the address code stored in the fixed information storage means is placed at the top, and the address information that is locally adjacent to this top address information is arranged next to the address code. Address information retrieving apparatus for reordering and outputting address information of conversion candidates.