JP5287752B2 - 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, according to the navigation device described in Patent Document 1 described above, when there are a plurality of generic words corresponding to extracted related terms such as abbreviations, candidate facility names corresponding to the generic terms are extracted. Therefore, the number of candidate facility names displayed in the list becomes too large, and there is a problem that it is difficult to quickly find a target facility name.

  Therefore, the present invention has been made to solve the above-described problems, and even if synonyms including abbreviations and the like are input, the number of candidate facility names to be extracted can be reduced. An object of the present invention is to provide a point search device that enables quick search.

  In order to achieve the object, the point search apparatus according to claim 1 includes a plurality of facility names representing destinations to be retrieved and synonyms representing the facility names, as well as keywords constituting each facility name and each synonym. A facility name storage means for storing the number of characters necessary to be searched for each keyword constituting each synonym, and an input means for inputting a search word, Search means for acquiring, as a candidate facility name, a facility name having a keyword that matches the search word input by the input means from each facility name stored in the facility name storage means, and input by the input means A required number-of-characters determination means for determining whether the number of characters of a search word is equal to or greater than the required number of characters attached to a keyword constituting the synonym that matches the search word in front, The search means is such that the number of characters of the search word input by the input means via the required character number determination means is greater than or equal to the required number of characters attached to the keyword constituting the synonym that matches the search word in front. If it is determined, a facility name represented by a synonym having a keyword that matches the search word in front is acquired as a candidate facility name.

  Further, in the point search device according to claim 1, in the point search device according to claim 1, when the facility name having a keyword that matches the search word in front is acquired as the candidate facility name by the search unit, First next character acquisition means for acquiring a next character that can be selected and input next to the search word from the candidate facility name, and the search word among the facility names stored in the facility name storage means Synonym determining means for determining whether or not there is a keyword that matches the search word in the synonyms representing the name of the facility that does not have a keyword that matches the facility name, and the facility name storage by the synonym determination means If it is determined that there is a keyword that matches the search word in the synonyms stored in the means, the next character that can be selected and input next to the search word is acquired from the synonym Second to Character acquisition means, and the input means is a next character that can be input next to the search word acquired by the first next character acquisition means, and the second character acquisition means acquired by the second next character acquisition means. The next character that can be input next to the search word is displayed in an identifiable manner.

  Furthermore, the point search device according to claim 3 is the point search device according to claim 2, wherein the input means can be input next to the search word acquired by the first next character acquisition means. If there is a character, only the next character acquired by the first next character acquisition unit is displayed in an identifiable manner, and is input next to the search word acquired by the first next character acquisition unit. When there is no possible next character, the next character that can be input next to the search word acquired by the second next character acquiring unit is displayed in an identifiable manner.

  In the point search device according to claim 1 having the above configuration, a plurality of facility names representing destinations to be searched and synonyms representing the facility names are classified for each facility name and each keyword constituting the synonym. It is stored as a divided character string. Then, a facility name having a keyword that matches the search word in front is acquired as a candidate facility name. Further, when the number of characters of the input search word is equal to or greater than the required number of characters attached to the keyword constituting the synonym that matches the search word, the synonym having the keyword that matches the search word The facility name represented is acquired as a candidate facility name.

  As a result, the facility name having a keyword that matches the input search word in front and the facility name represented by the synonym having the keyword that matches the input search word and more than the required number of characters can be displayed in a list. It becomes possible. In addition, when a synonym is input as a search term, the name of a candidate facility is extracted from the synonym in order to extract a facility name represented by the synonym having a keyword that matches the input search term more than the required number of characters. It is possible to reduce the number of extractions for extracting. Therefore, even if synonyms including abbreviations and the like are input, the number of candidate facility names to be extracted can be reduced, and a target facility name can be searched quickly.

  In the point search device according to claim 2, 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 search word, and the search word The next character that can be selected and input next to the search word acquired from the synonym having the keyword that matches the front can be displayed in an identifiable manner. Therefore, the user can selectively and quickly input a keyword constituting the facility name and a keyword constituting a synonym representing the facility name as a search term.

  Furthermore, in the point search device according to claim 3, when there is a next character that can be selected and input next to the search word acquired from the facility name having a keyword that matches the input search word in front. Since only the next character is displayed so as to be identifiable, the user can easily input a keyword constituting the facility name as a search term. In addition, if there is no facility name having a keyword that matches the search term that has been input, it can be selected and input next to the search term obtained from a synonym having a keyword that matches the search term. Since only the next character is displayed in an identifiable manner, the user can easily input a keyword constituting a synonym representing the facility name as a search term.

