JP6578233B2 - Search system, search method, search program, recording medium - Google Patents

Description

  The present invention relates to a search system, a search method, a search program, and a recording medium, and more particularly, to a search system, a search method, a search program, and a recording medium that execute information search.

  2. Description of the Related Art Conventionally, various search systems that provide information desired by a user in response to an input of a search query have been provided.

  For example, Patent Document 1 accepts input of a plurality of character strings, specifies a combination pattern in a search field to which these character strings belong, and descends the priority according to a priority predetermined for each combination pattern. Discloses a navigation device that presents search results.

  Patent Document 2 discloses a flow evaluation apparatus for evaluating a station. In the flow evaluation apparatus, evaluation is performed using land prices around the station, evaluations of stores around the station, and the number of people getting off at the station.

Japanese Patent No. 5400179 Japanese Patent Laid-Open No. 2015-203897

  By the way, in the said patent document, there exists a problem that each station cannot be evaluated effectively as an evaluation method of a station in an area where evaluation is higher in areas such as urban areas. Therefore, a search system that can perform evaluation from a different viewpoint is desired.

  Therefore, the present invention has been made in view of the above-described demand, and when a specific place such as a station is included as a search target, a search system capable of performing evaluation from a viewpoint different from the conventional one. It is an object to provide a search method, a search program, and a recording medium.

  The search system according to an embodiment of the present invention includes a map information including a specific place name, information on the type of route connected to the place indicated by the specific place name, and evaluation information indicating an evaluation for each type of route. A storage unit that stores information, an input unit that receives an input of a keyword related to a specific place name, an acquisition unit that acquires from the map information the type of a route connected to the specific place name corresponding to the keyword received by the input unit, The identification unit that identifies the evaluation of the type of route acquired by the acquisition unit from the evaluation information, the calculation unit that calculates the importance of a specific place name based on the evaluation specified by the identification unit, and the information indicating the importance are output And an output unit.

  Thereby, the search system can output the importance according to the route (for example, the type of train entering the station or the type of road entering the intersection) as the importance related to the specific place name. it can.

It is a block diagram which shows the structure of the search system which concerns on embodiment. It is a data conceptual diagram of POI information. It is a data conceptual diagram of station information. It is a data conceptual diagram of intersection information. (A) is a data conceptual diagram of route evaluation information. (B) is a data conceptual diagram of road evaluation information. It is a flowchart which shows the search process by a search system. It is an example of the map information around a station. It is an example of the map information around an intersection. It is a block diagram which shows the structure of the search system which concerns on embodiment.

  Hereinafter, a search system according to an embodiment of the present invention will be described in detail with reference to the drawings.

