JP5287775B2 - Point search device - Google Patents

Description

  The present invention relates to a point search device that searches 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 related word such as an abbreviation related to the destination data and a generic word that collectively refers to the destination data associated with the related word are stored, and each generic word and the destination data are stored in association with each other. Use an ambiguous dictionary. Then, related words that exactly match the input search word are extracted, generic words are extracted from the related words, candidate facility names are extracted from the generic words, and the list is displayed together with the candidate facility names that are narrowed down by the normal search. (For example, refer to Patent Document 1).

JP 2009-150788 A

  However, in the navigation device described in Patent Document 1, when it is possible to register a new related word defined by the user in the ambiguous dictionary and a generic word associated with this new related word, the user's If it is determined whether or not a new related word can be input in accordance with the usage state, there is a possibility that the new related word cannot be input as a search word against the user's intention, or may be input even when it is not applicable.

  Therefore, the present invention has been made to solve the above-described problems, and user-defined words registered by the user can be accurately and quickly entered as search terms, and the target facility name can be quickly entered. An object of the present invention is to provide a point search device capable of searching.

  In order to achieve the object, the point search apparatus according to claim 1 includes a facility name storage means for storing a plurality of facility names representing destinations to be searched by dividing them into a plurality of keywords, and a use registered by a user. A definition word storage means for storing a user-defined word and a registered name corresponding to the user-defined word, an input screen display means for displaying an input screen for inputting a search word, and a search word via the input screen An input means for inputting; a definition word extracting means for extracting the user-defined word that matches the search word input by the input means; and the input means from each facility name stored in the facility name storage means The candidate facility name having a keyword that matches the search term input in advance is searched, and the registered name corresponding to the user-defined word extracted by the definition word extracting unit and the previous A search unit that searches for a candidate facility name having a matching keyword, and a candidate facility name that has a keyword that matches the search term in front by the search unit is extracted from the candidate facility name. A first next character obtaining unit that obtains a next character that can be selected and input, and a candidate facility name having a keyword that matches the registered name by the search unit; When the number of characters of the user-defined word extracted by the means matches the number of characters of the search term, the next character that can be selected and input next to the registered name is acquired from the candidate facility name, and the definition word extraction If the number of characters in the user-defined word extracted by the means and the search word do not match, the next can be selected and input from the user-defined word corresponding to the registered name next to the search word Second input character acquisition means for acquiring a character, and the input screen display means follows the search word acquired by the first next character acquisition means and the second next character acquisition means. The next character that can be input is displayed in an identifiable manner.

  The point search device according to claim 2 is characterized in that, in the point search device according to claim 1, the registered name is any one of a plurality of keywords delimiting the facility name. To do.

  In the point search apparatus according to claim 1 having the above-described configuration, a plurality of facility names representing destinations to be searched are stored by being divided into a plurality of keywords. Further, a user definition word registered by the user and a registered name corresponding to the user definition word are stored. A candidate facility name having a keyword that matches the search word in front is searched. Further, a user definition word that matches the input search word in front is extracted, and a candidate facility name having a keyword that matches the registered name corresponding to the extracted user definition word is searched.

  Thereby, the facility name having the keyword that matches the input search word and the facility name having the registered name corresponding to the user-defined word that matches the input search word as a keyword are extracted. A list can be displayed. In addition, when a user-defined word is input as a search word, the user-defined word registered by the user is searched for in order to extract a facility name having a registered name corresponding to the input search word as a keyword. You can quickly find the target facility name even if you enter as

  Also, it is acquired from the next character that can be selected and input next to the search term obtained from the candidate facility name having the keyword that matches the input search term and the user-defined word that matches the search term. The next character that can be selected and input next to the search term or the next character that can be selected and input next to the registered name corresponding to the user-defined word acquired from the candidate facility name It can be displayed as possible. Therefore, the user can accurately and quickly input a keyword constituting the facility name and a user-defined word representing the facility name as a search term.

  In the point search device according to claim 2, since the registered name is any one of a plurality of keywords obtained by dividing the facility name, the user can associate any keyword constituting the facility name. A word can be easily selected as a user-defined word and registered with a registered name.

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 figure which shows an example of the user definition word 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. 5 is a sub-flowchart showing a sub-process of “candidate facility name extraction process” in FIG. 4. FIG. 6 is a sub-flowchart showing a sub-process of “user-defined word search process” in FIG. 5. FIG. 6 is a sub-flowchart showing a sub-process of “key display process” in FIG. 5. It is a figure which shows an example of the search word input screen which inputs a search word. It is explanatory drawing explaining the next character data acquired with respect to the input search term. It is explanatory drawing explaining the next character data acquired with respect to the input search term. It is a figure which shows an example of the search word input screen which displayed the input key to the tone-down. It is a figure which shows an example of the search result display screen which pressed the completion button of FIG.

  Hereinafter, a point search device 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 driver for writing predetermined data in 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 is composed of various information necessary for route guidance and map display. For example, new road information for specifying each new road, map display data for displaying a map, Intersection data related to intersections, node data related to node points, link data related to roads (links) as a type of facility, search data for searching for routes, store data related to POI (Point of Interest) such as stores as 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. 12) 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. The facility name DB 27 stores a user-defined word data table 52 (see FIG. 3) that stores user-defined words registered by a user described later and registered names corresponding to the user-defined words. .

  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 spot information display processing program (see FIG. 4) for searching for spot information based on a search word input from a later-described 50-sound key 62 (see FIG. 8) and displaying a list. ing.
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. In addition, the user presses a user-defined word button (not shown) constituting the operation unit 14, so that the user-defined word defined by the user from the 50 sound key 62 and the facility represented by the user-defined word A name or a keyword of the facility name can be input as a registered name and registered in the user-defined word data table 52. 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. 8) described later, a search result display screen 71 for displaying the name of the searched facility, 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, email, TV program, and the like are displayed.

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

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

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

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

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

  Further, “reading” stores a reading of a facility name including a keyword that matches the hiragana stored in each “division unit”. In addition, the reading of the facility name is stored by being separated by a delimiter (for example, “/”) for each keyword. For example, if the facility name reading is “Sakurujei / Okazaki / Miaiten”, “Sakurujei”, “Okazaki”, “Miaiten” are keywords for the facility name reading. It is stored in “Reading”. Accordingly, the facility name reading “Sakurujei / Okazaki / Miaiten” corresponds to each hiragana “O”, “sa”, “mi” of “division unit” in the facility name data table 51. Each is stored in “reading”.

  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 “Circle Jay Okazaki Miai” is stored corresponding to the facility name “Sakurujei / Okazaki / Miaiten”. Therefore, the facility name “Circle Jay Okazaki Miai-Shop” is “Sakurujei” of “Reading” in “Hi”, “Sa”, and “Mi” in “Division unit” of the facility name data table 51. / Okazaki / Miaiten ”is stored in the“ facility name ”.

  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).

