JP2009236860A - Destination setting device and program for destination setting - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To efficiently carry out processing when a plurality of searching key words are input. <P>SOLUTION: If a relation between two input key words is an unambiguous relation wherein the two words are only directly and continuously used and another key word never exist between them, both key words are connected to be one key word. For example, if both a relation of "rainbow" to "tokyo" and a relation of "land" to "rainbow" are unambiguous relations, the respective input key words are connected to be a searching key word of "tokyorainbowland", by which candidates of the destination are searched. <P>COPYRIGHT: (C)2010,JPO&INPIT

Description

  The present invention relates to a destination setting device and a destination setting program, for example, to searching for a target property such as a destination by inputting a character string.

In recent years, guiding a vehicle by a navigation device has been actively performed.
The navigation device has a function of setting a destination and searching for a route from the departure place to the destination, a function of detecting the position of the host vehicle using a sensor such as a GPS (Global Positioning System) satellite or a gyro, and a destination. A function to display the route to the current location of the vehicle and the current position on the map.
In general, in a navigation device, as proposed in Patent Document 1, a plurality of items (name reading, genre, address, etc.) are stored in the destination data, and a place name / facility name of the destination is searched. In this case, candidate points are narrowed down by inputting the name, address, telephone number, etc. from the touch panel.

Japanese Patent Laid-Open No. 11-271084

When searching for a desired place name or property using such a navigation device and setting it as a destination, a plurality of conditions may be input. For example, when searching from a name, search keywords such as “Tokyo” and “Lando” may be input.
In this case, the conventional navigation apparatus obtains a logical product between the search results of “Tokyo” and “Lando”.

That is, a facility including the keyword “Tokyo” in the reading is searched from the target data, and stored as a candidate facility in the first predetermined area of the memory.
In addition, the facility including the keyword “Land” in the reading is searched from the target data, and is stored as a candidate facility in the second predetermined area of the memory.

Then, the facility information included in both the first region and the second region of the memory is extracted and stored in the third region of the memory, so that the facility information satisfying the logical product of the keywords “Tokyo” and “Land” is obtained. Will be extracted.
Specifically, one facility name is read from candidate facilities stored in the first area of the memory, and it is determined whether or not the facility name is included in the second area. If included, both keywords are included. The candidate facility is stored in the third area of the memory. This process is performed for all candidate facilities stored in the first area.

In this way, in the conventional facility search or the like, when performing a logical product search for a plurality of keywords (all when a plurality of keywords are input or when a plurality of keywords are input and a logical cough is specified) ) Since the result of each condition needs to be obtained and stored in the memory, there is a problem that the amount of memory used increases.
Further, since the logical product of the search results of each condition is performed, there are problems that the processing load on the CPU increases and the search processing time becomes long.

  Therefore, an object of the present invention is to efficiently perform processing when a plurality of search keywords are input.

(1) In order to achieve the object, according to the first aspect of the present invention, destination data storage means for storing a plurality of destination data including a search keyword, keyword input means for inputting a search keyword, and the keyword input means The unambiguous relationship judgment means for judging whether or not the continuation relation of the other keyword with respect to the one keyword is an unambiguous relation and the unambiguous relation judging means for the two keywords input in If it is determined, the keyword linking means for linking the other keyword to the one keyword to form one keyword, search means for searching for a destination candidate using the linked keyword, and displaying the destination candidate And a destination selecting means for selecting the displayed destination candidate. To provide the land setting device.
(2) The invention according to claim 2 is provided with a continuation relation database storing keywords in which the continuation relation for one keyword has a unique relation, and the unique relation determination means is based on the continuation relation database. The destination setting device according to claim 1, wherein it is determined whether or not two keywords have a unique relationship.
(3) In the invention described in claim 3, the unambiguous relationship determination means determines an unambiguous relationship between two keywords input before and after. A setting device is provided.
(4) In the invention according to claim 4, there is provided a combination creating means for creating a combination of arbitrary two keywords for all the inputted keywords, and the unique relationship judging means is combined by the combination creating means. The destination setting device according to claim 1 or 2, wherein a unique relationship between the two keywords is determined.
(5) The invention according to claim 5 further comprises logical operation designating means for designating the contents of the logical operation for the input keyword, wherein the unambiguous relation judging means is a group unit of keywords in which logical products are continuous. The destination setting device according to any one of claims 1 to 4, characterized in that a unique relationship is determined.
(6) In the invention according to claim 6, for the keyword input function for inputting a search keyword and the two keywords input by the keyword input function, the continuation relationship of the other keyword with respect to one keyword is unambiguous. If the unique relationship determination function determines whether or not the unique relationship determination function determines that there is a unique relationship, the one keyword is connected to the other keyword to form one keyword. A search function for searching for a destination candidate using the linked keyword and the unlinked keyword from the destination data storage means for storing a plurality of destination data including a function and a search keyword, and displaying the destination candidate And a destination selection function for selecting the displayed destination candidate are realized on a computer. To provide the order destination setting for the program.

  According to the present invention, for two input keywords, it is determined whether or not the continuation relationship of the other keyword with respect to one keyword is an unambiguous relationship. Since the other keyword is concatenated into one keyword, processing when a plurality of search keywords are input can be performed efficiently.