It is the block diagram which showed the navigation apparatus which concerns on a present Example. It is a figure which shows an example of the facility name data table stored in facility name DB. It is a flowchart which shows "point information display processing" which searches for point information based on the input search term, and displays it as a list. 4 is a sub-flowchart showing a sub-process of “candidate facility name extraction process” in FIG. 3. 5 is a sub-flowchart showing a sub-process of “synonym search process” in FIG. 4. 5 is a sub-flowchart showing a sub-process of “key display process” in FIG. 4. 4 is a sub-flowchart showing a sub-process of “list display process” in FIG. 3. It is a figure which shows an example of the search word input screen which inputs a search word. It is a figure which shows an example of the search 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. 9 as a list. It is a figure which shows an example of the search word input screen which displayed the completion button toned down. It is a figure which shows an example of the search result display screen which pushed the completion button of FIG. 11 long. It is a figure which shows an example of the facility name data table stored in facility name DB which concerns on another Example.

  Hereinafter, a point search device 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. 10), 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.

  Further, in the facility name DB 27, a divided character string of a predetermined number of characters (one character in this embodiment) is used for synonyms such as a reading of the facility name corresponding to a facility name described later and an abbreviation representing the facility name. A facility name data table 51 (see FIG. 2) stored for each division unit is stored.

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

The ROM 43 stores a spot information display processing program (see FIG. 3) for searching for spot information based on a search term 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. 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 that is currently running, a search word input screen 61 (see FIG. 8) described later, a search result display screen 71 that displays a list of names of the searched facilities, operation guidance, operation menus, keys. 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 shown in FIG. 2, the facility name data table 51 stores “synonyms” for storing “division units”, “reading” for storing facility name readings, and readings for synonyms such as abbreviations representing facility names. And “facility name”. In this “division unit”, a hiragana character that matches the keyword that constitutes the reading of a facility name or a keyword that constitutes the reading of a synonym such as an abbreviation representing the facility name is stored one character at a time in the order of 50 notes. 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 is “Tokyo / Nezumi / Rand”, “Tokyo”, “Nezumi” and “Land” are stored in “Read” as keywords of the facility name. Therefore, the facility name reading “Tokyo / Nezumi / Land” is stored in the “reading” corresponding to each of the hiragana “to”, “ne”, “ra” in the “division unit” of the facility name data table 51, respectively. Is done.

  Also, “synonyms” stores readings of synonyms such as abbreviations representing facility names that include keywords that coincide with the hiragana stored in each “division unit”. The synonym readings are stored for each keyword separated by a delimiter (for example, “/”). In addition, the number of characters necessary to be a search target is stored at the top of each keyword that constitutes the reading of the synonym, assuming that the input search word and the keyword coincide with each other.

  For example, if the reading of a synonym such as an abbreviation representing the name of a facility is “7; Tie-Nue”, “Tie-Nue” is stored in “Synonym” as a keyword constituting a synonym reading. Has been. Accordingly, the synonym reading “7; Tee Nueru” is stored in the “synonym” corresponding to the hiragana “te” in the “division unit” of the facility name data table 51.

  In addition, at the beginning of the synonym reading “7; Tie-Nue”, “7 “7;” representing “character” is stored. In other words, in order for the keyword “Tee-Nue” stored in “Synonyms” to be a search target, the input search word and the seven characters “Tie-Nue” are included. This indicates that there is a need to match forward.

  Further, in “facility name”, the facility name representing the destination to be searched is stored corresponding to the reading of the facility name stored in “reading” and the reading of the synonym stored in “synonym”. Has been. For example, the facility name “Tokyo Nesmy Land” is stored in correspondence with the facility name reading “Tokyo / Nezumi / Land” and the synonym reading “7; Therefore, the facility name “Tokyo Nesme Land” is “Tokyo” / “Nezumi /” which is the “read” in each of the hiragana “te”, “to”, “ne”, “ra” in the “division unit” of the facility name data table 51. It is stored in “facility name” corresponding to “7;

  Therefore, although there is an overlap of the facility name stored in the “facility name” among the “division units” in the facility name data table 51, the facility name stored in the “facility name” is included in each “division unit”. There is no duplication and only one facility name is stored. Therefore, between the “division units” of the facility name data table 51, there is an overlap in the reading of the facility name stored in “reading” and the reading of the synonym stored in “synonym”, but within each “division unit”. There is no duplication of the reading of the facility name stored in “reading” and the reading of the synonym stored in “synonym”, and only the reading of the facility name and the reading of the synonym for one facility name is stored. ing.

  As a result, when the first character of the plurality of keywords constituting the facility name reading matches, the “facility” corresponding to “reading” and “synonyms” between “division units” in the facility name data table 51 It becomes possible to reduce the duplicate storage of “name”, and the data capacity of the facility data table 51 can be reduced. Further, the total data capacity of “reading”, “synonym” and “facility name” for each “division unit” can be set to a predetermined data capacity or less (for example, 1 to 10 megabytes or less). It becomes.

  In addition, since the number of characters necessary for a search target to be matched with the keyword is stored at the beginning of the synonym reading keyword, it corresponds to the input search word as described later. It is possible to reduce the number of extractions that extract candidate facility names from synonyms. Therefore, even if synonyms including abbreviations and the like are input, the number of candidate facility names to be extracted can be reduced, and a target facility name can be searched quickly.

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

  In 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. 4) 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 S <b> 16, the CPU 41 ends the process after executing a sub-process (see FIG. 7) of “list display process” described later for displaying a list of candidate facility names extracted in S <b> 13.