Next, the user defined word data table 52 stored in the facility name DB 27 will be described with reference to FIG.
As shown in FIG. 3, the user-defined word data table 52 includes a “user-defined word” that stores a user-defined word defined by the user, a facility name represented by the user-defined word registered by the user, It consists of a “registered name” that stores a registered name such as a keyword of the facility name.

  For example, the user inputs “maruei” from the 50-sound key 62 as a user-defined word representing “Circle A” of the facility names “Circle A Okazaki”, “Circle A Kariya”, and “Circle A Miai”. In addition, when the reading of “Circle A” is input as a registered name from the 50-sound key 62, the “user-defined word” in the user-defined word data table 52 is set to “maruei”. Is stored. In addition, “Suru-kuei” is stored as “Registered name” corresponding to “Maruei” of “User-defined word” in the user-defined word data table 52.

  Accordingly, the user can enter the user definition word data table 52 with a “user definition word” freely defined by the user and a “registered name” such as a facility name represented by the user definition word and a keyword of the facility name. Can be registered via the operation unit 14. Further, as will be described later, the user can display a list of facility names representing desired destinations by inputting the user-defined word registered by the user through the operation unit 14 as a search term.

[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. 4 is a flowchart showing a “spot information display process” which is a process executed by the CPU 41 and searches for spot information based on an input search word and displays the list. Note that the program shown in the flowchart of FIG. 4 is executed by the CPU 41 when a destination setting button (not shown) of the operation unit 14 is pressed.

As shown in FIG. 4, 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. 8, the search word input screen 61 displays a 50 sound key 62, an input character display unit 63, a correction button 66, a number display unit 67, a return button 68, and a completion button 69.

  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 66 is pressed, the last input character of the character string displayed on the input character display unit 63 can be deleted one by one. Further, by pressing the return button 68, it is possible to return to the state before the last operation.

  In addition, the number of facility names having keywords that match the character string displayed on the input character display unit 63 in the forward direction is displayed in the number display unit 67 as described later. Further, by pressing the completion button 69, it is possible to instruct to search and display a name related to the facility as the spot information using the character string displayed on the input character display unit 63 as a search word. .

  Subsequently, as shown in FIG. 4, 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 S <b> 13, the CPU 41 extracts a candidate facility name that is a destination candidate from the facility name stored in the facility name data table 51 using the character string displayed on the input character display unit 63 as a search word. After executing the sub-process (see FIG. 5) of “facility name extraction process”, 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 completion button 69 has been pressed. When it is determined that the completion button 69 has not been pressed (S14: NO), the CPU 41 proceeds to the process of S15.

  In S15, the CPU 41 executes a determination process for determining whether the correction button 66 or the return button 68 is pressed within a predetermined time (for example, within about 0.5 seconds). If it is determined that the correction button 66 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 68 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 66 and the return button 68 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 69 has been pressed (S14: YES), the CPU 41 proceeds to the process of S16. In S16, the CPU 41 reads out the candidate facility names extracted in S13 from the RAM 42 and displays the list as a list, displays the number of candidate facility names (see FIG. 12), and ends the processing.

[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. 5, in S <b> 111, the CPU 41 reads the search word displayed on the input character display unit 63 from the RAM 42.

  In S <b> 112, the CPU 41 specifies the “division unit” in the facility name data table 51 in which the hiragana that matches the search word in front is stored as the “division unit” for extracting the candidate facility name. For example, when the search term is “maru”, the CPU 41 selects “division unit” in the facility name data table 51 in which the hiragana “ma” that matches the search term “maru” is stored as a candidate facility name. It is specified as the “division unit” to be extracted.

  Subsequently, in S113, the CPU 41 reads out the search term from the RAM 42 and reads out the hiragana stored in the “division unit” for extracting the candidate facility name. Then, the CPU 41 performs a determination process for determining whether or not the number of characters of the search word, that is, the number of input characters is larger than the number of characters in Hiragana stored in the “division unit”, that is, whether or not it is larger than one character. Run.

  Then, when it is determined that the number of characters in the search term is equal to or less than the number of characters in the hiragana stored in the “division unit” for extracting the candidate facility name, that is, the number of characters in the search term is one character (S113: NO), CPU41 transfers to the process of S114. In S <b> 114, 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 that are destination candidates. To remember.

  After that, in S115, the CPU 41 stores in the RAM 42 the next character data of “read” which can be input by selecting “A” and the lower case “A” from the 50-note key 62 after the search word. The process proceeds to S119 described later. For example, as shown in FIG. 8, when the input character inputted as the search word is one character “MA”, as shown in FIG. "A--" is selected next to the search word and stored in the RAM 42 as the next character data of "reading" that can be input.

  On the other hand, if it is determined that the number of characters in the search term is greater than the number of characters in the hiragana stored in the “division unit” for extracting the candidate facility name, that is, the number of characters in the search term is two or more (S113: YES) ), The CPU 41 proceeds to the process of S116. In S <b> 116, the CPU 41 sequentially reads “reading” of all the facility names in the “division unit” from which the candidate facility name is extracted 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.

  Subsequently, in S117, the CPU 41 determines whether or not a candidate facility name that is a destination candidate is stored in the RAM 42, that is, a candidate facility name having a keyword that matches the search word in front of the facility name in the RAM 42. A determination process for determining whether or not it is stored is executed.

  When it is determined that the candidate facility name that is the destination candidate is not stored in the RAM 42, that is, the candidate facility name having the keyword that matches the search word in front of the facility name is not stored in the RAM 42. (S117: NO), the CPU 41 proceeds to the process of S119 described later.

  On the other hand, when it is determined that the candidate facility name that is the destination candidate is stored in the RAM 42, that is, the candidate facility name that has the keyword that matches the search word in front of the facility name is stored in the RAM 42. (S117: YES), the CPU 41 proceeds to the process of S118. In S118, the CPU 41 sequentially reads the candidate facility names stored in the RAM 42, reads the next character that can be selected and input next to the search word from the keywords that match the search word, and reads “read”. Is stored in the RAM 42 as the next character data.

  For example, as shown in FIG. 3 and FIG. 9, when the input search word is “maru” and the candidate facility name is “Marchen Okazaki store”, “to” is read as the next character data of “read”. , The next character data of “read” is stored in the RAM 42. Further, when the input search term is “marue”, since the candidate facility name is not stored, the next character data of “reading” is not stored in the RAM 42.

  For example, as shown in FIGS. 3 and 10, when the input search term is “Okazaki & Maru” and the candidate facility name is “Margen Okazaki store”, the next character data of “Reading” “To” is read and stored in the RAM 42 as the next character data of “read”. When the input search term is “Okazaki & Marue”, the candidate facility name is not stored in the facility name data table 51, so the next character data of “reading” is not stored in the RAM 42.

Subsequently, in S119, the CPU 41 executes a sub-process (see FIG. 6) of “user-defined word search process” described later.
In S120, the CPU 41 sequentially reads out the candidate facility name searched by the search word from the RAM 42 and the candidate facility name searched by the registered name as will be described later, counts the number of cases, and stores it in the RAM 42 as the number of candidate cases.
Thereafter, in S121, the CPU 41 executes a sub-process (see FIG. 7) of “key display process” to be described later, ends the sub-process, returns to the main flowchart, and proceeds to the process of S12.

[User-defined word search processing]
Next, sub-processing of “user-defined word search processing” executed by the CPU 41 in S119 will be described with reference to FIG.
As shown in FIG. 6, in S211, the CPU 41 reads the first user-defined word stored in the “user-defined word” in the user-defined word data table 52, and this user-defined word is the search result. A determination process is performed to determine whether or not the word matches the front.

  If the read user definition word does not coincide with the search word (S211: NO), the CPU 41 sets the next user in the “user definition word” of the user definition word data table 52. A determination process for determining whether there is a definition word is executed. If it is determined that there is a user definition word in the next order, the user definition word in the next order is read, and the processing from S211 is executed again. On the other hand, if it is determined that there is no user-defined word in the next order, the CPU 41 ends the loop and ends the sub-process, returns to the sub-flowchart of “candidate facility name extraction process”, and performs the process of S120 Migrate to

  On the other hand, when the read user-defined word matches forward with the search word (S211: YES), the CPU 41 proceeds to the process of S212. In S <b> 212, the CPU 41 reads out the “registered name” corresponding to the user-defined word that matches the search word from the user-defined word data table 52 and stores it in the RAM 42. For example, as shown in FIG. 3, when the search term is “maru” and the first user-defined word is “marue”, the user-defined word matches the search word in advance, The registered name “Sakuruei” corresponding to the user-defined word “maruei” is read and stored in the RAM 42.

  In S213, the CPU 41 identifies the “division unit” of the facility name data table 51 in which the hiragana that matches the read “registered name” is stored as the “division unit” for extracting the candidate facility name. For example, if the registered name is “Sakuruei”, the CPU 41 “divided unit” of the facility name data table 51 in which the hiragana “sa” that matches the registered name “sakuruei” is stored. Are identified as “division units” for extracting candidate facility names.

  Thereafter, in S <b> 214, the CPU 41 sequentially reads “reading” of all the facility names in the “division unit” from which the candidate facility name is extracted 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 coincides with the registered name among the keywords that constitute the reading of each facility name that has been read, 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 registered name in the keywords that constitute 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 having a keyword that matches the registered name in the reading.

  For example, when the registered name is “Sakuruei”, the CPU 41 performs a full-text search of “reading” in the “division unit” in which the hiragana “sa” in the facility name data table 51 is stored. The keywords “Sakuruei” of “Sakuruei / okazakiten”, “Sakuruei / Kariyaten”, and “Sakuruei / miaiten” match the registered name in advance. Then, the CPU 41 reads “Circle A Okazaki” in the “facility name” corresponding to this reading “Sakuruei / Okazakiten”, “Sakuruei / Kariyaten”, “Sakuruei / Miaiten”. “Store”, “Circle A Kariya store”, and “Circle A Miai store” are stored in the RAM 42 as candidate facility names that have keywords that match the registered names in the reading.

  Subsequently, in S <b> 215, the CPU 41 executes a determination process for determining whether or not a candidate facility name that has a keyword that matches the registered name in front is stored in the RAM 42. If the candidate facility name that has the keyword that matches the registered name in front is not stored in the RAM 42 (S215: NO), the CPU 41 stores “user defined word” in the user defined word data table 52. A determination process for determining whether there is a user-defined word in the next order is executed.

  If it is determined that there is a user definition word in the next order, the user definition word in the next order is read, and the processing from S211 is executed again. On the other hand, if it is determined that there is no user-defined word in the next order, the CPU 41 ends the loop and ends the sub-process, returns to the sub-flowchart of “candidate facility name extraction process”, and performs the process of S120 Migrate to

  On the other hand, when the candidate facility name having the keyword that matches the registered name in front is stored in the RAM 42 (S215: YES), the CPU 41 proceeds to the process of S216. In S <b> 216, the CPU 41 executes a determination process for determining whether or not the number of characters in the search word matches that of the user-defined word, that is, whether or not the number of characters is the same. If the number of characters of the search word and the user-defined word does not match, that is, if the number of characters of the search word is smaller than the number of characters of the user-defined word (S216: NO), the CPU 41 performs the process of S217. Migrate to

In S217, the CPU 41 reads the next character that can be selected and input next to the search word from the user-defined word, and stores it in the RAM 42 as the next character data of the user-defined word.
On the other hand, when the number of characters of the search word matches the number of characters of the user-defined word, that is, when the number of characters of the search word is the same as the number of characters of the user-defined word (S216: YES), the CPU 41 performs the process of S218. Transition. In S218, the CPU 41 reads the next character that can be selected and input next to the registered name from the candidate facility names that have the keyword that matches the registered name in the reading, and stores it in the RAM 42 as the next character data of “reading”. .

  For example, as shown in FIGS. 3 and 9, when the input search word is “maru” and the user-defined word is “marue”, “e” is used as the next character data of the user-defined word. Read and store in the RAM 42 as the next character data of the user defined word. If the input search term is “Marue” and the user-defined word is “Marui”, “I” is read as the next character data of the user-defined word, and the next character of the user-defined word is read. The data is stored in the RAM 42 as data.

  Also, for example, as shown in FIG. 3 and FIG. 10, when the input search word is “Okazaki & Maru”, it has a keyword that matches the search word “Okazaki” in the reading, and Since the name of a candidate facility having a keyword that matches the registered name “Sakuruei” in front is not stored in the facility name data table 51, the next character data of the user-defined word is not stored in the RAM 42.

  For example, as shown in FIGS. 2 and 3, when the input search word is “maruei” and the user-defined word is “maruei”, the number of characters of the search word and the user-defined word Since the number of characters matches, that is, the number of characters is the same, each candidate facility name that has a keyword that matches the registered name "Sakuruei" "Circle A Okazaki Store", "Circle A Kariya Store", "Circle A Migo Store" The next characters “O”, “ka”, and “mi” that can be selected and input next to the registered name “Sakuruei” are read from the “read” of “” and stored in the RAM 42 as the next character data of “read”. .

  Thereafter, the CPU 41 executes determination processing for determining whether or not there is a user definition word in the next order in the “user definition word” of the user definition word data table 52. If it is determined that there is a user definition word in the next order, the user definition word in the next order is read, and the processing from S211 is executed again. On the other hand, if it is determined that there is no user-defined word in the next order, the CPU 41 ends the loop and ends the sub-process, returns to the sub-flowchart of “candidate facility name extraction process”, and performs the process of S120 Migrate to

[Key display processing]
Next, sub-processing of “key display processing” executed by the CPU 41 in S121 will be described with reference to FIG.
As shown in FIG. 7, in S <b> 311, the CPU 41 reads out the number of candidates stored in the RAM 42 in S <b> 120 and displays it on the number display unit 67 of the search word input screen 61. For example, as illustrated in FIG. 8, when the number of candidates read from the RAM 42 is “305”, the CPU 41 displays “305” on the number display unit 67.

In step S <b> 312, the CPU 41 reads the next character data “read” and the next character data of the user-defined word from the RAM 42.
Subsequently, in S313, the CPU 41 executes a determination process for determining whether or not the read next character data is all the characters of the hiragana “a” and the lower case “a”. Then, when it is determined that the read next character data is all the characters of the hiragana “a” and the lower case “a” (S313: YES), the CPU 41 ends the sub-process, Return to the sub-process of “candidate facility name extraction process”.

  On the other hand, when it is determined that the read next character data is not all the characters of the hiragana “a” and the lower case “a” (S313: NO), the CPU 41 reads the next character data and reads the 50 characters. Characters that cannot be input next to the search word are extracted from the key 62 and stored in the RAM 42. Then, the CPU 41 displays the character button frame of the 50-sound key 62 corresponding to the characters that cannot be input or the characters in the frame with gray or the like, increased in tone, displayed in a toned down state from the normal display state, and then performs the sub-processing. End and return to the sub-process of “candidate facility name extraction process”.

  For example, as shown in FIG. 11, when “marue” is input as a search word, the next character data of “reading” is not stored, and “i” is used as the next character data of the user-defined word. When only the key is stored in the RAM 42, the CPU 41 displays a tone-down display for each key other than the “yes” key of the 50-sound key 62. In addition, “3 cases” is displayed in the number display section 67. That is, it is displayed that only the “50” key 62 “I” can be input.

  Then, as shown in FIG. 12, when the “yes” key of the 50 sound key 62 is pressed and the completion button 69 is pressed, the CPU 41 displays the search result display screen 71 on the liquid crystal display 15, Candidate facility names (point information) “Circle A Okazaki”, “Circle A” that have keywords that match the registered name “Sakuru Ei” corresponding to the user-defined word “Maruei” in each search result display field 72 "Kariya store", "Circle Ai Migo store" are displayed. In addition, the number display section 73 displays the number of candidate facility names “3”.

  When the user presses and selects a candidate facility name (point information) in each search result display field 72, the CPU 41 sets the facility as a destination, performs a route search, and displays a recommended route on the map. To do. In addition, facility information about the facility (for example, business hours, fees, etc.) is displayed. Further, on the left side of each search result display column 72, the names of the facilities in the search result display column 72 are scrolled down one by one, the previous button 74 and the next button 75 for scrolling up, and the facility in the search result display column 72 Each page button 76, 77 for scrolling down and scrolling up the name of each is displayed.

  As described above in detail, in the navigation device 1 according to the present embodiment, the facility name data table 51 stores a plurality of facility names representing destinations to be searched, and uses the facility name readings as a plurality of keywords. Separated and memorized. The user definition word data table 52 stores user definition words registered by the user and registered names corresponding to the user definition words.

  Then, the CPU 41 searches the facility name data table 51 for a “facility name” corresponding to the reading of the facility name having a keyword that matches the input search word, and acquires it as a candidate facility name. Further, the CPU 41 extracts from the user definition word data table 52 a user defined word that matches the input search word and has a keyword that matches the registered name corresponding to the extracted user defined word. The facility name is retrieved from the facility name data table 51 and acquired as a candidate facility name.

  Thus, the CPU 41 searches for a facility name having a keyword that matches the input search word and a facility name having a registered name corresponding to the user-defined word that matches the input search word as a keyword. Thus, it is possible to display a list. When a user-defined word is input as a search word, the CPU 41 extracts a facility name having a registered name corresponding to the input search word as a keyword. You can quickly search for the target facility name even if you enter

  In addition, it is acquired from the next character that can be selected and input next to the search word acquired from the name of the facility having a keyword that matches the input search word and the user-defined word that matches the search word. The next character that can be selected and input next to the search term, or the next character that can be selected and input next to the registered name corresponding to the user-defined word acquired from the candidate facility name can be identified. Can be displayed. Therefore, the user can accurately and quickly input a keyword constituting the facility name and a user-defined word representing the facility name as a search term.

  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.

DESCRIPTION OF SYMBOLS 1 Navigation apparatus 14 Operation part 15 Liquid crystal display 18 Touch panel 27 Facility name DB
41 CPU
42 RAM
43 ROM
51 Facility Name Data Table 52 User-Defined Word Data Table 61 Search Word Input Screen 62 50 Sound Keys 69 Done Button 71 Search Result Display Screen

Claims (2)

Facility name storage means for storing a plurality of facility names representing destinations to be searched, each divided into a plurality of keywords,
Definition word storage means for storing a user definition word registered by a user and a registered name corresponding to the user definition word;
An input screen display means for displaying an input screen for inputting a search term;
Input means for inputting a search term via the input screen;
Definition word extraction means for extracting the user definition word that matches the search word input by the input means in advance;
The user definition extracted by the definition word extraction unit is searched for a candidate facility name having a keyword that matches the search word input by the input unit from each facility name stored in the facility name storage unit. A search means for searching for a candidate facility name having a keyword that matches the registered name corresponding to the word,
When a candidate facility name having a keyword that matches the search word in front is extracted by the search means, a first character that is selected next to the search word from the candidate facility name and can be input is acquired. Next character acquisition means,
When a candidate facility name having a keyword that matches the registered name in front is extracted by the search unit, when the number of characters of the user-defined word extracted by the definition word extraction unit matches the number of characters, Next, the next character that can be selected and input from the candidate facility name is acquired, and when the number of characters of the user-defined word extracted by the definition word extraction unit and the search word do not match, Second next character acquisition means for acquiring a next character that can be selected and input next to the search word from the user-defined word corresponding to the registered name;
With
The input screen display means displays the next character that can be input next to the search word acquired by the first next character acquisition means and the second next character acquisition means in an identifiable manner. Point search device.   The point search device according to claim 1, wherein the registered name is any one of a plurality of keywords obtained by dividing the facility name.

Images