<Embodiment>
<Configuration>
A search system according to an embodiment of the present invention (corresponding to 100 in FIG. 1) includes a specific place name, map information including information on the type of route connected to the place indicated by the specific place name, and each route A storage unit (equivalent to 104 in FIG. 1) that stores evaluation information indicating evaluation for each type, an input unit (equivalent to 103 in FIG. 1) that receives input of a keyword related to a specific place name, and an input unit An acquisition unit (corresponding to 105 in FIG. 1) that acquires the type of route connected to a specific place name corresponding to the received keyword from the map information, and a specification that specifies evaluation of the type of route acquired by the acquisition unit from the evaluation information Part (corresponding to 105 in FIG. 1), a calculation part (corresponding to 105 in FIG. 1) for calculating the importance of a specific place name based on the evaluation specified by the specifying part, and information indicating the importance are output Output unit (corresponding to 105 in FIG. 1) Equipped with a.

  As illustrated in FIG. 1, the search system 100 includes a receiving unit 102, a position information detection sensor 101, an input unit 103, a storage unit 104, and a CPU 105. The search system 100 is used by being mounted on, for example, a navigation system mounted on a vehicle. The search system 100 is connected to the display device 110, and a search result by the search system 100 is displayed on the display device 110.

  The position information detection sensor 101 is a sensor that acquires current position information of a vehicle on which the search system 100 is mounted. Specifically, it is realized by using a positioning system using various satellite radio waves such as GPS and GNSS, and an autonomous navigation system such as a gyroscope. At this time, the current position information includes at least latitude information and longitude information of a position where the host vehicle is present, and may include altitude information. In addition, acquisition of the current position information by the position information detection sensor 101 may be acquired by using, for example, a beacon that is installed on the traveling road and can acquire the installation position information. It is not limited. The position information detection sensor 101 sequentially (or timely) acquires the position information from the outside or the current position information measured by the positioning system, and transmits the acquired position information to the receiving unit 102 as the current position information.

  The receiving unit 102 has a function of receiving the current position information transmitted from the position information detection sensor 101 and transmitting the current position information to the CPU 105. The receiving unit 102 also has a function of executing communication with an external device, receiving new facility information, and transmitting the new facility information to the CPU 105.

  The input unit 103 receives an input from a user boarding the vehicle. The input unit 103 receives a search query input by the user with respect to the navigation system. Then, the received search query is transmitted to the CPU 105. The input unit 103 receives destination information related to the destination of the vehicle from the user and transmits it to the CPU 105.

  The storage unit 104 is a recording medium that stores various types of data including various types of programs and map information necessary for the operation of the search system 100. The storage unit 104 is realized by, for example, an HDD (Hard Disc Drive), an SSD (Solid State Drive), or the like. The storage unit 104 stores POI information 200, station information 300, intersection information 400, route evaluation information 500, and road evaluation information 510. The POI information 200 is information related to various facilities. The station information 300 is information related to the station, and includes information on routes that are in (connected to) the station. The intersection information 400 is information regarding the intersection, and includes information on roads connected to the intersection. The route evaluation information 500 is information indicating an evaluation value for each route type. The road evaluation information 510 is information indicating an evaluation value for each road type. The station information 300 and the intersection information 400 may be configured to be included in the POI information 200. Details of the POI information 200, the station information 300, the intersection information 400, the route evaluation information 500, and the road evaluation information 510 will be described later. The map information includes information indicating road connection relations, distances, shapes, connection relations and shapes between stations and routes, and information indicating the position of each POI. POI information 200, station information 300, intersection information 400 Associated.

  The CPU 105 is a processor that executes a process to be executed by the search system 100 using a program and various data stored in the storage unit 104. The CPU 105 has a function of receiving a search query from the input unit 103 and searching for a POI, and outputting information for displaying the searched POI in a predetermined order to the display device 110.

  When the CPU 105 receives a search query from the input unit 103, the CPU 105 identifies a POI that matches the search query. The CPU 105 calculates the score of the identified POI, and outputs the calculated score to the display device 110 as information for determining a display order for displaying information regarding the identified POI. The CPU 105 outputs the POI score specified based on the accepted search query as follows.

  When the search query relates to a station, the CPU 105 calculates a score as a station facility according to the type of the route entering the station. The type of route may be determined by the name of the train, may be determined by the train operator, or may be determined according to the distance traveled by the train. In the present embodiment, a case where “Shinkansen”, “JR conventional line”, and “private railway” are set as the route type will be described. CPU105 calculates a score by adding the evaluation value evaluated by the route evaluation information 500 with respect to the route as many as the number of the routes which have entered the station. For example, the CPU 105 sets the evaluation value of “Shinkansen” to “15”, “2” for the “Shinkansen” and “3” for the “JR conventional line” at the search target station. If the evaluation value of “JR conventional line” is “10”, the score S of the station is calculated as S = 15 × 2 + 10 × 3 = 60.

  In addition, when the search query relates to an intersection, the CPU 105 calculates a score according to the type of road connected to the intersection. The type of road may be determined by the name of the road, may be determined by the road width (which may be classified by physical length or may be classified by the number of lanes), and the road is a national road. You can sort by private or private road. In the present embodiment, a case where “national highway”, “other national highway”, and “private road” are set as the road type will be described. CPU105 calculates a score by adding the evaluation value evaluated by the road evaluation information 510 with respect to the road as many as the number of roads in the intersection. For example, if the “National highway” is “1”, “Other national roads” is “2”, and “Private road” is “1” at the intersection to be searched, If the evaluation value of “main road” is “15”, the evaluation value of “other national roads” is “10”, and the evaluation value of “private road” is “5”, the score S of the intersection is S = 15 × 1 + 10 × 2 + 5 X1 = 40 is calculated.

  Further, the CPU 105 calculates a score according to the distance from the current position of the POI, past search results, the number of visits of the user, and the like, although details are omitted here for POIs other than stations and intersections. When the searched POI is located within a predetermined distance (for example, within 100 m) from any station or intersection, a predetermined coefficient is applied to the score calculated for the station or intersection within the predetermined distance. The value is added to the score calculated for the POI, and the score after addition is output to the display device 110 as the POI score.

  In this way, the CPU 105 calculates the scores for all the search targets that have been searched, and outputs the scores to the display device 110. The display device 110 displays POIs including stations and intersections in order from the highest received score. Thereby, the search system 100 can display the identification information of a station in the display order based on the importance as a station facility.

