JP4919913B2 - Operation route search apparatus and system, operation route search method, and computer program - Google Patents

Description

  The present invention relates to an operation route search technique that solves a problem on the system side due to the presence of a plurality of stations or stops having the same name, and that can realize a comfortable route search environment for a user.

  About the search technology of the optimal operation route in public transportation networks such as trains, the operation route search software `` Station Spago '' (registered trademark, which was developed by the applicant of the present application in the Showa period and gained the support of many users. Since the advent of Non-Patent Document 1), many improvements and improvements have been attempted by the hands of a plurality of enterprise engineers. Nowadays, network technologies represented by mobile terminals and Internet technologies have spread, technology for performing route guidance through a homepage (see Patent Document 1), technology for performing route search and transfer guidance through mobile mail (see Patent Document 2), etc. Has also been proposed.

"Electrical Spa" Fuunroku Amagasaki and others Nikkei Business Publications, Inc. March 20, 2006 JP 2001-331604 A JP 2006-323656 A

In the operation route search of public transportation, the search process when a departure place (departure station) and a destination (destination station) are designated is generally performed as follows.
For all routes and stations connected to the departure station, repeat the search process for the next station that minimizes the route operating cost (for example, time). Route search is performed in such a form. In the search process such as ripples, routes that do not satisfy the predetermined criteria are sequentially excluded. This is because the route is always connected at some station, and it is not practical to calculate the operation cost of the combination between all stations.
When the target station is identified during the search process, the route between the target station and the departure station is selected as a route candidate desired by the user, and a number of route candidates derived from the route are searched and stored for use. Sortable according to the search conditions specified by the user. For example, if the search condition specified by the user is the route with the shortest time, the stored patterns are sorted by time, and the route with the pattern with the shortest time is determined as the optimal route candidate. The comparison identifies some valid derivation paths and displays them on the display.

In the above search process, one of the causes for increasing the execution load is the existence of a station with the same name and a station with an abstract name.
For example, on a nationwide scale, “Fuchu” (Tokyo, Hiroshima, Tokushima), “Kobe” (Aichi, Gunma, Hyogo), “Nihonbashi” (Osaka, Tokyo), “Children's Country” ( There are stations of the same name such as Aichi Prefecture, Kanagawa Prefecture), Tokiwadai (Tokyo, Osaka Prefecture), “Urayasu” (Chiba Prefecture, Tottori Prefecture). For example, “Kujo” (Kyoto Prefecture, Osaka Prefecture, Nara Prefecture) is also an example, even if it is limited to searching for a route near the suburbs. In Japan, there are about 1,000 such stations with the same name that are considered to be unique in the region, but there are about 1,000 out of about 9,800 stations at the time of filing this application (about 10% ). Some train stations (including trams) have not only the same name, such as “in front of the stadium” (Okayama Prefecture, Kochi Prefecture), “in front of the racetrack” (Hokkaido, Fukuoka Prefecture), but there are also proper names for the land. There are many stations with abstract names such as “Prefectural Office” (Ehime Prefecture and 6 other prefectures) and “City Hall” (Aichi Prefecture and 9 other prefectures). It is more natural that there are bus stops with such abstract names at local bus stops, so if you include a bus route in the route search, the number of stations and bus stops with the same name will increase dramatically. Increase (about 10300 out of about 38000 stops (about 27%)).
For this reason, when performing a route search, it is not always possible to specify the route that the user wants by simply specifying the departure location (station / stop) and destination (station / stop). However, since it is necessary to search for a station with an abstract name, there is a serious problem that a great amount of resources are consumed for searching for a route that may actually be unnecessary, and the execution efficiency of the system is lowered.

For example, a search process specifying from Shinjuku to “Fuchu” is taken as an example.
In this search process, the search process may be performed according to the following procedure.
(1) Search for “Fuchu” in Tokyo from Shinjuku.
(2) Search for “Fuchu” in Tokushima Prefecture from Shinjuku.
(3) Search for “Fuchu” in Hiroshima from Shinjuku.
(4) A route with the lowest cost is selected from these search results.
In this case, the search process is executed three times (usually two search patterns are wasted), and the execution efficiency of the system is significantly reduced. In general, if the number of stations or stops with the same name at the departure point is m and the number of stations or stops with the same name at the destination is n, the execution efficiency is 1 / ( m * n).