Hereinafter, an embodiment of a destination setting device of the present invention will be described with reference to FIGS. 1 to 4 taking a navigation device as an example.
(1) Outline of Embodiment In the navigation device to which the destination setting device of the present embodiment is applied, when a dependency relationship exists between a plurality of input conditions, a search based on the dependency relationship is performed. Reduce AND operation.
For example, in order to search for “Tokyo Rainbow Land” as the destination, “Tokyo”, “Reinbo” and “Rando” are specified as keywords (search conditions) (“&” indicates a logical product). If it is, check the dependency between the specified keywords.

If the relationship between the two keywords is only directly used continuously, and there is no case in which there are other keywords between the two keywords, the two keywords are connected to each other. One keyword.
In the above example, if both “Reinbo” for “Tokyo” and “Rando” for “Reinbo” are in a unique relationship, the entered keywords will be concatenated to “TOKYO REINBOUNDO” Search for destination candidates using the search keyword.

However, if the dependency relationship is not constant (if it is not unambiguous), for example, in addition to “Tokyo / Rainbow / Land” (the slash indicates a keyword delimiter), there is a facility called “Rainbow / Park / Land”. In this case, the keywords “Reinbo” and “Rando” have “Tokyo / Rainbow / Land” that continues directly and “Rainbow / Park / Land” that does not continue directly. Absent.
Accordingly, since both keywords are not always used as a connected “reinland”, a search result is obtained for each keyword (condition) as usual, and a logical product operation is performed on each search result.

  Specifically, the continuation relationship that shows the unambiguous relationship between each keyword, assuming that the search of the facility to be searched is divided into keywords in meaning and notation units, and search conditions are entered in this keyword unit Create data.

(2) Details of Embodiment FIG. 1 is a system configuration diagram of a navigation device to which the destination setting device of this embodiment is applied.
The navigation device is mounted on a vehicle and includes a current position detection device 10, an information processing control device 20, an input / output device 40, and an information storage device 50 as shown in FIG.
First, the current position detection device 10 has the following configuration. The absolute direction sensor 11 is, for example, a geomagnetic sensor that detects in which direction the vehicle is located based on detection of the N direction based on a magnet, and may be any means that detects the absolute direction.

The relative azimuth sensor 12 detects, for example, whether or not an intersection is bent, and may be an optical rotation sensor attached to a rotating part of a handle, a rotational resistance volume, or an angle sensor attached to a wheel part.
Further, a gyro sensor that detects a change in angle using an angular velocity may be used. That is, any means capable of detecting an angle that has changed relative to the reference angle (absolute direction) may be used.
The distance sensor 13 may be, for example, one that detects and counts the rotation of a wheel, or one that detects acceleration and integrates twice. That is, any means capable of measuring the moving distance of the vehicle may be used.

The GPS (Global Positioning System) receiver 14 is a device that receives a signal from an artificial satellite, and includes various signals such as signal transmission time, position information of the receiver, moving speed of the receiver, and traveling direction of the receiver. Information can be obtained.
The beacon receiving device 15 is a device that receives a signal transmitted from a transmitting device installed at a specific point. In particular, VICS information can be obtained, and information related to vehicle travel such as traffic jam information, current position information, and parking lot information can be obtained.