<Data>
FIG. 2 is a data conceptual diagram showing a data configuration example of the POI information 200. As shown in FIG. 2, the POI information 200 is information in which a POI name 201, position information 202, and explanation information 203 are associated with each other.
The POI name 201 is information indicating the name of the POI.

  The position information 202 is information indicating the position of the corresponding POI, and includes longitude and latitude.

  The description information 203 is a description regarding the corresponding POI, and is a description as a description when presented as a search result.

  The POI information 200 may include information other than the information shown here. In addition, for example, icon information indicating the corresponding POI, a picture of the corresponding POI, and the like may be associated.

FIG. 3 is a data conceptual diagram illustrating a data configuration example of the station information 300. As illustrated in FIG. 3, the station information 300 is information in which a station name 301, position information 302, connection route information 303, and description information 304 are associated with each other.
The station name 301 is information indicating the name of the station.

  The position information 302 is information indicating the position of the corresponding station, and is composed of longitude and latitude. Here, the information is shown as one point of information, but the information indicating the position of the station may be range information.

  The connection route information 303 is information indicating the number of each route type connected to the corresponding station.

  The explanation information 304 is an explanation regarding the corresponding station, and is a sentence as an explanation when presented as a search result.

  In the example of FIG. 3, the location of “Tokyo” station is “(X1, X2)”, and there are “5 bullet trains” and “JR conventional lines” as connected routes. It can be recognized that there are “11” books and “private railway” books.

