JP2012037446A - Route retrieval application program, device, and method achieving predictive conversion of input character - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a route retrieval application program, etc. that decreases the number of times of user's operation for character input as much as possible by predicting and inserting a Kana (Japanese syllabary)-Kanji (Chinese character) character string to be input to an input field based upon a current position, a starting spot, and an arrival spot of a user.SOLUTION: The route retrieval application program allows a computer to function as: spot name dictionary means in which Kana-Kanji character strings and reading Kana character strings are associated with position information to be registered with respect to spot names; user input interface means; position acquisition means of acquiring a current position; nearest spot name retrieval means of retrieving a nearest spot name nearest the current position; candidate spot name retrieval means of retrieving a plurality of Kana-Kanji character strings having prefix matches each time a user inputs a Kana character to the input field; and candidate spot name display means of displaying the nearest spot name as a first candidate character string in the input field when the nearest spot name is included in the plurality of retrieved Kana-Kanji character strings.

Description

  The present invention relates to a route search application program technique.

  A user can use a route search system using a terminal such as a mobile phone in order to search for a route in transportation. The terminal accesses the route search system and displays a user interface screen for route search via, for example, a browser. The screen displays at least a “departure station name input field” and an “arrival station name input field”. The user inputs a character string of a departure station name and an arrival station name in these input fields. Then, the route search system searches for optimum route information in the sections of the two stations, and returns the search result to the terminal. The route information includes, for example, the name of a train to be boarded, departure time, arrival time, required time, and transit station name.

  The terminal has a character input application installed in advance so that a character string of a station name can be input in the input field in response to a user operation. When inputting Japanese characters, a kana-kanji conversion system is required as a character input application. The kana-kanji conversion system converts the “reading kana character string” input by the user into a “kana-kanji character string” (or “a kana-kanji mixed character string”). The kana-kanji conversion system holds a dictionary database in which kana-kanji character strings corresponding to reading kana character strings are registered. When the terminal is connected to the route search system and a reading kana character string of the station name is input to the displayed input field, the terminal is converted into a kana kanji character string of the station name.

  Generally, in the case of a kana-kanji conversion system installed in a personal computer, after a reading kana character string of at least a word level is input, it is converted into a kana-kanji character string at a time. In this case, the first candidate kana-kanji character string is inserted into the input field by pressing the first conversion key (for example, the space key), and the other candidate kana-kanji characters are pressed by pressing the second conversion key. A list of columns is displayed.

  On the other hand, when the input key is a numeric keypad as in a mobile phone, the number of times the key is pressed to input one character is larger than that of a QWERTY key like a personal computer. Therefore, in the case of a mobile phone, every time the user inputs a reading kana character string, the kana kanji character string that matches the front is displayed as a candidate from all the words in the dictionary database. The user may select a kana / kanji character string from the candidate list without inputting all the reading kana characters.

  Further, the dictionary installed in the kana-kanji conversion system is generally shared and used by all applications. Therefore, it is not provided exclusively for the route search system. Therefore, even if a reading kana character string is entered in the station name input field of the route search system, kana kanji character strings frequently used in other applications in the past are candidates. For example, a kana-kanji character string frequently used in mail becomes the first candidate character string in the station name input field in the route search system.

  According to the route search system, only the station name can be entered in the input field. However, when the user reads the station name and inputs it with kana characters, kana-kanji character strings that are candidates are those that are frequently used in other applications. Of course, it can be assumed that only the station name is input in the input field of the route search system. However, even if one character of a reading kana character string is input, there are many station names nationwide that match the character in front. Therefore, the number of candidates for the station name also increases.

  In these cases, the station name to be input may be displayed at a lower position in the candidate list. Therefore, the number of key presses is increased in order to select a desired station name. If even the candidate list is not displayed, it is necessary to input a further reading kana character string (second and subsequent characters) until the candidates are narrowed down.

  FIG. 1 is a display screen of a display in a conventional route search system.

  FIG. 1A shows a search screen of the user interface displayed on the browser when the mobile phone is connected to the route search system. In this search screen, a “departure station name input field” and an “arrival station name input field” are displayed. Here, it is assumed that “departure station name input field” is selected in accordance with a user operation.

  FIG. 1B shows a character input screen that is switched by selecting an input field. At this time, the Kana-Kanji conversion system is activated, and the state is shown at the bottom of the display.

  FIG. 1C shows a character input screen when the reading kana character “ka” is input in response to a user operation. The user wants to input the station name “Kami Fukuoka”. At this time, a kana / kanji character string that matches the front kana character “ka” is searched, and the candidate list is displayed at the bottom of the display. The candidate list is arranged in order from a kana-kanji character string frequently used in the past.

  Originally, when the user's current location is around “Kami-Fukuoka” station, “Kami-Fukuoka” is selected from the Kana-Kanji conversion character string that matches the front when “ka” is entered in the departure station name input field. There is a high probability.

  As a conventional technique, there is a technique for switching a dictionary for kana-kanji conversion according to a user's current position (see, for example, Patent Document 1). According to this technique, a plurality of kana-kanji conversion dictionaries are held, and the current position of the user is acquired using GPS (Global Positioning System). By switching dictionaries according to the current position, kana-kanji character string candidates can be optimized according to the current position. Further, frequency information used in the past is given to each word in the dictionary. That is, this frequency information is updated when the user confirms input using the dictionary around the current position. When a reading kana character string starts to be input in response to a user operation, conversion candidates using the character string as a key are extracted from a dictionary corresponding to the current position, and are arranged and presented in descending order of each frequency information.