The data transmission / reception device 16 is a device for communicating with the outside of the vehicle using a telephone line or radio waves and exchanging information.
For example, there are various usage methods such as a car phone, ATIS, VICS, GPS correction, and inter-vehicle communication, and it is possible to input / output information related to traveling.
Next, the information processing control device 20 performs calculation and control based on the information input from the current position detection device 10 and the input / output device 40 and the information stored in the information storage device 50, and displays the calculation result on the display 42. , A means for controlling to output to the output means such as the printer 43 or the speaker 44.

The information processing control device 20 has the following configuration.
The central processing unit (CPU) 21 performs overall calculation and control of the entire navigation device.
The first ROM 22 stores a navigation program, in particular, a navigation program related to detection of the current position, input keyword connection processing in the present embodiment, destination search processing, route search to the searched destination, display guidance, and the like.
The input interface 23 is means for receiving information from the current position detection device 10.

The RAM 24 stores keywords input by the input device 41 (to be described later), concatenated keywords, and destination candidates retrieved from the keywords, and users such as destination information and passing point information are stored by the user. The storage means stores the input information and stores the result calculated by the CPU 21 based on the user input information, the route search result, or the map information read from the information storage device 50. .
The communication interface 25 is a means for inputting / outputting information from the current position detection device 10, particularly information obtained from the outside.

The second ROM 26 stores a program related to navigation, particularly a navigation program related to voice guidance. Note that the first ROM 22 and the second ROM 26 may be configured by one common ROM.
The image processor 27 is processing means for processing the vector information processed by the CPU 21 into image information.
The clock 28 keeps time.
The image memory 29 is means for storing image information processed by the image processor.
The audio processor 30 processes the audio information read from the information storage device 50 and outputs it to the speaker 44.

The input / output device 40 includes an input device 41 for inputting data such as a search keyword, a destination, a passage point, and a search condition by a user, a display 42 for displaying an image, a printer 43 for printing information, and a speaker 44 for outputting sound. Consists of. The input device 41 includes, for example, a touch panel, a touch switch, a joystick, a key switch, and the like.
The display 42 displays a map around the current location and a travel route to the destination.

The information storage device 50 is connected to the information processing control device 20 via the transmission path 45.
The information storage device 50 includes a map data file 51, an intersection data file 52, a node data file 53, a road data file 54, a photo data file 55, a destination data file 56, a guidance point data file 57, a detailed destination data file 58, A continuation relation data file 59 and other data files 60 are stored.
The information storage device 50 is generally composed of an optical storage medium such as a DVD-ROM, a CD-ROM, or a magnetic storage medium such as a hard disk, but various types such as a magneto-optical disk and various semiconductor memories. You may comprise with an information storage medium.
Information that needs to be rewritten may be constituted by a rewritable hard disk or flash memory, and other fixed information may be a ROM such as a CD-ROM or DVD-ROM.

  The map data file 51 stores map data such as a national road map, a road map of each region, or a house map. The road map is composed of roads such as main arterial roads, expressways and narrow streets, and ground targets (facility etc.). A house map is a city map in which a figure representing an outer shape of a ground structure, a road name, and the like are displayed. A narrow street is, for example, a relatively narrow road having a road width equal to or less than a predetermined value below a national road or prefectural road, and road to which traffic regulation information such as “one-way” is not added.

In the intersection data file 52, data on intersections such as the geographical position coordinates and names of the intersections are stored in the road data file 54. Is the road location and type, the number of lanes, and road-related data such as the connection relationship between the roads, and the photo data file 55 shows various facilities, sightseeing spots, or places where visual indications such as major intersections are required The image data of the copied photograph is stored.

The destination data file 56 stores data such as locations and names of places and facilities that are likely to be destinations such as major tourist spots, buildings, and companies / businesses described in the telephone directory. Yes.
FIG. 2 conceptually shows the contents of data stored in the destination data file 56.
As shown in FIG. 2, the destination data file 56 includes data such as names of facilities and points to be searched as destinations (facility names), keywords of the facility names, coordinates, addresses, telephone numbers, and genres. Is remembered.
The facility name is a notation of the facility name.
The keyword indicates the reading of the facility name. These readings are delimited by units of meaning and notation (indicated by a slash (/) in the figure), and keywords are composed of these delimited units.