[Candidate facility name extraction process]
Next, the sub-process of the “candidate facility name extraction process” executed in S13 will be described with reference to FIG.
As shown in FIG. 4, in S <b> 111, the CPU 41 reads the search word displayed on the input character display unit 63 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 “Tokyo”, the CPU 41 selects “division unit” in the facility name data table 51 in which the hiragana character “to” that matches the search term “Tokyo” 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 S120 described later.
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.

Subsequently, in S119, the CPU 41 executes a sub-process (see FIG. 5) of a “synonym search process” described later.
In S <b> 120, the CPU 41 sequentially reads the candidate facility names from the RAM 42, counts the number of cases, and stores the number in the RAM 42 as the number of candidate cases.
Thereafter, in S121, the CPU 41 executes a sub-process (see FIG. 6) of “key display process” to be described later, ends the sub-process, returns to the main flowchart, and proceeds to the process of S12.

[Synonym search processing]
Next, the sub-process of the “synonym search process” executed by the CPU 41 in S119 will be described with reference to FIG.
As shown in FIG. 5, in S211, the CPU 41 reads the reading of the synonym first stored in the “synonym” in the “division unit” for extracting the candidate facility name, and the synonym of the read synonym is read. A keyword that matches the search word from the keywords constituting the reading is searched, that is, a full-text search of the read synonym reading is performed. If there is a keyword that matches the search word in the keywords that constitute the reading of the read synonym, the keyword that matches the search word and the “number of required characters” stored at the beginning of the keyword Are stored in the RAM 42.

  Subsequently, in S212, the CPU 41 determines whether or not there is a keyword that matches the search word in the keyword that constitutes the reading of the read synonym, that is, the keyword that matches the search word in the forward direction is stored in the RAM 42. A determination process for determining whether or not it is stored is executed.

  If there is no keyword that matches the search word in the keyword that constitutes the reading of the read synonym, that is, if the keyword that matches the search word is not stored in the RAM 42 (S212). : NO), CPU41 performs the determination process which determines whether there exists the reading of the next order synonym memorize | stored in the "synonym" in the "division unit" which extracts the said candidate facility name .

If it is determined that there is a next synonym reading, the next synonym reading is performed, and the processes after S211 are executed again.
On the other hand, if it is determined that the next synonym is not read, 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 there is a keyword that matches the search word in the keywords that constitute the reading of the read synonym, that is, when a keyword that matches the search word in advance is stored in the RAM 42 (S212). : YES), the CPU 41 proceeds to the process of S213. In S213, the CPU 41 reads the “necessary number of characters” stored at the beginning of the front-matched keyword from the RAM 42, and determines whether or not the number of characters of the search word is equal to or greater than the required number of characters attached to the front-matched keyword. A determination process for determining That is, the CPU 41 executes a determination process for determining whether or not the search word matches the keyword more than the necessary number of characters.