JP 2006-350904 A

  However, according to the technique described in Patent Document 1, only a dictionary corresponding to the current position of the user is used. For this reason, only kana-kanji character strings that have been input in the past (pressing the confirmation key) at the current position are presented as conversion candidates. Also, the kana / kanji character string that has been frequently used in the past at the first position is not presented as the first candidate at the second position. For example, when the user is present at the second position, the dictionary based on the first position is not used when inputting a station name around the first position in the arrival station name input field.

  Accordingly, the present invention predicts and inserts a kana-kanji character string to be input in the input field based on the relative relationship between the current position of the user, the departure point, and the arrival point, thereby performing an operation for character input by the user. It is an object of the present invention to provide a route search application program, apparatus and method capable of reducing the number of times as much as possible.

According to the present invention, in a route search application program for causing a computer mounted on a terminal to function in order to search for a route between a departure point and an arrival point,
A spot name dictionary means that registers a kana / kanji character string and a reading kana character string and position information in association with each other,
User input interface means for displaying a departure point name input field and / or an arrival point name input field on the display and prompting the user to input a kana character;
Position acquisition means for acquiring a current position in the terminal;
A closest point name search means for searching for a closest point name closest to the current position using a point name dictionary means;
Each time a kana character is input to the input field by the user, a candidate spot name search means for searching for a plurality of kana-kanji character strings that match forward using the spot name dictionary means,
As a candidate spot name display means for displaying the nearest spot name on the display as the first candidate character string in the input field of the user input interface means when the nearest spot name is included in the plurality of searched kana / kanji character strings. It is characterized by making a computer function.

According to another embodiment of the route search application program of the present invention,
When reading kana characters are being entered in the departure point name input field displayed by the user input interface means,
The candidate spot name display means, when the nearest spot name is included in the searched kana-kanji character strings for the departure spot name input field, the nearest spot name is displayed in the first place name entry field. It is also preferable to cause the computer to function as a candidate character string.

According to another embodiment of the route search application program of the present invention,
If it is already entered in the departure point name input field in the user input interface means and the kana character is being entered in the arrival point name input field,
The candidate point name display means includes the name of the latest point in the plurality of kana-kanji character strings searched for the arrival point name input field, and the point name input in the departure point name input field It is also preferable to cause the computer to function so as not to display the latest location name as a candidate character string in the arrival location name input field when the latest location name matches the latest location name.