The guidance point data file 57 stores guidance data of points where guidance is required, such as the contents of guidance display boards installed on the road and guidance of branch points.
The detailed destination data file 58 stores detailed data relating to the destination stored in the destination data file 56.

The continuation relationship data file 59 stores data indicating whether or not the relationship between keywords is a unique relationship, and functions as a continuation relationship database.
FIG. 3 conceptually shows the contents of the continuation relation data file 59, which is created from the destination data illustrated in FIG. 2, but is actually created based on all destination data (keywords for all facilities). Is done.
The first keyword is all keywords of the destination data. In practice, they are sorted in order, but in FIG. 3, the first keywords are arranged in the order in which they appear in the keyword field of FIG.

In the related keyword, a keyword that is present behind each first keyword (after reading) is stored.
For each related keyword, A (continuation) is defined when continuing directly to the first keyword, and B (related) is defined when continuing with the other keyword (s) sandwiched between the first keyword, If both cases exist, A and B (continuation, association) are defined.
Of the related keywords, the related keyword for which only A (continuation) is defined is a keyword that is uniquely related to the first keyword.

  For example, with respect to the first keyword “Tokyo”, the related keyword “Spring” has the facility name “Tokyo Springland” in FIG. Since there is no case where another keyword is inserted between the two keywords, only A indicating a unique relationship is defined.

  On the other hand, for the first keyword “Tokyo”, the related keyword “Land” is the case where the two keywords continue directly as in the facility name “Tokyo Land Sea” in FIG. 2 and the facility name “Tokyo Rainbow Land”. In the case of B in which another keyword “Rainbow” is inserted between the two keywords. For this reason, A and B (continuation, relation) are defined in the related keyword “Land”.

  In addition, for the first keyword “Tokyo”, the related keyword “Shi” has only facilities with other keywords in between, such as the facility names “Tokyo Land Sea” and “Tokyo Rainbow Sea” in FIG. No, there is no facility name having a direct continuous relationship “Tokyo Sea…”, so B (related) is defined.

The same applies to the other first keywords.
Although the first keyword “Shi” is not illustrated in FIG. 2, “Paradais” having an unambiguous relationship and “Dock” having no unambiguous relationship are stored as related keywords.

In the navigation device configured as described above, route guidance is performed as follows.
The navigation device detects the current position by the current position detection device 10, reads the map information around the current position from the map data file 51 of the information storage device 50, and displays it on the display 42.
When one or more keywords are input from the input device 41, the information processing control device 20 searches for a destination candidate. In this destination candidate search, a connection process (described later) for each keyword is performed.
When a destination is selected from the searched destination candidates, the information processing control device 20 searches for (calculates) a plurality of travel route candidates from the current position to the destination, and displays them on the map displayed on the display 42. When the driver selects one of the travel routes, the travel route is acquired by storing the selected travel route in the RAM 24 (travel route acquisition means).

The information processing control device 20 travels by transmitting the current vehicle position (or input departure point) and destination to the information processing center and receiving a travel route to the destination searched for by the information processing center. A route may be acquired. In this case, communication of the destination and the travel route is performed by wireless communication via the communication interface 25.
In addition, a travel route from the departure place to the destination is searched using an information processing device such as a personal computer at home, etc., stored in a storage medium such as a USB memory, and obtained via the storage medium reader. You may do it. The storage medium reading device in this case is connected to the information processing control device 20 via the transmission path 45. In this case, the keyword linking process may also be performed in the destination search.

When the vehicle travels, route guidance is performed by tracking the current position detected by the current position detection device 10.
The route guidance specifies the vehicle position on the map by map matching between the road data corresponding to the searched travel route and the current position detected by the current position detection device 10, and displays a map around the vehicle current position on the display 42. In addition to the display, the searched travel route and the current position are displayed on the map.
Also, based on the relationship between the searched travel route and the current position, the necessity of guidance, that is, whether or not guidance for a travel route such as a predetermined route change point and direction guidance is necessary when straight traveling continues for a predetermined distance or more, etc. Judgment is made, and if necessary, display on the display 42 and voice guidance are executed.

Next, a keyword linking process executed in the destination search process in the present embodiment will be described.
FIG. 4 is a flowchart showing the contents of the keyword linking process.
When a plurality of keywords are input, the information processing control device 20 sets n = 1 (step 11), and acquires the keyword n and the next input keyword (n + 1). Each input keyword is stored in the RAM 24.

