JP5407760B2 - Point search device and program - Google Patents

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, 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

According to the vehicle navigation device described in Patent Literature 1 described above, it is possible to search for a corresponding facility name at a high speed by searching for a name that matches the input search word in front.
However, since it is necessary to create and store a plurality of names for each facility, the data capacity of the name list increases. However, when an application program for facility search is developed on the memory, the name list There is a problem in that it is difficult to extract from a large amount of data due to a limit in the memory capacity for deploying.

  On the other hand, if only one name of the facility name representing the destination is stored, the memory capacity for expanding the name list is reduced, but the name that includes the reading that matches the input search term is included in the name. Therefore, there is a problem that the search time increases and the response performance decreases.

  Accordingly, the present invention has been made to solve the above-described problems, and can suppress an increase in the memory capacity for expanding the name list, perform a search at a high speed, and prevent a decrease in responsiveness. It is an object of the present invention to provide a point search apparatus and a program that can be used.

In order to achieve the object, the point search apparatus according to claim 1 reads a plurality of facility names representing a destination to be searched and a reading of the facility name for each keyword constituting a reading of each facility name. The facility name storage means for storing in association with the divided character string having a predetermined number of characters that coincides with the forward character, the input means for inputting the search word, and the number of reading characters of the search word input by the input means is larger than the predetermined character number A character number determining means for determining whether or not the number of characters read by the input means via the character number determining means is greater than the predetermined number of characters . the predetermined number from the front of the reading of the input search word as the divided character string, key matching the search term and forward from all locations name stored in association with the divided character string Find the facility name with the read over de as a candidate POI name, if the number of characters read search term that is input is determined to the the predetermined number or less by the input means via said number determining means And a search means for acquiring all facility names stored in association with the divided character string including the search word as candidate facility names .

In addition, the point search device according to claim 2 matches the keyword with a plurality of facility names representing destinations to be searched and the reading of the facility name for each keyword constituting the reading of each facility name. A facility name storage means for storing in association with a combination of a predetermined number of lines of 50 sounds to which a plurality of divided character strings of a predetermined number of characters belong, an input means for inputting a search word, and a search word input by the input means Search for searching for a candidate facility name from all facility names stored in association with a combination of a predetermined number of lines of 50 sound lines to which the divided character string belongs, with the plurality of predetermined characters as the divided character string from the front of the reading Means .

Further, the point search device according to claim 3 is the point search device according to claim 2 , wherein the number of characters for determining whether or not the number of characters read by the input means is greater than the predetermined number of characters. A determination unit, and when the search unit determines that the number of characters read by the input unit via the character number determination unit is greater than the predetermined number of characters, the divided character string is A facility name having a keyword that matches the search word as a candidate for reading is searched as a candidate facility name from all the facility names stored in association with a combination of a predetermined number of lines of the 50 sound lines to which the line belongs. If it is determined that the number of characters of the search word input by the input means is equal to or less than the predetermined number of characters, the 50-sound character to which the divided character string including the search word belongs is assigned. And acquiring the entire facility names stored in association with the combination of a predetermined number of rows as the candidate POI name.

According to a fourth aspect of the present invention, there is provided the point search apparatus according to the second aspect , wherein the search means includes 50 sounds constituting the predetermined number of characters from the front of the reading of the search word input by the input means. A facility name having a keyword that matches the search word in front as a candidate facility name is searched from all the facility names stored in association with the combination of lines.