According to another embodiment of the route search application program of the present invention,
When the departure point name input field displayed by the user input interface means is blank, and reading kana characters are being input to the arrival point name input field,
The candidate spot name display means inserts the nearest spot name into the departure spot name input field when the searched kana-kanji character strings and the nearest spot name do not coincide with each other in the arrival spot name input field. It is also preferable to make the computer function.

According to another embodiment of the route search application program of the present invention,
A route relation accumulation means for accumulating the route relation degree in the section between the first spot name and the second spot name;
The candidate point name display means functions the computer to display the candidate point names in the departure point name input column side by side in ascending order of the degree of path relation between the latest point name and the candidate point name in the departure point name input column. It is also preferable that

According to another embodiment of the route search application program of the present invention,
A route relation accumulation means for accumulating the route relation degree in the section between the first spot name and the second spot name;
The candidate point name display means displays the candidate point name in the arrival point name input column in ascending order of the degree of route relation between the departure point name inserted in the departure point name input column and the candidate point name in the arrival point name input column. It is also preferable to cause the computer to function so as to display them side by side.

According to another embodiment of the route search application program of the present invention,
The route search application is based on route search in transportation,
The point name is based on the boarding position in the transportation system,
It is also preferable that the terminal on which the computer is mounted functions the computer so that it is a portable terminal.

According to another embodiment of the route search application program of the present invention,
The degree of route relation causes the computer to function as a linear sum of the required travel time in the section between the first spot name and the second spot name and the required travel time when there is a need to transfer within the section. It is also preferable.

According to another embodiment of the route search application program of the present invention,
The transit time is the increment / decrement of the correction time based on user attributes,
The user attributes are preset and stored by the user,
It is also preferable to make the computer function so that the user attribute is based on the presence / absence of the user's transfer experience, the transfer method, and / or the walking speed.

According to another embodiment of the route search application program of the present invention,
It is also preferable to make the computer function so that the route relation degree is a fare in the section between the first point name and the second point name.

According to another embodiment of the route search application program of the present invention,
The closest location name search means allows the computer to function so that the most recent location name is the boarding location with the shortest route distance or travel time based on the geographical distance or movement from the current location of the terminal. Is also preferable.

According to another embodiment of the route search application program of the present invention,
The position acquisition means causes the computer to function to acquire the current position by a GPS (Global Positioning System) function, by a life log function that always acquires user behavior information, or by input based on an explicit user operation. It is also preferable.

According to another embodiment of the route search application program of the present invention,
It further has an input history storage means for storing past kana-kanji character strings input in the input field,
The candidate spot name display means causes the computer to display a candidate spot name that matches the kana / kanji character string stored in the input history storage means at the top when the candidate spot names are displayed side by side in the input field. Is also preferable.

According to another embodiment of the route search application program of the present invention,
The reading kana character is
By pressing a physical button on the keyboard or numeric keypad,
By pressing a virtual button on the touch panel, or
It is also preferable to make the computer function so as to be input by the user's voice for the voice recognition function.

According to the present invention, in a terminal that can search for a route between a departure point and an arrival point,
A spot name dictionary means that registers a kana / kanji character string and a reading kana character string and position information in association with each other,
User input interface means for displaying a departure point name input field and / or an arrival point name input field on the display and prompting the user to input a kana character;
Position acquisition means for acquiring a current position in the terminal;
A closest point name search means for searching for a closest point name closest to the current position using a point name dictionary means;
Each time a kana character is input to the input field by the user, a candidate spot name search means for searching for a plurality of kana-kanji character strings that match forward using the spot name dictionary means,
A candidate point name display means for displaying the nearest point name on the display as a first candidate character string in the input field of the user input interface means when the nearest point name is included in the plurality of searched kana-kanji character strings; It is characterized by having.