Each keyword is input from the input device 41, and keyword delimiters are designated by the input of logical operation symbols by the user.
For example, if the logical product and logical sum are “*” and “+”, respectively, and the user sequentially inputs “Tokyo * Land * Shi + Toshima * Hausu”, the keywords are separated by logical operation symbols. “Land”, “Toshima” and “Hausu”.
Then, concatenation processing for “Tokyo”, “Rando”, and “Shi” for which logical product is specified and concatenation processing for “Toshima” and “Hausu” are performed separately. In this manner, the connection is determined for each keyword group in which the logical product is continuous. In the above example, since a logical sum is designated between “Rando” and “Toshima”, no determination is made regarding the connection process.
In addition to the case where the user designates a logical operation symbol between keywords, the determination result of the device may be used when the device automatically determines according to a certain relational rule.

Next, the information processing control device 20 determines whether or not the keyword (n + 1) is uniquely related to the two keywords input before and after, that is, the keyword n (step 13). That is, the information processing control device 20 checks each related keyword from the continuation relation data file 59 using the keyword n as the first keyword.
If the keyword (n + 1) has only the continuation (A) relationship with the keyword n, it is determined as a unique relationship. On the other hand, if it is related to continuation (A, B) or related (B), it is determined that the relationship is not unique.

  When the keyword (n + 1) is not uniquely related to the keyword n (step 13; N), the information processing control device 20 does not connect the keyword n and the keyword (n + 1), and a logical product relationship between the two keywords. (Step 14). Thus, in the main destination search process, a destination including both the keywords n and (n + 1) is obtained by calculating a logical product of the destination candidates searched for with the keyword n and the destination candidates searched with the keyword (n + 1). Candidates are extracted.

  When the keyword n and the keyword (n + 1) are uniquely related (step 13; Y), the information processing control device 20 determines whether or not the keyword n is linked to the keyword (n-1) (step 15). ). That is, in the previous cycle, it is determined that the keyword (n-1) and the keyword n are uniquely related, and it is determined whether or not both keywords are connected.

When the keyword (n-1) and the keyword n are not connected (step 15; N), the information processing control device 20 connects the keyword (n + 1) to the keyword n (step 16). As a result, both keywords input by the user are connected to form one keyword n (n + 1).
On the other hand, when the keyword (n-1) and the keyword n are connected (step 15; Y), the keyword (n + 1) is connected to the already connected keyword (n-1) n (step 17). . As a result, the three keywords input by the user become one keyword (n−1) n (n + 1).
However, if three or more keywords having a unique relationship are continuously input, all of them are connected to become (n-2) (n-1) n (n + 1) (n + 2).

For example, when three keywords are entered in the order of “Tokyo”, “Land”, and “Shi”, the following occurs.
In this case, the information processing control device 20 determines from the continuation relationship data file 59 in FIG. 3 that the related keyword “Land” is not uniquely related to the first keyword “Tokyo”, and the first keyword “Land”. It is determined that the related keyword “Shi” has a unique relationship.
Then, the information processing control device 20 does not concatenate the keywords “Tokyo” and “Land” in the first cycle (steps 12 to 19) of the keyword concatenation process, and sets the keyword “Land” to “ "Shi" is concatenated into one keyword "Randoshi".
As a result, in the destination search process, a logical product is obtained between the search result of the keyword “Tokyo” and the search result of “Landoshi”.

On the other hand, when the three keywords are entered in the order of “Tokyo”, “Reibo”, and “Rando”, the following results.
In this case, the information processing control device 20 determines from the continuation relation data file 59 of FIG. 3 that the related keyword “reinbo” for the first keyword “Tokyo” and the related keyword “lando” for the first keyword “reinbo”. "Is determined to be in a unique relationship.
In the first cycle (Steps 12 to 19), the information processing control device 20 concatenates the keyword “Tokyo” with “Reinbo” to form one keyword “Tokyo Kyoto” (Step 17). In this cycle, the keyword “Land” is further connected to form the keyword “Tokyo Kyoto Land” (Step 17).