In order to solve such problems, in many route search systems, a departure point (station / stop) or destination (station / stop) is input by a user, and a station with the same name but a different name (hereinafter referred to as “the same name”). If it is found that there is a different stop with the same name but different name (hereinafter sometimes referred to as “same name different stop”), inform the user to that effect and either The route search is performed after narrowing down one and confirming the intention of completion of the narrowing down (see, for example, Patent Document 3).
JP 2001-14331 A

However, the solution of the problem as in Patent Document 3 is a system in a usage environment where interactive intention confirmation is not possible or difficult to take until the route search condition input is confirmed between the route search system and the user. Remarkably powerless.
Since users usually do not know the existence of the same name different station or the same name error stop, this type of route search system is essentially a simple use environment that does not make the user aware of the above problems. It is desirable from the viewpoint of promoting the use of.

  With this background, the present invention solves the problems associated with the existence of the same name different station and the same name different stop, avoids unnecessary consumption of resources when searching for a route, and makes the user environment comfortable to the user. The main issue is to provide a route search mechanism that makes it possible.

In order to solve the above problems, the present invention provides an operation route search device, a system, an operation route search method, and a computer program.
The travel route search device of the present invention is triggered by the input of a route search condition including at least one of a departure point and a destination and one or more combinations of a departure time, an arrival time, and a search range. A route search tool that identifies the optimal route candidate according to the route search condition by repeating the search process of the next station or stop with the lowest operation cost of the route starting from the destination, and a plurality of names having the same name The name of the station or stop is set as a virtual landmark where the operation cost from the station or stop is zero, and the route search tool recognizes the set virtual landmark as the starting point or the destination. And a landmark registration tool.
The “virtual landmark” is used to treat a target that does not actually exist as if it exists, but from the viewpoint of user convenience, it may be a station name that is actually used. desirable. “Setting” means to exist in a predetermined memory area at least for a time that can be recognized by the route search tool. A “tool” is a function realization body that is formed by using a property unique to a computer resource by a program controlling the hardware resource of the computer.

  By making a virtual landmark recognized as a departure place by the route search tool, during the route search process, the virtual landmark can be used as an intermediate to immediately reduce the operation cost including multiple actual same-named stations or stops with the same name. Since the comparison is possible, useless expansion of the search range can be prevented. In addition, since there is no need to consider the existence of the same name and different station, the system design (for example, program development, preparation of necessary hardware, etc.) is simplified and automatic recognition and automatic execution of route search conditions. This makes it possible to realize an operation route search device with excellent operability for the user.

  Another travel route search device according to the present invention is the above travel route search device, further comprising interface means that enables communication with an information terminal operated by a user, a word or phrase, and the route search tool can be recognized. A rule table in which correspondence rules with the route search conditions are recorded, and a natural language process is performed on the request sentence composed of the natural language received through the interface means, whereby a word or phrase included in the request sentence is obtained. A user operates a natural language processing tool to be extracted, a conversion tool that converts a word or phrase extracted by the natural language processing tool into the route search condition according to the rule table, and a route terminal condition converted by the conversion tool. Input to the route search tool without the need for the optimal route candidate specified by the route search tool. Only taken, an apparatus having a control means for the received optimal path candidate viewable in said information terminal via said interface means.

Natural language processing is processing for extracting meaningful words or phrases by recognizing the contents of natural language that humans use on a daily basis. Even with a simple method of requesting a route search with a request sentence in such a natural language, the system side extracts words or phrases included in the request sentence with a natural language processing tool, and a route search condition is set with a conversion tool. Since the route search result is received from the route search tool after conversion, a route search use environment that is comfortable for the user can be realized in a concrete and real manner.
The request sentence may have any data structure as long as the system can analyze the semantic content of the text sentence, HTML, or the like. It is desirable that the information received by the user from the route search tool includes a sentence composed of a natural language.

