JP2000222408A - Information processor - Google Patents

Abstract

PROBLEM TO BE SOLVED: To make easily inputtable desired address character string data by dividing address character string data definitely inputted into address codes, storing and learning them and preferentially retrieving learned data. SOLUTION: This processor comprises a controller 101 performing the control of the entire system, an input device 102 inputting place names, a place name dictionary memory 107 storing place name data hierarchically, a retrieving means 104, and address candidate extending and generating means 105, etc. The reading of a place name inputted from the device 102 is defined as 'Takatsuka'. The means 104 performs a head coincidence retrieval of place name data for the reading from the memory 107 and obtains writing information of the 'Takatsuka' and the information of place name data, etc., existing in its upper and lower hierarchies. The means 105 extends, generates and outputs address character string data to be a possible candidate from the place name data based on information showing a hierarchical structure obtained by the means 104.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an information processing apparatus for converting and inputting a part of place name of address character string data into address character string data and inputting the same, and a method thereof.

[0002]

2. Description of the Related Art Conventionally, there has been a method in which place name data stored hierarchically in advance is automatically searched from an arbitrary place name level, and desired address character string data is collectively expanded and output.

[0003]

However, in the conventional method of collectively expanding and generating address character string data from an arbitrary place name level, a place name (for example, honmachi ( (Honmachi) etc.), when the address character string data is expanded and output, complicated operations such as narrowing down the address candidates are required to obtain desired address character string data from many address candidates.

An object of the present invention is to make it possible to easily input desired address character string data by reducing the number of address candidates as much as possible or by giving priority to the address candidates.

[0005]

In order to solve this problem, the present invention divides address character string data that has been fixed and input before into hierarchical address codes, stores and learns them, and stores and learns the next place name data. This is realized by giving priority to the address candidates when expanding the address string data from an arbitrary place name level by giving priority to this learned data at the time of searching, and by generating it. It is.

[0006]

DESCRIPTION OF THE PREFERRED EMBODIMENTS The invention according to claim 1 of the present invention is based on a means for inputting reading or notation of a place name, a means for hierarchically storing place name data, and a method for reading or noting the inputted place name. An information processing apparatus comprising means for searching the place name data from an arbitrary place name level and means for outputting the searched place name data, wherein the input place name data is hierarchically arranged from the arbitrary place name level. It has the effect of searching.

According to a second aspect of the present invention, in the information processing apparatus according to the first aspect, the means for retrieving place name data from an arbitrary place name level simultaneously includes an address code in a layer above and below the searched place name data. An information processing apparatus comprising: means for searching; and means for expanding the corresponding place name data from the upper and lower hierarchical address codes and outputting the address data. It has an effect of expanding and outputting a plurality of address character string data by a code.

According to a third aspect of the present invention, in the information processing apparatus according to the second aspect, the means for outputting the address character string data is provided when a plurality of expanded address candidates are output for the same place name. And a means for displaying a list of the address candidates, and a means for selecting desired address character string data from the displayed address candidates. Has the effect of selecting the address character string data.

According to a fourth aspect of the present invention, in the information processing apparatus according to the third aspect, the means for selecting desired address character string data from the plurality of address candidates includes a step of converting the selected address character string data into a hierarchical form. Means for dividing into place name data, means for searching for an address code of the divided place name data,
And a means for hierarchically storing the searched address code.The information code is divided into place name data from the desired address character string data which has been previously determined and input,
It has the effect of storing and learning as a hierarchical address code.

According to a fifth aspect of the present invention, in the information processing apparatus according to the fourth aspect, the means for outputting the address character string data is provided when the address codes in the upper and lower layers of the searched place name data are simultaneously searched. Means for prioritizing means for hierarchically storing the address code of the previously input address character string data and means for searching,
This has the effect of assigning priorities to address candidates when generating and expanding address character string data from an arbitrary place name level.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings.

(Embodiment 1) FIG. 1 is a configuration diagram showing an information processing apparatus according to an embodiment of the present invention.

In FIG. 1, 101 is a control device for controlling the entire system, 102 is an input device for inputting place name data, 107 is a place name dictionary memory hierarchically storing place name data, and 104 is a search for a place name dictionary memory. Address name extension generating means for expanding address character string data from the searched place name data to generate the address character string data;
103 is a display device for displaying the output address candidates, 10
Reference numeral 6 denotes an address candidate selection unit for selecting a desired address from a plurality of address candidates.

FIG. 3 is a diagram showing an example of searching for an address candidate in the embodiment. The operation of the embodiment will be described below with reference to FIGS.

It is assumed that the reading of the place name input from the input device 102 is "Tatsuka". The place name search means 104 stores the place name data corresponding to the reading "Takatsuka" in the place name dictionary memory 1.
From 07, a head match search is performed to obtain notation information for "Takatsuka" and information such as place name data in the hierarchy above and below. Based on the information indicating the hierarchical structure obtained by the place name search means 104, the address candidate expansion generation means 105 expands the place name data into candidate address character string data as shown in FIG. I do.

The method of generating place name data above and below the hierarchically stored place name data described above will be specifically described with reference to FIGS. 6, 7, 8 and 9. FIG.
Each place name data is stored separately for each level. In this embodiment, a place name corresponding to a prefecture name is level 1 place name data, a place name corresponding to a city or a district is level 2 place name data, a place name corresponding to a ward or town is a level 3 place name data, and place names belonging to Are divided into a hierarchy of level 4 character name and place name data to form a place name dictionary. FIGS. 6, 7, 8 and 9 are diagrams showing examples of the configuration of the place name dictionary memory at each level.

Each of the place name data of level 1, level 2, and level 3 is composed of an address code assigned to each level, reading of place names, and its notation data.
Level 4 character name place name data includes, in addition to the address code, the reading and the notation data, the number of address candidates to be expanded and generated from the character name and place name, and level 1 for expanding and generating a higher place name from the character name and place name. Address codes for referring to a few place name data are also provided. Here, (-1) indicates that there is no place name data corresponding to the level.

It is assumed that the place name input from the input device 102 is "katsuka". First, it is assumed that the level 4 character name and place name data in FIG. 9 is searched, and “Takaka” of the address code 12345 is searched. At this time, level 1, 2, 3
An address code for expanding and generating an address candidate from each place name is searched at the same time. 16- as the first address candidate
When the extension is generated from 523-(-1), it is searched from the address code 16 as the level 1 place name data, and 16 "Toyamaken (Toyama prefecture)" is generated as shown in the level 1 place name data of FIG. Next, the address code 523 is searched for as level 2 place name data, and 523 “name changeover (namekawa city)” is generated as shown in the level 2 place name data in FIG. Next, as level 3 place name data in FIG.
As shown in 1), it is found that there is no place name data corresponding to level 3. As described above, the address candidate “Toyama / Namekawa / Takatsuka” is expanded and generated as the first candidate. Similarly, as shown in FIG. 3, an address candidate such as “Takazuka, Nakamachi, Togashi-gun, Toyama” is expanded and generated. In addition, in order to perform a head-match search as a search method in the present embodiment, "Takatsukadai (Takatsukadai)" following the head "Takatsuka" is also searched at the same time, and as shown in FIG. Address candidates such as "Takatsukadai" are also generated at the same time. The output address candidates are displayed on the display device 103, and desired address data is selected by the address candidate selection means 106.

