JP5353649B2 - Point search device and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a spot search device and a program for extracting candidate facility names by using all input search words as search conditions. <P>SOLUTION: The search sequence of search words is set according to the inclusion relations of input search words. Then, the keyword flags of leading keywords whose prefix search with the search word is successful among keywords whose keyword flags have not been set are set sequentially from the first search word according to the search sequence for each reading configured of the keywords of a plurality of facility names. Afterwards, the facility name corresponding to reading when the number of the keywords whose keyword flags have been set is equal to the number of the search words whose including relations have been set is extracted as a candidate facility name from a plurality of facility names, and output. <P>COPYRIGHT: (C)2011,JPO&amp;INPIT

Description

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

Conventionally, various techniques for searching for point information based on an input search word have been proposed.
For example, a partially matched keyword is narrowed down for each keyword for name, address, and genre with respect to an input search character, and destination candidates are narrowed down for each keyword narrowed down to this search character. The destination candidates narrowed down for each keyword are stored in correspondence with each search character. Then, there is a navigation device configured to extract destination candidates included in all the destination candidates stored for each search character (logical product) and display them as destination candidates (for example, patents) Reference 1).

JP 2009-54133 A

  According to the navigation device described in Patent Document 1 described above, the logical product of destination candidates included in all the destination candidates stored for each search character is calculated. For this reason, if there is an inclusion relationship between the input search characters, the search characters on the included side will be ignored, and destination candidates can be extracted using all the input search characters as search conditions. There is a problem that it is difficult.

  Therefore, the present invention has been made to solve the above-described problems, and provides a point search apparatus and program capable of extracting candidate facility names using all input search terms as search conditions. The purpose is to do.

The destination point search device according to claim 1 for achieving the can, the readings of a plurality of facility name and the facility name that represents the destination to be searched for each keyword which constitutes the reading of each facility name, the Facility name storage means for storing in association with a divided character string having a predetermined number of characters that coincides with a keyword , input means for inputting a search word, and inclusion relation setting means for setting the inclusion relation of the search word input by the input means If the search order setting means for setting a search order of the search words according to said inclusion relation, each read of the plurality of facility names, the search order is the dividing said predetermined number of characters from the front of the reading of the first search term as a string, each reading of all facility names stored in association with the divided character string, in order from the first search term in accordance with the search order is not set keyword flag the keyword A keyword flag setting means for setting a keyword flag of the first keyword that matches the search word in front of the search word, and the number of keywords for which the keyword flag is set from the plurality of facility names A candidate facility name extracting unit that extracts a facility name corresponding to a reading equal to the number as a candidate facility name; and an output unit that outputs the candidate facility name extracted by the candidate facility name extracting unit. To do.

Further, the spot search device according to claim 2 is the spot search device according to claim 1 , wherein the inclusion relation setting means sets the inclusion relation in descending order of the number of characters of the search words input by the input means. It is characterized by doing.

Furthermore, the program according to claim 3, searches the plurality of facility names representing the destination of interest and readings of the facility name, for each keyword to configure the reading of each facility name, a predetermined matching the keyword and forward An input step of inputting a search term to a computer provided with a facility name storage means for storing in association with a divided character string of the number of characters, an inclusion relationship setting step of setting an inclusion relationship of the search terms input in the input step, A search order setting step for setting a search order for search terms according to the inclusion relationship set in the inclusion relationship setting step, and a search order set in the search order setting step for each reading of the plurality of facility names is first. as the divided character string of the predetermined number of characters from the front of the reading of the search terms, for each reading of all facility names stored in association with the divided character string, from the first search term in accordance with the search order First, a keyword flag setting step for setting the keyword flag of the first keyword that matches the search term in front of the keywords for which no keyword flag is set, and the number of keywords for which the keyword flag is set from the plurality of facility names A candidate facility name extracting step that extracts a facility name corresponding to a reading equal to the number of search terms for which the inclusion relation is set as a candidate facility name, and an output that outputs the candidate facility name extracted in the candidate facility name extracting step And a process for executing the process.