FIG. 4 is a data conceptual diagram illustrating a data configuration example of the intersection information 400. As shown in FIG. 4, the intersection information is information in which an intersection name 401, position information 402, connection route information 403, and description information 404 are associated with each other.
The intersection name 401 is information indicating the name of the intersection.

  The position information 402 is information indicating the position of the corresponding intersection, and includes longitude and latitude. Here, although shown as one point of information, the information indicating the position of the intersection may be range information.

  The connection route information 403 is information indicating the number of each route type connected to the corresponding intersection.

  The description information 304 is a description regarding the corresponding intersection, and is a description as a description when presented as a search result.

  In the example of FIG. 4, the location of the “Tokyo A” intersection is “(X1, Y1)”, and “4 national highways” and “National roads” are “ It can be recognized that “2” books and private road are “0” books.

  FIG. 5A is a data conceptual diagram showing a data configuration example of the route evaluation information 500. As shown in FIG. 5A, the route evaluation information 500 is information in which a route type 501 and an evaluation value 502 are associated with each other.

  The route type 501 is information indicating the type of route. In the present embodiment, three types of “Shinkansen”, “JR conventional line”, and “private railway” are set as route types.

  The evaluation value 502 is information indicating an evaluation value of the corresponding route, and is information indicating a numerical value used when calculating a score as a facility of the station when the corresponding route is in the station. .

  In the example of FIG. 5A, the evaluation value “15” is associated with the route “Shinkansen”, and if the “Shinkansen” is entered at the search target station, the CPU 105 When the station score is calculated, the evaluation value “15” is used.

  FIG. 5B is a data conceptual diagram showing a data configuration example of the road evaluation information 510. As shown in FIG. 5B, the road evaluation information 510 is information in which a road type 511 and an evaluation value 512 are associated with each other.

  The road type 511 is information indicating the type of road. In the present embodiment, three types of “national highway”, “other national highway”, and “private road” are set as road types. “National highway” is a road that connects major points in a region or city. “Other national roads” are national roads other than national highways. A “private road” is an area where land owned by an individual or an organization is used as a road.

  The evaluation value 512 is information indicating the evaluation value of the corresponding road, and is information indicating a numerical value used when calculating the score of the intersection when the corresponding road enters the intersection.

  In the example of FIG. 5B, the evaluation value “15” is associated with the road “National highway”, and “National highway” is entered at the intersection to be searched. When calculating the score of the intersection, the CPU 105 calculates using the evaluation value “15”.

<Operation>
FIG. 6 is a flowchart showing an operation related to the search of the search system 100.

  The input unit 103 of the search system 100 receives a search query (step S601). The input unit 103 transmits the received search query to the CPU 105.

  The CPU 105 searches the POI information 200, the station information 300, and the intersection information 400 from the search query to identify one or more search targets (step S602). Then, the CPU 105 calculates a score for each of the searched one or more search targets.

  The CPU 105 determines whether or not the search target name includes a station name depending on whether or not the search target name is registered in the station information 300 (step S603). When determining that the search target includes a station name (YES in step S603), the CPU 105 refers to the station information 300 and specifies the number of routes for each type of route entering the station (step S604). Next, the CPU 105 determines whether or not the search target station name bears the name of the area (step S605). Then, the CPU 105 calculates a station score based on the evaluation value and the number of types of routes entering the search target station, and whether the station name bears the name of the area (step S606), and step S614. Migrate to

  When the search target name does not include the station name (NO in step S603), the CPU 105 determines whether or not the search target includes the intersection name, depending on whether or not the search target name is registered in the intersection information. (Step S607).

  If the search target includes an intersection name (YES in step S607), the number of roads for each type of road connected to the intersection is specified with reference to the intersection information 400 (step S608). Next, the CPU 105 determines whether or not the intersection name to be searched bears the name of the area (step S609). Then, the CPU 105 calculates the score of the intersection based on the evaluation value and the number of types of roads entering the intersection to be searched, and whether the intersection name bears the name of the area (step S610). The process proceeds to S614.

  If the search target name does not include a station name or an intersection name (NO in step S607), the CPU 105 determines whether there is a station or an intersection within a predetermined distance from the position information of the search target (step S611).

  When the search target exists within a predetermined distance from the station or the intersection (YES in step S611), the CPU 105 considers the score calculated for the station or intersection existing within the predetermined distance, and the search target A score is calculated (step S612), and the process proceeds to step S614.

  When the search target does not exist within a predetermined distance from the station or intersection (NO in step S611), the CPU 105 calculates the search target score without considering the station or intersection score (step S613), and step S614. Migrate to

  In step S614, the CPU 105 determines whether or not scores have been calculated for all search targets searched in step S602 (step S614). If scores have not been calculated for all search targets (NO in step S614), the process returns to step S603. When the scores are calculated for all search targets (YES in step S614), the CPU 105 associates the search target identification information (for example, the name of the search target) with the calculated scores, and displays the display device 110. (Step S615), and the process ends.

  Thereby, the display apparatus 110 displays the identification information of the search target searched by the search system 100 from the search query in the order of the associated scores. At this time, the transmitted score itself may be displayed.

