JP5299331B2 - Facility search apparatus and program - Google Patents

Description

  The present invention relates to a facility search apparatus and program for searching facility information based on an input search word.

Conventionally, various techniques for searching facility information based on an input search word have been proposed.
For example, the facility name representing the destination is divided into words, and all names obtained by changing the order of the divided words are sorted in reading order to create a name list registered as the facility name, and the input search word and the front There is a vehicle navigation device that searches for a matching name, extracts a facility name corresponding to the name, and displays it on a display unit as a candidate spot name (see, for example, Patent Document 1).

JP-A-9-97266

  However, in the vehicle navigation apparatus described in Patent Document 1 described above, the head of the input search word and the rear end of another search word, or the rear end of the input search word and another search When there is a continuation relationship in which the beginnings of the words overlap with each other, there is again a process of eliminating the duplication of the facility name from the positional relationship of the words corresponding to each search word between the facility names searched for each search word. Therefore, there is a problem that the search time is increased and the response performance is lowered.

  Therefore, the present invention has been made to solve the above-described problems, and even if there is a continuation relationship between input search words, the search can be performed at high speed to prevent a decrease in responsiveness. An object of the present invention is to provide a facility search apparatus and a program that can be used.

  In order to achieve the object, the facility search apparatus according to claim 1 includes a facility name storage unit that stores a plurality of facility names to be searched by dividing each facility name into a plurality of keywords, an input unit that inputs a search word, A candidate facility name extracting unit that extracts a facility name as a candidate facility name when a search word matches a search target character string created by rearranging a plurality of keywords constituting the facility name; and the candidate facility Output means for outputting the candidate facility name extracted by the name extraction means, wherein the candidate facility name extraction means includes a search word input by the input means and a rear end portion of one search word and the other If there is a continuation relationship in which the beginnings of the search terms overlap with each other, the search term search order is set according to the continuation relationship, and the first search term is determined according to the search order for each of the plurality of facility names. First, a search target character string that matches the search word in front is searched, and among a plurality of keywords constituting the search target character string that matches the search word in front, the search word is used A keyword including the search word character is sequentially excluded, and a facility name having a keyword that coincides with the last search word is extracted as a candidate facility name.

  Moreover, the facility search device according to claim 2 is the facility search device according to claim 1, wherein the candidate facility name extraction unit searches for overlapping rear end portions of the pair of search words having the continuation relationship. The search order of words is set so as to be the order immediately before the search order of search words with overlapping heads.

  The facility search apparatus according to claim 3 is the facility search apparatus according to claim 2, wherein the candidate facility name extraction unit is configured such that the search word input by the input unit does not have the continuation relationship. The search order is set in the input order following the search order of the search terms having the continuation relationship.

  Furthermore, the program according to claim 4 includes an input step of inputting a search word to a computer provided with a facility name storage unit that stores a plurality of facility names to be searched by dividing them into a plurality of keywords, and the input step. A candidate facility name extracting step of extracting the facility name as a candidate facility name when the search term input in the above matches a search target character string created by rearranging a plurality of keywords constituting the facility name. An output step of outputting the candidate facility name extracted in the candidate facility name extraction step, and in the candidate facility name extraction step, one of the search terms input by the input means When there is a continuation relationship in which the rear end portion and the head portion of another search word overlap each other, a search word search order is set according to the continuation relationship, and the search order is set for each of the plurality of facility names. Therefore, in order from the first search word, a search target character string that matches the search word in front is searched, and the search word and the front of the plurality of keywords constituting the search target character string that matches the search word in front This is a program for executing to extract a facility name having a keyword that matches forward with the last search word as a candidate facility name by sequentially excluding keywords including characters of the search word used when matching. .

  In the facility search apparatus according to claim 1 having the above configuration, the search word search order is set in accordance with the continuation relationship of the input search words. Then, for each of a plurality of facility names, a search target character string that matches the search word in front is searched in order from the first search word according to the search order. Then, from among a plurality of keywords constituting the search target character string that matches the search word in front, a keyword including the character of the search word used when the search word is matched forward is sequentially excluded, and the last A facility name having a keyword that matches the search word in front is extracted as a candidate facility name and output.

  As a result, even if there is a continuation relationship between the input search terms, candidate facility names can be extracted for each facility name by a single search according to the search order set for each search term. This makes it possible to prevent a decrease in responsiveness.

  Further, in the facility search device according to claim 2, the search order of the search words having the overlapping rear end portions of the pair of search words having the continuation relationship is one before the search order of the search words having the overlapping top portions. Since the setting is made in order, it is possible to surely eliminate the corresponding keyword in duplicate, perform the search at a higher speed, and further improve the responsiveness.

  Further, in the facility search apparatus according to claim 3, when the search word input by the input means does not have a continuation relationship, the search order is changed in the input order following the search order of the search terms having the continuation relationship. Therefore, it is possible to quickly set the search order of the search terms, perform the search at a higher speed, and further improve the responsiveness.

  Furthermore, in the program according to claim 4, the computer sets the search term search order according to the continuation relation of the input search terms by reading the program. Then, for each of a plurality of facility names, a search target character string that matches the search word in front is searched in order from the first search word according to the search order. Then, from among a plurality of keywords constituting the search target character string that matches the search word in front, a keyword including the character of the search word used when the search word is matched forward is sequentially excluded, and the last A facility name having a keyword that matches the search word in front is extracted as a candidate facility name and output.

  As a result, even if there is a continuation relationship between the input search terms, the computer can extract candidate facility names in a single search according to the search order set for each search term for each reading of a plurality of facility names. Thus, it is possible to perform a search at a high speed and prevent a decrease in responsiveness.