In the point search apparatus according to claim 1 having the above-described configuration, the search word search order is set according to the inclusion relation of the input search words. Then, for every reading of a plurality of facility names, every reading of all facility names stored in association with the divided character string, with a predetermined number of characters as a divided character string from the front of the reading of the search word whose search order is the first. In addition, in accordance with the search order , the keyword flag of the first keyword that matches the search word from the first search word in order from the first search word is set. Thereafter, a facility name corresponding to a reading in which the number of keywords with the keyword flag set to the corresponding state is equal to the number of search terms for which the inclusive relation is set is extracted as a candidate facility name from a plurality of facility names and output.

  As a result, by extracting the facility names corresponding to the readings in which the number of keywords set with the keyword flag from a plurality of facility names is equal to the number of search terms for which inclusion relations are set, Candidate facility names can be extracted using the search term as a search condition.

Further, as the divided character string predetermined number from the front of the search order to read the first search term, in order to search for candidate facility name from all hosts names stored in association with the divided character string to be searched The facility name can be reduced, the search can be performed at a high speed, and a decrease in responsiveness can be prevented.

  Further, a plurality of facility names and the readings of the facility names are stored in association with a divided character string having a predetermined number of characters that coincides with the keyword for each keyword constituting each facility name reading. Thereby, since only one reading of the facility name representing the destination associated with one divided character string is stored, the number of facility names stored in duplicate is reduced, and all facility names to be searched are read. Thus, it is possible to suppress an increase in memory capacity for developing keywords and keyword flags that constitute readings of all facility names.

Moreover, in the point search device according to claim 2 , since the inclusion relation is set in descending order of the number of characters of the reading of the search word input by the input unit, the keyword corresponding to the search word from the keywords constituting the reading of each facility name Can be reliably searched.

Furthermore, in the program according to claim 3 , the computer sets the search term search order according to the inclusion relation of the input search terms by reading the program. The computer for each reading of a plurality of facility names, as divided character string predetermined number from the front of reading the search order of the first search term, the entire facility names stored in association with the divided character string For each reading , the keyword flag of the first keyword that matches the search word among the keywords for which the keyword flag is not set is set in order from the first search word according to the search order . After that, the computer extracts the facility names corresponding to the readings in which the number of keywords set with the keyword flag from the plurality of facility names is equal to the number of search words set with the inclusion relation as candidate facility names and outputs them.

As a result, the computer extracts a facility name corresponding to a reading in which the number of keywords set with the keyword flag from a plurality of facility names is equal to the number of search terms for which inclusion relations have been set as a candidate facility name. Candidate facility names can be extracted using all of the search terms as a search condition. In addition, the computer searches the candidate facility names from the names of all facilities stored in association with the divided character strings, with the predetermined number of characters from the front of the reading of the first search term as the divided character string. As a result, it is possible to reduce the number of facility names, and to perform a search at high speed and prevent a decrease in responsiveness. Further, a plurality of facility names and the readings of the facility names are stored in association with a divided character string having a predetermined number of characters that coincides with the keyword for each keyword constituting each facility name reading. Thereby, since only one reading of the facility name representing the destination associated with one divided character string is stored, the number of facility names stored in duplicate is reduced, and all facility names to be searched are read. Thus, it is possible to suppress an increase in memory capacity for developing keywords and keyword flags that constitute readings of all facility names.

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 which initialized the keyword flag and display object flag of the flag table. It is a figure which shows an example which set the keyword flag and display object flag of the flag table. It is a figure which shows an example of the search result display screen which displayed the list of the extracted facility name. It is a figure which shows an example of the facility name data table stored in facility name DB which concerns on another Example.

  Hereinafter, a point 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) that are a type of facility, search data for searching for routes, store data related to POI (Point of Interest) such as stores that are a type of facility , And search data for searching for a point.

  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. 5), display priority data may be stored together with an 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.