(Embodiment 2) FIG. 2 is a configuration diagram of an information processing apparatus according to a second embodiment of the present invention.

In FIG. 2, reference numerals 104 to 107 are the same as those in FIG. 108 is a place name data cutout means for cutting out the selected address character string data into place name data and generating an address code, and 109 is an address code hierarchical storage means for hierarchically learning and storing the cut out address codes.

The operation of this embodiment will be described with reference to FIG. 2, FIG. 4, and FIG.

When the reading "Takatsuka" is input from the input device 102, the same operation as in the first embodiment is performed until a candidate as shown in FIG. 3 as an address candidate is displayed on the display device 103. Operation.

It is assumed that “Takatsukadai, Nishi-ku, Kobe-shi, Hyogo” is selected by the address candidate selecting means 106 as the desired address data. As described in the first embodiment, FIG. 9 shows that the address code obtained by expanding the address is 28-833-1576. At this time, the place name data extracting means 108 extracts the address character string data from the selected address character string data of each layer of “Hyogo prefecture (28)”, “Kobe city (833)”, and “Nishi Ward (1576)” shown in FIG. The place name data is cut out, and the address codes corresponding to the place name data are learned and stored by the address code hierarchy storage means 109 for each hierarchy (level) as shown in FIG.

Next, it is assumed that the reading of the place name input from the input device 102 is "honmachi". As in the case of the first embodiment, as shown in FIG. 5, it is generated by expanding the place name data into address character string data that can be a candidate, and is output as an address candidate. Next, place name data stored for each level in the address code hierarchy storage means 109 is hierarchically matched with the output address code. In this case, "Hyogo prefecture (28)" has been learned as level 1 and "Kobe city (833)" has been learned as level 2 first.
In order of matching degree, "Hongo, Hyogo-ku, Kobe-shi, Hyogo", "Honcho, Himeji-shi, Hyogo", "Honcho, Akashi-shi, Hyogo"
Can be output with priority.