Then, when the number of characters of the search word is less than the required number of characters attached to the prefix matched keyword (S213: NO), the CPU 41 proceeds to the process of S215 described later.
On the other hand, when the number of characters of the search term is equal to or greater than the required number of characters attached to the keyword that matches forward (S213: YES), the CPU 41 proceeds to the process of S214. In S <b> 214, the CPU 41 reads “facility name” corresponding to the reading of the synonym from the facility name data table 51 and stores it in the RAM 42 as a candidate facility name that is a destination candidate.

Subsequently, in S215, the CPU 41 reads the next character that can be selected and input next to the search word from the reading of the synonym having the keyword that matches the search word in advance, and uses it as the next character data of “synonym”. Store in the RAM 42.
Thereafter, the CPU 41 executes a determination process for determining whether or not there is a reading of the next synonym stored in the “synonym” in the “division unit” for extracting the candidate facility name.

If it is determined that there is a next synonym reading, the processing from S211 onward is executed again for the next synonym reading.
On the other hand, if it is determined that the next synonym is not read, 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. 6, in S <b> 311, the CPU 41 reads 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. 9, when the number of candidates read from the RAM 42 is “40”, the CPU 41 displays “40” on the number display unit 67.

  Subsequently, in S <b> 312, the CPU 41 executes a determination process for determining whether or not the next character data “read” is stored in the RAM 42. If it is determined that the next character data of “reading” is stored in the RAM 42 (S312: YES), the CPU 41 proceeds to the process of S313.

  In S 313, the CPU 41 reads the next character data of “read” from the RAM 42, extracts characters that cannot be input next to the search word from the 50 sound keys 62, and stores them in the RAM 42. If there is a character that cannot be input next to the search word from the 50-sound key 62, the CPU 41 sets the character button frame of the 50-sound key 62 corresponding to these characters that cannot be input or the characters in the frame to gray or the like. Is increased, the tone is lowered from the normal display state, and the process proceeds to S316 described later.

  For example, as shown in FIG. 9, the CPU 41 selects “Aku”, “Kokosa”, “Suu” as the next characters of “Reading” that can be selected and input after the search word “Matsu”. “So”, “Tsuna”, “Ne-to”, “Ma”, “Ya-ra”, “Ru-n”, and lower-case letters “a-a” are read from the RAM 42. Then, the CPU 41 extracts “ke, shi, ta, chi,..., Mori” as characters that cannot be input next to the search word from the 50-note key 62, and this “ke, shi, ta, chi, ..., Each character button of the 50-sound key 62 corresponding to “Ri” is displayed in a tone-down manner from the normal display state.

  On the other hand, when it is determined that the next character data “read” is not stored in the RAM 42 (S312: NO), the CPU 41 proceeds to the process of S314. In S <b> 314, the CPU 41 executes a determination process for determining whether or not the next character data of “synonym” is stored in the RAM 42. If it is determined that the next character data of “synonym” is not stored in the RAM 42 (S314: NO), the CPU 41 ends the sub-process and performs a sub-process of “candidate facility name extraction process”. Return to.

  On the other hand, when it is determined that the next character data of “synonym” is stored in the RAM 42 (S314: YES), the CPU 41 proceeds to the process of S315. In S <b> 315, the CPU 41 reads the next character data of “synonyms” from the RAM 42, extracts characters that cannot be input next to the search word from the 50 sound keys 62, and stores them in the RAM 42. If there is a character that cannot be input next to the search word from the 50-sound key 62, the CPU 41 sets the character button frame of the 50-sound key 62 corresponding to these characters that cannot be input or the characters in the frame to gray or the like. Is increased, and after tone-down from the normal display state and displayed, the process proceeds to S316.

  In S <b> 316, the CPU 41 reads from the RAM 42 a character that cannot be input next to the search word from the 50 sound key 62, and executes a determination process for determining whether or not the next character that can be input from the 50 sound key 62 is “1 character”. To do. That is, the CPU 41 executes a determination process for determining whether or not there is one key displayed in the normal state of the 50 sound key 62 on the search word input screen 61. If the next character that can be input from the 50-sound key 62 is “two or more characters” (S316: NO), the CPU 41 ends the sub-process and proceeds to a sub-process of “candidate facility name extraction process”. Return.

  On the other hand, when the next character that can be input from the 50 sound key 62 is “1” (S316: YES), the CPU 41 proceeds to the process of S317. In S317, the CPU 41 displays the frame of the completion button 69 of the search word input screen 61 and the characters in the frame in gray or the like, increases the transparency, displays the tone down from the normal display state, ends the sub-process, Return to the sub-process of “candidate facility name extraction process”.

  For example, as shown in FIG. 11, when “Teie Nue” is input as a search word, the next character data of “reading” is not stored, and the next character data of “synonym” is stored. When only “RU” is stored in the RAM 42, the CPU 41 displays each key other than the “RU” key of the 50-sound key 62 in a tone-down display. In addition, “1” is displayed in the number display section 67. That is, it is displayed that only the “sound” key 50 can be input. In addition, the CPU 41 displays a completion button 69 as a tone-down display.