It is the block diagram which showed the navigation apparatus which concerns on a present Example. It is a figure which shows an example of the facility name data table stored in facility name DB. It is a flowchart which shows "point information display processing" which searches for point information based on the input search term, and displays it as a list. 4 is a sub-flowchart showing a sub-process of “candidate facility name extraction process” in FIG. 3. 4 is a sub-flowchart showing a sub-process of “list display process” in FIG. 3. It is a figure which shows an example of the search word input screen which inputs a search word. It is a figure which shows an example of the search result display screen which displayed the list of the extracted facility name.

  Hereinafter, a facility search device and a program according to the present invention will be described in detail with reference to the drawings based on an embodiment in which a navigation device is embodied.

[Schematic configuration of navigation device]
First, a schematic configuration of the navigation device according to the present embodiment will be described with reference to FIG. FIG. 1 is a block diagram showing a navigation device 1 according to the present embodiment.
As shown in FIG. 1, the navigation apparatus 1 according to the present embodiment records a current position detection processing unit 11 that detects a current position of the own vehicle (hereinafter referred to as “own vehicle position”) and the like, and various data. The data recording unit 12, the navigation control unit 13 for performing various arithmetic processes based on the input information, the operation unit 14 for receiving operations from the operator, and displaying information such as a map to the operator A liquid crystal display 15, a speaker 16 for outputting voice guidance regarding route guidance, etc., and a communication device 17 for communicating with a road traffic information center, a map information distribution center, etc. (not shown) via a mobile phone network, etc. The touch panel 18 is mounted on the surface of the liquid crystal display 15. The navigation control unit 13 is connected to a vehicle speed sensor 21 that detects the traveling speed of the vehicle.

  Hereinafter, each component constituting the navigation device 1 will be described. The current position detection processing unit 11 includes a GPS 31, a direction sensor 32, a distance sensor 33, and the like. It is possible to detect a travel distance and the like.

  The data recording unit 12 includes an external storage device and a hard disk (not shown) as a recording medium, a map information database (map information DB) 25, a facility name database (facility name DB) 27 stored in the hard disk, and a predetermined number. And a recording head (not shown) which is a driver for reading predetermined programs and writing predetermined data to the hard disk.

  The map information DB 25 stores navigation map information 26 used for travel guidance and route search of the navigation device 1. Here, the navigation map information 26 includes various information necessary for route guidance and map display. For example, new road information for identifying each new road, map display data for displaying a map, Intersection data related to each intersection, node data related to node points, link data related to roads (links) as a type of facility, search data for searching for routes, stores related to POI (Point of Interest) such as stores as a type of facility It is composed of data, search data for searching points, and the like.

  The store data includes a search result display screen 71 (FIG. 5) described later in addition to the name, address, telephone number, etc. regarding POIs such as hotels, hospitals, gas stations, parking lots, stations, airports, and ferry platforms in each region. 7) may be stored together with the ID for specifying the POI. For example, the display priority is represented by a numerical value such as “88” or “256”, and the higher the numerical value, the higher the priority. The contents of the map information DB 25 are updated by downloading update information distributed from the map information distribution center (not shown) via the communication device 17.

  In addition, the facility name DB 27 stores a facility name and a reading of the facility name, which will be described later, in association with a divided character string of a predetermined number of characters (one character in this embodiment) and stored for each division unit. 51 (see FIG. 2) is stored.

  As shown in FIG. 1, the navigation control unit 13 constituting the navigation device 1 is a working device that controls the entire navigation device 1, the CPU 41 as the control device, and the CPU 41 performs various types of arithmetic processing. An internal storage device such as a RAM 42 that is used as a memory and stores route data when a route is searched, a ROM 43 that stores a control program, and a flash memory 44 that stores a program read from the ROM 43 In addition, a timer 45 for measuring time is provided.