According to a fifth aspect of the present invention, the program includes a plurality of facility names representing destinations to be searched and a reading of the facility names for each keyword constituting each facility name reading, and a predetermined number of characters that match the keyword forward An input step of inputting a search word to a computer having facility name storage means for storing the character string in association with the divided character string, and whether the number of characters read in the search word input in the input step is greater than the predetermined number of characters In the character number determination step and the character number determination step, if it is determined that the number of characters to be read in the search word input in the input step is larger than the predetermined number of characters, it is input in the input step the predetermined number from the front of the search word reading as the divided character string, reading the keyword that the prefix match the search term from the entire facility name stored in association with the divided character string Search facility name to as candidate POI name in the character number judgment step, when the number of characters read search term input by the input step is determined to the the predetermined number or less, containing the search term And a search step for acquiring all facility names stored in association with the divided character strings as candidate facility names .
Further, the program according to claim 6 includes a plurality of facility names representing destinations to be searched and a reading of the facility names for each keyword constituting each facility name reading. An input step of inputting a search word to a computer having facility name storage means for storing in association with a combination of a predetermined number of 50 sound lines to which a divided character string of a predetermined number of characters belongs, and a search input in the input step Search for candidate facility names from all facility names stored in association with a combination of predetermined number of lines of 50 sounds to which the divided character string belongs, with the plurality of predetermined characters as the divided character string from the front of the word reading And a search step for executing the program.

  In the point search device according to claim 1 having the above-described configuration, for each of a plurality of divided character strings having a predetermined number of characters, reading of a keyword that matches forward with the divided character string is performed from a plurality of facility names representing destinations to be searched. The facility name is extracted, and the extracted facility name and the reading of the facility name are stored in association with the corresponding divided character string. As a result, 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 the data capacity of the name list is reduced. Therefore, it is possible to suppress an increase in memory capacity for expanding the name list.

In addition, when the readings of a plurality of keywords constituting the facility name are forward-matched with the same divided character string, the facility name is stored in association with only this divided character string. Therefore, it is possible to effectively reduce an increase in memory capacity for expanding the name list.
In addition, if it is determined that the number of characters in the search word is larger than the predetermined number of characters, the name of the facility that has the keyword that matches the search word in front from all the facility names stored in association with the divided character string. Search for. As a result, the number of facility names to be searched can be reduced , search for candidate facility names can be performed at high speed, and a decrease in responsiveness can be prevented. In addition, when it is determined that the number of characters read in the search word is equal to or less than the predetermined number of characters, all facility names stored in association with the divided character string including the search word are acquired as candidate facility names, so that the speed is further increased. It is possible to prevent a decrease in responsiveness by performing a search.

Moreover, in the point search device according to claim 2, a destination to be searched for each of a plurality of divided character strings composed of a plurality of character strings having a predetermined number of characters corresponding to combinations of a predetermined number of lines of 50 sound lines. A facility name having a keyword reading that matches the divided character string in advance is extracted from a plurality of facility names representing the divided character string, and a divided character string having a predetermined number of characters corresponding to the extracted facility name and the facility name reading belongs to 50. Each of the sound lines is stored in association with a combination of a predetermined number of lines. Thereby, since only one reading of the facility name representing the destination stored in association with one set of the combinations of the predetermined number of rows of 50 sounds is stored, the facility name that is stored redundantly is stored. By reducing this, it is possible to reduce the data capacity of the name list and to suppress an increase in memory capacity for expanding the name list.
In addition, when the readings of a plurality of keywords constituting a facility name coincide with a divided character string of a combination of a predetermined number of lines of the same 50 sound lines, the facility name is associated only with this divided character string. Therefore, it is possible to further reduce the data capacity of the name list and effectively suppress an increase in memory capacity for expanding the name list.
Further, to search for a candidate facility name from all facility names stored in association with a combination of a predetermined number of lines of 50 sound lines to which the divided character string belongs as a predetermined character string from the front of the search word reading. Thus, the name of the facility to be searched can be reduced, the search can be performed at high speed, and the decrease in responsiveness can be prevented.

In the point search device according to claim 3, when it is determined that the number of characters read out of the search word is larger than the predetermined number of characters, it is associated with a combination of the predetermined number of lines of 50 sounds to which the divided character string belongs. The name of the facility having the keyword that matches the search word in front as a reading is searched from all the facility names stored. As a result, the number of facility names to be searched can be reduced, search for candidate facility names can be performed at high speed, and a decrease in responsiveness can be prevented. In addition, if it is determined that the number of characters read in the search word is equal to or less than the predetermined number of characters, all facilities stored in association with the combination of the predetermined number of lines of 50 sound lines to which the divided character string including the search word belongs Since the name is acquired as a candidate facility name, it is possible to perform a search at a higher speed and to prevent a decrease in responsiveness.

  In the point search device according to claim 4, a keyword that matches the search word in advance from all the facility names stored in association with a combination of 50 sound lines constituting a predetermined number of lines from the front of the search word reading. Search for the name of the facility you have in reading as a candidate facility name. As a result, the name of the facility representing the destination to be searched can be reduced, the search can be performed at a high speed, and a decrease in responsiveness can be prevented.