[List display processing]
Next, the sub-process of “list display process” executed in S16 will be described with reference to FIG.
As shown in FIG. 7, in S411, the CPU 41 executes determination processing for determining whether or not the completion button 69 of the search word input screen 61 is displayed in a tone-down manner. That is, the CPU 41 executes a determination process for determining whether or not there is one key that can be input displayed in the normal state of the 50 sound key 62 on the search word input screen 61.

  If the completion button 69 on the search word input screen 61 is not displayed as a tone-down display (S411: NO), the CPU 41 proceeds to the process of S412. In S412, the CPU 41 reads candidate facility names from the RAM 42 and displays them as a list, displays the number of candidate facility names, ends the sub-process, and returns to the main flowchart.

For example, as shown in FIG. 9, an example of a result list display when “Matsu” is input as a search word on the search word input screen 61 and the completion button 69 is pressed will be described based on FIG. .
As shown in FIG. 10, the CPU 41 displays a search result display screen 71 on the liquid crystal display 15. ”,“ Max Max Securities Asakusa Branch ”,“ Max Marine Shop ”, and the top 5 candidate facility names (point information) are displayed. In addition, the number display section 73 displays the number of candidate facility names “40”.

  Here, the search term “Matsu” is the synonym reading “3; Mack / 1; Tokyo Kyomeen” stored in “Synonym” of the division unit in which Hiragana “Ma” is stored. The keyword “3; Mack” of “3; Mack / 1; Makuhari Ekimen” matches the front and “3 characters” of the required number of characters for each keyword “3; Mack”. Therefore, in S119, the CPU 41 extracts “McDorco Tokyo Station Store” and “McDorco Makuhari Station Store” as candidate facility names and stores them in the RAM 42.

  On the other hand, as shown in FIG. 7, when the completion button 69 of the search word input screen 61 is displayed as a tone-down display in S411 (S411: YES), the CPU 41 proceeds to the process of S413. In S413, the CPU 41 waits for a predetermined operation after the completion button 69 is pressed (S413: NO). For example, the CPU 41 waits for an operation for continuously pressing the completion button 69 for a predetermined time or longer (for example, about 1 second or longer), that is, an operation for long-pressing the completion button 69. Alternatively, the CPU 41 waits for a predetermined time or longer (for example, about 3 seconds or longer) after the completion button 69 is pressed.

  When a predetermined operation is performed after the completion button 69 is pressed (S413: YES), the CPU 41 proceeds to the process of S414. In S414, the CPU 41 determines that the “one character” that can be input from the 50-sound key 62 has been input and the completion button 69 has been pressed, reads the candidate facility names from the RAM 42, displays the list, and displays the candidate facility name. After displaying the number of cases, the sub-process is terminated and the process returns to the main flowchart.

  For example, as shown in FIG. 11, when each key other than the “RU” key of the 50-sound key 62 is displayed in a tone-down manner and the completion button 69 is displayed in a tone-down manner, the completion button 69 is displayed. An example of the result list display when long-pressed will be described with reference to FIG.

  As shown in FIG. 12, the CPU 41 determines that the “ru” key of the 50-sound key 62 has been pressed and the completion button 69 has been pressed, and displays the search result display screen 71 on the liquid crystal display 15. In the display column 72, “Tokyo Nesme Land” and one candidate facility name are displayed. In addition, the number of candidate facility names “1” is displayed in the number display section 73.

  Here, the CPU 41 determines that the search term “deaiue” has been input, and executes the process of S13. Then, the CPU 41 reads “7; tee” of the synonym stored in “synonyms” stored in “synonyms” in the “division unit” in which the hiragana “te” is stored. Nue ", that is, the keyword" 7; The CPU 41 then searches for the synonym “7; tee enu” because the search word “tei nu eru” has the required number of characters “7 characters” for the keyword “7; The facility name “Tokyo Nesme Land” corresponding to “Eru” is read from the facility name data table 51 and displayed as a list of candidate facility names.

  As described above in detail, in the navigation device 1 according to the present embodiment, the CPU 41 stores “reading” of all the facility names in the “division unit” in which the hiragana of the first character of the search word is stored. Read sequentially from 51. 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.

  Further, the CPU 41 reads the synonym reading stored in the “synonym” in the “division unit”, and selects a keyword that matches the search word from the keywords constituting the read synonym reading. Search for. Then, if there is a keyword that matches the search word in front, the CPU 41 reads the “necessary number of characters” stored at the head of the keyword that matches forward, and the number of characters of the search word matches the keyword that matches the search word. If the number of characters is more than the required number, the “facility name” corresponding to the reading of the synonym 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.

  As a result, the CPU 41 displays a list of facility names having keywords that match the input search word and the synonyms having keywords that match the input search word more than the required number of characters. It becomes possible to do. In addition, when a synonym is input as a search word, the CPU 41 extracts “facility name” corresponding to the reading of the synonym having a keyword that matches the input search word for the required number of characters or more. It is possible to reduce the number of extractions that extract candidate facility names from synonyms. Therefore, even if a user inputs a synonym including an abbreviation or the like, the number of candidate facility names to be extracted can be reduced, and a target facility name can be searched quickly.

  When the next character data of “reading” is stored in the RAM 42, the CPU 41 reads the next character data of “reading” from the RAM 42, and extracts characters that cannot be input next to the search word from the 50 sound keys 62. To do. Then, the CPU 41 displays the character buttons of the 50 tone keys 62 corresponding to the characters that cannot be input, with a tone down from the normal display state. Thereby, the user can input easily the keyword which comprises a facility name as a search term.

  If the next character data of “reading” is not stored in the RAM 42, the CPU 41 reads the next character data of “synonym” from the RAM 42, and selects a character that cannot be input next to the search word from the 50 sound key 62. Extract. Then, the CPU 41 displays the character buttons of the 50 tone keys 62 corresponding to the characters that cannot be input, with a tone down from the normal display state. Thereby, the user can input easily the keyword which comprises the synonym showing a facility name as a search word.

  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 following may be used.

  (A) For example, in FIG. 10, when a skip button 81 (not shown) is displayed on the search result display screen 71 and the skip button 81 is pressed, a list of facility names corresponding to synonym readings is displayed. It may be displayed at the end of the display. Further, in FIG. 10, a removal button 82 (not shown) is displayed on the search result display screen 71. When the removal button 82 is pressed, the facility name corresponding to the synonym reading is deleted from the list display. You may make it do. Thereby, the facility name corresponding to the synonym displayed as a list on the search result display screen 71 can be easily removed or skipped.

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