After the keyword concatenation (steps 16 and 17) or the logical product relationship (step 14), the information processing control device 20 determines whether or not the keyword (n + 1) is the last input keyword (step 18). If it is not the last keyword (step 18; N), n = n + 1 is set (step 19), and the process returns to step 12 to determine the unique relationship for the next keyword.
On the other hand, if the keyword (n + 1) is the last keyword (step 18; Y), the keyword linking process is terminated and the process returns to the destination search process.

As described above, according to the keyword linking process according to the present embodiment, if the next input keyword (n + 1) has a unique relationship with the input keyword n, the keyword n ( Since n + 1) is one keyword, the number of keywords for searching for destination candidates in the destination search is reduced, and the memory usage for storing the search results of each keyword can be reduced.
In addition, the processing load on the CPU 21 can be reduced by reducing the number of times of performing a logical product with respect to the search result of each keyword.

As mentioned above, although one Example of this invention was described, this invention is not limited to this, Other embodiments and modifications can be employ | adopted in the range described in the claim.
For example, in the described embodiment, as shown in FIG. 3 as the continuation relation data file 60, the continuation only is related to the first keyword (A), the continuation is related (A, B), the relation Only in the case of (B).
On the other hand, you may make it prescribe | regulate only about the presence or absence of an unambiguous relationship. That is, continuation (A) is defined as having a unique relationship, and continuation, relationship (A, B), and relationship (B) are defined as having no unique relationship. In this case, whether or not there is an unambiguous relationship is defined by the presence or absence of a flag or the storage of predetermined data.

Moreover, although the case where the related keyword is preserve | saved with respect to the 1st keyword was demonstrated, you may make it preserve | save only the keyword which has an unambiguous relationship with respect to the 1st keyword.
In this case, the information processing control device 20 determines whether or not the keyword (n + 1) exists in the related keyword column for the first keyword n. If it does not exist, there is no unambiguous relationship, so a logical product relationship is established without concatenating keywords.

Further, in the embodiment described above, a case has been described in which the presence / absence of an unambiguous relationship is determined for a plurality of input keywords in consideration of the input order.
On the other hand, regardless of the input order, it may be determined whether or not there is an unambiguous relationship with respect to any two keyword combinations for all input keywords.
For example, when keywords A, B, C, and D are input in this order, B for A, A for B, C for A, A for C, A for C, D for A, A for D, C for D, C for B, B for C It is determined whether or not there is a unique relationship with respect to D, B with respect to D, D with respect to C, and C with respect to D, and both keywords in a combination in a unique relationship are connected.

When the unambiguous relationship with respect to any two keyword combinations for all the keywords input in this way is determined, a certain keyword m may have an unambiguous relationship with the two keywords. To process.
(A) When the keyword m is the first keyword with respect to two keywords p and q that are uniquely related (in the case of mq to which another keyword q is linked), and when it is a related keyword (other In the case of pm linked to the keyword p), the information processing control device 20 continuously links the three keywords to obtain pmq.
However, when there is a relationship of (c) described later, priority is given to (c), and the three keywords are not connected.
(B) When the keyword m is the first keyword for two keywords p and q that are uniquely related (in the case of mp and mq in which the other keywords p and q are connected), or both If it is a related keyword (when it is pm and qm linked to other keywords p and q), the information processing control device 20 takes the logical sum of the linked keywords and sets it to (mp + mq) or (pm + qm).
(C) When the two keywords m and p have a unique relationship with each other, that is, when both mp and pm have a unique relationship, the logical sum (mp + pm) of the two connected keywords mp and pm is used. .

When the keyword m is uniquely related to three or more other keywords, it is determined whether or not the above case (a) exists, and if there is, the three keywords are connected according to (a). The other keywords are linked to the keyword m according to the unambiguous relationship, and are logically ORed with the three linked keywords according to (a).
If none of the above cases (a) exists, the keyword m and each keyword are connected according to a unique relationship, and the entire logical sum is obtained.

When determining the unambiguous relationship between any two keywords regardless of the input order as described above In the above modification, in the case other than the above (a), none of them are connected and logically operated as usual. You may make it take a product.
For example, in the case of AB, AC, etc. in (b), or in the case of AB, BA in (c), concatenation of AB, AC, etc. is not performed, and the logical product for each search result of A, B, C is performed as usual. Take.

In this way, by determining the unambiguous relationship based on a combination of two arbitrary keywords instead of the input order, the user can input each keyword constituting the name of the facility to be searched without being aware of the order. Can do.
In particular, even if the facility names are not accurately remembered, they can be input in the order in which they are remembered.