The ROM 43 stores a spot information display processing program (see FIG. 3) for searching for spot information based on a search word input from a later-described 50-sound key 62 and displaying the list.
Furthermore, the navigation control unit 13 is electrically connected to peripheral devices (actuators) of the operation unit 14, the liquid crystal display 15, the speaker 16, the communication device 17, and the touch panel 18.

  The operation unit 14 is operated when correcting the current location at the start of traveling, inputting a departure point as a guidance start point and a destination as a guidance end point, or searching for information about facilities, etc. Consists of keys and multiple operation switches. The navigation control unit 13 performs control to execute various corresponding operations based on switch signals output by pressing the switches.

  Further, the liquid crystal display 15 includes map information currently traveling, a search word input screen 61 (see FIG. 6), which will be described later, a search result display screen 71 (see FIG. 7) for displaying the names of the searched facilities, and operation guidance. , Operation menu, key guidance, recommended route from the current location to the destination, guidance information along the recommended route, traffic information, news, weather forecast, time, mail, TV program, etc. are displayed.

  In addition, the speaker 16 outputs voice guidance or the like for guiding traveling along the recommended route based on an instruction from the navigation control unit 13. Here, the voice guidance to be guided includes, for example, “200m ahead, turn right at XX intersection”.

  The communication device 17 is a communication means such as a mobile phone network that communicates with the map information distribution center, and transmits / receives the latest version of updated map information and the like to / from the map information distribution center. Further, in addition to the map information distribution center, the communication device 17 receives traffic information composed of information such as traffic congestion information transmitted from the road traffic information center and the like and congestion status of the service area.

  The touch panel 18 is a transparent panel-like touch switch mounted on the surface portion of the liquid crystal display 15, and inputs various instruction commands by pressing buttons or a map displayed on the screen of the liquid crystal display 15. It is configured to be possible. Note that the touch panel 18 may be configured by an optical sensor liquid crystal method or the like that directly presses the screen of the liquid crystal display 15.

Here, the facility name data table 51 stored in the facility name DB 27 will be described with reference to FIG.
As illustrated in FIG. 2, the facility name data table 51 includes “division units”, “reading” that stores the reading of the facility name, and “facility name”. In this “division unit”, hiragana characters that match the keywords that make up the reading of the facility name are stored one character at a time in the order of 50 tones. Here, the keyword is a character string of reading composed of units that make sense.

  “Division unit” includes, for example, “Ah”, “Ai”, “Ah”,..., “Ah,” “Ah,” “Ah”, etc. You may make it memorize | store it one by one. In addition, only a part of the “division unit”, for example, “O”, “ka”, “ka”, “kan”, “ki”, “ku”, etc., 50 sounds Two or more characters may be stored in order.

  Further, “reading” stores a reading of a facility name including a keyword that matches the hiragana stored in each “division unit”. In addition, the reading of the facility name is stored by being separated by a delimiter (for example, “/”) for each keyword. The facility name readings are rearranged so that the keyword order circulates in accordance with the reading order of the facility name so that the first keyword matching the hiragana stored in the division unit is first. Has been.

  For example, if the facility name is “Tokyo / Nezumi / Rand”, “Tokyo”, “Nezumi” and “Land” are stored in “Read” as keywords of the facility name. The facility name reading “Tokyo / Nezumi / Rand” is stored in the “reading” corresponding to each of the hiragana “to”, “ne”, “ra” in the “division unit” of the facility name data table 51, respectively. Is done.

  In addition, “g”, “pa”, and other muffled / semi-acoustic sounds included in the facility name readings are “ka”, “ha”, etc., as well as lower-case kana characters such as “nya”, “tsu”, etc. ) Is converted into kana basic characters such as “ya” and “tsu”, and long tones are converted into kana basic characters and stored, such as corresponding vowels. For example, “Tokyo / Nesumi / Rando” is actually stored as “Toukiyo / Nesumi / Rando”, but in this embodiment, in order to simplify the explanation, the facility name and the reading are used. Match and explain as “Tokyo / Nezumi / Land”.

  In the “reading” of the facility name corresponding to the “division unit” in which the hiragana “to” is stored, “Tokyo / nezumi / rando” is stored so that the keyword “Tokyo” is first. . In addition, in the “reading” of the facility name corresponding to the “division unit” in which the hiragana “ne” is stored, “nezumi / rando / tokyo” is stored so that the keyword “nezumi” is first. Yes. In addition, in the “reading” of the facility name corresponding to the “division unit” in which the hiragana “ra” is stored, “rando / tokyo / nezumi” is stored so that the keyword “rando” comes first. .

  Further, in “facility name”, a facility name representing a destination to be searched is stored corresponding to the reading of the facility name stored in “reading”. For example, the facility name “Tokyo Nesme Land” is stored corresponding to the reading of the facility name “Tokyo / Nezumi / Land”. Accordingly, the facility name “Tokyo Nesme Land” is “Hi”, “Ne” and “Read” in “Tokyo” / “Nezumi / Land”, “ It is stored in the “facility name” corresponding to each of “Nezumi / Land / Tokyo” and “Rand / Tokyo / Nezumi”.

  As a result, there is an overlap of the facility name stored in the “facility name” among the “division units” in the facility name data table 51, but the facility name stored in the “facility name” within each “division unit”. There is no duplication, and only one facility name is stored. Accordingly, there is an overlap in the reading of the facility name stored in the “reading” among the “division units” in the facility name data table 51, but in each “division unit”, the facility name stored in the “reading” is stored. There is no duplication of readings, and only readings of one facility name are stored.

  In addition, for example, if the reading of the name of the facility matches the reading of the first character of each keyword “NOUKYO” and “NOOM”, such as “NOOKYO / NOMU”, the name of the facility Only “Reading” corresponding to “No” in “Division unit” of the data table 51 stores “Now / Noum” and “Facility name” corresponding to “No” in “Division unit” "Agricultural cooperative gnome" is stored only.

  As a result, when the first character in front of a plurality of keywords constituting the facility name reading matches, the redundant storage of “reading” and “facility name” between “division units” in the facility name data table 51 is reduced. Therefore, the data capacity of the facility data table 51 can be reduced. In addition, the total data capacity of “reading” and “facility name” for each “division unit” can be set to a predetermined data capacity or less (for example, 1 megabyte to 10 megabyte or less).