According to the present invention, in a route search method for searching for a route between a departure point and an arrival point using a terminal,
The terminal has a spot name dictionary part in which the kana / kanji character string and the reading kana character string and the position information are registered in association with the spot name,
A first step of displaying a departure point name input field and / or an arrival point name input field on the display, and prompting the user to input a kana character;
A second step of obtaining a current position at the terminal;
A third step of searching for the nearest point name closest to the current position using the point name dictionary means;
A fourth step of searching for a plurality of kana-kanji character strings that match forward each time a kana character is input into the input field by the user using the point name dictionary means;
A fifth step of displaying the nearest point name on the display as the first candidate character string in the input field of the user input interface means when the nearest point name is included in the plurality of searched kana / kanji character strings; It is characterized by having.

  According to the route search application program, apparatus, and method of the present invention, by predicting and inserting a kana-kanji character string to be input in the input field based on the relative relationship between the current position of the user, the departure point, and the arrival point. The number of operations for user character input can be reduced as much as possible.

It is a display screen of the display in the route search system of a prior art. It is a functional block diagram of the program of this invention which makes the computer mounted in the terminal function. It is explanatory drawing showing the path | route relation degree in the area of a departure station name and an arrival station name. It is a flowchart showing the process of a candidate point name display part. It is a 1st explanatory view which displays a candidate spot name in the present invention. It is a 2nd explanatory view which displays a candidate point name in the present invention. It is a 3rd explanatory view which displays a candidate point name in the present invention.

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

  FIG. 2 is a functional configuration diagram of the program of the present invention that causes a computer installed in a terminal to function.

  The route search application program is for searching for a route between a departure point and an arrival point, and is used for route search in a transportation facility, for example. The point name is based on the boarding position in the transportation facility, and is, for example, a station name or a stop name. The terminal on which the route search application program functions is, for example, a mobile phone, and is preferably movable with the user.

  The terminal 1 in FIG. 2 includes a display 101, input keys 102, and a position acquisition unit 103.

  The display 101 prompts the viewing user to input search condition information (departure point name and arrival point name) for route search, and displays the search result information (route information). In the case of a mobile terminal such as a mobile phone, a liquid crystal display device is used.

  The input key 102 allows the user to input search condition information. Specifically, a reading kana character string is input. In the case of a personal computer, a keyboard is frequently used, and in the case of a mobile phone, a numeric keypad is frequently used. Here, the input key 102 is not limited to a physical button such as a keyboard or a numeric keypad. It may be a virtual button on a touch panel that is becoming popular with mobile terminals (smartphones). Of course, it may be configured by a microphone for inputting a user's utterance and a voice recognition function for reading a kana character string from the utterance.

The position acquisition unit 103 acquires a current position (for example, latitude / longitude) in the terminal. For example, the current position can be measured by the following technique.
(1) GPS (Global Positioning System) function (2) Life log function that always acquires user behavior information The life log function refers to leaving human life in a log as digital data. For example, by recording information that the user has passed through the ticket gate on the terminal, it is possible to know whether or not the route has existed in the user's past movement route. The current position can be estimated from the range of the past movement route.
(3) Input based on explicit user operation

  According to FIG. 2, the route search application program includes a spot name dictionary unit 111, a user input interface unit 112, a recent spot name search unit 113, a candidate spot name search unit 114, a candidate spot name display unit 115, It has an input history storage unit 116 and a path relation accumulation unit 117. These functional components are realized by executing a route search application program that causes a computer installed in the terminal to function.

The spot name dictionary unit 111 registers a kana / kanji character string, a reading kana character string, and position information in association with the spot name. For example, the following table is configured.

  The user input interface unit 112 displays a “departure point name input field” and an “arrival point name input field” on the display 101 and prompts the user to input a point name. This is displayed via a browser. Further, the user input interface unit 112 inputs a reading kana character from the input key 102 and outputs the reading kana character string to the candidate spot name search unit 114 (for example, via the input history storage unit 116). Furthermore, the user input interface unit 112 displays a list of a plurality of candidate spot names in a predetermined input field in response to an instruction from the candidate spot name display unit 115.

  The recent location name search unit 113 inputs the current position information acquired by the position acquisition unit 103. Then, the “most recent spot name” closest to the current position is searched using the spot name dictionary unit 111. The latest point name of the search result is output to the candidate point name search unit 114.