Further, the ROM 43 stores a program (see FIG. 3) of point information display processing for searching for point 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 running, a search word input screen 61 (see FIG. 4) described later, a search result display screen 71 (see FIG. 5) for displaying a list of 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 system 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. For example, when the facility name is “Tokyo / Nezumi / Shi”, “Tokyo”, “Nezumi”, and “Shi” are stored in “Yomi” as keywords for the facility name. Therefore, the reading of the facility name “Tokyo / Nezumi / Shi” corresponds to the “reading” corresponding to the hiragana “shi”, “to”, and “ne” of the “division unit” in the facility name data table 51, respectively. Remembered.

  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 See” is stored corresponding to the reading of the facility name “Tokyo / Nezumi / Shi”. Therefore, the facility name “Tokyo Nesmy Sea” is changed to “Tokyo / Nezumi / Shi” of “Hi” and “To” in “Division unit” of the facility name data table 51 and “Reading” in “Ne”. The corresponding “facility name” is stored respectively.

  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.

  Further, by pressing the return button 66, it is possible to return to the state before the last operation. Furthermore, when the completion button 68 is pressed, each character string displayed on the search word character display unit 64 and the character string displayed on the input character display unit 63 are used as search words, and the name of the facility as point information. Etc. can be instructed to be displayed as 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 character input from the 50-sound key 62 on the input character display unit 63 and also 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 character 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 for extracting candidate facility names that are destination 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 is pressed within a predetermined time (for example, within about 0.5 seconds). If it is determined that the correction button 65 has been pressed within a predetermined time, the CPU 41 deletes one last input character of the character string displayed on the input character display unit 63, and then again after S12. Execute the process.

  If it is determined that the return button 66 has been pressed within a predetermined time, the CPU 41 returns to the state before the last operation, and then executes the processing from S12 again. Further, when it is determined that the correction button 65 and the return button 66 have not been pressed within a predetermined time, 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 inclusion relation of the search words read from the RAM 42, and stores the search words in the RAM 42 in the search order. For example, the CPU 41 sets the search word search order in descending order of the number of characters of each search word read from the RAM 42, and stores the search words in the RAM 42 in this search order. Further, when the number of characters of each search word read from the RAM 42 is the same, the CPU 41 sets the search word search order in the order stored in the RAM 42 earlier in time series, and stores the search words in the RAM 42 in this search order.

  For example, when each search word read from the RAM 42 is “Tokyo”, “Tokyo”, “Tou”, the CPU 41 sets the search order of the search word “Tokyo” first and sets the search word “Tokyo” The search order is set to the second, and the search order of the search word “TO” is set to the third. Then, the CPU 41 stores the search terms “Tokyo”, “Touki”, and “Tou” in the RAM 42 in the search order.

  Further, for example, when the search terms read from the RAM 42 are “Touki” and “Touki”, the CPU 41 sets the search order of the search term “Touki” previously stored in the RAM 42 as the final search term first. The search order of the search word “Touki” displayed in the input character display unit 63 is set to the second. Then, the CPU 41 stores the search terms “touki” and “touki” in the RAM 42 in the order of search.

  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, when the first search word in the search order is “Touki”, the CPU 41 stores “divided unit” in the facility name data table 51 in which the hiragana “to” that matches the search word “Touki” is stored. Are identified as “division units” for extracting candidate facility names.

  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 the flag table 71. Is stored in the RAM 42.

Here, an example of the flag table 71 will be described with reference to FIG.
As shown in FIG. 7, the flag table 71 includes “facility names”, “keywords / keyword flags”, and “display target flags”. First, the CPU 41 sequentially stores all facility names read from “facility names” in “division units” for extracting candidate facility names in “facility names” of the flag table 71.

  Then, the CPU 41 sequentially reads “reading” of all the facility names in the “division unit” for extracting the candidate facility name in the “keyword / keyword flag” of the flag table 71, and for each keyword constituting each reading. A keyword flag is added and stored in order of keywords corresponding to each facility name. Further, the CPU 41 stores, in the “display target flag” of the flag table 71, a display target flag indicating whether or not the candidate facility name is a destination candidate in association with each facility name.

  For example, in the “keyword / keyword flag” corresponding to “facility name” of “Tokyo Pottery Class” in the flag table 71, each keyword “Tokyo” of “Tokyo / Tokyo / Kyotsu” is read. , “Toki”, “Kyotsutsu”, and “ON” or “OFF” keyword flags are stored in the reading order of each keyword. In addition, the “display target flag” corresponding to the “facility name” of “Tokyo Pottery Classroom” in the flag table 71 is a display target of “ON” or “OFF” indicating whether or not the candidate facility name is a destination candidate. A flag is stored.

  In S115, as shown in FIG. 7, the CPU 41 sets all keyword flags and all display target flags stored in the flag table 71 to “OFF” and initializes them.