An operation route search system according to the present invention is an operation route search system connected to a network that can be accessed by a plurality of information terminals and a mail server, and includes a first server and one or more second servers. The
The first server includes the above-described route search tool and virtual landmark registration tool, and the second server includes the interface unit, rule table, natural language processing tool, conversion tool, and control unit described above. It is what has.
In such a route search system, for example, by optimizing the execution load associated with the route search in the first server, the execution load of the second server as a window from the user, and the number of received request sentences. An efficient route search environment can be realized.

  An operation route search method according to the present invention is an operation route search method executed by an apparatus including the above-described route search tool and an interface unit with an information terminal operated by a user, and a plurality of stations having the same name or For the stop, the name is set as a virtual landmark where the operation cost from the station or the stop is zero, and the route search tool recognizes the set virtual landmark as the departure place or the destination and use When a request sentence input by a person in natural language through an information terminal is received through the interface means, a natural language process is performed on the received text sentence by a natural language processing tool, so that a word included in the request sentence or The process of extracting a phrase, and the extracted word or phrase, the correspondence rule between the word or phrase and the route search condition was recorded in advance A process of converting to the route search condition according to a route table, and the converted route terminal condition is input to the route search tool without requiring an operation by the user, and the optimum route candidate identified thereby is input to the route search tool. And receiving the received optimum route candidate in a form that can be displayed on the information terminal via the interface means.

  The computer program of the present invention is a computer program for route search, which causes a computer to function as the above-described route search tool and virtual landmark registration tool.

  According to the present invention, by setting a virtual landmark and recognizing it as a departure place or the like in the route search tool, problems associated with the existence of the same name different station or the same name different stop are solved. In addition, when a departure place or the like includes a station with the same name or a station with the same name, it is not necessary for the user to narrow down any one, and the system design can be simplified. Furthermore, since wasteful use of resources during route search is avoided, the execution load during route search is greatly reduced. Since the problems associated with the existence of the same name different station and the same name different stop are solved, it is also possible to specifically realize a use environment that is comfortable for the user, for example, a route search in a text sentence in a natural language.

  Hereinafter, an embodiment will be described in which the present invention is applied to a network type operation route search system that enables a route search service for portable terminals.

  FIG. 1 is an overall configuration diagram of an operation route search system of this embodiment, and only characteristic portions are posted. This route search system includes a route search server 10 connected to a digital network N such as the Internet, and one or a plurality of mobile service servers 20 (one in the illustrated example). To the digital network N, a mail server 60 and a personal computer (PC) as an example of an information terminal can be connected. The portable terminal 50, which is another example of the information terminal, can be connected to the digital network N directly if it has data communication and data processing functions, and via the mail server 60 if it has only the mail function. .

[Route search server]
The route search server 10 is realized by the cooperation of the server body and the computer program of the present invention. That is, when the server body reads and executes the computer program, the server body functions as the data communication interface 100, the route search tool 110, and the virtual landmark registration tool 120, and information for route search is obtained. Make the process executable.

  The data communication interface 100 enables bidirectional communication with the portable terminal 50 and the PC 70 having data communication and data processing functions, and provides a hierarchical page screen that can be browsed by these information terminals. This hierarchical page screen is used to provide a web service for route search, and it is possible to interactively specify route search conditions interactively between the system side and the user so that a route search that satisfies the user can be performed. Provide an environment to do. The route search result information can also be displayed on this page screen.

  The route search tool 110 includes an operation information DB 111 (DB is an abbreviation of database, the same applies hereinafter) 111 and a route search engine 112 that store data such as routes of transportation facilities (railways / buses), timetables, and the like. When the conditions are entered, the route search engine 112 uses the information stored in the operation information DB 111 to search for the next station or stop where the route operation cost is the lowest, By repeating in a chain like a ripple, the optimum route candidate according to the route search condition is specified. “Operating cost” is usually for time, but distance and fare may be used, or a combination of these may be used. The route search tool 110 is also equipped with an inference engine, and if it becomes clear that the route becomes unrealistic during the search, the route search tool 110 stops the search after the next station on the route.

  As route search conditions, identification of the optimum route candidate between the departure point and the destination, identification of a station or stop within a certain range from the departure point, identification of a station or stop reaching the destination within a predetermined time, A combination of departure time, arrival time, search range, and the like. As the basic function portion of the route search tool 110, for example, the route search software “Electric Spa” (registered trademark) provided by the applicant of the present application can be used.

  FIG. 2 is a diagram showing a state of the search in the case of performing the most general search processing by the route search tool 110, that is, specifying the optimum route candidate between the departure point and the destination. The example shown in the figure is a very short section between Higashi-Koenji Station and Koenji Station in Tokyo, but it shows that a huge number of routes exist in such a short section.