As a search method for “recent location”, for example, there are the following methods.
(1) Search for the name of a point having the shortest geographical linear distance, that is, the difference between latitude and longitude as viewed from the current position of the terminal.
(2) The name of the point with the shortest route distance based on movement is searched using the road drawing of the map information (for example, navigation system) around the current position.
(3) Based on the road drawing and the moving speed, a point name having the shortest moving time from the current position is searched.

  The candidate spot name search unit 114 inputs a reading kana character string from the user input interface unit 112. The candidate point name search unit 114 uses the point name dictionary unit 111 to search for a plurality of kana-kanji character strings that match forward each time a reading kana character is input in the input field in response to a user operation. The plurality of searched kana-kanji character strings are output to the candidate spot name display unit 115.

  The candidate spot name display unit 115 displays the nearest spot name as the first candidate character string in the input field of the user input interface unit 112 when the nearest spot name is included in the plurality of searched kana / kanji character strings. To display. A specific display example in the candidate spot name display unit 115 will be described later with reference to FIG.

  The candidate spot name search unit 114 and the candidate spot name display unit 115 are executed each time the user inputs one reading kana character, and a predicted station name candidate is displayed.

  The input history storage unit 116 stores past kana / kanji character strings input in the input field. The candidate spot name display unit 115 displays the candidate spot name that matches the kana / kanji character string stored in the input history storage unit 116 when the candidate spot names are displayed side by side in the input field.

  The route relationship accumulation unit 117 accumulates the route relationship in the section between the first spot name and the second spot name.

  FIG. 3 is an explanatory diagram showing a route relation degree in a section between a departure station name and an arrival station name.

The route relation degree F may be the required travel time or distance in the section between the departure station name Sstr and the arrival station name Sarv. The route relation F may be a fare in the section between the departure station name Sstr and the arrival station name Sarv.
F = F1
F1: Time required for boarding, distance, fare, or a combination thereof The shorter the time required for boarding, the higher the degree of route relation. Further, the shorter the distance, the higher the degree of path relation. Furthermore, the lower the fare, the higher the degree of route relation. Of course, the route relation degree may be derived by combining any or all of the required boarding time, distance, and fare.

According to FIG. 3, the degree of route relation in the section between the departure station name “Kami Fukuoka” and the arrival station name “Iidabashi” is shown. The path relation degrees are associated as follows, for example.

When a transfer is required between the departure station name Sstr and the arrival station name Sarv, it is preferable that the route relation degree F is a linear sum of the transfer required time and the transfer required time.
F = F1 + F2
F1: Time required for boarding (total time required for boarding for each section to be transferred)
F2: Time required for transfer (if multiple transfers are required, the total time required for transfer)
Of course, if the route does not require transfer, F2 = 0.

  According to FIG. 3, the boarding time F1 is the sum of the boarding time for Kamifukuoka-> Ikebukuro and the boarding time for Ikebukuro-> Iidabashi. In Ikebukuro Station, it is necessary to transfer between the Tojo Line and Yurakucho Line. For this purpose, the route relation F is calculated by further adding the transfer required time F2.

  Here, it is preferable that the transfer required time is obtained by incrementing / decreasing the correction time based on the user attribute. The user attributes are preset and stored by the user, and are based on the presence / absence of the user's transfer experience, the transfer method, and / or the walking speed. When the user has experience in the past at Ikebukuro Station, the transfer time is relatively short. In addition, when changing trains, the transfer required time varies depending on a transfer method such as an elevator, an escalator, or walking. Furthermore, when the user is elderly, the transfer time is relatively short due to the walking speed. It is also preferable to correct the transfer required time based on such user attributes.

  FIG. 4 is a flowchart showing processing of the candidate spot name display unit.

  The candidate spot name display unit 115 inputs a plurality of candidate spot names from the candidate spot name search unit 114, and inputs one recent spot name from the nearest spot name search unit 113. In the flowchart of FIG. 4, each time a user inputs a reading kana character, a plurality of candidate spot names are input from the candidate spot name search unit 114 and the process starts. Note that processing may be started for a series of reading kana character strings by pressing a prediction start key assigned separately instead of every time a user inputs characters.