[Point information display processing]
Next, a process executed by the CPU 41 of the navigation apparatus 1 configured as described above, which searches for point information based on a search word input from the 50 sound key 62 and displays a list of the “point information display process” Will be described with reference to FIGS.

  FIG. 3 is a flowchart showing a “spot information display process” which is a process executed by the CPU 41 and searches the spot information based on the input search word and displays the list. The program shown in the flowchart in FIG. 3 is executed by the CPU 41 when a destination setting button (not shown) of the operation unit 14 is pressed.

As shown in FIG. 3, first, in step (hereinafter abbreviated as S) 11, the CPU 41 searches the screen of the liquid crystal display 15 for a destination address, a name related to a facility, etc. as point information. A search word input screen 61 for inputting is displayed.
Here, an example of the search word input screen 61 will be described with reference to FIG. As shown in FIG. 6, on the search word input screen 61, a 50 sound key 62, an input character display unit 63, a search word display unit 64, a correction button 65, a return button 66, a next word button 67, and a completion button 68 are displayed. Is done.

  In the input character display portion 63, the input character input by the 50 sound key 62 is displayed. When the next word button 67 is pressed, the character string displayed on the input character display unit 63 is fixedly displayed on the search word display unit 64 as a search word, and the next character string is input. Is possible. Further, every time the correction button 65 is pressed, the last input characters of the character string displayed on the input character display unit 63 can be deleted one by one.

  In addition, by pressing the return button 66, it is possible to return to the screen before the search word input screen 61. Further, by pressing the completion button 68, the name of the facility as the point information, etc., with each character string displayed on the search word display unit 64 and the character string displayed on the input character display unit 63 as a search word Can be instructed to search and display a list.

  Subsequently, as shown in FIG. 3, in S <b> 12, the CPU 41 executes a determination process for determining whether or not the 50 sound key 62 is pressed, that is, whether or not a search word is input from the 50 sound key 62. . If it is determined that the 50-sound key 62 has been pressed (S12: YES), the CPU 41 displays the input characters input from the 50-sound key 62 on the input character display unit 63 and the input character display unit 63. Is stored in the RAM 42 as a search term, and the process proceeds to S13.

  In S13, the CPU 41 uses each character string displayed on the search word display unit 64 and the character string displayed on the input character display unit 63 as a search word from the facility name stored in the facility name data table 51. After executing a sub-process (see FIG. 4) of “candidate facility name extraction process” described later that extracts candidate facility names that are site candidates, the processes after S12 are executed again.

  On the other hand, if it is determined that the 50 sound key 62 has not been pressed (S12: NO), the CPU 41 proceeds to the process of S14. In S14, the CPU 41 executes a determination process for determining whether or not the next word button 67 has been pressed. If it is determined that the next word button 67 has been pressed (S14: YES), the CPU 41 proceeds to the process of S15.

  In S15, the CPU 41 displays the character string displayed on the input character display unit 63 as a search word on the search word display unit 64 and stores the character string in the RAM 42 in time series as a fixed search word. Further, the CPU 41 clears the character string displayed on the input character display unit 63 and sets it so that a new character string can be input from the 50-sound key 62, and then executes the processes after S12 again.

  On the other hand, if it is determined that the next word button 67 has not been pressed (S14: NO), the CPU 41 proceeds to the process of S16. In S16, the CPU 41 executes determination processing for determining whether or not the completion button 68 has been pressed. If it is determined that the completion button 68 has not been pressed (S16: NO), the CPU 41 proceeds to the process of S17.

  In S17, the CPU 41 executes a determination process for determining whether the correction button 65 or the return button 66 has been pressed. If it is determined that the correction button 65 has been pressed, the CPU 41 deletes one character of the last input character of the character string displayed on the input character display unit 63, and then executes the processes after S12 again. .

  If it is determined that the return button 66 has been pressed, the CPU 41 ends the processing shown in FIG. 3 and returns to the screen before the search word input screen 61. Further, when the correction button 65 and the return button 66 are not pressed, the CPU 41 executes the processes after S12 again.

  On the other hand, if it is determined that the completion button 68 has been pressed (S16: YES), the CPU 41 proceeds to the process of S18. In S <b> 18, the CPU 41 terminates the process after executing a sub-process (see FIG. 5) of “list display process” described later for displaying a list of candidate facility names extracted in S <b> 13.