The virtual landmark registration tool 120 sets the station name or stop name of the same name different station (in the case of a railway line) and the same name different stop (in the case of a bus route) as a virtual landmark in a station or a stop, The route search tool 110 is made to recognize as a starting point or a destination. Since it does not actually exist, the operation cost from the virtual landmark to each station or stop is set to zero, that is, when the operation cost is regarded as time, it is set to 0 minute on foot.
The virtual landmark registration tool 120 is activated under the instruction when the route search tool 110 detects a station with the same name in the course of performing the route search, and sets a virtual landmark each time. However, it may be registered in advance in the virtual landmark DB 122 via the registration unit 121 that accepts registration of settings from the outside, and the route search engine 112 searches as needed to set the obtained one. . When setting each time, a virtual landmark that has been newly set once is registered in the virtual landmark DB 122.

  As an example, the above-mentioned “Fuchu” is set as a virtual landmark, and it is set as a 0-minute walk from the existing Fuchu Station in Tokyo, Fuchu Station in Hiroshima Prefecture, and Fuchu Station in Tokushima Prefecture. The meaning in the route search of handling as a place or destination will be described in more detail.

FIG. 3A shows an example in which a virtual landmark (“Fuchu”) is recognized as a departure place. A range search for searching for a station or a stop within the required time from the departure point may be performed, but here, it is assumed that “Koenji” in Tokyo is recognized as the destination.
In this case, the route search tool 110 operates at the operation cost to the next station starting from Fuchu Station in Tokyo, Fuchu Station in Tokushima Prefecture, or Fuchu Station in Hiroshima Prefecture, which is associated with zero operation cost (0 minutes on foot). First, calculate. The operation cost after the next station starting from the other two stations excluding Fuchu Station in Tokyo is not realistic because the operation time to “Koenji” exceeds tens of hours at this point. Are immediately excluded from the candidate route to be searched (broken line in the figure). Therefore, it is possible to shift to only the next route search connected to Fuchu Station in Tokyo without wasting resources any more. The number of stations is enormous, so if there are no virtual landmarks, the resources that are reduced compared to the conventional method that repeats the search after the next station connected to Fuchu Station in Tokushima Prefecture and Fuchu Station in Hiroshima Prefecture are measured. Bigger than you know.

  This feature becomes more prominent when a virtual landmark (“Fuchu”) is recognized as a destination as shown in FIG. That is, the route connecting to the latter two stations is immediately excluded simply by comparing the operation costs of the section immediately before the route search with the Fuchu Station in Tokyo, the Fuchu Station in Tokushima Prefecture, and the Fuchu Station in Hiroshima Prefecture.

  In this way, in the route search, since it is possible to immediately compare the operation cost between a plurality of existing stations or stops through virtual landmarks, quickly identify the route that the user is most likely to need, Can be returned to the user. The system design is remarkably simplified because it is not necessary to confirm with the user each station to identify the station with the same name, and the user is also aware of the station with the same name that exists in other areas. It is possible to specify the name of a station that is used regularly, so even if it is difficult to interactively confirm with the user until the input of route search conditions is confirmed, it is possible to operate even in difficult usage environments. Route search can be executed. An environment for automatic input / execution of route search conditions can also be realized by using this virtual landmark with no operation cost.

  Note that the virtual landmark is a landmark registration function that is used in many route search systems in that it performs search processing on the assumption that a target (landmark) such as a station or stop that does not actually exist exists. It should be noted that it differs from the landmarks that are handled. The well-known landmark registration function uses existing facilities as landmarks and registers them in advance by associating them with transportation such as the nearest station and walking. It is used to select the optimal route when there are multiple required stations and nearest stations.