In the described embodiment, a navigation device (destination input device) that is assumed to be used in Japan has been described. That is, the input device 41 for inputting keywords is composed of Japanese syllabary keys, which are input units in Japanese, and data related to destination search in Japan is stored in the destination data file 56 and the continuation relation data file 59. A Japanese navigation device was described.
However, the environment in which the navigation device is used is not limited to Japan. By making the specification of the input device 41 and each data correspond to the region, the input function using the keyword data described above can be used in various countries.

For example, as an example of a navigation device (destination input device) for use outside Japan, a device having an alphabet key corresponding to English (English character) input may be used.
Furthermore, the apparatus may be adapted to input any language such as German, Spanish, French, Arabic, Chinese, Korean, Russian. For example, in the case of a navigation device that supports Chinese input, the input device 41 includes an input keyboard 422 that supports Chinese pinyin input.

The language to be input need not necessarily correspond to the country (region) to be used for the navigation device. For example, a navigation device that supports German input may be used in France. In this case, in the destination data file 56, the continuation relation data file 59, etc., data to be searched when performing destination search, that is, data to be compared with input characters (for example, destination name, keyword, address) Etc.) stores data corresponding to the input language.
In addition to the input language, data corresponding to the language of the country (region) to be used may be stored in the data to be searched.
In addition, data that is not a search target when performing destination search, for example, additional information data, need not store data corresponding to the input language. For example, data corresponding to the input language, data corresponding to the language of the country (region) to be used are stored as the data that is not the search target, Data corresponding to both languages of a given country (region) may be stored.

1 is a system configuration diagram of a navigation device to which the present embodiment is applied. It is explanatory drawing which represented notionally the content of the destination data memorize | stored in the destination data file. It is explanatory drawing which represented the content of the continuation relation data file notionally. It is a flowchart showing the content of the connection process of a keyword.

Explanation of symbols

DESCRIPTION OF SYMBOLS 10 Current position detection apparatus 20 Information processing control apparatus 40 Input / output apparatus 41 Input apparatus 42 Display 50 Information storage apparatus

Claims (6)

Destination data storage means for storing a plurality of destination data including a search keyword;
Keyword input means for entering search keywords;
Unambiguous relationship determination means for determining whether or not the continuation relationship of the other keyword with respect to one keyword is a unique relationship with respect to the two keywords input by the keyword input means;
When it is determined that the unambiguous relationship is determined by the unambiguous relationship determining unit, a keyword connecting unit that connects the other keyword to the one keyword to form one keyword;
Search means for searching for a destination candidate using the linked keywords;
Display means for displaying the destination candidates;
Destination selecting means for selecting the displayed destination candidates;
A destination setting device characterized by comprising: A continuation relationship database storing keywords in which the continuation relationship for one keyword is a unique relationship;
The unambiguous relationship determining means determines whether or not two keywords are in an unambiguous relationship based on the continuation relationship database.
The destination setting device according to claim 1. The unambiguous relationship determining means determines an unambiguous relationship between two keywords input before and after.
The destination setting device according to claim 1. A combination creating means for creating a combination of arbitrary two keywords for all the input keywords;
The unambiguous relationship determining means determines an unambiguous relationship for the two keywords combined by the combination creating unit.
The destination setting apparatus according to claim 1 or 2, characterized in that Logical operation specifying means for specifying the content of the logical operation for the input keyword,
The unambiguous relationship determining means determines an unambiguous relationship in a group unit of keywords in which logical products are continuous.
The destination setting device according to any one of claims 1 to 4, wherein the destination setting device is a device. A keyword input function for entering search keywords,
An unambiguous relationship determination function for determining whether or not the continuation relationship of the other keyword with respect to one keyword is an unambiguous relationship with respect to the two keywords input by the keyword input function;
When it is determined that the unique relationship is determined by the unique relationship determination function, a keyword linking function that links the other keyword to the one keyword to form one keyword;
A search function for searching for destination candidates from the destination keyword storage means for storing a plurality of destination data including a search keyword using the linked keyword and the unlinked keyword;
A display function for displaying the destination candidates;
A destination selection function for selecting the displayed destination candidates;
A program for setting a destination to enable a computer to implement a program.

Images