Further , in the program according to claim 5, when the computer reads the program and it is determined that the number of characters to be read in the search word is larger than the predetermined number of characters, it is stored in advance in association with the divided character string. Candidate facility names that have a keyword that matches the search word in front are read from all the facility names . Thereby, the computer can reduce the number of facility names to be searched , search for candidate facility names at high speed, and prevent a decrease in responsiveness. In addition, when it is determined that the number of characters read in the search word is equal to or less than the predetermined number of characters, the computer acquires all facility names stored in association with the divided character string including the search word as candidate facility names. In addition, it is possible to perform a search at a higher speed and prevent a decrease in responsiveness.
Furthermore, in the program according to claim 6, the computer reads the program so that a predetermined number of characters is divided from the front of reading the search word, and a combination of a predetermined number of lines of 50 sound lines to which the divided character string belongs. Since the name of the candidate facility is searched from all the facility names stored in association with the name of the facility, the name of the facility to be searched can be reduced, the search can be performed at high speed, and the decrease in responsiveness can be prevented.

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. 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 search result of FIG. 4 as a list. 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 search result of FIG. 6 as a list. It is a figure which shows an example of the facility name data table stored in facility name DB which concerns on another Example. It is a flowchart which shows "point information display processing 2" which searches for point information based on the input search term based on another Example, and displays it as a list.

  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) 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. 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. 4, the search word input screen 61 displays a 50 sound key 62, an input character display unit 63, a correction button 65, a return button 66, and a completion button 68.

  In the input character display portion 63, the input character input by the 50 sound key 62 is displayed. 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. Further, by pressing the completion button 68, it is possible to instruct to search for a name related to the facility as the point information and display the list using the character string displayed on the input character display unit 63 as a search word. .

  Subsequently, as shown in FIG. 3, in S12, the CPU 41 waits for a search word to be input by the 50 sound key 62 (S12: NO). When the search word is input from the 50 sound key 62 (S12: YES), the CPU 41 displays the character string input from the 50 sound key 62 on the input character display unit 63, and then proceeds to the process of S13. To do.

  In S <b> 13, the CPU 41 uses the character string displayed on the input character display unit 63 as a search word to search for the name of the facility and display a list of destination candidates, that is, the completion button 68 is displayed. A determination process for determining whether or not the button has been pressed is executed. If the other 50 sound key 62 or the like is pressed without the completion button 68 being pressed (S13: NO), the CPU 41 executes the processes after S12 again.

  On the other hand, when the completion button 68 is pressed (S13: YES), the CPU 41 stores the character string displayed on the input character display unit 63 as a search word in the RAM 42, and then proceeds to S14. In S <b> 14, the CPU 41 reads out the search term from the RAM 42 and reads out the hiragana of “division unit” in the facility name data table 51 that matches the search term in front. Then, the CPU 41 determines whether or not the number of characters in the search word, that is, the number of input characters is larger than the number of characters in the hiragana character in the “division unit” that matches the search word in front, that is, whether or not there are two or more characters Execute the process.

  If it is determined that the number of characters in the search term is greater than the number of characters in the hiragana character in the “division unit” that matches the search term in front, that is, two or more characters (S14: YES), the CPU 41 executes S15. Move on to processing. In S <b> 15, the CPU 41 sequentially reads “reading” of all the facility names in the “division unit” in which the hiragana characters that coincide with the search word are stored in order from the facility name data table 51. Then, the CPU 41 executes a determination process for determining whether or not there is a keyword that matches the search word in the keywords that constitute the reading of each read facility name, that is, all the facility names that have been read. Perform a full-text search for "reading".

  Then, if there is a keyword that matches the search word in the keywords constituting the reading of the read facility name, the CPU 41 sets the “facility name” corresponding to the reading of the facility name to the facility name data table 51. Are stored in the RAM 42 in order as candidate facility names that are destination candidates, and the process proceeds to S17.

  When the reading keyword of the facility name that matches the search word in front is a character string shorter than the search word, the CPU 41 further matches the remaining character string that does not match the keyword of the search word. A determination process for determining whether or not the keyword to be included is among the keywords constituting the reading of the facility name is executed.

  Then, the CPU 41 responds to the reading of the facility name when the keyword that matches the remaining character string that does not match the keyword of the search word is among the keywords constituting the reading of the facility name. The “facility name” is read from the facility name data table 51 and stored in the RAM 42 as a candidate facility name that is a destination candidate.

  On the other hand, when it is determined that the number of characters of the search term is equal to or less than the number of characters in the hiragana “division unit” that matches the search term, that is, one character (S14: NO), the CPU 41 performs the process of S16. Transition. In S <b> 16, the CPU 41 reads out all facility names of “facility names” in the “division unit” in which hiragana characters that coincide with the search word are stored from the facility name data table 51, and stores them in the RAM 42 as candidate facility names as destination candidates. Then, the process proceeds to S17.

  Subsequently, in S <b> 17, 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, and ends the processing. The liquid crystal display 15 displays a predetermined number of items, such as five at a time, in the order of the list (see FIG. 5). 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. 4, an example of a result list display when “Tokyo Nezumi” is entered as a search word on the search word input screen 61 and the completion button 68 is pressed is based on FIG. 5. explain.