(S400) First, it is determined whether the input field (input mode) that the user intends to input is “departure point name input field” or “arrival point name input field”.

(S411) If the input field that the user intends to input is the “departure point name input field”, is a plurality of kana-kanji character strings that have been searched included the one that matches the name of the nearest point in front? Determine whether or not. If not included, the process proceeds to S413.
(S412) If included, the nearest point name is displayed as the first candidate character string in the departure point name input field.
(S413) The candidate spot names in the departure spot name input column are displayed side by side in ascending order of the degree of path relation between the nearest spot name and the candidate spot name.

  FIG. 5 is a first explanatory diagram for displaying candidate spot names in the present invention.

  According to FIG. 5, the user is inputting reading kana characters in the “departure station input field”. At this time, the user is going to input “Kami Fukuoka” as the departure station. Note that when a user searches for a route, the departure station often inputs a station name close to the current position.

  According to FIG. 5, it is assumed that “Ka” of “Kami Fukuoka” is input to the “Departure station input field”. In this case, a number of station names “Kasumigaseki, Kagurazaka, Kawagoe, Kamifukuoka, Kanamecho,. When a recent station name (recent location name) is included in a plurality of searched station names (kana / kanji character strings), the latest station name is displayed as the first candidate station name in the “departure station input field”. Here, since the station name “Kami-Fukuoka” is recently included in the plurality of searched station names, the first candidate station name “Kami-Fukuoka” is displayed.

  Next, the candidate point name display unit 115 displays the route relationship in the section between the latest station name “Kami-Fukuoka” and other station names “Kasumigaseki”, “Kagurazaka”, “Kawagoe”, “Kanamecho”,. Candidate station names in the departure station name input field are displayed side by side in ascending order. According to FIG. 5, the candidate spot names are displayed in the order of “Kawagoe”-> “Kanamecho”-> “Kagurazaka”-> “Kasumigaseki”->.

(S420) If the input field that the user intends to input is the “arrival point name input field”, it is determined whether or not the departure station name has already been input to the “departure point name input field” by the user.

(S421) If the departure station name has already been entered in the "departure point name input field", the latest point name and the front of the plurality of kana-kanji character strings searched for the "arrival point name input field" It is determined whether or not a matching item is included. If not included, the process proceeds to S425.
(S422) If it is included, it is determined whether the departure station name in the “departure point name input field” matches the latest point name.
(S423) If the departure station name and the latest point name match, the latest point name is excluded from the arrival point name candidates in the “arrival point name input field”. That is, the latest point name is not displayed as a candidate character string in the arrival point name input field.
(S424) If the departure station name and the latest point name do not match, the latest point name is displayed as the first candidate character string in the “arrival point name input field”.
(S425) When the departure point name has already been input, the candidate point names in the arrival point name input column are displayed side by side in ascending order of the route relation degree between the departure point name and each arrival candidate point name.

  FIG. 6 is a second explanatory diagram for displaying candidate spot names in the present invention.

  According to FIG. 6, the user has already entered “Kami-Fukuoka” in the “departure station entry field” and is entering the reading kana character in the “arrival station entry field”. At this time, the user is going to input “Kagurazaka” as the arrival station.

  According to FIG. 6, it is assumed that “ka” of “Kagurazaka” is input to the “arrival station input field”. In this case, a number of station names “Kawagoe, Kamifukuoka, Kanamecho, Kagurazaka, Kasumigaseki,. Here, it is recognized that the station name “Kami-Fukuoka” is recently included in the searched station names. Since “Kami-Fukuoka” has already been entered as the “Departure station input field”, “Kami-Fukuoka” is excluded from the searched station names. Therefore, according to FIG. 6, from the departure station “Kami-Fukuoka”, the candidate point names “Kawagoe”-> “Kanamecho”-> “Kagurazaka”-> “ “Kasumigaseki”-> is displayed.