[Mobile service server]
Since the route search server 10 according to the present embodiment has an environment for automatic input / execution of route search conditions, the mobile service server 20 cooperates with the route search server 10 to use the mobile terminal 50 arbitrarily. Route search service from a particular location, especially a route search service in natural language using e-mail as a transmission medium.

  Similar to the route search server 10, the mobile service server 20 is realized by cooperation between the server body and a computer program. That is, the server body reads and executes the computer program, thereby causing the server body to function as the mobile terminal interface 200, the service control unit 210 having the editing unit 211, and the search condition input unit 220. The search condition input unit 220 includes a rule table 221, a natural language processing tool 222, and a conversion tool 223.

  The mobile terminal interface 200 enables two-way communication by electronic mail with the mobile terminal 50 via the mail server 60 connected to the digital network N. It is distinguished from the data communication interface 100 in that only e-mail is accepted.

  In the search condition input unit 220, the rule table 221 records correspondence rules between words or phrases and route search conditions that the route search tool 110 can recognize. As shown in part of FIG. 4, for example, the correspondence rule here is such that the departure place for the words “from OO (station)” or “to XX (station)” is “XX”. It is. The same rule table is prepared for each of the destination, departure time, arrival time, required time, and required distance. In addition, a condition rule transmitted to the route search tool 110 together with the execution request, that is, when only two station names are input, search for an average route between the stations, and when a combination of two station names and departure times, search for the passage time of each route, In the case of a combination of two station names and arrival times, search for the time of each route when arriving before the arrival time, and for one station name and required time, search for a range when the station is the departure station (departure station Search for a station that can be reached within the required time) is also prepared as a corresponding rule.

The natural language processing tool 222 extracts a word or a phrase included in the requested sentence by performing natural language processing on the requested sentence composed of the natural language received through the mobile terminal interface 200. As the natural language processing tool 222, for example, “L-navi (natural language interface embedded development kit)” sold by SET Software Co., Ltd. can be used.
The conversion tool 223 converts the word or phrase extracted by the natural language processing tool 222 into a route search condition according to the rule table 221.

  The service control unit 210 controls various operations in the entire mobile service server 20. For example, when the mobile terminal interface 200 detects that an e-mail has been received from the mobile terminal 50, the search condition input unit 220 is controlled to extract a part including the route search condition from the request text in the e-mail, The extracted route search condition is input to the route search tool 110 without requiring any operation by the user. That is, it is an automatic input / automatic execution request. When the optimum route candidate is specified by the route search tool 110, it is received from the route search tool 110, and the received optimum route candidate is edited into electronic information having a size that can be displayed on the display of the portable terminal 50 by the editing unit 211. . Then, by controlling the mobile terminal interface 200, the edited electronic information is returned to the mobile terminal 50 that is the transmission source of the electronic mail via the mail server 60 and displayed. Electronic information includes sentences consisting of natural language. This sentence is a text sentence, HTML, or other data structure that can be easily understood by the user. It may contain images. When only a text sentence or HTML is used, the processing load is reduced, so that a quicker response is possible.

[Operational form]
Next, an operation mode example of the operation route search system of this embodiment will be described.
Here, an example of providing a mobile route search service to a user will be described. The mobile route search service is a service that allows the user to receive a service route search service by e-mail by operating the mobile terminal 50. This service is led by the mobile service server 20.

FIG. 5 is a diagram illustrating a control procedure of the service control unit 210 in the mobile service server 20.
The user requests a route search by electronic mail. Here, as an example, as shown in FIG. 6 (a), a request sentence with the content “Please tell us the route from Omiya to Shinjuku via Kiyosato on December 25, 13:00” Suppose that it is sent by e-mail to a dedicated address of the route search system.

  When the service control unit 210 receives this e-mail (step S101: Yes), the service control unit 210 records the mail address of the sender in an address memory (not shown) (step S102). The natural language processing tool 222 is activated to analyze a mail sentence (request sentence) and extract a phrase by natural language processing (step 103). In the example shown in the figure, there is no same name different station or same name different stop, but if these are included in the request text, they are extracted as they are. The conversion tool 223 is activated to generate a route search condition based on the extracted word and the rule table 221 (step S104). The generated route search conditions are automatically input to the route search tool 110, and automatic execution is requested (step S105).