First, as shown in FIG. 4, the CPU 41 stores “Tokyo Nezumi” as a search term in the RAM 42 in S13.

  After that, the CPU 41 reads out the hiragana “to” of “division unit” of the facility name data table 51 that matches the search word “Tokyo Nezumi” in S14, and the number of characters of the search word is larger than the number of characters of “division unit”. Judge that there are many. Then, the CPU 41 sequentially reads “reading” of all the facility names in the division unit of the hiragana “to” from the facility name data table 51 in S15 and includes a keyword that matches the search term “Tokyo Nezumi” in front. Do a full text search.

  If there is “Tokyo” in the reading keyword of the facility name, the CPU 41 further performs a full text search to determine whether “Nezumi” is included in the reading keyword of the facility name. Name names “Tokyo / Nesumi / Shi”, “Tokyo Nesmee / Land” corresponding to each facility name “Tokyo Nesme See” and “Tokyo Nesme Land” are read from the facility name data table 51 and are destination candidates. The candidate facility name is stored in the RAM 42.

  Subsequently, as shown in FIG. 5, the CPU 41 displays a search result display screen 71 on the liquid crystal display 15, and names of two candidate facilities “Tokyo Nesme See” and “Tokyo Nesme Land” in the two search result display columns 72. (Point information) is displayed. Here, when the user presses and selects the spot information in the 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.

Next, as shown in FIG. 6, an example of a result list display when “to” is input as a search word on the search word input screen 61 and the completion button 68 is pressed will be described based on FIG. 7. .
First, as shown in FIG. 6, the CPU 41 stores “to” in the RAM 42 as a search word in S <b> 13.

  Thereafter, the CPU 41 reads out the hiragana “to” of the “division unit” in the facility name data table 51 that matches the search word “to” in S14, and the number of characters of the search word is equal to or less than the number of characters of the “division unit”. judge. Then, the CPU 41 reads out all facility names of “facility names” in the division unit of hiragana “to” from the facility name data table 51 in S16 and stores them in the RAM 42 as candidate facility names that are destination candidates.

  Subsequently, as shown in FIG. 7, the CPU 41 displays a search result display screen 71 on the liquid crystal display 15, and “Tokyo Nesme See”, “Tokyo Nesme Land”, “Tokyo Rainbow Land”, “Tokyo Rainbow Sea” and “Tokyo Rose Sea” and the top five candidate facility names (location information) are displayed. The number display part 73 displays the number of candidate facility names “282”.

  As described in detail above, in the navigation device 1 according to the present embodiment, there is a duplication of the facility name stored in the “facility name” between the “division units” of the facility name data table 51, but each “division unit”. Inside, there is no duplication of the facility name stored in “facility name”, 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, in each “division unit” of the facility name data table 51, only one facility name reading indicating the destination is stored, and only one facility name corresponding to the facility name reading is stored. Therefore, it is possible to reduce the capacity of the facility name data table 51 by reducing the number of facility names that are stored in duplicate and the reading of the facility names. Further, the total data capacity of “reading” and “facility name” for each “division unit” in the facility name data table 51 is set to a predetermined data capacity or less (for example, 1 to 50 megabytes or less). Thus, it is possible to suppress an increase in the memory capacity of the RAM 42 that develops the facility name in the facility name data table 51 corresponding to the search term and the reading of the facility name.

  If the first character of the plurality of keywords constituting the facility name reading matches, the facility name is “division unit” corresponding to the first character of the keyword in the facility name data table 51. It is stored in “Read”. For this reason, it is possible to further reduce the data capacity of the facility name data table 51 by further reducing the facility names stored in the facility name data table 51 and the reading of the facility names.

  If the number of characters of the search word is greater than the number of hiragana characters in the “division unit” that matches the search word, the CPU 41 stores the hiragana character that matches the search word in the “division unit”. “Reading” of all facility names is sequentially read from the facility name data table 51, and a facility name having a keyword that matches the search word as a reading is retrieved. As a result, the facility names to be searched can be limited to all facility names in the “division unit” in which the hiragana that matches the search word in advance is stored, and the full text search of candidate facility names can be performed at high speed. Thus, it becomes possible to prevent a decrease in responsiveness.

  Further, when the number of characters of the search word is equal to or less than the number of characters in the “division unit” that matches the search word in front, the CPU 41 stores the “division unit” in the “division unit” that stores the hiragana that matches the search word in front. All facility names of “facility names” are read from the facility name data table 51 as candidate facility names and stored in the RAM 42. Then, the CPU 41 displays a list of a predetermined number of candidate facility names, such as five at a time, in the order of the list, and displays the number of candidate facility names. This makes it possible to search for candidate facility names at a higher speed and prevent a decrease in responsiveness, and whether the user further increases the number of search term characters or selects candidate facility names displayed in a list. Can be determined.

  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 navigation device 101 according to another embodiment has almost the same configuration as the navigation device 1, but stores the facility name data table 81 shown in FIG. 8 in the facility name DB 27 instead of the facility name data table 51. You may do it. Here, the facility name data table 81 will be described with reference to FIG.