<About stations and connecting routes>
With reference to FIG. 7, the relationship between the station and the connection route and the calculation of the POI score in the vicinity will be described. In FIG. 7, routes 711, 713, 714 and 712, 713, 714 are connected to each other. In FIG. 7, the routes 711 and 712 are shown to be joined for easy viewing.

  FIG. 7 illustrates a part of the map information. In the case of the map information shown in FIG. 7, the station 701 includes a route 713 (route 711 and route 712) and a route 715. When calculating the score of the station 701, the route 711 and the route 701 A score in which evaluation values of 712 and the route 715 are added is calculated.

  On the other hand, when calculating the score of the station 702, the station 702 includes the route 713 (the route 711 and the route 712), and when calculating the score of the station 702, the route 711 and the route 712 are calculated. A score that takes into account the evaluation value is calculated.

  In the case of FIG. 7, POIs 721 to 724 are included, and a circle indicated by a dotted line centering on each POI indicates a range of a predetermined distance from each POI 721 to 724. In the case of POI 721 and POI 722, since the station 701 is included within a predetermined distance, the score calculated for the station 701 is added to the score of POI 721 and POI 722. In the case of POI 723, since both the station 701 and the station 702 are included, a score in which the scores calculated for the station 701 and the station 702 are added is calculated. Since no station is included within a predetermined distance from the POI 724, the score based on the station does not propagate to the POI 724 score.

<About intersections and connecting roads>
With reference to FIG. 8, the relationship between intersections and connecting roads and the calculation of POI scores in the vicinity will be described. FIG. 8 illustrates a part of the map information. In FIG. 8, the road 811, the road 812, the road 813, and the road 814 are connected to the intersection 801. When calculating the score of the intersection 801, the types of the roads 811 to 814 An evaluation value corresponding to the above is taken into account and calculated as a score. On the other hand, the road 811, the road 815, and the road 816 are connected to the intersection 802. When the score of the intersection 802 is calculated, the evaluation value according to the type of the road 811, 815, 816 is calculated. Is taken into account and calculated as a score.

  In the case of FIG. 8, POIs 821 to 824 are included, and a circle indicated by a dotted line centering on each POI indicates a range of a predetermined distance from each POI. In the case of POIs 821, 822, and 823, since the intersection 801 is included within a predetermined distance, when calculating each score, the score calculated for the intersection 801 is taken into account. On the other hand, since the intersection 801 is not included within a predetermined distance from the POI 824, the score of the intersection 801 is calculated without taking the score of the intersection 801 into account when calculating the score of the POI 824.

<Summary>
The search system 100 according to the present embodiment can calculate a score as a station facility according to the type and number of routes entering the station. In addition, the search system 100 can calculate the score of the intersection according to the type and number of roads entering the intersection. Since the importance of a station or intersection varies depending on the type of route or road entering the station or intersection, use the route type or road type as an objective index to calculate the station or intersection score. Can do. These scores can be used as indicators of the importance of stations and intersections, and the display device 110 can display them as search results in an order corresponding to the scores. Also, the POIs that exist around stations and intersections are more important due to the influence of the stations and intersections because the POIs that are near important stations and intersections are closer to the stations and intersections. Therefore, since the search system 100 according to the present embodiment can propagate the scores of nearby stations and intersections to the POI score, it is possible to provide a search result more in line with the user expected value.