[Candidate facility name extraction process]
Next, the sub-process of the “candidate facility name extraction process” executed in S13 will be described with reference to FIG.
As shown in FIG. 4, in S <b> 111, the CPU 41 reads the search word displayed on the input character display unit 63 and the confirmed search word displayed on each search word display unit 64 from the RAM 42.

  In S112, the CPU 41 sets the search word search order according to the continuation relationship of the search words read from the RAM 42, and stores the search words in the RAM 42 in the search order.

  Specifically, first, when there is a continuation relationship in which the rear end portion of one search word read from the RAM 42 and the head portion of another search word overlap each other, the CPU 41 has a pair of continuation relationships. Of the search terms, the search order of search terms with overlapping rear ends is set to be one order before the search order of search terms with overlapping top portions. Further, when the search word read from the RAM 42 does not have a continuation relationship, the CPU 41 stores the search term in the RAM 42 earlier in the input order, that is, in time series, following the search order of the search terms having the continuation relationship. Set the search order in order.

  For example, when the search word displayed on the input character display unit 63 is “Ranto” and the finalized search word is “Tokyo” or “Nezumi”, the CPU 41 first searches for the search word “Ranto”. Since the rear end “to” and the head part “to” of the search term “Tokyo” overlap, the search order of the search term “Ranto” is set to “first”, and the search order of the search term “Tokyo” is “ Set as “second”. The CPU 41 sets the search order as “third” because the search term “nezumi” has no continuation relationship with other search terms, and each search term “Ranto” and “Tokyo” in this search order. , “Nezumi” is stored in the RAM 42.

  Note that special characters such as muddy sound, semi-voiced sound, stuttering sound, prompt sound, and long sound included in the search word are converted into basic characters and processed. For example, “Tokyo” is searched as “Toukiyo”, “Nezumi” is searched as “Nesumi”, and “Ranto” is unchanged as “Ranto”. As described above, since the special characters included in the facility name reading stored in the facility name data table 51 are also converted into basic characters and stored, as a result, a search that ignores the special characters is performed. become.

  Subsequently, in S113, the CPU 41 reads the search word set first in the search order from the RAM 42, and selects the “division unit” of the facility name data table 51 in which the hiragana that matches the search word in front is stored. It is specified as a “division unit” for extracting the facility name. For example, if the first search word in the search order is “Ranto”, the CPU 41 “divides” the facility name data table 51 in which the hiragana “Ra” that matches the search word “Ranto” is stored. The “unit” is specified as the “division unit” for extracting the candidate facility name.

  In S <b> 114, the CPU 41 sequentially reads “reading” and “facility name” of all the facility names in the “division unit” for extracting the identified candidate facility name from the facility name data table 51 and stores them in the RAM 42. To do. Further, the CPU 41 stores a display target flag indicating whether each “facility name” is a candidate facility name that is a destination candidate in association with each other. Then, the CPU 41 sets all display target flags to “OFF” and initializes them.