As shown in FIG. 8, the facility name data table 81 is configured by “division unit”, “reading” that stores the reading of the facility name, and “facility name”, like 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 81 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 81 and “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 81 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 may execute a “point information display process 2” shown in FIG. 9 instead of the “point information display process” shown in FIG. Here, the “point information display process 2” will be described with reference to FIG.

As shown in FIG. 9, in S111-S113, CPU41 performs the process of said S11-S13.
Subsequently, in S114, the CPU 41 reads the search word from the RAM 42, and whether or not the number of characters of the search word, that is, the number of input characters is greater than the number of lines of 50 sounds of “division unit”, that is, more than two characters. Judgment processing is performed to determine whether or not.

  If it is determined that the number of characters of the search word is larger than the number of lines of 50 sounds of “division unit”, that is, three or more characters (S114: YES), the CPU 41 proceeds to the process of S115. In S <b> 115, the CPU 41 sequentially reads “reading” of all the facility names in the “division unit” in which two lines of 50 sounds to which the first two characters of the search word belong are stored from the facility name data table 81. Then, the CPU 41 executes a determination process for determining whether or not there is a keyword that matches the search word in the keywords that constitute the reading of each read facility name, that is, all the facility names that have been read. Perform a full-text search for "reading".

  Then, when there is a keyword that matches the search word in the keywords constituting the reading of the read facility name, the CPU 41 sets the “facility name” corresponding to the reading of the facility name to the facility name data table 81. Are stored in the RAM 42 in order as candidate facility names that are destination candidates. Thereafter, the CPU 41 proceeds to the process of S117, executes the process of S17, and ends the process.

  On the other hand, when it is determined that the number of characters of the search word is equal to or less than the number of lines of 50 sounds of the “division unit”, that is, 2 characters or less (S114: NO), the CPU 41 proceeds to the process of S116. In S116, the CPU 41 reads all facility names of “facility names” in the “division unit” in which two lines of 50 sounds to which the search word belongs are read from the facility name data table 81, and names of candidate facilities that are destination candidates. Is stored in the RAM. Thereafter, the CPU 41 proceeds to the process of S117, executes the process of S17, and ends the process.

  For example, as shown in FIG. 4, when the CPU 41 stores the search term “Tokyo Nezumi” in S <b> 114 when the completion button 68 is pressed in S <b> 113 and the search term “Tokyo Nezumi” is stored in the RAM 42 in S <b> 114. The number of characters is determined to be greater than the number of lines of 50 sounds of “division unit”, that is, more than two characters. Then, the CPU 41 sequentially reads “reading” of all the facility names in the division unit of “Ta line row” to which the first two characters “To” of the search term “Tokyo Nezumi” belong in S115 from the facility name data table 81. And a full-text search is performed to determine whether a keyword that matches the search word “Tokyo Nezumi” is included.

  If there is “Tokyo” in the reading keyword of the facility name, the CPU 41 further performs a full text search to determine whether “Nezumi” is included in the reading keyword of the facility name. Name names “Tokyo / Nesumi / Shi”, “Tokyo Nesmy / Land” corresponding to each facility name “Tokyo Nesme See” and “Tokyo Nesme Land” are read from the facility name data table 81 and are destination candidates. The candidate facility name is stored in the RAM 42.

  Subsequently, as shown in FIG. 5, the CPU 41 displays a search result display screen 71 on the liquid crystal display 15, and names of two candidate facilities “Tokyo Nesme See” and “Tokyo Nesme Land” in the two search result display columns 72. (Point information) is displayed. Here, when the user presses and selects the spot information in the 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.

  For example, as shown in FIG. 6, when the CPU 41 has pressed the completion button 68 in S113 and stores “to” as a search word in the RAM 42, the number of characters of the search word “to” is determined in S114. , It is determined that the number is less than the number of lines of 50 sounds of “division unit”, that is, less than 2 characters. Then, the CPU 41 reads from the facility name data table 81 all the facility names of “facility names” within each division unit of “Ta line a line” to “Ta performed line” to which the search term “to” belongs in S116, The candidate facility name that is the destination candidate is stored in the RAM 42.

  Subsequently, as shown in FIG. 7, the CPU 41 displays a search result display screen 71 on the liquid crystal display 15, and “Tokyo Nesme See”, “Tokyo Nesme Land”, “Tokyo Rainbow Land”, “Tokyo Rainbow Sea” and “Tokyo Rose Sea” and the top five candidate facility names (location information) are displayed. Further, the number display unit 73 displays the number of candidate facility names as, for example, “317”.

  As described above in detail, in the navigation apparatus 101 according to another embodiment, since each “division unit” of the facility name data table 81 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 81, 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 81, 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, within each “division unit”, only one reading of the facility name representing the destination is stored, and only one facility name corresponding to this facility name reading is stored. It is possible to further reduce the facility name stored in the “division unit” and the number of reading data of the facility name. Therefore, while reducing the data capacity of the facility name data table 81, the total data capacity of “reading” and “facility name” for each “division unit” is less than or equal to a predetermined data capacity (for example, 1 to 50 megabytes). The following can be easily set. Further, it is possible to suppress an increase in the memory capacity of the RAM 42 that develops the facility name in the facility name data table 81 corresponding to the input search term and the reading of the facility name.

  In addition, when the two characters in front of a plurality of keywords constituting the facility name reading belong to a combination of two lines of the same 50 sounds, the facility name is the same as the two characters in front of the keyword in the facility name data table 81. It is stored in “reading” of “division unit” of two lines of 50 sounds. For this reason, it is possible to further reduce the capacity of the facility name data table 81 by further reducing the number of facility names stored in duplicate in the facility name data table 81 and reading of the facility names.

  When the number of characters of the search word is larger than the number of 50 sound lines of the “division unit”, the CPU 41 names all the facilities in the “division unit” of 2 lines of 50 sound to which the front two characters of the search word belong. Are read in order from the facility name data table 81, and the facility name having the keyword that matches the search word in front as a reading is searched. As a result, the number of facility names to be searched can be limited to all the facility names within the “division unit” in which two lines of 50 sounds to which the first two characters of the search word belong are stored. It is possible to perform a full-text search at a high speed and prevent a drop in responsiveness.

  Further, when the number of characters of the search word is equal to or less than the number of lines of 50 sounds of the “division unit”, that is, 2 characters or less, the CPU 41 stores “division unit” in which 2 lines of 50 sounds to which the search word belongs are stored. All facility names in “facility names” in “” are read out from the facility name data table 81 as candidate facility names and stored in the RAM 42. Then, the CPU 41 displays a list of a predetermined number of candidate facility names, such as five at a time, in the order of the list, and displays the number of candidate facility names. This makes it possible to search for candidate facility names at a higher speed and prevent a decrease in responsiveness, and whether the user further increases the number of search term characters or selects candidate facility names displayed in a list. Can be determined.