As shown in FIG. 13, the facility name data table 91 is similar to the facility name data table 51, and includes synonyms such as “division unit”, “reading” that stores the reading of the facility name, and abbreviations representing the facility name It consists of “synonyms” that memorize the readings and “facility names”.
However, in this “divided unit”, two lines of 50 sounds to which a two-character hiragana character that matches the keyword constituting the reading of the facility name or the keyword constituting the synonym reading such as an abbreviation representing the facility name belongs. It is stored corresponding to the combination. 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 reading of the facility name is “Tokyo / Nezumi / Rando”, which is the “division unit” of the facility name data table 91 corresponding to “Tou”, “Nezu”, “Ran” in the first two characters of each keyword. It is stored in “reading” corresponding to each combination of “tana line”, “na line”, and “ra performed line” of two lines of 50 sounds. The long sound “-” is read as the vowel of the previous character.

  The “synonym” stores a reading of a synonym such as an abbreviation representing a facility name including a keyword that matches the front of each two-character hiragana belonging to each “division unit”. The synonym readings are stored for each keyword separated by a delimiter (for example, “/”). In addition, the number of characters necessary to be a search target is stored at the top of each keyword that constitutes the reading of the synonym, assuming that the input search word and the keyword coincide with each other.

  Further, in “facility name”, the facility name representing the destination to be searched is stored corresponding to the reading of the facility name stored in “reading” and the reading of the synonym stored in “synonym”. Has been. For example, the facility name “Tokyo Nesme Land” is “Tokyo Line / Nezumi” in “Reading” in “Ta line line”, “Na line line”, “Ra line” in “Division unit” of the facility name data table 91. -/ Rando "and the" facility name "corresponding to the synonym reading" 7;

  Then, the CPU 41 of the navigation device 101 according to another embodiment uses the facility name data table 91 instead of the facility name data table 51 in the sub-process of the “candidate facility name extraction process” shown in FIG. It may be.

  Specifically, in S112, the CPU 41 extracts the candidate facility name from the “division unit” in the facility name data table 91 in which two lines of 50 sounds to which the two front characters of the search word belong are stored. Identified as “unit”. For example, when the search word is “Matsu”, the CPU 41 stores “Magita Line” to which the first two characters “Matsu” of the search word “Matsu” belong is stored. The “division unit” is specified as the “division unit” for extracting candidate facility names.

  As described above in detail, in the navigation apparatus 101 according to another embodiment, since each “division unit” of the facility name data table 91 is composed of a combination of two lines of 50 sounds, there are 250 “division units”. Can be configured. In addition, although there is a duplication of the facility name stored in the “facility name” among the “division units” in the facility name data table 91, within each “division unit”, the facility name stored in the “facility name” is stored. There is no duplication and only one facility name is stored.

  Therefore, there is an overlap between the reading of the facility name stored in the “reading” and the reading of the synonym stored in the “synonym” between the “division units” of the facility name data table 91, but within each “division unit”. There is no duplication of the reading of the facility name stored in “reading” and the reading of the synonym stored in “synonym”, and only the reading of the facility name and the reading of the synonym for one facility name is stored. ing.

