JP2008090334A - Location analyzer, location analyzing method, its program, and recording medium - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To automatically select and output only one of locations even when two or more locations corresponding to input address expressions exist. <P>SOLUTION: A location candidate extraction part 31 retrieves a database 1 in which only address information or the designations of facilities existing in predetermined addresses and the address information are registered for every record by using the input address expressions as keys, and extracts the address information of records including the pertinent address expressions as location candidates. A fame score calculation part 32 calculates each geographical distance between the address information of the extracted location candidates and the address information of each record in the database 1, and calculates the number of records whose geographical distances are a fixed distance or less as fame scores for every location candidate, and determines the location candidate whose fame score is the highest as a location. <P>COPYRIGHT: (C)2008,JPO&INPIT

Description

  The present invention is a location that is information (for example, address information, latitude / longitude information, etc.) representing a place corresponding to the address expression from an address expression consisting of part of the address information or the name of a facility existing at a predetermined address. Related to technology.

Conventionally, as a system for finding the location corresponding to this from the address expression, the address information input is a database in which only the address information or the name of the facility existing at the predetermined address and the address information is registered for each record. Is used as a key, and the address information of a record including the corresponding address expression is output as a location (see Patent Document 1).
JP 2001-134579 A

  By the way, there are not a few address expressions that have two or more corresponding locations. For example, there are locations in Tokyo and Osaka that correspond to address expressions consisting of part of the address information “Nihonbashi”, and locations that correspond to address expressions consisting of part of the address information “Suehirocho” are all over Japan. There are also 126 locations.

  In this case, the above-mentioned conventional system only displays a list of all the corresponding locations as candidates, and after that, the user must make a selection based on his / her own judgment. There has been a problem that it is difficult or time consuming to determine the location, that is, the target location.

  An object of the present invention is to make it possible to automatically select and output only one of the addresses even if there are two or more locations corresponding to the input address expression.

  In the present invention, in order to solve the above-mentioned problem, the address of only the address information or the name of the facility existing at the predetermined address and the address information registered for each record is referred to, and the record including the input address expression is recorded. The address information is output as a location candidate, and the number of records including address information identical and geographically close to the address information of the location candidate is output for each location candidate as a celebrity score. The location candidate having the highest reputation score is determined as the location.

  Further, in the present invention, in order to solve the above-mentioned problem, the name of the facility existing only at the address information or at the predetermined address and the database in which the address information is registered for each record are referred to, and the input address expression is included The address information of the record is output as a location candidate, and the location candidate with the nth smallest distance among the geographical distances between the address information of the location candidate and the address information of each record in the database as a celebrity score It is output every time, and among the output location candidates, the location candidate having the lowest celebrity score is determined as the location.

  According to the present invention, among the address candidates including the input address expression, a candidate whose address information includes many address information identical and geographically close to the address information is determined as the address, or the address information and the database. When there are two or more locations corresponding to the input address expression by determining the candidate having the smallest nth smallest distance among the geographical information between the address information of each record in Even so, only one of them can be automatically selected and output.

  Here, the number of records that include not only the address information of the address candidate but also the address information that is geographically close to this is used as the celebrity score, or the address information of the address candidate and the address information of each record in the database The nth smallest distance among the geographical distances between the two is used as the celebrity score, so that it is reflected in the celebrity score due to the difference in administrative divisions compared to the related prior application (Japanese Patent Application No. 2006-137660: unpublished) It is possible to reflect information that has not been made, and to obtain a more accurate reputation.

  For example, the area around Mitaka Station in Tokyo is the boundary between Mitaka City and Musashino City, and the other side across the road often has different administrative divisions. In such a case, in the previous application, the information on the other side of the road was geographically close, but became a different administrative division and was not reflected in the reputation score. In the present invention, not only the address information of the address candidate but also the address information geographically close to the address candidate is used, or the geographical distance between the address information of the address candidate and the address information of each record in the database is used. It becomes possible to obtain a reputation score that does not depend on administrative divisions.

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