DESCRIPTION OF SYMBOLS 1,101 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, 81 Facility name data table 61 Search term input screen 62 50 sound key 71 Search result display screen 72 Search result display field

Claims (6)

A facility that stores a plurality of facility names representing destinations to be searched and a reading of the facility name in association with a divided character string having a predetermined number of characters that matches the keyword for each keyword that constitutes the reading of each facility name. Name storage means;
An input means for entering a search term;
A number-of-characters determining means for determining whether or not the number of characters of the search term input by the input means is larger than the predetermined number of characters;
When it is determined that the number of characters read by the input unit via the character number determination unit is greater than the predetermined number of characters, the search word input by the input unit is read from the front. a predetermined number of characters as the divided character string, retrieves the facility name with the read keywords that match the search term and forward from all locations name stored in association with the divided character string as a candidate POI name,
If it is determined that the number of characters read by the input means via the character number determination means is less than or equal to the predetermined number of characters, the character string is stored in association with the divided character string including the search word. Search means for acquiring all facility names as candidate facility names ;
The point search device characterized by comprising. A plurality of facility names representing destinations to be searched and a reading of the facility names, for each keyword constituting each facility name reading, a plurality of predetermined character numbers of divided character strings belonging to a predetermined number of characters belong to Facility name storage means for storing in association with a combination of a predetermined number of rows of
An input means for entering a search term;
A plurality of the predetermined number of characters from the front of the reading of the search term input by the input means is stored as a divided character string in association with a combination of a predetermined number of lines of 50 sound lines to which the divided character string belongs. Search means for searching for candidate facility names from facility names;
Ground point search device, comprising the. Character number determination means for determining whether or not the number of characters of the search term input by the input means is greater than the predetermined number of characters,
If the search means determines that the number of characters read by the input means via the character number determination means is greater than the predetermined number of characters, the search means performs a line of 50 sounds to which the divided character string belongs. A facility name having a keyword that matches the search word in front as a candidate facility name is searched from all the facility names stored in association with the combination of the predetermined number of rows ,
When it is determined that the number of characters read by the input means via the character number determination means is equal to or less than the predetermined number of characters, a line of 50 sounds to which the divided character string including the search word belongs The point search device according to claim 2 , wherein all facility names stored in association with a combination of the predetermined number of rows are acquired as candidate facility names . The search means is a keyword that matches the search word in advance from all facility names stored in association with a combination of 50 sound lines constituting the predetermined number of characters from the front of the reading of the search word input by the input means. The point search device according to claim 2 , wherein a facility name having a reading of “” is searched as a candidate facility name. A facility that stores a plurality of facility names representing destinations to be searched and a reading of the facility name in association with a divided character string having a predetermined number of characters that matches the keyword for each keyword that constitutes the reading of each facility name. In a computer with name storage means,
An input process for entering a search term;
A character number determination step of determining whether or not the number of characters read in the search term input in the input step is greater than the predetermined number of characters;
In the character number determination step, when it is determined that the number of characters read in the search word input in the input step is larger than the predetermined character number, the predetermined number of characters from the front of the search word input input in the input step is determined. the number of characters as the divided character string, retrieves the facility name with the read keywords that match the search term and forward from all locations name stored in association with the divided character string as a candidate POI name,
In the character number determination step, when it is determined that the number of characters read in the search term input in the input step is equal to or less than the predetermined number of characters, all characters stored in association with the divided character string including the search word are stored. A search process for acquiring a facility name as a candidate facility name ;
A program for running A plurality of facility names representing destinations to be searched and a reading of the facility names, for each keyword constituting each facility name reading, a plurality of predetermined character numbers of divided character strings belonging to a predetermined number of characters belong to In a computer provided with facility name storage means for storing in association with a combination of a predetermined number of rows of
An input process for entering a search term;
A plurality of the predetermined number of characters from the front of the reading of the search word input in the input step is stored as a divided character string in association with a combination of a predetermined number of lines of 50 sound lines to which the divided character string belongs. A search process for searching for candidate facility names from facility names;
A program for running

Images