<Reference example>
Although the search system according to one embodiment of the present invention has been described in the above embodiment, the idea of the present invention is not limited to this. Hereinafter, various reference examples included as the idea of the present invention will be described.

  (1) In the above embodiment, the cases of “Shinkansen”, “JR conventional line”, and “private railway” have been described as examples of the route type, but the route type is not limited to this. For example, you may classify | categorize according to route length, and you may classify | categorize according to the kind of train which drive | works a route.

  The type of train that travels along a route refers to the type according to the travel distance traveled by the train, such as “special express”, “express”, and “normal”. And in the route evaluation information 500, an evaluation value is set so that the evaluation becomes higher as a station where a train with a long traveling distance is anchored. Therefore, in this case, the evaluation value may be set so that the evaluation value of “special express”> the evaluation value of “express”> the evaluation value of “normal”.

  (2) In the above embodiment, if the search target cannot be searched in step S602, the CPU 105 outputs error information to the display device 110, and the display device 110 cannot search the search target. The error information shown may be displayed.

  (3) Although not particularly described in the above embodiment, the score calculated in steps S606, S610, and S612 may be considered with evaluation using the same elements as the score calculated in score 613. . That is, the CPU 105 may calculate a score by taking into account evaluation values based on factors such as the number of visitors at stations and intersections and the distance from the current position information.

  (4) In the above embodiment, when a station or an intersection bears the name of a region, the CPU 105 may calculate a score so that points are added as the range of the region crowned as a name increases. Good. For example, when “Ginza 1-chome” and “Ginza Station” are searched as search targets, a point may be added to “Ginza Station”. In addition, a plurality of thresholds are set for the area of the area specified by the name, points are added according to each threshold range, and the corresponding score is set as the score of the area related to the name of the station or intersection. It is good also as adding points.

  (5) The calculation formula of the score shown in the above embodiment is an example, and any calculation is possible as long as the score is calculated based on the evaluation value according to the type of the route or road entering the station or the intersection An expression may be used.

  For example, as the calculation method of the score of the station that is the search target shown in the above embodiment, an example in which the evaluation value for each route entering the station and the multiplication value of the number of the routes is totaled is shown. When a route enters a station, an evaluation value for each route may be acquired, and among those evaluation values, the highest evaluation value may be used as the score of the station. Alternatively, when a specific route is included, a fixed value may be set in advance as a score, unlike a station that does not include the specific route.

  (6) In the above embodiment, the map information is associated with the POI information 200, the station information 300, and the intersection information 400, but the map information includes the POI information 200, the station information 300, and the intersection information 400. It may be constituted by. The POI information 200 may be configured to include station information 300 and intersection information 400.

  (7) In the above embodiment, the station information 300 and the intersection information 400 show an example in which one station is registered in the station name 301 as one station, but the station information 300 and the intersection information 400 are searched. As a target, a station for each route type or an intersection name for each type of road may be held. That is, taking the station information 300 in FIG. 3 as an example, since the Tokyo station contains all of the Shinkansen, JR conventional lines, and private railways, the station information 300 is “Tokyo” (Shinkansen) ”,“ Tokyo (JR conventional line) ”, and“ Tokyo (private railway) ”may be configured to hold search target names. It may be configured to hold search target names such as “Akihabara (JR conventional line)” and “Akihabara (private railway).” The intersection name may also have the same configuration. Alternatively, a score may be calculated for an intersection according to the evaluation values of the route evaluation information 500 and the road evaluation information 510.

  (8) Although the search system 100 has been described as a so-called car navigation system used by being mounted on a vehicle in the above embodiment, this is not limited thereto. The search system 100 may be realized by, for example, a portable terminal (for example, a smartphone, a mobile phone, a portable game machine, etc.) that is used while connected to a vehicle.

  (9) In the above embodiment, each functional unit of the search system 100 is a logic circuit (hardware) formed in an integrated circuit (IC (Integrated Circuit) chip, LSI (Large Scale Integration)) or the like that realizes the function of each unit. Hardware) or a dedicated circuit, or software using a CPU (Central Processing Unit) and a memory. Each functional unit may be realized by one or a plurality of integrated circuits, and the functions of the plurality of functional units may be realized by a single integrated circuit. An LSI may be called a VLSI, a super LSI, an ultra LSI, or the like depending on the degree of integration. For example, as shown in FIG. 9, the search system 100 may include a position information detection circuit 101a, a reception circuit 102a, an input reception circuit 103a, a storage circuit 104a, and a control circuit 105a. Each circuit may correspond to each part having the same name in the above embodiment and may be configured to have a similar function. The control circuit 105a corresponds to the CPU 105 in the above embodiment.

  When each functional unit of the search system 100 is realized by software, the search system 100 reads a CPU that executes an instruction of a search program, which is software that realizes each function, and reads the search program and various data by a computer (or CPU). A ROM (Read Only Memory) or a storage device (these are referred to as “recording media”), a RAM (Random Access Memory) in which the search program is expanded, and the like are provided. The computer (or CPU) reads the search program from the recording medium and executes it to achieve the object of the present invention. As the recording medium, a “non-temporary tangible medium” such as a tape, a disk, a card, a semiconductor memory, a programmable logic circuit, or the like can be used. The search program may be supplied to the computer via any transmission medium (such as a communication network or a broadcast wave) that can transmit the search program. The present invention can also be realized in the form of a data signal embedded in a carrier wave, in which the search program is embodied by electronic transmission.

  The search program can be implemented using, for example, a script language such as ActionScript or JavaScript (registered trademark), an object-oriented programming language such as Objective-C or Java (registered trademark), or a markup language such as HTML5.

  (10) Although the present invention has been described based on the drawings and examples, it should be noted that those skilled in the art can easily make various modifications and corrections based on the present disclosure. Therefore, it should be noted that these variations and modifications are included in the scope of the present invention. For example, the functions included in each means, each step, etc. can be rearranged so that there is no logical contradiction, and a plurality of means, steps, etc. can be combined or divided into one. .

  (11) The configurations described in the above embodiments and various modifications may be combined as appropriate.