Subsequently, in S 116, the CPU 41 reads each keyword and keyword flag corresponding to the facility name stored first from “keyword / keyword flag” in the flag table 71 and stores it in the RAM 42.
In S117, the CPU 41 reads from the RAM 42 the search word having the first search order.

  In S118, the CPU 41 reads each keyword and keyword flag stored in S116 from the RAM 42, and among the keywords for which the keyword flag is set to “OFF”, the first search word in the search order and the front If there is a matching keyword, the keyword flag corresponding to the first keyword that matches the search word in front is set to “ON” and stored in the RAM 42 again.

  For example, as shown in FIG. 7, when the first facility name stored in the “facility name” of the flag table 71 is “Tokyo Pottery Classroom” and the first search word in the search order is “Touki”. First, the CPU 41 reads “Tokyo / OFF”, “Tokyo / OFF”, and “Tokyo / OFF” of the “keyword / keyword flag” corresponding to “Tokyo Pottery Classroom” in the flag table 71 and reads the RAM 42. To remember.

  Then, the CPU 41 reads “Tokyo / OFF”, “Tokyo / OFF”, and “Tokyo / OFF” from the RAM 42 as keywords and keyword flags. The CPU 41 corresponds to the first keyword “Tokyo / OFF” because there is a first keyword “Tokyo / OFF” whose keyword flag is “OFF” in front of the first search word “Tokyo” in each search order. The keyword flag is set to “ON” and stored in the RAM 42 again. That is, the CPU 41 again stores “Tokyo / ON”, “Tokyo / OFF”, and “Tokyo / OFF” as the keywords and keyword flags in the RAM 42.

  Thereafter, 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 have not been selected, that is, if the search terms in the next search order remain (S119: NO), the CPU 41 again executes the search terms in the next search order after S117. Execute the process.

  For example, when there is a second search term “Touki” in the search order, the CPU 41 reads “Tokyo / ON”, “Toki / OFF”, and “Kyoto / OFF” from the RAM 42 as each keyword and keyword flag. . Then, since there is a head keyword “Touki / OFF” with a keyword flag “OFF” that matches the second search word “Touki” in the search order, the CPU 41 corresponds to the first keyword “Touki / OFF”. The flag is set to “ON” and stored in the RAM 42 again. That is, the CPU 41 stores “Tokyo / ON”, “Tokyo / ON”, and “Tokyo / OFF” as the keywords and keyword flags in the RAM 42 again.

  On the other hand, when all search words are selected, that is, when there are no search words in the next search order (S119: YES), the CPU 41 reads each keyword and keyword flag from the RAM. Then, when there is a keyword whose keyword flag is set to “ON”, the CPU 41 sets the keyword flag corresponding to the keyword of “keyword / keyword flag” in the flag table 71 to “ON”, The process proceeds to S120.

  For example, as shown in FIG. 8, the CPU 41 reads “Tokyo / ON”, “Tokyo / ON”, and “Tokyo / OFF” from the RAM 42 as each keyword and keyword flag. Then, the CPU 41 extracts the keywords “Tokyo” and “Tokyo” whose keyword flag is set to “ON”. Then, the CPU 41 sets the keyword flags of the extracted keywords “Tokyo” and “Touki” of the “keyword / keyword flag” corresponding to the facility name stored first in the “facility name” of the flag table 71 to “ After setting to “ON”, the process proceeds to S120.

  In S120, the CPU 41 reads each keyword and keyword flag from the RAM 42 again. When the number of keywords for which the keyword flag is set to “ON” is equal to the number of search terms acquired in S111, the CPU 41 sets “display target flag” in the flag table 71 to “ON”. Set to. On the other hand, if the number of keywords whose keyword flag is set to “ON” is different from the number of search terms acquired in S111, the CPU 41 sets “display target flag” in the flag table 71 to “ON”. Is not set, i.e., remains "OFF".

  For example, as shown in FIG. 8, when each search term is “Touki” or “Touki”, first, the CPU 41 sets “Toyo / ON”, “Touki / ON”, “Toyo” as each keyword and keyword flag. "/ OFF" is read from the RAM 42. Then, the CPU 41 determines that the number of keywords whose keyword flag is set to “ON” is “2” and is equal to the number of search terms “2”, and the “facility name” in the flag table 71 is determined. The “display target flag” corresponding to the facility name stored first is set to “ON”.

  Subsequently, after executing the process of S120, the CPU 41 stores in the "keyword / keyword flag" of the flag table 71 each keyword and keyword flag corresponding to the facility name next to each keyword and keyword flag read in S116. A determination process for determining whether or not there is present is executed. If the CPU 41 determines that there is a keyword and keyword flag corresponding to the next facility name of each keyword and keyword flag read in S116, the CPU 41 determines the keyword and keyword flag corresponding to the next facility name. The loop after S116 is executed again.

  On the other hand, if it is determined that there is no keyword and keyword flag corresponding to the facility name next to each keyword and keyword flag read out in S116, the CPU 41 stores all keyword flags and keywords stored in the flag table 71. It is determined that all display target flags have been set, the loop is terminated, the sub-process is terminated, and the process returns to the main flowchart.