DESCRIPTION OF SYMBOLS 1,101 Navigation apparatus 14 Operation part 15 Liquid crystal display 18 Touch panel 27 Facility name DB
41 CPU
42 RAM
43 ROM
51, 91 Facility name data table 61 Search term input screen 62 50 sound key 69 Done button 71 Search result display screen

Claims (3)

A plurality of facility names representing destinations to be searched and a synonym representing the facility name are stored as a divided character string divided for each facility name and a keyword constituting each synonym, and each synonym is stored. A facility name storage means for storing the number of characters necessary to be a search target for each keyword constituting
An input means for entering a search term;
Search means for acquiring, as a candidate facility name, a facility name having a keyword that matches the search word input by the input means from each facility name stored in the facility name storage means;
Required number of characters determination means for determining whether or not the number of characters of the search word input by the input means is equal to or greater than the required number of characters attached to the keyword constituting the synonym that matches the search word in advance;
With
In the search means, the number of characters of the search word input by the input means via the required character number determination means is greater than or equal to the required number of characters attached to the keyword constituting the synonym that matches the search word in front. If it is determined that the facility name is a candidate facility name, the site search device is configured to acquire a facility name represented by a synonym having a keyword that coincides with the search word. When a facility name having a keyword that directly matches the search word is acquired as a candidate facility name by the search means, a next character that can be selected and input next to the search word from the candidate facility name is acquired. 1 next character acquisition means;
Whether there is a keyword that matches the search word in the synonyms representing the facility name that does not have a keyword that matches the search word in the facility name stored in the facility name storage means Synonym determining means for determining
When it is determined by the synonym determination means that there is a keyword that matches the search word in the synonyms stored in the facility name storage means, the synonym is followed by the search word. Second next character acquisition means for acquiring a next character that can be selected and input;
With
The input means can input the next character that can be input next to the search word acquired by the first next character acquisition means and the search word acquired by the second next character acquisition means. The point search device according to claim 1, wherein the next character is displayed in an identifiable manner.   When there is a next character that can be input next to the search word acquired by the first next character acquisition unit, the input unit acquires the next character acquired by the first next character acquisition unit. When there is no next character that can be input next to the search term acquired by the first next character acquisition unit, the second next character acquisition unit acquires The point search device according to claim 2, wherein a next character that can be input next to the search word is displayed in an identifiable manner.

Images