DESCRIPTION OF SYMBOLS 100 Search system 101 Position information detection sensor 102 Reception part 103 Input part 104 Storage part 105 CPU (Acquisition part, specific part, calculation part, output part, determination part, search part)

Claims (22)

A storage unit that stores a specific place name, map information including information on the type of route connected to the place indicated by the specific place name, and evaluation information indicating an evaluation for each type of route,
An input unit for receiving an input of a keyword related to the specific place name;
An acquisition unit that acquires from the map information the type of route connected to a specific place name corresponding to the keyword received by the input unit;
A specifying unit for specifying the evaluation of the type of route acquired by the acquiring unit from the evaluation information;
A calculation unit that calculates the importance of the specific place name based on the evaluation specified by the specification unit;
A search system comprising: an output unit that outputs information indicating the importance. The specific place name is a station name,
The search system according to claim 1, wherein the calculation unit calculates importance as a station facility as the specific place name.   The search system according to claim 1, wherein the specific place name is an intersection name of a road. The search system further includes:
A determination unit for determining whether or not the keyword received by the input unit includes a name of a region in a predetermined range;
When the determination unit determines that the keyword received by the input unit includes an area name within a predetermined range, the calculation unit determines the importance of the specific place name indicated by the keyword received by the input unit, The search system according to any one of claims 1 to 3, wherein the search system is calculated so as to be higher than a specific place name not including a name of an area in a predetermined range. When the calculation unit further includes a plurality of the specific place names including the keyword received by the input unit, and determines that each of the specific place names includes a predetermined range of names, the predetermined range. 5. The search system according to claim 4, wherein the importance of the specific place name is calculated so that the importance of the specific place name corresponding to a wide area increases. The map information further includes facility information about the facility,
The said calculating part further calculates the importance of the said facility included in the predetermined range from the said specific place name using the importance calculated with respect to the said specific place name. The search system of any one of -5. The input unit further accepts a character string related to a station name or an intersection name as the keyword ,
The search system further includes:
A search unit for searching the map information and outputting search result information based on the keyword ;
The search system according to claim 1, further comprising: a presentation unit that presents at least one search result information obtained for the keyword in order of the importance. A search method executed by a search method,
A storage step of storing a specific place name, map information including information on a type of route connected to the place indicated by the specific place name, and evaluation information indicating an evaluation for each type of route;
An input step of receiving an input of a keyword related to the specific place name;
An acquisition step of acquiring from the map information the type of route connected to a specific place name corresponding to the keyword received in the input step;
A specifying step for identifying an evaluation of the type of route acquired in the acquiring step from the evaluation information;
A calculation step of calculating the importance of the specific place name based on the evaluation specified in the specifying step;
An output step of outputting information indicating the degree of importance. The specific place name is a station name,
The search method according to claim 8, wherein the calculating step calculates importance as a station facility as the specific place name.   The search method according to claim 8, wherein the specific place name is an intersection name of a road. The search method further includes:
A determination step of determining whether or not the keyword received in the input step includes a name of a region in a predetermined range;
In the determination step, when it is determined that the keyword received in the input step includes a name of a region in a predetermined range, the calculation step determines the importance of the specific place name indicated by the keyword received in the input step. The search method according to any one of claims 8 to 10, wherein the calculation is performed so as to be higher than a specific place name that does not include an area name in a predetermined range. In the calculation step, when there are a plurality of the specific place names including the keyword received in the input step, and when it is determined that each of the specific place names includes a predetermined range of names, the predetermined range The search method according to claim 11, wherein the importance of the specific place name is calculated so that the importance of the specific place name corresponding to a wide area increases. The map information further includes facility information about the facility,
The search method according to any one of claims 8 to 12, wherein the calculation step further calculates the importance of the facility using the importance calculated for the station or the intersection. . The input step further accepts a character string related to a station name or an intersection name as the keyword ,
The search method further includes:
A search step of searching the map information and outputting search result information based on the keyword ;
The search method according to claim 8, further comprising a presentation step of presenting at least one search result information obtained for the keyword in order of the importance. On the computer,
A storage function for storing a specific place name, map information including information on the type of route connected to the place indicated by the specific place name, and evaluation information indicating an evaluation for each type of route;
An input function for receiving an input of a keyword related to the specific place name;
An acquisition function for acquiring, from the map information, the type of a route connected to a specific place name corresponding to the keyword received by the input function;
A specific function for identifying the evaluation of the type of route acquired by the acquisition function from the evaluation information;
A calculation function for calculating the importance of the specific place name based on the evaluation specified by the specific function;
A search program for realizing an output function for outputting information indicating the importance. The specific place name is a station name,
16. The search program according to claim 15, wherein the calculation function calculates importance as a station facility as the specific place name.   The search program according to claim 15, wherein the specific place name is a road intersection name. The search program further includes:
A determination function for determining whether or not the keyword received by the input function includes an area name in a predetermined range;
When the determination function determines that the keyword received by the input function includes a name of a region in a predetermined range, the calculation function determines the importance of the specific place name indicated by the keyword received by the input function, The search program according to any one of claims 15 to 17, wherein the search program is calculated so as to be higher than a specific place name that does not include a name of an area in a predetermined range. When the calculation function further includes a plurality of the specific place names including the keyword received by the input function, and each of the specific place names includes a predetermined range of area names, The search program according to claim 18, wherein the importance of the specific place name is calculated so that the importance of the specific place name corresponding to a wide area increases. The map information further includes facility information about the facility,
The search function according to any one of claims 15 to 19, wherein the calculation function further calculates the importance of the facility using the importance calculated for a station or an intersection. . The input function further accepts a character string related to a station name or an intersection name as the keyword ,
The search program further includes:
A search function for searching the map information and outputting search result information based on the keyword ;
The search program according to any one of claims 15 to 20, wherein a presentation function for presenting at least one search result information obtained for the keyword in order of the importance is realized. . The computer-readable recording medium which recorded the search program of any one of Claims 15-21.

Images