[List display processing]
Next, sub processing of “list display processing” executed in S18 will be described with reference to FIGS.
As shown in FIG. 5, in S <b> 211, the CPU 41 executes a determination process for determining whether or not the flag table 71 exists, that is, whether or not the flag table 71 is stored in the RAM 42. If the flag table 71 is not stored in the RAM 42 (S211: NO), the CPU 41 ends the sub-process and returns to the main flowchart.

  On the other hand, when the flag table 71 is stored in the RAM 42 (S211: YES), the CPU 41 proceeds to the process of S212. In S212, the CPU 41 reads the facility name whose display target flag is set to “ON” from the “facility name” of the flag table 71, and sequentially stores it in the RAM 42 as a candidate facility name that is a destination candidate.

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 at a time in the order of the list (see FIG. 9). 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. 8, only the “display target flag” corresponding to the facility name of “Tokyo Ceramics Class” in the flag table 71 is set to “ON” with the search terms “Touki” and “Touki”. An example of a list display of candidate facility names in the case of being present will be described with reference to FIG.

  As shown in FIG. 9, the CPU 41 displays a search result display screen 81 on the liquid crystal display 15, and displays one candidate facility name (point information) of “Tokyo Pottery Classroom” in the search result display field 82 at the top. indicate. Here, when the user presses and selects the point information in the search result display field 82, 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 83 is provided in the upper portion of the search result display screen 81, and the number of searched search targets “1” is displayed. In addition, on the left side of each search result display column 82, the name of the facility in the search result display column 82 is scrolled down one by one, the previous button 84 and the next button 85 for scrolling up, and the facility in the search result display column 82 The page buttons 86 and 87 for scrolling down and scrolling up the name of each page are displayed.

  As described above in detail, in the navigation device 1 according to the present embodiment, the CPU 41 sequentially searches the keywords and keyword flags corresponding to the facility names in the flag table 71 in order from the first search term. If the keyword whose keyword flag is set to “OFF” includes a keyword that matches the search word, the keyword flag corresponding to the first keyword that matches the search word is set to “ON”. Set.

  Then, after setting each keyword flag of the flag table 71 for all search terms, the CPU 41 sets the number of keywords whose keyword flag is set to “ON” for each facility name of “facility name” of the flag table 71, and If the number of search terms is equal, the “display target flag” is set to “ON”. Then, the CPU 41 reads out the facility names for which the display target flag is set to “ON” from “facility names” in the flag table 71 and displays a list of candidate facility names that are destination candidates.

  As a result, when the number of keywords whose keyword flag is set to “ON” for each facility name of “facility name” in the flag table 71 is equal to the number of search terms, “display target flag” is set to “ON”. Therefore, it is possible to reliably extract candidate facility names using all the search terms input from the 50-sound key 62 as search conditions.

  In addition, the CPU 41 reads the search word set first in the search order from the RAM 42, and stores “1” of all the facility names in the “division unit” of the facility name data table 51 in which the hiragana characters that coincide with the search word are stored. The “read” and “facility name” are read in order, and the flag table 71 is created. As a result, the facility names to be searched for candidate facility names are all facility names in the “division unit” of the facility name data table 51 in which the hiragana characters that match the search word set first in the search order are stored. The number of facility names to be searched can be reduced, and the search can be performed at a high speed and the reduction in responsiveness can be prevented.

  In addition, although there is a duplication of the facility name stored in the “facility name” among the “division units” in the facility name data table 51, the facility name stored in the “facility name” is stored in 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.

  Thus, since only one facility name representing the destination is stored in the “facility name” of the flag table 71, the facility name that is stored redundantly, each keyword and keyword flag corresponding to the facility name are stored. By reducing this, it is possible to reduce the data capacity of the flag table 71. Accordingly, it is possible to suppress an increase in the memory capacity of the RAM 42 that expands the facility name in the flag table 71 and each keyword and keyword flag corresponding to the facility name.

  When a search word is input from the 50 sound key 62, the CPU 41 searches each character string displayed on the search word character display unit 64 and the character string displayed on the input character display unit 63 with the search word. As above, the search order is set in the order of the number of characters in each search word, and when the number of characters is the same, the search order is set in chronological order. Thereby, the CPU 41 can surely search each keyword and keyword flag corresponding to each facility name in the flag table 71 for all search words.

  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.

  (A) For example, the navigation device 101 according to another embodiment has substantially the same configuration as that of the navigation device 1, but the facility name data table 91 shown in FIG. You may make it store in. Here, the facility name data table 91 will be described with reference to FIG.