The route search tool 110 receives the route search condition and the automatic execution request, and starts a process for searching for an optimum route candidate according to the route search condition. The reason for selecting “optimum route candidate” instead of “optimum route” is that it is the user who determines whether or not it is optimal. Since the route search condition includes at least one of the departure point and the destination, the route search tool 110 refers to the virtual landmark DB 122 when starting the search, and the virtual landmark is registered for the departure point and the like. Check if it has been.
In the case of this example, there is no station with the same name, but if it exists and is registered as a virtual landmark, it is recognized as a departure place or the like. Even if it does not exist, if it is found that it is the same name and different station at the start of the search, a virtual landmark is set, and after setting, it is registered in the virtual landmark DB 122.

  When the search result is received from the route search tool 110 (step S106: Yes), the service control unit 210 edits information including the route search result for e-mail addressed to the mobile terminal (step S107). That is, unlike the display of the PC 70 or the like, the display of the portable terminal 50 is small and the resolution is low, so that unnecessary information can be removed and displayed on one screen as much as possible with as few packets as possible, but the necessary information is Edit to include. Thereafter, the sender mail address is read (step S108), and the edited route search result information is sent to the sender mail address (step S109).

  The portable terminal 50 displays the route search result information edited in this way on the display. FIG. 6B shows an example of contents displayed in the case of this example. As shown in the figure, in this example, the amount of information is large, so it is edited in a text sentence, but images or figures are included depending on the amount of information or when there is an explicit designation by the user. Is possible.

  As described above, in the operation route search system of the present embodiment, the route search server 10 has a function of setting a virtual landmark, avoiding wasteful consumption of resources and determining which station of the same name is different from the user. Since a mechanism that eliminates the need for confirmation has been realized, route search conditions can be automatically entered and executed. Further, by using this mechanism, a user can use a relatively simple information terminal such as the portable terminal 50 to request a route search request in natural language and by e-mail, and obtain search result information. Since it did in this way, the utilization environment of the route search which becomes comfortable for a user can be provided. Since this is an e-mail, this service can be used without inconvenience even if the model of the portable terminal is changed. Of course, this service can also be used using a PC.

The following procedure is indispensable when a conventional service route search system of this kind (see, for example, Patent Document 2) is intended to realize the same type of service for performing a route search via a network from a mobile terminal having a data processing function. In view of this, the magnitude of the impact that the operation route search system of this embodiment has on the user will be easily understood.
(A) A user accesses a route search service site. Alternatively, a route search application is started. It takes a certain time here.
(B) A user designates a departure station and an arrival station. In the case of a station with the same name, it is displayed together with a plurality of prefectures in which it exists, so one is selected. Requires confirmation of confirmation. For this reason, too, it takes time here, and the communication fee for the portable terminal is also extra.
(C) A route search is executed. In the case where the same name and the like station are included, there is a possibility that a route that is not possible in reality is specified as an optimal route candidate and higher. In this case, it takes time and a communication fee until the next route is displayed.
(D) Obtain search results and display them on the screen.

  In the present embodiment, an example in which the route search server 10 and the mobile service server 20 are realized by different server bodies is shown. This is because the execution load of the route search server 10 is larger than that of the mobile service server 20, and on the other hand, as the number of mobile service servers 20 increases, the number of contacts for mobile service users increases. The main reason is that it is preferable to optimize the above. However, it is not always necessary to operate in such a form, and an embodiment in which the functions of the servers 10 and 20 are integrated into one server is also possible. In this case, there is an advantage that only one computer program for realizing the functions of the present invention is sufficient.

  Moreover, by installing such one computer program in a general-purpose computer such as a PC, the computer can be operated as a single operation route search device.

  Further, in the present embodiment, the description has been mainly focused on the case where the mobile route search service is provided. However, regardless of this service, even when it takes time and effort, a route search in which search conditions are specified precisely is desired. Can use a data processing function of the portable terminal 50 to access the data communication required interface 100 of the route search server 10 and operate the route search engine 110 by this.

  The present invention is of course used for optimal route search by public transportation such as railways and buses, but the function using the virtual landmarks can be widely applied to car navigation and the like.

1 is an overall configuration diagram of an operation route search system to which the present invention is applied. Explanatory drawing of the method of the search between stations by a route search tool. It is a figure explaining the procedure at the time of using a virtual landmark in a route search tool, (a) is an example at the time of making a virtual landmark ("Fuchu") recognize as a departure place, (b) is the purpose. It is an example in the case of making it recognize as the ground. The content explanatory view of a rule table. Explanatory drawing of the control procedure of the service control part in the case of providing a mobile route search service. (A) is the figure which showed the example of the content of the text sentence at the time of requesting a mobile route search service with an electronic mail, (b) is description of the route search result information sent in response from this route search service to this text sentence. Figure.

Explanation of symbols

  DESCRIPTION OF SYMBOLS 10 ... Path search server, 20 ... Mobile service server, 50 ... Mobile terminal, 60 ... Mail server, 70 ... PC, 100 ... Data communication interface, 110 ... Path Search tool, 120 ... Virtual landmark registration tool, 200 ... Mobile terminal interface, 210 ... Service control unit, 220 ... Search condition input unit, N ... Digital network.