(S431) If the departure station name is blank in the “departure point name input field”, whether or not a plurality of searched kana-kanji character strings and the latest point name match the “arrival point name input field”. Determine whether or not. If there is a forward match, the process proceeds to S433.
(S432) If there is no coincidence in front, the name of the nearest point is inserted into the “departure point name input field”. Note that the departure point name is often a point name close to the current position.
(S433) When the departure station name is input, the candidate point names in the arrival point name input column are displayed side by side in ascending order of the degree of route relation between the departure station name and the candidate point name.

  FIG. 7 is a third explanatory diagram for displaying candidate spot names in the present invention.

  According to FIG. 7, the user is entering a reading kana character in the “departure station input field” and the “arrival station input field”. At this time, the user is going to input “Iidabashi” as the arrival station.

  According to FIG. 7, it is assumed that “I” of “Iidabashi” is input to the “arrival station input field”. In this case, a number of station names “Ikebukuro, Iidabashi, Ichigaya, Iwamotocho,. At this time, the station name “Kami-Fukuoka” is not recently included in the searched station names. Therefore, the latest point name “Kami Fukuoka” is inserted into the “departure point name input field”. Note that when a user searches for a route, the departure station often inputs a station name close to the current position.

  As described above in detail, according to the route search application program, apparatus, and method of the present invention, kana-kanji characters that are input to the input field based on the relative relationship between the current position of the user, the departure point, and the arrival point. By predicting and inserting columns, the number of operations for character input by the user can be reduced as much as possible.

  Various changes, modifications, and omissions of the above-described various embodiments of the present invention can be easily made by those skilled in the art. The above description is merely an example, and is not intended to be restrictive. The invention is limited only as defined in the following claims and the equivalents thereto.

DESCRIPTION OF SYMBOLS 1 Terminal 101 Display 102 Input key 103 Position acquisition part 111 Spot name dictionary part 112 User input interface part 113 Recent spot name search part 114 Candidate spot name search part 115 Candidate spot name display part 116 Input history memory | storage part 117 Path | route relationship degree accumulation | storage part

Claims (16)