As shown in FIG. 10, the facility name data table 91 is composed of a “division unit”, “reading” for storing the reading of the facility name, and “facility name” in the same manner as the facility name data table 51. Yes.
However, this “division unit” is stored corresponding to a combination of two lines of 50 sounds to which a two-character hiragana character that coincides with the keyword constituting the facility name reading belongs. For example, when the “division unit” is “ta line line”, each hiragana character “taa”, “tai”, “tau”,... Toe "and" Too "belong.

  In addition, for example, “A line”, “A line”, “Sa line”,..., “A line, A line, A line”, “A line, A line”, “A line” One line of 50 sounds, or a combination of three or more lines, such as “A line, etc.” may be stored. In addition, only a part of the “division unit”, for example, “A line”, “A line, a line”, “A line, a line”,. A combination of three or more lines of 50 sounds, such as “ka line or line”, “ka line or line”, etc., may be stored.

  In addition, “reading” stores a reading of a facility name including a keyword that coincides with each hiragana character of two characters belonging to “division unit”. For example, the facility name reading “Tokyo / Nezumi / Shi” is “division unit” in the facility name data table 91 corresponding to the two characters “To”, “Nez”, and “Shi” in front of each keyword. ”Is stored in“ reading ”corresponding to each of the combinations of“ ta line and line ”,“ na line and line ”, and“ sa line and line ”. The long sound “-” is read as the vowel of the previous character.

  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 Nesmea” is “Tokyo / L” in the “division unit” of the facility name data table 91, “Tokyo / It is stored in the “facility name” corresponding to “nezumi / shi”.

  Also, for example, the reading of the name of the facility is “Nokyo / Nomu”, and the two letters in front of each keyword “Nokyo” and “Noum” have the same “division unit” “Na”. In the case of belonging to “line-of-line”, only “reading” corresponding to “line-of-line” of “division unit” of the facility name data table 91 is stored and The “agricultural cooperative gnome” is stored only in the “facility name” corresponding to the “division unit” of the “division unit”.

  Then, the CPU 41 of the navigation device 101 according to another embodiment replaces the facility name data table 51 with the facility name data table 91 in S113 to S114 of the “candidate facility name extraction process” shown in FIG. May be used.

  Specifically, in S113, the CPU 41 reads the search word set first in the search order from the RAM 42, and stores a facility name data table in which two lines of 50 sounds to which the first two characters of the search word belong are stored. The “division unit” 91 is specified as a “division unit” for extracting candidate facility names. For example, if the first search word in the search order is “Touki”, the CPU 41 stores the facility name data in which “Ta line row” to which the first two letters “Tou” of the search word “Touki” belongs is stored. The “division unit” in the table 91 is specified as the “division unit” for extracting the candidate facility name.

  In S114, the CPU 41 sequentially reads “reading” and “facility name” of all the facility names in the “division unit” from which the identified candidate facility name is extracted from the facility name data table 91, and sets the flag table. 71 is created and stored in the RAM 42. That is, the CPU 41 sequentially reads “reading” of all the facility names in the “division unit” of the facility name data table 91 from which the candidate facility name is extracted into the “keyword / keyword flag” of the flag table 71, and reads each reading A keyword flag is added to each of the keywords constituting the, and the keywords are stored in the order of the keywords corresponding to each facility name. Further, the CPU 41 stores, in the “display target flag” of the flag table 71, a display target flag indicating whether or not the candidate facility name is a destination candidate in association with each facility name.

  As described above in detail, in the navigation apparatus 101 according to another embodiment, since each “division unit” of the facility name data table 91 is composed of a combination of two lines of 50 sounds, there are 250 “division units”. Can be configured. In addition, although there is a duplication of the facility name stored in the “facility name” among the “division units” in the facility name data table 91, within each “division unit”, the facility name stored in the “facility name” is stored. 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” between the “division units” in the facility name data table 91, 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.

  Thereby, in the navigation apparatus 101 according to another embodiment, in addition to the effect achieved by the navigation apparatus 1, only one facility name representing the destination is stored in the “facility name” of the flag table 71. Therefore, it is possible to further reduce the data capacity of the flag table 71 by reducing the redundantly stored facility names and the keywords and keyword flags corresponding to the facility names. Therefore, it is possible to reliably suppress an increase in the memory capacity of the RAM 42 that expands the facility name in the flag table 71 and each keyword and keyword flag corresponding to the facility name.

  (B) Also, for example, the navigation device 105 according to another embodiment has substantially the same configuration as the navigation device 1, but instead of the facility name data table 51, all of the navigation devices 105 are divided into “division units”. You may make it memorize | store in the facility name DB27 the reading divided | segmented with the delimiter for every facility name and the keyword of the said facility name.

  Then, the CPU 41 of the navigation device 105 according to another embodiment replaces the processes of S113 to S114 of the sub-process of “candidate facility name extraction process” shown in FIG. Each keyword of “name” and “reading” of the facility name may be read in order to create the flag table 71 and store it in the RAM 42.

  That is, the CPU 41 may add a keyword flag for each keyword for reading all the facility names, and store them in the flag table 71 in order of keywords corresponding to each facility name. Further, the CPU 41 may store a display target flag indicating whether or not the candidate facility name is a destination candidate in the flag table 71 in association with all the facility names.

  Thereby, the CPU 41 displays the “display target flag” when the number of keywords whose keyword flag is set to “ON” and the number of search terms are the same for each facility name of “facility names” in the flag table 71. Can be set to “ON”, and the candidate facility names can be reliably extracted using all the search terms input from the 50-sound key 62 as search conditions.