Claims (7)

In response to the input of a route search condition including at least one of the departure point and the destination, the search process for the next station or stop with the lowest operation cost of the route starting from the departure point or the destination is repeated in a chain. A route search tool for identifying an optimal route candidate according to the route search condition,
For a plurality of stations or stops having the same name, the name is set as a virtual landmark where the operation cost from the station or stop is zero, and the route search tool is set with the set virtual landmark as the starting point or the destination. A virtual landmark registration tool to be recognized by
Travel route search device. Interface means for enabling communication with an information terminal operated by a user;
A rule table that records correspondence rules between words or phrases and the route search conditions that can be recognized by the route search tool;
A natural language processing tool for extracting a word or phrase included in the request sentence by performing natural language processing on the request sentence composed of the natural language received through the interface means;
A conversion tool for converting a word or phrase extracted by the natural language processing tool into the route search condition according to the rule table;
The route terminal condition converted by the conversion tool is input to the route search tool without requiring a user operation, the optimum route candidate specified thereby is received from the route search tool, and the received optimum route candidate is Control means for enabling display on the information terminal through the interface means,
The operation route search device according to claim 1. The information terminal is a mobile terminal equipped with a display,
The interface means receives the request text by e-mail from the mobile terminal,
The control means edits the optimal route candidate specified by the route search tool into electronic information having a size that can be displayed on the display, and returns the edited electronic information to the sender of the e-mail via the interface means. To
The operation route search device according to claim 2.   The operation route search device according to claim 3, wherein the edited electronic information includes a sentence composed of a natural language. A route search system connected to a network that can be accessed by a plurality of information terminals and a mail server, comprising a first server and one or a plurality of second servers,
The first server is
In response to the input of a route search condition including at least one of the departure point and the destination, the search process for the next station or stop with the lowest operation cost of the route starting from the departure point or the destination is repeated in a chain. A route search tool for identifying an optimal route candidate according to the route search condition,
For a plurality of stations or stops having the same name, the name is set as a virtual landmark where the operation cost from the station or the stop is zero, and the route search tool with the set virtual landmark as the starting point or the destination And a virtual landmark registration tool to be recognized by
The second server is
Interface means for enabling communication with the information terminal or mail server;
A rule table that records correspondence rules between words or phrases and the route search conditions that can be recognized by the route search tool;
A natural language processing tool for extracting a word or phrase included in the request sentence by performing natural language processing on the request sentence composed of the natural language received through the interface means;
A conversion tool for converting a word or phrase extracted by the natural language extraction tool into the route search condition according to the rule table;
The route terminal condition converted by the conversion tool is input to the route search tool of the first server without requiring any operation by the user, and the optimum route candidate specified thereby is received from the route search tool and received. Control means for enabling display of the optimum route candidate on the information terminal through the interface means,
Travel route search system. In response to the input of a route search condition including at least one of the departure point and the destination, the search process for the next station or stop with the lowest operation cost of the route starting from the departure point or the destination is repeated in a chain. A route search method that is executed by a device including a route search tool that identifies an optimal route candidate according to the route search condition and an interface unit with an information terminal operated by a user,
For a plurality of stations or stops having the same name, the name is set as a virtual landmark where the operation cost from the station or the stop is zero, and the route search tool with the set virtual landmark as the starting point or the destination The process of recognizing
When a request sentence entered by a user in a natural language through an information terminal is received through the interface means, a natural language processing tool is used to process the received request sentence with a natural language processing tool. Or the process of extracting phrases;
Converting the extracted word or phrase into the route search condition according to a rule table in which correspondence rules between the word or phrase and the route search condition are recorded in advance;
The converted route terminal condition is input to the route search tool without requiring an operation by the user, the optimum route candidate specified thereby is received from the route search tool, and the received optimum route candidate is received from the interface. And a process of transmitting the information in a form that can be displayed on the information terminal via the means. Using a computer to input a route search condition including at least one of the departure point and the destination, the search process for the next station or stop with the lowest operation cost of the route starting from the departure point or the destination is linked. A route search tool for identifying an optimum route candidate according to the route search condition, and
For a plurality of stations or stops having the same name, the name is set as a virtual landmark where the operation cost from the station or the stop is zero, and the route search tool with the set virtual landmark as the starting point or the destination A computer program for route search that functions as a virtual landmark registration tool to be recognized.

Images