<Embodiment 1>
FIG. 1 shows an example of an embodiment of the location analysis apparatus of the present invention. In the figure, 1 is a database, 2 is an address expression storage unit, 3 is a location candidate generation unit, 4 is a location candidate storage unit, A location determination unit 6 is an address expression-location association unit.

  The database 1 is at least one database in which address information and its latitude / longitude information or the name of a facility existing at a predetermined address and its address information and latitude / longitude information are registered for each record. It consists of a store database 12, a station name database 13, and a landmark database 14.

  As shown in FIG. 2, the address database 11 stores address information and its latitude / longitude information, here, address information of all of Japan and its latitude / longitude information for each record. The part where the address information is registered is called an address field, and the part where the latitude / longitude information is registered is called a latitude / longitude field. Here, the address database 11 includes addresses including addresses and issues existing all over Japan as records (for example, “Nihonbashi 1-chome xx-1 No. 1”, “Nihonbashi 1-chome xx-2 Chuo-ku, Tokyo”). ”, Etc.) along with the latitude / longitude information, or addresses up to the middle of the street, such as“ Chuo-ku, Tokyo ”or“ Chuo-ku, Tokyo ” “Nihonbashi 1-chome” and “Chuo-ku, Tokyo”) may also be registered along with the latitude and longitude information.

  As shown in FIG. 3, the store database 12 is a facility in which a facility existing at a predetermined address, here a store name (store name), its address information, and latitude / longitude information is registered for each record. In the record, the part where the store name is registered is called the store name field, the part where the address information is registered is called the address field, and the part where the latitude / longitude information is registered is called the latitude / longitude field.

  As shown in FIG. 4, the station name database 13 is a facility in which a facility existing at a predetermined address, in this case, a station name (station name), its address information, and latitude / longitude information is registered for each record. Of these, a part where a station name is registered is called a station name field, a part where address information is registered is called an address field, and a part where latitude / longitude information is registered is called a latitude / longitude field.

  As shown in FIG. 5, the landmark database 14 is a facility in which a facility existing at a predetermined address, in this case, a landmark name (landmark name), its address information, and latitude / longitude information is registered for each record. In each record, the part where the landmark name is registered is the landmark name field, the part where the address information is registered is the address field, and the part where the latitude / longitude information is registered is the latitude / longitude field. Call.

  The address expression storage unit 2 temporarily stores an address expression that is directly input from a keyboard (not shown) or the like, or read and input from a storage medium or input from another device or the like via a communication medium.

  The location candidate generation unit 3 refers to the database 1 and outputs the address information of the record including the address expression input as described above as a location candidate, and the same and geographically close address information as the address information of the location candidate. The number of records including “” is output as a famousness score for each location candidate, and more specifically, includes a location candidate extraction unit 31 and a famousity score calculation unit 32.

  The location candidate extraction unit 31 searches the database 1 using the input address expression as a key, and extracts address information and latitude / longitude information of all records including the corresponding address expression as location candidates. 1 includes a database selection unit 311 and a location information acquisition unit 312.

  The database selection unit 311 stores and holds in advance a database selection table that describes character string rules and corresponding database names and field names as shown in FIG. The addressed character string is compared with each character string rule described in the table, and if there is a matching character string rule, the database name and field name corresponding to the matching character string rule are read from the table. , And outputs the selected database name and field name to the location information acquisition unit 312.

  Here, the character string rule is to determine that the input address expression is “store name” when the character “store” exists at the end of the input address expression character string. In addition, when the character “station” is present at the end of the character string of the input address expression, the input address expression is determined to be “station name”. Accordingly, by referring to the database selection table describing the character string rule and the corresponding database name and field name as shown in FIG. 6, the database name and field name corresponding to the input address expression are obtained. It is possible to select and output.

  The database selection unit 311 is used to reduce the number of databases and fields to be searched when extracting location candidates. This database selection unit 311 is not an indispensable component and requires a large amount of calculation. You may make it search with respect to all the databases and all the fields by using the input address expression as a key.

  The location information acquisition unit 312 receives the address representation input as described above and temporarily stored in the address representation storage unit 2, and the database name and field name selected and output by the database selection unit 311 as input, and the address representation The database field corresponding to the selected database name and field name is searched from the database 1 using as a key, and the address information and latitude / longitude information of the record including the corresponding address expression are acquired as location candidates, It outputs to the score calculation part 32 and the address candidate memory | storage part 4 (however, the address candidate output to the address candidate memory | storage part 4 may be only address information).

  The celebrity score calculation unit 32 receives the address information and latitude / longitude information of the location candidate extracted and output by the location candidate extraction unit 31, and inputs the address information of the location candidate and the address information of each record in the database 1. The geographical distance between the two is calculated using the latitude and longitude information, and the number of records in which the geographical distance is less than or equal to a predetermined distance is counted. These are performed every time, and these are output to the location determination unit 5 as the famousness score for each location candidate.