1, 101, 105 Navigation device 14 Operation unit 15 Liquid crystal display 18 Touch panel 25 Map information DB
27 Facility name DB
41 CPU
42 RAM
43 ROM
51, 91 Facility name data table 61 Search term input screen 62 50 sound key 71 Flag table 81 Search result display screen 82 Search result display field

Claims (3)

A plurality of readings of the facility name and the facility name that represents the destination to be searched for each keyword which constitutes the reading of each facility name, and stores in association with the divided character string having a predetermined number of characters that match the keyword and forward Facility name storage means;
An input means for entering a search term;
Inclusion relation setting means for setting inclusion relations of search terms input by the input means;
Search order setting means for setting a search order of search terms according to the inclusion relation;
For each read of the plurality of facility names, the predetermined number of characters the search order is from the front of the reading of the first search term as the divided character string, reading of all the facility names stored in association with the divided character string A keyword flag setting means for setting a keyword flag of the first keyword that matches the search word in front of the keywords for which no keyword flag is set in order from the first search word in accordance with the search order ;
Candidate facility name extraction means for extracting, as candidate facility names, facility names corresponding to readings in which the number of keywords with keyword flags set from the plurality of facility names is equal to the number of search terms for which the inclusion relation is set;
Output means for outputting the candidate facility name extracted by the candidate facility name extracting means;
The point search device characterized by comprising. The point search device according to claim 1, wherein the inclusion relation setting unit sets the inclusion relation in descending order of the number of characters of the search word input input by the input unit. A plurality of readings of the facility name and the facility name that represents the destination to be searched for each keyword which constitutes the reading of each facility name, and stores in association with the divided character string having a predetermined number of characters that match the keyword and forward A computer equipped with facility name storage means
An input process for entering a search term;
An inclusion relationship setting step of setting an inclusion relationship of the search terms input in the input step;
A search order setting step for setting a search order of search terms according to the inclusion relationship set in the inclusion relationship setting step;
For each reading of the plurality of facility names, the predetermined number of characters is stored in association with the divided character string as the divided character string from the front of the reading of the search word having the first search order set in the search order setting step. Each time the names of all facilities are read , the keyword flag of the first keyword that matches the search word in front of the search keyword is set in order from the first search word in accordance with the search order. Keyword flag setting process,
A candidate facility name extracting step of extracting, as candidate facility names, facility names corresponding to readings in which the number of keywords set with keyword flags from the plurality of facility names is equal to the number of search terms set with the inclusion relation;
An output step of outputting the candidate facility name extracted in the candidate facility name extraction step;
A program for running

Images