Subsequently, in S115, the CPU 41 reads the “reading” of the facility name that is stored first from the “reading” and “facility name” of all the facility names stored in the RAM 42 in S114.
In S116, the CPU 41 reads from the RAM 42 the search word having the first search order.

  Thereafter, in S117, the CPU 41 excludes the used keywords that have already been matched with other search words from the keywords that constitute the “reading” of the facility name that has been read out, and includes them in the remaining unused keywords. A determination process for determining whether or not there is a keyword that matches the search word in front is executed.

  Then, from the keywords constituting the “reading” of the facility name that has been read out, used keywords that have already been forward-matched with other search words are excluded, and the remaining search keywords are forward-matched with the remaining search keywords. When it is determined that there is no keyword (S117: NO), the CPU 41 executes a determination process for determining whether or not there is a “reading” of the next facility name stored in the RAM 42 in S114.

  If it is determined that there is a “reading” of the next facility name stored in the RAM 42 in S114, the CPU 41 executes the loop after S115 again for “reading” of the next facility name. On the other hand, if it is determined that there is no “reading” of the next facility name stored in the RAM 42 in S114, the CPU 41 ends the loop, ends the sub-process, and returns to the main flowchart.

  On the other hand, used keywords that have already matched forward with other search terms are removed from the keywords that constitute the “reading” of the facility name that has been read out, and the search terms that match the search terms remain in the remaining unused keywords. If it is determined that there is a keyword (S117: YES), the CPU 41 proceeds to S118.

  In S <b> 118, the CPU 41 sets an unused keyword that matches the search word that constitutes the “reading” of the read facility name as used and stores it in the RAM 42. When the character string of the search word is longer than the character string of the keyword set as used, the CPU 41 searches again for the character string excluding the keyword that matches the front from the head of the search word. A word. Then, the CPU 41 further sets a keyword that matches the search word in the forward direction to “used” and stores it in the RAM 42.

  For example, if the first search term is “Ranto”, the “reading” of the facility name of the “division unit” in which the hiragana “ra” is stored is “Ran / Tokyo / Kokusai” and each keyword “Ran” ”,“ Tokyo ”, and“ Kokusai ”are not used, the CPU 41 first sets the first keyword“ RAN ”that matches the search term“ RANTO ”as used and stores it in the RAM 42. To do. Then, since the character string of the search term “Ranto” is longer than the character string of the keyword “Ran” set as used, the CPU 41 excludes the keyword “Ran” from the search word “Ranto”. Let “and” be the search term again. Then, the CPU 41 further sets the second keyword “Tokyo” that matches the search term “to” in the forward direction to “used” and stores it in the RAM 42.

  Also, for example, when the first search term is “Ranto”, the “reading” of the facility name of the “division unit” in which the hiragana “ra” is stored is “Rand / Tokyo / Nezumi” and each keyword “ When “Rando”, “Tokyo”, and “Nezumi” are not used, the CPU 41 first sets the first keyword “Rando” that matches the search word “Rando” to “used” and stores it in the RAM 42. Remember. In addition, since the length of the character string of the keyword “Lando” set as used is longer than the length of the character string of the first search term “Lando”, the second keyword “Tokyo” is not used. Remains set to.

  Subsequently, in S119, the CPU 41 executes a determination process for determining whether or not all search terms have been selected, that is, whether or not there are remaining search terms in the next search order. If all the search terms are not selected, that is, if the search terms in the next search order remain (S119: NO), the CPU 41 again performs the search terms in the next search order after S116. Execute the process.

  On the other hand, when all the search words are selected, that is, when there are no search words in the next search order (S119: YES), the CPU 41 proceeds to the process of S120. In S120, the CPU 14 reads the display target flag corresponding to this facility name from the RAM 42 and sets it to “ON”, assuming that the facility name corresponding to the read “read” has all the search terms as keywords. Thereafter, it is stored in the RAM 42 again.

  Subsequently, the CPU 41 executes determination processing for determining whether or not there is “reading” of the next facility name stored in the RAM 42 in S114. If it is determined that there is a “reading” of the next facility name stored in the RAM 42 in S114, the CPU 41 executes the loop after S115 again for “reading” of the next facility name. On the other hand, if it is determined that there is no “reading” of the next facility name stored in the RAM 42 in S114, the CPU 41 ends the loop, ends the sub-process, and returns to the main flowchart.

[List display processing]
Next, the sub-process of “list display process” executed in S18 will be described with reference to FIG.
As shown in FIG. 5, in S <b> 211, the CPU 41 executes the process of S <b> 113 and specifies a “division unit” that specifies a candidate facility name.
In S222, out of all the facility names in the “division unit” from which the identified candidate facility name is extracted, the facility name whose display target flag is set to “ON” is read out, and the candidate facility that is the destination candidate The names are stored in the RAM 42 in order.