Here, the geographical distance D between the address information of the candidate location and the address information of one record in the database 1 is obtained by using the latitude information N ₁ and N ₂ and the longitude information E ₁ and E _2. ,
D = {(N ₁ −N ₂ ) ² + (E ₁ −E ₂ ) ² } ^1/2
Calculate more.

  As described above, the distance D is sufficient if it can be determined from the predetermined distance (value) as described above, that is, an absolute distance value is not required. Calculation of the (1/2 power) portion may be omitted. As for this formula, a known formula for calculating the distance between two points using latitude information and longitude information, for example, “formula for calculating geodesic line length by converting latitude and longitude into plane rectangular coordinates” (BRBowring , "TOTAL INVERSE SOLUTIONS FOR THE GEODESIC AND GREAT ELLIPTIC," Survey Review, Vol.33, No.261, July 1996, pp.461-476 (http://vldb.gsi.go.jp/sokuchi/surveycalc/algorithm /) See) etc. may be used.

  A specific calculation object in the famousness score calculation unit 32 is a latitude / longitude field of all records of each database. At this time, by limiting the database to be calculated, famousity scores corresponding to various assumptions can be obtained.

  For example, if it is assumed that the number of stores is more famous, the famousness score that is higher for the location candidates with more stores can be obtained by using only the store database.

  Further, when it is assumed that the location is more famous as there are more administrative districts, the use of only the address database can obtain a reputation score that increases as the location candidate has more administrative districts.

  Furthermore, if it is assumed that the location is more famous as there are more descriptions in the WEB document, it is possible to use only the search hit document database of each address using the WEB page (not shown in FIG. 1). , A famousness score that is higher for a location candidate that has more descriptions in a WEB document can be obtained.

  Further, the famousity score calculation unit 32 does not need to perform processing such as calculating the distance to each record or counting the number of records after the location candidate is input. It is also possible to prepare a database that has been calculated and registered, and when a location candidate is input, the famousness score of the corresponding location candidate may be read from this database and output.

  The location candidate storage unit 4 temporarily stores the location candidate output from the location candidate generation unit 3 (location information acquisition unit 312 of the location candidate extraction unit 31).

  The location determination unit 5 determines a location candidate having the highest celebrity score from among the location candidates output from the location candidate generation unit 3. More specifically, the location determination unit 5 outputs the location candidate from the location candidate extraction unit 31. The location candidate temporarily stored in the unit 4 and the celebrity score output from the celebrity score calculation unit 32 are input, the location candidate having the highest celebrity score is determined as the location, and the address expression-location association unit 6 is output.

  The address expression-location associating unit 6 outputs the input address representation and the location determined by the location determining unit 5 in association with each other. More specifically, the address expression-location associating unit 6 inputs the address expression and the address temporarily as described above. The stored address representation and the location output from the location determination unit 5 are input, and the address representation and the location (address information thereof) are output in association with each other.

  In addition, when it is not necessary to output the address expression and the address in association with each other, and only the address corresponding to the input address expression needs to be output, the address determined by the address determining unit 5 is determined as the address determining unit 5. In this case, the address expression / address associating unit 6 is not necessary.

  FIG. 7 shows the flow of processing in the location analysis apparatus of the present invention. Hereinafter, the operation will be described in detail with an example.

  The address expression input as described above is stored in the address expression storage unit 2 and input to the database selection unit 311. The character string of the address expression input to the database selection unit 311 is compared with the character string rule in the database selection table stored and held in advance in the database selection unit 311 and corresponds to the matched character string rule. The database name and field name are selected, and the database name and field name are output to the location candidate acquisition unit 312 (s1).

  For example, when the address expression “Nihonbashi” is input, “address database, address field” is output as shown in FIG. When the address expression “Tokyo Tower” is input, “landmark database, landmark name field” is output as shown in FIG. When the address expression “NTT Yokosuka store” is input, “store database, store name field” is output as shown in FIG. When the address expression “Tokyo station” is input, “station name database, station name field” is output as shown in FIG.

  Next, in the address candidate acquisition unit 312, the address expression stored in the address expression storage unit 2 is read and input, and the database name and field name selected and output by the database selection unit 311 are input. Then, the database field corresponding to the selected database name and field name is searched from the database 1 using the address expression as a key, and the address information and latitude / longitude information of the record including the corresponding address expression are the location candidates. (S2) (however, the location candidate that is output and stored in the location candidate storage unit 4 may be address information alone). good.).

  For example, when the address expression is “Nihonbashi”, the selected database name is “address database (DB)”, and the selected field name is “address field”, as shown in FIG. 35.677, 139.776 ”and“ Nipponbashi, Naniwa-ku, Osaka City, Osaka, Japan…, 34.656, 135.509 ”are acquired and output as location candidates (in the case of the address database 11 shown in FIG. Strictly speaking, “Nihonbashi 1-chome, Chuo-ku, Tokyo, 35.679, 139.754” is also acquired and output as a location candidate, but is omitted here for the sake of simplicity.)

  The above processing is “location candidate extraction processing”.

  Next, when the address information and latitude / longitude information of the location candidate extracted and output by the location candidate extraction unit 31 are input to the famousity score calculation unit 32, the address information of the location candidate and each of the information in the database 1 are input. The geographical distance between the address information of the records is calculated using the latitude / longitude information, and the number of records where the geographical distance is equal to or less than a predetermined distance is counted. This processing is performed for each location candidate, and these are output to the location determination unit 5 as a famousity score for each location candidate (s3).

For example, when the location candidate is “Nihonbashi, Chuo-ku, Tokyo, 35.677, 139.776”, the geographical distance D between one record in the database 1 is the latitude / longitude of the one record. If the information is “34.123, 138.654”
D = {(35.677−34.123) ² + (139.776−138.654) ² } ^1/2
= 1.916715941
Is calculated. The calculated distance D (value) is compared with a predetermined distance (value), for example, “100”, and if it is “100” or less, the corresponding record, that is, the location candidate “Nihonbashi, Chuo-ku, Tokyo” , 35.677, 139.776 ”is counted (+1) as the number of records including address information geographically close to the address information. The same distance calculation, comparison, and counting are performed with all records in the database 1. If the final count value is 150, “150” is output as the famousity score as shown in FIG. Is done. The same processing is performed when the location candidate is “Nipponbashi, Naniwa-ku, Osaka-shi, Osaka ... 34.656, 135.509”. If the final count value is 50, as shown in FIG. “50” is output as the famousness score.

  The above processing is “location candidate generation processing”.

  Next, in the location determination unit 5, the location candidates stored in the location candidate storage unit 4 are read and input, and the famousity score calculated and output by the famousness score calculation unit 32 is input. Then, the location candidate with the highest celebrity score is determined as the location, and is output to the address expression-location association unit 6 (s4).

  For example, if the location candidates are “Nipponbashi, Chuo-ku, Tokyo” and “Nihonbashi, Naniwa-ku, Osaka, Osaka ...” and the celebrity scores are “150” and “50”, as shown in FIG. “Nihonbashi” is determined as the location and output.

  Finally, in the address expression-location associating unit 6, the address representation stored in the address representation storage unit 2 is read and input, and the location determined and output by the location determination unit 5 is input. And the address expression and the location (address information) are output in association with each other (s5).

  For example, when the address expression is “Nihonbashi” and the location is “Nihonbashi, Chuo-ku, Tokyo”, “Nihonbashi: Nihonbashi, Chuo-ku, Tokyo” is output as shown in FIG.

  Thus, according to this embodiment, even when there are two or more locations corresponding to the input address expression, only one of them can be automatically selected and output. It becomes.

  As described above, when it is not necessary to output the address expression and the address in association with each other, and only the address corresponding to the input address expression needs to be output, the address determined by the address determination process (s4). May be directly output to the outside, and in this case, the address expression / address associating process (s5) is not necessary.

<Embodiment 2>
In the second embodiment of the present invention, as shown in FIG. 13, the address information and the latitude / longitude information divided for each address level in prefectures, municipalities, towns, villages, town squares, and letters / chomes are recorded for each record. Use the address database registered in. That is, for example, if the address information of one record in the address database described in the first embodiment is “Nihonbashi, Chuo-ku, Tokyo ...”, the address information of the same record in the present embodiment is “Tokyo / city, "Chuo / Ku, Nihonbashi, ..." (However, "," is a delimiter symbol, and "/" is the character string up to the next delimiter symbol "," may or may not be in the address expression. As shown in FIG. 5), the registered address is divided into each prefecture, municipality, town, village, town large character, letter / chome address level.

  Then, in the address candidate generation unit 3 (specifically, the address candidate acquisition unit 312 of the address candidate extraction unit 31), the address field of the address database using the input address expression, here, the address expression consisting of a part of the address information as a key. , The address information of the record including the corresponding address expression is acquired, and the address information of the record satisfying the coincidence with the address expression is output together with the latitude / longitude information as a location candidate.

  According to the present embodiment, for example, an address expression is configured such that a record including address information “Highland of England ...” is extracted from the input address expression “Iran” and is generated as a location candidate. It is less likely that incorrect location candidates are generated due to simple matching of character strings.

<Embodiment 3>
In the third embodiment of the present invention, the location candidate generation unit 3 (specifically, the location candidate acquisition unit 312 of the location candidate extraction unit 31) outputs and stores the location candidate storage unit 4 and inputs it to the location determination unit 5. It is essential that latitude / longitude information is included as address candidates together with address information, and is output from the address determining unit 5 and input to the address expression-address associating unit 6, and from the address expression-address associating unit 6. It is essential that latitude / longitude information is included together with address information as a location output in association with, for example, the address expression is “Nihonbashi” and the location is “Nihonbashi, Chuo-ku, Tokyo, 35.677”. , 139.776 ”, the address expression / location associating unit 6 outputs“ Nihonbashi: Nihonbashi, Chuo-ku, Tokyo; 35.677, 139.776 ”or the like.

  According to the present embodiment, it is possible to output latitude / longitude information in addition to address information as the location corresponding to the address expression.

<Embodiment 4>
In Embodiment 4 of the present invention, the address candidate generation unit 3 refers to the database 1 and outputs the address information of the record including the input address expression as a position candidate. The nth (n is a natural number) smallest distance (value) of the geographical distance between each address in each record is output as a celebrity score for each location candidate. In the calculation unit 32, the address information and latitude / longitude information of the location candidate extracted and output by the location candidate extraction unit 31 are input, and the address information between the location candidate and the address information of each record in the database 1 is input. The geographical distance is calculated using the latitude / longitude information, and the calculated geographical distance is arranged in order from the smallest to the largest. The nth (for example, 100th) distance (value) is determined from the thing, the same processing is performed for each location candidate, and these are output to the location determination unit 5 as the famousity score for each location candidate. And

  Further, the location determination unit 5 determines a location candidate having the lowest celebrity score from among the location candidates output from the location candidate generation unit 3. More specifically, the location determination unit 5 outputs the location candidate output from the location candidate extraction unit 31. Using the location candidate temporarily stored in the candidate storage unit 4 and the celebrity score output from the celebrity score calculation unit 32 as input, the location candidate having the lowest celebrity score is determined as the location, and address expression-location correspondence It outputs to the attaching part 6, It is characterized by the above-mentioned.

  According to the present embodiment, a value greater than “0” can always be obtained as the famousness score of each location candidate (in the previous embodiments, the calculated geographical distances are all greater than a certain distance). In this case, the famousness score is “0”), and all the location candidates can be relatively compared.

  The above explanation is based on the assumption that the number of location candidates extracted by the location candidate extraction unit 31 (location candidate extraction process) is two or more. Some only exist. Therefore, after the location candidate extraction unit 31 (location candidate extraction processing), a location candidate number determination unit (location candidate number determination processing) is provided for determining whether the number of location candidates is “one” or larger than “one”. If the number of location candidates is “1”, the famousness score calculation unit 31 (famousness score calculation processing) and the location determination unit 5 (location determination processing) are skipped, and the extracted one location candidate is used as the location as it is. Or may be output in association with the address expression input by the address expression-address associating unit 6 (address expression-address associating process) (note that the number of address candidates is “0”, In other words, if no one is obtained, the fact is output from the location candidate extraction unit 31 (location candidate extraction processing), and it goes without saying that the processing ends.

  The present invention can also be realized by installing a program having the procedure shown in the flowchart of FIG. 7 through a medium or a communication line in a known computer having or connected to the database.

The block diagram which shows an example of embodiment of the location analyzer of this invention Explanatory diagram showing an example of the address database Explanatory drawing which shows an example of a store database Explanatory diagram showing an example of the station name database An explanatory diagram showing an example of a landmark database Explanatory drawing which shows an example of a database selection table Flow chart of processing in the location analysis apparatus of the present invention Explanatory drawing which shows an example of the input / output value of a database selection part Explanatory drawing which shows an example of the input / output value of a location candidate acquisition part Explanatory drawing which shows an example of the input-output value of a famousness score calculation part Explanatory drawing which shows an example of the input / output value of a location determination part Explanatory drawing which shows an example of the input-output value of an address expression-address matching part Explanatory drawing showing another example of address database

Explanation of symbols

  1: Database, 2: Address expression storage unit, 3: Location candidate generation unit, 4: Location candidate storage unit, 5: Location determination unit, 6: Address expression-location association unit, 31: Location candidate extraction unit, 32: Celebrity score calculation unit, 311: database selection unit, 312: location candidate acquisition unit, s1: database selection processing, s2: location candidate extraction processing, s3: celebrity score calculation processing, s4: location determination processing, s5: address expression -Location mapping process.

Claims (16)

In an apparatus for obtaining a location which is information representing a place corresponding to the address expression from an address expression consisting of a part of the address information or the name of a facility existing at a predetermined address,
At least one database in which only the address information or the name of the facility existing at the predetermined address and the address information are registered for each record;
With reference to the database, the address information of the record including the input address expression is output as a location candidate, and the number of records including address information identical and geographically close to the address information of the location candidate is used as a celebrity score A location candidate generator for outputting each location candidate;
A location analysis apparatus comprising: a location determination unit that determines a location candidate having the highest celebrity score among location candidates output from the location candidate generation unit. The location candidate generator
Searching the database using the input address expression as a key, and a candidate address extracting unit that extracts address information of a record including the corresponding address expression as a candidate address;
The geographical distance between the address information of the address candidate extracted by the address candidate extraction unit and the address information of each record in the database is calculated, and the record of the record whose geographical distance is equal to or less than a certain distance is calculated. The location analysis apparatus according to claim 1, further comprising a famousness score calculation unit that counts the number as a famousness score for each candidate location. In an apparatus for obtaining a location which is information representing a place corresponding to the address expression from an address expression consisting of a part of the address information or the name of a facility existing at a predetermined address,
At least one database in which only the address information or the name of the facility existing at the predetermined address and the address information are registered for each record;
With reference to the database, the address information of the record including the input address expression is output as a location candidate, and the geographical distance between the address information of the location candidate and the address information of each record in the database A location candidate generator that outputs the nth smallest distance as a celebrity score for each location candidate;
A location analysis apparatus comprising: a location determination unit that determines a location candidate having the lowest celebrity score among location candidates output from the location candidate generation unit. The location candidate generator
Searching the database using the input address expression as a key, and a candidate address extracting unit that extracts address information of a record including the corresponding address expression as a candidate address;
The geographical distance between the address information of the address candidate extracted by the address candidate extraction unit and the address information of each record in the database is calculated, and the geographical distances are arranged in order from the smallest to the largest. The location analysis device according to claim 3, further comprising: a famousity score calculation unit that determines, for each candidate location, the nth distance from the smallest one as a famousness score. Use a database with a database name that represents the contents of the database and a field name that represents the contents of the registration information.
A database corresponding to a character string rule that matches a character string included in an input address expression with reference to a database selection table describing a character string rule and a corresponding database name and field name stored in advance A database selection unit for selecting a name and a field name and outputting the selected database name and field name;
The database field corresponding to the database name and field name selected by the database selection unit is searched from the database using the input address expression as a key, and the address information of the record including the corresponding address expression is acquired as a location candidate. The location analysis device according to claim 2 or 4, wherein a location candidate extraction unit comprising a location information acquisition unit is used. Using at least one database in which the address information and its latitude / longitude information or the name of the facility existing at a given address and its address information and latitude / longitude information are registered for each record,
The location candidate extraction unit extracts latitude / longitude information as well as address information as location candidates,
The celebrity score calculation unit calculates the geographical distance between the address information of the candidate location extracted by the candidate location extraction unit and the address information of each record in the database, using the latitude / longitude information thereof. The location analysis device according to claim 2 or 4, characterized in that: Use at least a database that registers address information separated for each address level in prefectures, cities, towns, towns, towns, large letters, and letters / chomes,
The address candidate generation unit outputs address information of a record satisfying a delimiter coincidence with the address expression among records including an address expression including a part of the input address information, as the address candidate. The location analysis apparatus according to any one of 1 to 6. In a method for obtaining a location which is information representing a place corresponding to the address expression from an address expression consisting of part of the address information or the name of a facility existing at a predetermined address,
Using a computer with a database that registers only the address information or the name of the facility existing at the predetermined address and the address information for each record,
The computer
With reference to the database, the address information of the record including the input address expression is output as a location candidate, and the number of records including address information identical and geographically close to the address information of the location candidate is used as a celebrity score A candidate location generation processing step for outputting each candidate location;
A location analysis method comprising: executing a location determination processing step of determining a location candidate having the highest celebrity score as a location among the location candidates output in the location candidate generation processing step. The location candidate generation processing step
Searching the database using the input address expression as a key, and extracting the address information of the record including the corresponding address expression as a position candidate extraction process step;
A record in which the geographical distance between the address information of the address candidate extracted in the address candidate extraction processing step and the address information of each record in the database is calculated, and the geographical distance is equal to or less than a certain distance. The location analysis method according to claim 8, further comprising: a famousity score calculation processing step of counting the number of each as a famousness score for each location candidate. In a method for obtaining a location which is information representing a place corresponding to the address expression from an address expression consisting of part of the address information or the name of a facility existing at a predetermined address,
Using a computer with a database that registers only the address information or the name of the facility existing at the predetermined address and the address information for each record,
The computer
With reference to the database, the address information of the record including the input address expression is output as a location candidate, and the geographical distance between the address information of the location candidate and the address information of each record in the database A location candidate generation processing step for outputting the nth smallest distance as a celebrity score for each location candidate;
A location determination method comprising: executing a location determination processing step of determining a location candidate having the lowest celebrity score as a location among the location candidates output in the location candidate generation processing step. The location candidate generation processing step
Searching the database using the input address expression as a key, and extracting the address information of the record including the corresponding address expression as a position candidate extraction process step;
The geographical distance between the address information of the candidate address extracted in the candidate address extraction processing step and the address information of each record in the database is calculated, and the geographical distance is calculated in order from the smallest to the largest. The location analysis method according to claim 10, further comprising: a famousity score calculation processing step for determining, for each candidate location, the nth distance from the smallest one when arranged, as a famousness score. Use a database with a database name that represents the contents of the database and a field name that represents the contents of the registration information.
A database corresponding to a character string rule that matches a character string included in an input address expression with reference to a database selection table describing a character string rule and a corresponding database name and field name stored in advance A database selection processing step of selecting a name and a field name and outputting the selected database name and field name;
Search the database field corresponding to the database name and field name selected in the database selection processing step from the database using the input address expression as a key, and acquire the address information of the record including the corresponding address expression as a location candidate. The location analysis method according to claim 9 or 11, wherein a location candidate extraction processing step including a location information acquisition processing step is used. Using at least one database in which the address information and its latitude / longitude information or the name of the facility existing at a given address and its address information and latitude / longitude information are registered for each record,
In the location candidate extraction processing step, the latitude / longitude information is included together with the address information, and extracted as location candidates.
The celebrity score calculation processing step uses the geographical distance between the address information of the candidate location extracted in the candidate location extraction processing step and the address information of each record in the database, using the latitude / longitude information thereof. The location analysis method according to claim 9 or 11, characterized in that: Use at least a database that registers address information separated for each address level in prefectures, cities, towns, towns, towns, large letters, and letters / chomes,
The address candidate generation processing step outputs address information of a record satisfying a delimiter coincidence with the address expression out of records including an address expression made up of a part of the input address information as the address candidate. Item 14. The location analysis method according to any one of Items 8 to 13.   A location analysis program for causing a computer to execute each processing step of the location analysis method according to claim 8.   A computer-readable recording medium on which the location analysis program according to claim 15 is recorded.

Images