[0025]

As described above, according to the present invention, a place name (for example, "Honmachi") which may generate many address candidates
For example, even if the address character string data is expanded and output from (e.g.), it is complicated to narrow down the address candidates by storing and learning the information of the address data which has been fixed and input for each layer of the place name data. It is possible to automatically obtain desired address data with priority without performing a complicated operation. This learning effect can be expected to function particularly effectively when there are many opportunities to input a locally nearby address such as an address book.

[Brief description of the drawings]

FIG. 1 is a configuration diagram of an information processing apparatus according to an embodiment of the present invention;

FIG. 2 is a configuration diagram of an information processing apparatus according to a second embodiment of the present invention;

FIG. 3 is a diagram showing an example of searching for an address candidate according to the first embodiment;

FIG. 4 is a data configuration diagram of address code hierarchy storage according to the second embodiment;

FIG. 5 is a diagram showing a search example of address candidates according to the second embodiment;

FIG. 6 is a configuration diagram of level 1 place name data in a place name dictionary memory according to the present invention.

FIG. 7 is a configuration diagram of level 2 place name data in a place name dictionary memory according to the present invention.

FIG. 8 is a configuration diagram of level 3 place name data in a place name dictionary memory according to the present invention.

FIG. 9 is a configuration diagram of level 4 character name place name data of the place name dictionary memory according to the present invention.

[Explanation of symbols]

 Reference Signs List 101 control device (CPU) 102 input device 103 display device 104 place name search means 105 address candidate extension generation means 106 address candidate selection means 107 place name dictionary memory 108 place name data cutout means 109 address code hierarchy storage means

Claims (5)

[Claims] A means for inputting a reading or a notation of a place name;
An information processing apparatus comprising: means for hierarchically storing place name data; means for retrieving the place name data from an arbitrary place name level by reading or writing the input place name; and means for outputting the searched place name data. . 2. The means for retrieving place name data from an arbitrary place name level includes means for simultaneously retrieving address codes in the upper and lower layers of the retrieved place name data, and means for decompressing the corresponding place name data from the upper and lower layers of the address code. And outputting the address character string data. 3. An address character string data output means for displaying a list of address character string data when a plurality of expanded address character string data (hereinafter referred to as address candidates) are output for the same place name. 3. The information processing apparatus according to claim 2, further comprising: means for selecting desired address character string data from the displayed plurality of address candidates. 4. A means for selecting desired address character string data from a plurality of address candidates, means for dividing the selected address character string data into hierarchical place name data, and an address code of the divided place name data The information processing apparatus according to claim 3, further comprising: means for searching for an address code; and means for hierarchically storing the searched address code. 5. The method according to claim 1, wherein said means for outputting the address character string data includes a step of, when simultaneously searching for the upper and lower hierarchy address codes of the searched place name data, the address code of the previously input address character string data fixedly input. The information processing apparatus according to claim 4, further comprising: means for performing a search by giving priority to means for storing the information.