Subsequently, in S213, the CPU 41 reads out candidate facility names from the RAM 42 and displays them as a list, displays the number of candidate facility names, ends the sub-process, and returns to the main flowchart.
The liquid crystal display 15 displays a predetermined number, for example, five items at a time in the order of the list (see FIG. 7). When the display priority is assigned to each facility name, the CPU 41 displays the list of candidate facility names as a list sorted in descending order of display priority.

Here, as shown in FIG. 6, when the search word displayed on the input character display unit 63 is “Ranto” and the finalized search word is “Tokyo”, the candidate when the completion button 68 is pressed is displayed. An example of the facility name list display will be described with reference to FIG.
As shown in FIG. 6, as described above, since the search term “Ranto” and the finalized search term “Tokyo” have a continuation relationship, the CPU 41 sets the search order of the search term “Ranto” to “first”. The search order of the search term “Tokyo” is set as “second” and stored in the RAM 42.

  Then, the CPU 41 reads “read” and “read” of all the facility names in the “division unit” of the facility name data table 51 in which the hiragana “ra” that matches the first search term “Ranto” in the search order is stored. The “facility name” is read out and stored in the RAM 42. Further, the CPU 41 sets “OFF” in the display target flag assigned to each facility name and initializes it.

  Subsequently, for example, when the first “reading” of the “division unit” in the facility name data table 51 is “Ran / Tokyo / Kokusai”, as described above, the search term “Ranto” and the front The matching first keyword “RAN” and the second keyword “Tokyo” are set as used. For this reason, since there is no unused keyword that matches forward with the finalized search term “Tokyo”, the display target flag corresponding to the facility name “Tokyo International Run” remains set to “OFF” (S117: NO).

  Further, for example, when the second “reading” of the “division unit” is “Rand / Tokyo / Nezumi”, as described above, the first keyword “ Rando "is set as used. Also, since the second keyword “Tokyo” that matches the confirmed search term “Tokyo” is not used, this second keyword “Tokyo” is set to “used” and corresponds to the facility name “Tokyo Nesme Land”. The display target flag to be set is set to “ON” (S120).

  Also, for example, when the third “reading” of the “division unit” is “Land / Tokyo / Reinbo”, as described above, the first one that matches the search term “Ranto” in the forward direction. The keyword “Land” is set as used. In addition, since the second keyword “Tokyo” that matches the confirmed search term “Tokyo” is not used, the second keyword “Tokyo” is set to “used” and the facility name “Tokyo Rainbow Land” is used. The corresponding display target flag is set to “ON” (S120).

  Therefore, as shown in FIG. 7, the CPU 41 displays the search result display screen 71 on the liquid crystal display 15, and sets a candidate facility name (point information) of “Tokyo Nesme Land” with the display target flag set to “ON”. It is displayed in the search result display field 72 at the top. Further, the CPU 41 displays the candidate facility name (point information) of “Tokyo Rainbow Land” in which the display target flag is set to “ON” in the second search result display field 72 from the top.

  Here, when the user presses and selects the point information in each search result display field 72, the CPU 41 sets the facility as a destination, performs a route search, and displays a recommended route on the map. In addition, facility information about the facility (for example, business hours, fees, etc.) is displayed.

  In addition, a number display section 73 is provided in the upper part of the search result display screen 71, and the number of searched search targets “2” is displayed. Further, on the left side of each search result display column 72, the names of the facilities in the search result display column 72 are scrolled down one by one, the previous button 74 and the next button 75 for scrolling up, and the facility in the search result display column 72 Each page button 76, 77 for scrolling down and scrolling up the name of each is displayed.

  As described above in detail, in the navigation device 1 according to the present embodiment, the CPU 41 continues the relationship in which the rear end portion of one search word and the head portion of another search word overlap each other among the input search terms. If there is a search term, the search term search order is set according to the continuation relationship. In addition, when the search word has no continuation relationship, the CPU 41 sets the search order in the input order following the search order of the search terms having the continuation relationship.

  Then, the CPU 41 reads “reading” and “facility name” of all the facility names in the “division unit” that matches the first search word in accordance with the search order, and stores them in the RAM 42. Further, the CPU 41 sets “OFF” in the display target flag assigned to each facility name and initializes it. Then, the CPU 41 sets the used keywords in order from the first keyword including the character of the search word used when it matches the search word in front of the plurality of keywords constituting each “reading”. Then, the display target flag of the facility name having an unused keyword that coincides with the last search word is set to “ON” and extracted as a candidate facility name.

  As a result, even if there is a continuation relationship between the input search terms, candidate facility names are extracted in a single search according to the search order set for each search term for each facility name in the corresponding "division unit" Therefore, it is possible to perform a search at a high speed and prevent a decrease in responsiveness.

  In addition, the CPU 41 sets the search order of search words with overlapping rear end portions of a pair of search terms having a continuation relationship so that the search order of the search terms with overlapping head portions is the one before the search order. Therefore, it is possible to surely eliminate the corresponding keyword in duplicate, perform the search at high speed, and improve the responsiveness.

  Furthermore, when the input search word does not have a continuation relationship, the search order is set in the input order following the search order of the search terms having the continuation relationship. It is possible to set quickly, perform a search at a higher speed, and further improve the responsiveness.

  In addition, this invention is not limited to the said Example, Of course, various improvement and deformation | transformation are possible within the range which does not deviate from the summary of this invention.

  For example, the search order of search words with overlapping head parts of a pair of search words having a continuation relationship is set to be the order one before the search order of search words with overlapping rear end parts. Also good. Also, in this case, if the character string of the search word with overlapping rear ends is longer than the keyword that has been matched forward, the character string that is obtained by removing the keyword that has been matched from the search word will be used again as the search word. It may be set to determine whether or not there is an unused keyword that matches the search word in front (S117). As a result, the CPU 41 can surely eliminate the corresponding keyword in duplicate, perform a search at a high speed, and improve the responsiveness.

  Also, for example, if there are search terms that do not have a continuation relationship among the plurality of input search terms, the search terms that do not have a continuation relationship are set in the order in which they are entered, followed by a continuation relationship You may make it set the search order of a certain search term. As a result, the CPU 41 can quickly set the search order of the search terms, perform the search at high speed, and improve the responsiveness.