In a route search application program that allows a computer installed in a terminal to function to search for a route between a departure point and an arrival point,
A spot name dictionary means that registers a kana / kanji character string and a reading kana character string and position information in association with each other,
User input interface means for displaying a departure point name input field and / or an arrival point name input field on the display and prompting the user to input a kana character;
Position acquisition means for acquiring a current position in the terminal;
The latest location name search means for searching for the nearest location name closest to the current position using the location name dictionary means,
Each time a kana character is input to the input field by the user, a candidate spot name search means for searching for a plurality of kana-kanji character strings that match forward using the spot name dictionary means;
When the nearest point name is included in a plurality of searched kana / kanji character strings, the candidate point is displayed on the display as the first candidate character string in the input field of the user input interface means. A route search application program for causing a computer to function as a name display means. When reading kana characters are being entered for the departure point name input field displayed by the user input interface means,
The candidate spot name display means, when the nearest spot name is included in a plurality of searched kana-kanji character strings in the departure spot name input field, the nearest spot name is input as the departure spot name. The route search application program according to claim 1, wherein the computer is caused to function as a first candidate character string in a column. If it is already entered in the departure point name input field in the user input interface means, and the kana characters are being entered in the arrival point name input field,
The candidate point name display means includes, for the arrival point name input column, the nearest point name included in a plurality of searched kana-kanji character strings, and is input to the departure point name input column. 2. The route according to claim 1, wherein if the name of the spot and the name of the nearest spot match, the computer is caused to function so as not to display the name of the nearest spot as a candidate character string in the arrival spot name input field. Search application program. When the departure point name input field displayed by the user input interface means is blank, and reading kana characters are being input to the arrival point name input field,
The candidate point name display means, when the plurality of kana-kanji character strings searched for the arrival point name input field and the nearest point name do not coincide with each other, The route search application program according to claim 1, wherein the computer is caused to function so as to insert a place name. A route relation accumulation means for accumulating the route relation degree in the section between the first spot name and the second spot name;
The candidate spot name display means displays the candidate spot names in the departure spot name input field side by side in ascending order of the degree of path relation between the nearest spot name and the candidate spot name in the departure spot name entry field. The route search application program according to claim 2, wherein the computer is caused to function. A route relation accumulation means for accumulating the route relation degree in the section between the first spot name and the second spot name;
The candidate point name display means includes the arrival point name input field in ascending order of the degree of route relation between the departure point name inserted in the departure point name input field and the candidate point name in the arrival point name input field. 5. The route search application program according to claim 3, wherein the computer is caused to function so as to display the candidate spot names side by side. The route search application is based on route search in transportation,
The point name is based on the boarding position in transportation,
The route search application program according to any one of claims 1 to 6, wherein the terminal on which the computer is mounted causes the computer to function as a mobile terminal.   The route relation degree is obtained by calculating the computer so that the required travel time in the section between the first spot name and the second spot name is a linear sum of the required travel time when it is necessary to transfer in the section. 8. The route search application program according to claim 7, wherein the route search application program is made to function. The transfer required time is obtained by incrementing / decreasing the correction time based on the user attribute,
The user attribute is preset and stored by the user,
9. The route search application program according to claim 8, wherein the user attribute causes the computer to function based on presence / absence of a user's transfer experience, a transfer method, and / or a walking speed.   8. The route search application program according to claim 7, wherein the route function is a fare in a section between the first point name and the second point name.   The nearest location name searching means uses a computer so that the boarding location having the shortest route distance or travel time based on a geographical linear distance or movement is the nearest location name as viewed from the current location of the terminal. 8. The route search application program according to claim 7, wherein the route search application program is made to function.   The position acquisition means acquires the current position by a GPS (Global Positioning System) function, a life log function that always acquires user behavior information, or an input based on an explicit user operation. 12. The route search application program according to claim 1, wherein the route search application program is made to function. An input history storage means for storing past kana / kanji character strings input in the input field;
The candidate spot name display means displays a candidate spot name that matches the kana-kanji character string stored in the input history storage means at the top when displaying candidate spot names side by side in the input field. The route search application program according to any one of claims 1 to 12, wherein the route search application program is operated. The reading kana character is in the input field,
By pressing a physical button on the keyboard or numeric keypad,
By pressing a virtual button on the touch panel, or
The route search application program according to any one of claims 1 to 13, wherein the computer is made to function so as to be inputted by a user's utterance with respect to a voice recognition function. In the terminal that can search the route between the departure point and the arrival point,
A spot name dictionary means that registers a kana / kanji character string and a reading kana character string and position information in association with each other,
User input interface means for displaying a departure point name input field and / or an arrival point name input field on the display and prompting the user to input a kana character;
Position acquisition means for acquiring a current position in the terminal;
The latest location name search means for searching for the nearest location name closest to the current position using the location name dictionary means,
Each time a kana character is input to the input field by the user, a candidate spot name search means for searching for a plurality of kana-kanji character strings that match forward using the spot name dictionary means;
When the nearest point name is included in a plurality of searched kana / kanji character strings, the candidate point is displayed on the display as the first candidate character string in the input field of the user input interface means. A route search terminal comprising name display means. In a route search method for searching a route between a departure point and an arrival point using a terminal,
The terminal has a spot name dictionary part in which a kana / kanji character string and a reading kana character string and position information are registered in association with the spot name,
A first step of displaying a departure point name input field and / or an arrival point name input field on the display, and prompting the user to input a kana character;
A second step of obtaining a current position at the terminal;
A third step of searching for the nearest location name closest to the current location using the location name dictionary means;
A fourth step of searching for a plurality of kana-kanji character strings that match forward each time a kana character is input to the input field by the user using the point name dictionary means;
When the nearest point name is included in a plurality of searched kana-kanji character strings, the nearest point name is displayed on the display as a first candidate character string in the input field of the user input interface means. And a route search method for a terminal.

Images