DESCRIPTION OF SYMBOLS 1 Navigation apparatus 14 Operation part 15 Liquid crystal display 18 Touch panel 25 Map information DB
27 Facility name DB
41 CPU
42 RAM
43 ROM
51 Facility Name Data Table 61 Search Word Input Screen 62 50 Sound Key 71 Search Result Display Screen 72 Search Result Display Field

Claims (4)

Facility name storage means for storing a plurality of facility names to be searched by dividing them into a plurality of keywords,
An input means for entering a search term;
A candidate facility name extracting means for extracting a facility name as a candidate facility name when the search word is forward-matched with a search target character string created by rearranging a plurality of keywords constituting the facility name;
Output means for outputting the candidate facility name extracted by the candidate facility name extracting means;
With
The candidate facility name extraction means includes:
Of the search terms input by the input means, if there is a continuation relationship in which the rear end of one search term and the beginning of another search term overlap each other, the search terms are searched according to the continuation relationship. Set,
For each of the plurality of facility names, in search from the first search word in accordance with the search order, search for a search target character string that matches forward with the search word,
Of the plurality of keywords constituting the search target character string that matches the search word in front, the keyword including the character of the search word that was used when the search word is matched forward is sequentially excluded, and the last search word A facility search apparatus that extracts a facility name having a keyword that coincides with the keyword as a candidate facility name.   The candidate facility name extraction means sets the search order of search words with overlapping rear end portions of the pair of search terms having the continuation relationship to the order immediately before the search order of search terms with overlapping head portions. The facility search device according to claim 1, wherein the facility search device is set as follows.   The candidate facility name extraction unit sets the search order in the input order following the search order of the search terms having the continuation relationship when the search term input by the input unit does not have the continuation relationship. The facility retrieval apparatus according to claim 2, wherein In a computer equipped with facility name storage means for storing a plurality of facility names to be searched, each divided into a plurality of keywords,
An input process for entering a search term;
A candidate facility name that extracts a facility name as a candidate facility name when the search term input in the input step matches a search target character string created by rearranging a plurality of keywords constituting the facility name. An extraction process;
An output step of outputting the candidate facility name extracted in the candidate facility name extraction step;
And execute
In the candidate facility name extraction step,
Of the search terms input by the input means, if there is a continuation relationship in which the rear end of one search term and the beginning of another search term overlap each other, the search terms are searched according to the continuation relationship. Set,
For each of the plurality of facility names, in search from the first search word in accordance with the search order, search for a search target character string that matches forward with the search word,
Of the plurality of keywords constituting the search target character string that matches the search word in front, the keyword including the character of the search word that was used when the search word is matched forward is sequentially excluded, and the last search word A program for executing a facility name having a keyword that matches the front of the name as a candidate facility name.

Images