JP5577809B2 - Facility search apparatus and program - Google Patents

Description

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

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

JP-A-9-97266

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

  In addition, when a plurality of search terms having a small number of characters (for example, one character or two characters) are input, the number of facility names that coincide with the first input search term increases. Since it is necessary for all facility names to determine whether or not a reading that coincides with the search word after the first search word is included in the name, there is a problem that the search time increases and the response performance decreases.

  Therefore, the present invention has been made to solve the above-described problems, and can suppress an increase in the memory capacity for expanding the name list, and can search a plurality of search words with a small number of characters. An object of the present invention is to provide a facility search apparatus and a program that can be performed at high speed and prevent deterioration of responsiveness.

In order to achieve the above object, the facility search apparatus according to claim 1 divides a plurality of facility names to be searched into a plurality of keywords, and divides each facility name into a divided character string having a predetermined number of characters that matches each keyword in front. A plurality of divisional characters, each consisting of a different character and assigned a predetermined order, to each of the facility names associated with the facility name storage means for storing and associated with the predetermined number of divided character strings A keyword head character information storage means for storing count information for each section obtained by counting the first character of each keyword that matches a section character belonging to each section in association with the divided character string of the predetermined number of characters, and a search word And an input means for inputting the first character of each search word input via the input means in the keyword first character information storage means. The divided character string acquisition means for acquiring the divided character string corresponding to each search word based on the count information corresponding to the classification to be performed, and the facility name storage means, the acquired through the divided character string acquisition means Each search word input by the input means from the facility name stored in association with the divided character string and the search word set in the descending order of the number of characters in each search word , or the search order set in the input order when the number of characters is the same And a search unit that acquires a facility name having a matching keyword as a candidate facility name.

  Moreover, the facility search apparatus according to claim 2 is the facility search apparatus according to claim 1, wherein the count information for each of the categories is the plurality of facility names associated with the predetermined character string divided character string. The maximum count value obtained by counting the first characters of each keyword that matches the classified characters belonging to each category for each category, and the divided character string acquisition means is the first character of each search word input via the input means All of the maximum count values of the category to which the first character of each search word belongs are acquired with the divided character string associated with the count information that is equal to or greater than the count value of the first character for each category to which the first character belongs. To do.

  Moreover, the facility search device according to claim 3 is the facility search device according to claim 1, wherein the count information for each of the divisions includes the plurality of facility names associated with the predetermined character string divided character strings. It is presence / absence information indicating whether or not there is a count value obtained by counting the first character of each keyword that matches the classification character belonging to each classification, and the divided character string acquisition means is input via the input means The divided character string associated with the count information indicating that all the presence / absence information for each section to which the first character of each search word belongs has a count value is acquired.

  The facility search apparatus according to claim 4 is the facility search apparatus according to any one of claims 1 to 3, wherein the segment character is a 50-sound kana and the segment is a line of 50 sounds. It is characterized by being divided separately. Here, the Japanese syllabary kana includes hiragana and katakana.

  Further, in the facility search apparatus according to any one of claims 1 to 3, the division character may be an alphabet, a number, a predetermined symbol (for example, an arithmetic symbol, an arrow, or the like). In addition, when the division character is an alphabet, the plurality of divisions may be divided so that a predetermined number of alphabets belong to the alphabetical order. The divided character string may be an alphabet having a predetermined number of characters.

Furthermore, the program according to claim 5 divides a plurality of facility names to be searched into a plurality of keywords, respectively, and stores each facility name in association with a predetermined number of divided character strings that match each keyword in front. For each facility name associated with the storage means and each facility name associated with the predetermined number of divided character strings, each category is divided into a plurality of categories to which a predetermined number of segment characters each composed of a different character and assigned a predetermined order belong. In a computer provided with keyword head character information storage means for storing count information for each section that counts the first character of each keyword that matches a section character belonging to, in association with the divided character string of the predetermined number of characters. And in the keyword head character information storage means, the first character of each search word input in the input step A divided character string obtaining step for obtaining the divided character string corresponding to each search word based on count information corresponding to the classification to be performed, and the divided character obtained in the divided character string obtaining step in the facility name storage means Each search word input in the input step from the facility name stored in association with the column and the search word in the order of the number of characters in each search word , or the search order set in the input order when the number of characters is the same. And a search step for acquiring a facility name having a keyword as a candidate facility name.

  In the facility search apparatus according to claim 1 having the above-described configuration, a facility name storage unit that divides a plurality of facility names into a plurality of keywords, and associates each facility name with a predetermined number of character strings that are forward-matched with each keyword. I remember it. As a result, since only one facility name representing the destination associated with each divided character string is stored, the number of facility names stored in duplicate is reduced to reduce the data capacity of the name list. An increase in the memory capacity for expanding the list can be suppressed.

In addition, the keyword head character information storage means corresponds to the section to which the head character of each search word belongs, based on the count information for each section stored in association with the divided character string that matches the input one search word. A divided character string corresponding to each search word is acquired based on the count information. Then, the obtained divided character string is used as a divided character string of the facility name storage means, and from the facility name associated with the divided character string, each search word and each search word have the same number of characters or the same number of characters. In this case , a facility name having a keyword that matches forward in the search order set in the input order is acquired as a candidate facility name.

  As a result, even if a plurality of search terms having a small number of characters (for example, one or two characters) are input, the divided characters in which the facility names having the first character of each search word as the first character of each keyword are stored. Only the column can be extracted from the keyword head character information storage means. Accordingly, since the candidate facility names are searched from the facility names stored in the facility name storage means in association with the extracted divided character string, the facility names to be searched can be reduced, and the search can be performed at high speed. Thus, it becomes possible to prevent a decrease in responsiveness.

  Further, in the facility search device according to claim 2, each maximum count for each category to which the first character of each search word belongs is determined from the divided character string that matches the input one search word in the keyword first character information storage means. A divided character string associated with count information in which all values are equal to or greater than the count value of the first character for each category to which the first character of each search word belongs is acquired. Then, the acquired divided character string is used as a divided character string in the facility name storage means, and a facility name having a keyword that matches the search word in front from the facility name associated with the divided character string is acquired as a candidate facility name.

  Thereby, even if a plurality of search terms with a small number of characters (for example, one character or two characters) are input, the divided characters associated with the facility name having the first character of each search word as the first character of each keyword. Only the column can be reliably extracted from the keyword head character information storage means. Accordingly, since the candidate facility names are searched from the facility names stored in the facility name storage means in association with the extracted divided character string, the facility names to be searched can be reduced, and the search can be performed at high speed. Thus, it becomes possible to prevent a decrease in responsiveness.

  In addition, when a plurality of search terms having the same first character are input, each maximum count value of the category to which the first character of the plurality of search terms belongs is divided into count information more than the number of the search terms. Only character strings can be acquired. As a result, it is possible to reduce the number of divided character strings to be extracted, so that it is possible to further reduce the names of facilities to be searched, perform searches at high speed, and prevent a decrease in responsiveness. Become.

  Further, in the facility search device according to claim 3, in the keyword head character information storage means, presence / absence information for each section to which the head character of each search word belongs is obtained from the divided character string that matches the input one search word. A divided character string associated with count information indicating that all count values are present is acquired. Then, the acquired divided character string is used as a divided character string in the facility name storage means, and a facility name having a keyword that matches the search word in front from the facility name associated with the divided character string is acquired as a candidate facility name.

  Thereby, even if a plurality of search terms with a small number of characters (for example, one character or two characters) are input, the divided characters associated with the facility name having the first character of each search word as the first character of each keyword. Only the column can be reliably extracted from the keyword head character information storage means. Accordingly, since the candidate facility names are searched from the facility names stored in the facility name storage means in association with the extracted divided character string, the facility names to be searched can be reduced, and the search can be performed at high speed. Thus, it becomes possible to prevent a decrease in responsiveness.

  In the facility search apparatus according to claim 4, the keyword first character information storage means counts the first character of each keyword that matches the 50-sound kana (hiragana or katakana) belonging to each row for each 50-sound row. The count information for each line is stored in association with a predetermined number of divided character strings. Thereby, it is possible to limit the number of count information stored in association with a predetermined number of divided character strings to 10 and reduce the number of divided pieces, and it is possible to more quickly extract a divided character string corresponding to a search word. Become.

In the program according to claim 5, the computer reads the program so that the keyword head character information storage means stores each category stored in association with the divided character string that matches the input one search word. From the count information, a divided character string corresponding to each search word is acquired based on the count information corresponding to the section to which the first character of each search word belongs. Then, the computer uses the acquired divided character string as the divided character string of the facility name storage means, and from the facility name associated with the divided character string, each search word and the order of the number of characters of each search word , or the number of characters Are the same, the name of the facility having the keyword that matches forward in the search order set in the input order is acquired as the candidate facility name.

  As a result, the computer stores the name of the facility having the first character of each search word as the first character of each keyword even if a plurality of search words having a small number of characters (for example, one or two characters) are input. Only the divided character string can be extracted from the keyword head character information storage means. Therefore, since the computer searches for the candidate facility names from the facility names stored in the facility name storage means in association with the extracted divided character string, the number of facility names to be searched can be reduced, and the search can be performed at high speed. It is possible to prevent a decrease in responsiveness.

1 is a block diagram illustrating a navigation device according to Embodiment 1. FIG. 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 head character information data table stored in facility name DB. It is a flowchart which shows "facility information display process" which searches facility 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. It is a figure which shows an example of the search word input screen which inputs a search word. It is a figure which shows an example of the search result display screen which displayed the list of the extracted facility name. It is a figure which shows an example of the head character information data table stored in facility name DB which concerns on Example 2. FIG. It is a figure which shows an example of the head character information data table stored in facility name DB which concerns on Example 3. FIG. It is a figure which shows an example of the facility name data table stored in facility name DB which concerns on Example 4. FIG. It is a figure which shows an example of the head character information data table stored in facility name DB which concerns on Example 4. FIG. It is a figure which shows an example of the head character information data table stored in facility name DB which concerns on Example 5. FIG. It is a figure which shows an example of the head character information data table stored in facility name DB which concerns on Example 6. FIG.

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

[Schematic configuration of navigation device]
First, a schematic configuration of the navigation device according to the first embodiment will be described with reference to FIG. FIG. 1 is a block diagram illustrating a navigation device 1 according to the first embodiment.
As shown in FIG. 1, the navigation apparatus 1 according to the first 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 to the hard disk.

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

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

  In addition, the facility name DB 27 stores a facility name described later and a reading of the facility name in association with a divided character string of a predetermined number of characters (in the first embodiment, 1 character or 2 characters) for each division unit. A name data table 51 (see FIG. 2) is stored. In the facility name DB 27, “keyword first character information” representing a line of 50 sounds to which the first character of each keyword constituting a facility name reading described later belongs is stored in a predetermined number of characters (in the first embodiment, one character or two characters). The first character information data table 52 (see FIG. 3) stored for each division unit is stored in association with the divided character string.

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

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

  Further, the liquid crystal display 15 includes map information currently being traveled, a search word input screen 61 (see FIG. 6) described later, a search result display screen 71 for displaying 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 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 by one or two characters in the order of 50 tones. Here, the keyword is a character string of reading composed of units that make sense.

  In the “division unit”, for example, “ah”, “ah”, “ah”, etc., three or more characters may be stored in the order of 50 tones. In addition, only a part of the “division unit”, for example, “O”, “ka”, “ka”, “kan”, “ki”, “ku”, etc., 50 sounds Two or more characters may be stored in order.

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

  For example, when the reading of the facility name is “Sei / Doom”, “Sei” and “Domu” are stored in “Reading” as keywords for reading the facility name. The facility name reading “Sei / Dom” is stored in the “reading” corresponding to each hiragana “sei” and “too” of the “division unit” in the facility name data table 51.

  In addition, “g”, “pa”, and other muffled / semi-acoustic sounds included in the facility name readings are “ka”, “ha”, etc., as well as lower-case kana characters such as “nya”, “tsu”, etc. ) Is converted into kana basic characters such as “ya” and “tsu”, and long tones are converted into kana basic characters and stored, such as corresponding vowels. For example, “Sei / Dom” is actually stored as “Sei / Toom”, but in this embodiment, the facility name and the reading are matched to simplify the explanation. / Doom ".

  In the “reading” of the facility name corresponding to the “division unit” in which the hiragana “sei” is stored, “sei / doom” is stored so that the keyword “seito” comes first. . In addition, in the “reading” of the facility name corresponding to the “division unit” in which the hiragana “too” is stored, “doom / seito” is stored so that the keyword “dom” comes first. .

  Further, in “facility name”, a facility name representing a destination to be searched is stored corresponding to the reading of the facility name stored in “reading”. For example, the facility name “Nishito Dome” is stored corresponding to the reading of the facility name “Sei / Dom”. Therefore, the facility name “Nishito Dome” is “Hirai” or “Domu” or “Domu” of “Read” in “Hi” in “Division unit” of the Facility name data table 51. And “facility name” corresponding to each of “and”.

  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, 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 first character information data table 52 stored in the facility name DB 27 will be described with reference to FIG.
As shown in FIG. 3, the head character information data table 52 is composed of “division unit”, “keyword head character information”, and “reading”. Further, “keyword first character information” is divided into 50 sound lines from “A line” to “Wa line”.

  This “division unit” corresponds to the “division unit” of the facility name data table 51, and hiragana characters that match the keywords that make up the reading of the facility name are stored one by one or two characters in the order of 50 characters. ing. Therefore, when the “division unit” of the facility name data table 51 stores, for example, “a”, “ah”, “ai”,. Similarly, the information data table 52 stores “a”, “ah”, “ai”,.

  The “reading” corresponding to each “division unit” stores the reading of the facility name stored in “reading” in each “division unit” of the facility name data table 51. For example, the “reading” corresponding to the “division unit” in which the hiragana “sei” is stored is stored in the “reading” in the “division unit” in which the hiragana “sei” in the facility name data table 51 is stored. The readings of the names of the facilities are “Sei / Domu”, “Sei / Hyukaten”, “Seigen / Someya”, “Seito / Sotoya” are separated by the delimiter “;”. Is remembered.

  In addition, in the “keyword first character information” corresponding to each “division unit”, the first character of each keyword belongs for each reading of each facility name stored in “reading” corresponding to the same “division unit”. The 50-sound line is counted by line, and the maximum count value between readings of each facility name is extracted from each 50-sound line-by-line count value. ”To“ Wa ”are stored separately for each of the 50 sound lines.

  For example, as shown in FIG. 3, in the “keyword first character information” corresponding to the “division unit” in which hiragana “sei” is stored, each of the keywords “seisei” of the facility name reading “seigen / someya” is displayed. The count value “2” of “Sa line” to which the first character of “Gen” and “Someya” belongs is stored as the maximum count value obtained by counting the line of 50 sounds to which the first character of each keyword belongs.

  Similarly, in the “keyword first character information” corresponding to the “division unit” in which the hiragana “sei” is stored, each facility name reading “seito / doom”, “seika / toshokan” Each count value “1” of the “ta line” to which the first character of each of the keywords “Dom” and “Toshokan” belongs is the maximum count value obtained by counting the 50-sound row to which the first character of each keyword belongs. Is remembered as

  Similarly, in the “keyword first character information” corresponding to the “division unit” in which the hiragana “seika” is stored, the keyword “hyacca” of the facility name reading “seito / hyakten” The count value “1” of “ha line” to which the first character of “ten” belongs is stored as the maximum count value obtained by counting the 50-sound row to which the first character of each keyword belongs by line. In addition, in the “keyword first character information” corresponding to the “division unit” in which the hiragana “sei” is stored, “a line”, “ka line”, “na line”, “ma line” to “wa line” Stores “0” indicating that the first character of each keyword of the facility name reading does not belong.

  Therefore, according to the count values stored separately for each of the 50 sound lines of “A line” to “Wa line” of “Key word first character information” corresponding to each “Division unit” of the first character information data table 52, It is possible to determine the presence / absence of a line of 50 sounds to which the first character of each keyword reading of the facility name stored in each “division unit” belongs.

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

  FIG. 4 is a flowchart showing a “facility information display process” which is a process executed by the CPU 41 and which searches for facility 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 the facility, etc. as facility information. A search word input screen 61 for inputting is displayed.
Here, an example of the search word input screen 61 will be described with reference to FIG. As shown in FIG. 6, the search word input screen 61 includes a 50-sound key 62, an input character display unit 63, a search word display unit 64, a correction button 65, a return button 66, a next word button 67, a completion button 68, and the number of cases. A display unit 69 is displayed.

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

  In addition, by pressing the return button 66, it is possible to return to the screen before the search word input screen 61. Furthermore, when the completion button 68 is pressed, each character string displayed on the search word display unit 64 and the character string displayed on the input character display unit 63 are used as search words, and the name of the facility as facility information, etc. Can be instructed to search and display a list. The number display unit 69 displays the number of facility names searched by the character string displayed on the input character display unit 63 and each character string displayed on the search word display unit 64.

  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 characters input from the 50-sound key 62 on the input character display unit 63 and the input character display unit 63. Is stored in the RAM 42 as a search term, and the process proceeds to S13.

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

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

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

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

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

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

  On the other hand, if it is determined that the completion button 68 has been pressed (S16: YES), the CPU 41 proceeds to the process of S18. In S18, the CPU 41 displays a list of all candidate facility names extracted in S13 (see FIG. 7), and ends the process.

[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 and the confirmed search word displayed on each search word display unit 64 from the RAM 42.

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

  Specifically, the CPU 41 sets the search word search order in descending order of the number of characters of each search word read from the RAM 42, and stores the search words in the RAM 42 in this search order. Further, when the number of characters of each search word read from the RAM 42 is the same, the CPU 41 sets the search word search order in the order stored in the RAM 42 earlier in time series, and stores the search words in the RAM 42 in this search order.

  For example, when each search word read from the RAM 42 is “se” and “to” as shown in FIG. 6, the CPU 41 sets the search order of the search word “se” to the first, Set the search order of “and” to the second. Then, the CPU 41 stores the search terms “SE” and “TO” in the RAM 42 in the search order.

  Subsequently, in S <b> 113, the CPU 41 reads the hiragana stored in the first “division unit” of the first character information data table 52. Then, the CPU 41 executes a determination process for determining whether or not the hiragana stored in the “division unit” matches the first search word in the search order.

  If it is determined that the hiragana stored in the “division unit” does not match the first search word in the search order (S113: NO), the CPU 41 stores the next character in the first character information data table 52. The determination process for determining whether or not the “division unit” is stored is executed. If it is determined that the next “division unit” is stored in the first character information data table 52, the CPU 41 determines the hiragana stored in the next “division unit” in the first character information data table 52. Read, and the loop after S113 is executed again. On the other hand, when it is determined that the next “division unit” is not stored in the first character information data table 52, the CPU 41 ends the loop and proceeds to the processing of S116.

  On the other hand, if it is determined in S113 that the hiragana stored in the “division unit” matches the first search word in the search order (S113: YES), the CPU 41 proceeds to the process of S114. In S114, the CPU 41 reads all the search words from the RAM 42, and counts the lines of 50 sounds to which the first characters of all the search words belong by line.

  Then, the CPU 41 determines that each count value stored in the line of the 50-sound row to which each head character of all the search words of the “keyword head character information” of the “division unit” belongs is the head of each search word. A determination process is performed to determine whether or not the count value of each line of the 50-sound line to which the character belongs is equal to or greater. That is, the reading of the name of the facility to which the first character of each keyword belongs to the line of 50 sounds to which the first character of all search words belongs is in the “division unit” of the facility name data table 51 corresponding to the “division unit”. A determination process for determining whether or not “read” is stored is executed.

  Then, the count value stored in the line of 50 sound lines to which the first characters of all the search words of the “keyword first character information” of the “division unit” belong is 50 to which the first characters of all the search words belong. When it is determined that there is at least one 50-sound line classification or a 50-sound line classification with a count value of “0” (S114: NO), the CPU 41 determines that there is less than the count value for each sound line. Then, a determination process for determining whether or not the next “division unit” is stored in the first character information data table 52 is executed.

  If it is determined that the next “division unit” is stored in the first character information data table 52, the CPU 41 determines the hiragana stored in the next “division unit” in the first character information data table 52. Read, and the loop after S113 is executed again. On the other hand, when it is determined that the next “division unit” is not stored in the first character information data table 52, the CPU 41 ends the loop and proceeds to the processing of S116.

  On the other hand, in S114, the count value stored in the line of the 50-sound row to which each first character of all the search words of “keyword first character information” of the “division unit” belongs is the value of each first character of all the search words. If it is determined that the count value is greater than or equal to the count value for each line of the 50 sound lines to which it belongs (S114: YES), the CPU 41 proceeds to the process of S115. In S <b> 115, the CPU 41 stores the “division unit” in the RAM 42 as a corresponding “division unit” for searching for a candidate facility name in the facility name data table 51.

  Subsequently, the CPU 41 executes determination processing for determining whether or not the next “division unit” is stored in the first character information data table 52. If it is determined that the next “division unit” is stored in the first character information data table 52, the CPU 41 determines the hiragana stored in the next “division unit” in the first character information data table 52. Read, and the loop after S113 is executed again. On the other hand, when it is determined that the next “division unit” is not stored in the first character information data table 52, the CPU 41 ends the loop and proceeds to the processing of S116.

  For example, as shown in FIG. 3, when the search term set in the first search order in S112 is “SE” and the search term set in the second search order is “TO”, the CPU 41 For each “division unit” in which each hiragana “se”, “sea”, “sei”, “seu”,... “Sen” stored in front of the first character “se” of the search term is stored, The process of S114 is executed.

  Then, the CPU 41 classifies all search words “SE”, “TO” of the “keyword first character information”, “SE”, “SO”, and “TA” of 50 sounds to which “TO” belongs. The “division unit” for searching the candidate name of the facility name data table 51 for the “division unit” in which each hiragana “sei” and “sen” is stored is “1” or more. Is stored in the RAM 42.

  Then, as shown in FIG. 5, in S <b> 116, the CPU 41 sequentially reads out the corresponding “division unit” for searching for the candidate facility name in the facility name data table 51 stored in S <b> 115 from the RAM 42, and stores in the facility name data table 51. Read “reading” of all facility names in the “division unit” in turn. Then, the CPU 41 executes a determination process for determining whether or not there is a keyword that matches forward with each search word for which the search order is set in S112, among the keywords that constitute the reading of each read facility name. That is, the full text search of each search word is performed for “read” of all the facility names that have been read.

  Then, when there is a keyword that matches each 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 which are destination candidates, and the process proceeds to S117.

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

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

  For example, when the “division unit” in which the hiragana characters “sei” and “sen” are stored in the RAM 42 as the corresponding “division unit” for searching the candidate facility name in the facility name data table 51, the CPU 41 The “reading” of all the facility names in the “division unit” in which the hiragana characters “sei” and “sen” in the name data table 51 are stored is read in order.

  Then, as shown in FIG. 2, the CPU 41 reads the name of each facility having a keyword that matches the search terms “SE” and “TO” among the keywords that constitute the reading of each facility name that has been read. Facility name data for each facility name “Nishito Dome”, “Nishito Departmental Library”, “Senjyo Clock” corresponding to “Seito / Domu”, “Seitoka / Toyokan”, “Senkei / Tokei” The data is read from the table 51 and stored in the RAM 42 in order as candidate facility names that are destination candidates.

  Subsequently, as shown in FIG. 5, in S117, the CPU 41 sequentially reads out the candidate facility names from the RAM 42, counts them, and stores them in the RAM 42 as the number of candidate facility names that can be searched by the input search word. For example, if the candidate facility name is each facility name “Nishito Dome”, “Nishito Department Library”, or “Senji Clock”, “3 cases” is stored in the RAM 42 as the number of cases.

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

  In S118, the CPU 41 reads the number of cases from the RAM 42, displays the number of cases on the number of words display section 69 of the search word input screen 61, ends the sub-process, returns to the main flowchart, and executes the processes after S12. For example, if the number read from the RAM 42 is “3”, as shown in FIG. 6, after displaying “3” in the number display section 69, the sub-process is terminated and the process returns to the main flowchart. The subsequent processing is executed.

  Here, as shown in FIG. 6, when the search words “se” and “to” are input from the 50 sound key 62 and the completion button 68 is pressed, a search result display that displays the extracted facility names as a list is displayed. An example of the screen 71 will be described with reference to FIG. It is assumed that the facility names “Nishito Dome”, “Nishito Kagaku Library”, and “Senji Clock” are extracted as candidate facility names by the search terms “se” and “to”.

  As shown in FIG. 7, the PU 41 displays a search result display screen 71 on the liquid crystal display 15, and names each facility name “Western Dome”, “Western Department Library”, and “Senji Clock” from the RAM 42 as candidate facility names. Read and display in order from the search result display column 72 at the top. Further, the CPU 41 reads the number “3” from the RAM 42 and displays it on the number display unit 73 provided at the top of the search result display screen 71.

Here, when the user presses and selects the facility information in each search result display column 72, the CPU 41 sets the facility as a destination, performs a route search, and displays a recommended route on the map. In addition, facility information about the facility (for example, business hours, fees, etc.) is displayed.
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 first embodiment, the CPU 41 stores the hiragana that matches the first search word in the search order among the “division units” in the first character information data table 52. Extracted “division unit” is extracted. Then, the CPU 41 stores each of the extracted “division units” in the division of 50 sound lines to which the first characters of all search words of “keyword first character information” of each “division unit” belong. Only those whose count value is equal to or greater than the count value for each line of 50 sound lines to which the first characters of all search words belong are stored in the RAM 42 as corresponding “division units” for searching for the candidate facility names in the facility name data table 51. To do.

  Subsequently, the CPU 41 sequentially reads out the corresponding “division units” for searching for candidate facility names in the facility name data table 51, and sequentially reads “reading” of all the facility names in the corresponding “division unit” in the facility name data table 51. Read to each. Then, the CPU 41 performs a full-text search of each search word for “read” of all the facility names that have been read, and if there is a keyword that matches the search word in the keywords that constitute the reading of the facility name that has been read. The “facility name” corresponding to the reading of the facility name is read from the facility name data table 51 and stored in the RAM 42 as a candidate facility name that is a destination candidate.

  As a result, even if a plurality of search terms having a small number of characters (for example, one character or two characters) are input, the CPU 41 stores “hiragana” in which the hiragana whose search order matches the first search term is stored. Of the “units”, it is possible to extract from the first character information data table 52 only “division units” in which the facility names having the first characters of all search terms as the first characters of each keyword are stored. Accordingly, the CPU 41 extracts from the first character information data table 52 only the “division unit” in which the facility name having the first character of all search terms as the first character of each keyword is stored, and the corresponding “ Since “reading” of all facility names in the “division unit” is sequentially read out and full text search is performed for all search terms, it is possible to reduce the number of facility names to be searched, and to search at high speed and respond It is possible to prevent a decrease in property.

  In addition, although there is a duplication of the facility name stored in the “facility name” among the “division units” in the facility name data table 51, the facility name stored in the “facility name” is stored in each “division unit”. There is no duplication and only one facility name is stored. Accordingly, there is an overlap in the reading of the facility name stored in the “reading” among the “division units” in the facility name data table 51, but in each “division unit”, the facility name stored in the “reading” is stored. There is no duplication of readings, and only readings of one facility name are stored. As a result, only one facility name stored in the “facility name” of each “division unit” is stored, so the number of facility names stored in duplicate is reduced and the data capacity of the name list is reduced. It is possible to suppress an increase in memory capacity for expanding the name list.

  Next, a navigation device 81 according to the second embodiment will be described with reference to FIG. In the following description, the same reference numerals as those of the navigation device 1 according to the first embodiment shown in FIGS. 1 to 7 indicate the same or corresponding parts as those of the navigation device 1 according to the first embodiment.

The schematic configuration of the navigation device 81 according to the second embodiment is substantially the same as that of the navigation device 1 according to the first embodiment. Various control processes are also substantially the same as the navigation apparatus 1 according to the first embodiment.
However, the navigation device 81 is different in that the first character information data table 82 shown in FIG. 8 is stored in the facility name DB 27 instead of the first character information data table 52. For this reason, as described later, the processing in S114 is also different.

Here, the head character information data table 82 will be described with reference to FIG.
As shown in FIG. 8, the first character information data table 82 according to the second embodiment is similar to the first character information data table 52 in that “dividing unit”, “first character information of keyword”, “reading”, It is composed of Further, “keyword first character information” is divided into 50 sound lines from “A line” to “Wa line”.

  However, as shown in FIG. 8, the “keyword first character information” corresponding to each “division unit” includes, for each reading of each facility name stored in “reading” corresponding to the same “division unit”, The 50-sound line to which the first character of each keyword belongs is counted for each line, and “1” is assigned to and stored in the line-by-line classification of 50 sounds whose count value is “1” or more, and the count value is “0”. "0" is substituted and stored in the line-by-line classification of "". That is, “1” is stored in the 50-sound line classification to which the first character of each keyword belongs, and “0” is stored in the other 50-sound line classifications.

  For example, as shown in FIG. 8, in the “keyword first character information” corresponding to the “division unit” in which the hiragana “sei” is stored, the keyword “seisei” of the facility name reading “seigen / someya” is displayed. Since the count value of “Sa line” to which the first characters of “Gen” and “Someya” belong is “2” (see FIG. 3), “1” is included in “Sa line” of the “Key word first character information”. Is stored.

  Similarly, in the “keyword first character information” corresponding to the “division unit” in which the hiragana “sei” is stored, each facility name reading “seito / doom”, “seika / toshokan” Since each count value of “Ta line” to which the first character of each of the keywords “Dom” and “Toshokan” belongs is “1” (see FIG. 3), In the “row”, “1” is stored.

  Similarly, in the “keyword first character information” corresponding to the “division unit” in which the hiragana “seika” is stored, the keyword “hyacca” of the facility name reading “seito / hyakten” Since the count value of “ha line” to which the first character of “Ten” belongs is “1” (see FIG. 3), “1” is stored in “ha line” of the “key character first character information”. Yes. In addition, in the “keyword first character information” corresponding to the “division unit” in which the hiragana “sei” is stored, “a line”, “ka line”, “na line”, “ma line” to “wa line” Stores “0” indicating that the first character of each keyword of the facility name reading does not belong.

  Accordingly, whether or not the value stored in each line of 50 sounds of “A line” to “Wa line” of “Key word first character information” corresponding to each “Division unit” of the first character information data table 82 is “1”. Thus, it is possible to determine the presence / absence of the 50-sound line to which the first character of each keyword reading of the facility name stored in each “division unit” belongs.

Next, the process of S114 executed by the CPU 41 of the navigation device 81 according to the second embodiment will be described.
In S114, the CPU 41 reads out all the search words from the RAM 42, and classifies them into 50 sound lines to which the first characters of all the search words of the “keyword first character information” corresponding to the “division unit” specified in S113 belong. A determination process for determining whether or not all stored values are “1” is executed. That is, the reading of the name of the facility to which the first character of each keyword belongs to the line of 50 sounds to which the first character of all search words belongs is in the “division unit” of the facility name data table 51 corresponding to the “division unit”. A determination process for determining whether or not “read” is stored is executed.

  Then, it is determined that the values stored in the 50-sound line classification of the “keyword first character information” of the “division unit” are not all “1”, that is, the value “0” exists. In this case (S114: NO), the CPU 41 executes a determination process for determining whether or not the next “division unit” is stored in the first character information data table 82.

  If it is determined that the next “division unit” is stored in the first character information data table 82, the CPU 41 determines the hiragana stored in the next “division unit” in the first character information data table 82. Read, and the loop after S113 is executed again. On the other hand, if it is determined that the next “division unit” is not stored in the first character information data table 82, the CPU 41 ends the loop and proceeds to the process of S116.

  On the other hand, in S114, it is determined that all the count values stored in the section of the 50-sound row to which each head character of all the search words of “keyword head character information” of the “division unit” belongs are “1”. If it has been (S114: YES), the CPU 41 proceeds to the process of S115. In S <b> 115, the CPU 41 stores the “division unit” in the RAM 42 as a corresponding “division unit” for searching for a candidate facility name in the facility name data table 51.

  Subsequently, the CPU 41 executes determination processing for determining whether or not the next “division unit” is stored in the first character information data table 82. If it is determined that the next “division unit” is stored in the first character information data table 82, the CPU 41 determines the hiragana stored in the next “division unit” in the first character information data table 82. Read, and the loop after S113 is executed again. On the other hand, if it is determined that the next “division unit” is not stored in the first character information data table 82, the CPU 41 ends the loop and proceeds to the process of S116.

  For example, as shown in FIG. 8, when the search term set in the first search order in S112 is “SE” and the search term set in the second search order is “TO”, the CPU 41 For each “division unit” in which each hiragana “se”, “sea”, “sei”, “seu”,... “Sen” stored in front of the first character “se” of the search term is stored, The process of S114 is executed.

  Then, the CPU 41 stores all search words “se” and “to” in the “keyword first character information” in the first characters “se” and “sa line” and “ta line” of 50 sounds to which “to” belongs. The “divided unit” in which each hiragana “sei” and “sen” is stored in the RAM 42 as the corresponding “divided unit” for searching the candidate facility name in the facility name data table 51. Remember.

  As described above in detail, in the navigation device 81 according to the second embodiment, the CPU 41 stores a hiragana whose search order matches the first search word in the “division unit” of the first character information data table 82. Extracted “division unit” is extracted. Then, the CPU 41 stores each of the extracted “division units” in the division of 50 sound lines to which the first characters of all search words of “keyword first character information” of each “division unit” belong. Only values having a value of “1” are stored in the RAM 42 as corresponding “division units” for searching for candidate facility names in the facility name data table 51.

  Subsequently, the CPU 41 sequentially reads out the corresponding “division units” for searching for candidate facility names in the facility name data table 51, and sequentially reads “reading” of all the facility names in the corresponding “division unit” in the facility name data table 51. Read to each. Then, the CPU 41 performs a full-text search of each search word for “read” of all the facility names that have been read, and if there is a keyword that matches the search word in the keywords that constitute the reading of the facility name that has been read. The “facility name” corresponding to the reading of the facility name is read from the facility name data table 51 and stored in the RAM 42 as a candidate facility name that is a destination candidate.

  As a result, even if a plurality of search terms having a small number of characters (for example, one character or two characters) are input, the CPU 41 stores “hiragana” in which the hiragana whose search order matches the first search term is stored. Of the “units”, it is possible to extract from the first character information data table 82 only “division units” in which the facility names having the first characters of all the search words as the first characters of each keyword are stored.

  Therefore, the CPU 41 extracts from the first character information data table 82 only the “division unit” in which the facility name having the first character of all search terms as the first character of each keyword is stored, and the corresponding “ Since “reading” of all facility names in the “division unit” is sequentially read out and full text search is performed for all search terms, it is possible to reduce the number of facility names to be searched, and to search at high speed and respond It is possible to prevent a decrease in property.

  Next, a navigation device 85 according to the third embodiment will be described with reference to FIG. In the following description, the same reference numerals as those of the navigation device 1 according to the first embodiment shown in FIGS. 1 to 7 indicate the same or corresponding parts as those of the navigation device 1 according to the first embodiment.

The schematic configuration of the navigation device 85 according to the third embodiment is substantially the same as that of the navigation device 1 according to the first embodiment. Various control processes are also substantially the same as the navigation apparatus 1 according to the first embodiment.
However, the navigation device 85 is different in that the first character information data table 86 shown in FIG. 9 is stored in the facility name DB 27 instead of the first character information data table 52. For this reason, as described later, the processing in S114 is also different.

Here, the head character information data table 86 will be described with reference to FIG.
As shown in FIG. 9, the first character information data table 86 according to the third embodiment is similar to the first character information data table 52 in that “dividing unit”, “keyword first character information”, “reading”, and the like. It is composed of However, the “keyword first character information” is divided so that hiragana characters belong to one character at a time in the order of the Japanese syllabary.

  In addition, in the “keyword first character information” corresponding to each “division unit”, the first character of each keyword is read for each reading of each facility name stored in “reading” corresponding to the same “division unit”. It counts for each sound, extracts the maximum count value between readings of each facility name from the count values for each of the 50 sounds, and “a” to which the first character of each keyword of “keyword first character information” belongs. ~ It is stored in the category of “n”.

  For example, as shown in FIG. 9, the name of each facility corresponding to the “division unit” in which the hiragana “sei” is stored is “seito / doom”, “seito / hyakten” , “Seigen / Someya”, “Seiyoka / Toshokan” are stored. For this reason, the count values of the first characters of the keywords “Sei” and “Domu” in the facility name reading “Sei / Domu” are “1” for “Se” and “1” for “To”. is there. In addition, the count values of the first characters of the keywords “Sei” and “Hyka Ten” in the facility name reading “Sei / Hykaten” are “1” and “hi”. Is “1”.

  In addition, the count value of the first character of each of the keywords “seigen” and “someya” of the facility name reading “seigen / someya” is “1” for “se” and “1” for “so”. . In addition, the count values of the first characters of the keywords “seika” and “toyokan” of the facility name reading “seika” are “1” and “to” are “1”. It is.

  Therefore, each hiragana “se”, “so”, “to” and “hi” in the “keyword first character information” corresponding to the “division unit” in which the hiragana “sei” is stored belongs to the maximum. “1” is stored as the count value. Also, the hiragana characters “a” to “su”, “ta” to “te”, “na” to “ha” of “keyword first character information” corresponding to the “division unit” in which the hiragana character “sei” is stored. , “0” is stored in the category to which “fu” to “n” belong.

  Accordingly, each “division unit” is determined by the count value stored in each category to which “a” to “n” of “keyword first character information” corresponding to each “division unit” of the first character information data table 86. It becomes possible to discriminate the hiragana that constitutes the first character of each keyword for reading the facility name stored therein.

Next, the process of S114 executed by the CPU 41 of the navigation device 85 according to the third embodiment will be described.
In S114, the CPU 41 reads all search words from the RAM 42, and counts the first characters of all search words for each of the 50 sounds. Then, the CPU 41 determines that each count value stored in the category to which each first character of all the search words of “keyword first character information” of “division unit” specified in S113 belongs is the first character of all search words. A determination process is performed to determine whether or not the count value is greater than or equal to 50. That is, the reading of the facility name to which the first character of each keyword belongs to the division of 50 sounds to which the first character of all search words belongs is in the “division unit” of the facility name data table 51 corresponding to the “division unit”. A determination process for determining whether or not “read” is stored is executed.

  Then, in the division to which the first character of all search words of the “keyword first character information” of the “division unit” belongs, a division or count value smaller than the count value for each first sound of all the search words is “0”. When the CPU 41 determines that there is at least one section (S114: NO), the CPU 41 executes a determination process for determining whether or not the next “division unit” is stored in the first character information data table 86. To do.

  If it is determined that the next “division unit” is stored in the first character information data table 86, the CPU 41 uses the hiragana stored in the next “division unit” in the first character information data table 86. Read, and the loop after S113 is executed again. On the other hand, if it is determined that the next “division unit” is not stored in the first character information data table 86, the CPU 41 ends the loop and proceeds to the processing of S116.

  On the other hand, in S114, the count value stored in the section to which each first character of all the search words of the “keyword first character information” of the “division unit” belongs is the count value for each first character of all the search words. When it determines with it being above (S114: YES), CPU41 transfers to the process of S115. In S <b> 115, the CPU 41 stores the “division unit” in the RAM 42 as a corresponding “division unit” for searching for a candidate facility name in the facility name data table 51.

  Subsequently, the CPU 41 executes a determination process for determining whether or not the next “division unit” is stored in the first character information data table 86. If it is determined that the next “division unit” is stored in the first character information data table 86, the CPU 41 uses the hiragana stored in the next “division unit” in the first character information data table 86. Read, and the loop after S113 is executed again. On the other hand, if it is determined that the next “division unit” is not stored in the first character information data table 86, the CPU 41 ends the loop and proceeds to the processing of S116.

  For example, as shown in FIG. 9, when the search term set in the first search order in S112 is “SE” and the search term set in the second search order is “TO”, the CPU 41 For each “division unit” in which each hiragana “se”, “sea”, “sei”, “seu”,... “Sen” stored in front of the first character “se” of the search term is stored, The process of S114 is executed.

  Then, the CPU 41 determines that each count value stored in the category to which all the search words “se” and “to” of “keyword first character information” belong is assigned “1”. The “division unit” in which the hiragana characters “sei” and “sen” are stored is stored in the RAM 42 as a corresponding “division unit” for searching for a candidate facility name in the facility name data table 51.

  As described above in detail, in the navigation device 85 according to the third embodiment, the CPU 41 stores the hiragana whose search order matches the first search word in the “division unit” of the first character information data table 86. Extracted “division unit” is extracted. Then, the CPU 41 sets the count values stored in the sections to which the first characters of all the search words of the “keyword first character information” of each “division unit” belong to the extracted “division units”. Only those of the first word of the search word that are equal to or greater than the count value for each of the 50 sounds are stored in the RAM 42 as the corresponding “division unit” for searching for the candidate facility name in the facility name data table 51.

  Subsequently, the CPU 41 sequentially reads out the corresponding “division units” for searching for candidate facility names in the facility name data table 51, and sequentially reads “reading” of all the facility names in the corresponding “division unit” in the facility name data table 51. Read to each. Then, the CPU 41 performs a full-text search of each search word for “read” of all the facility names that have been read, and if there is a keyword that matches the search word in the keywords that constitute the reading of the facility name that has been read. The “facility name” corresponding to the reading of the facility name is read from the facility name data table 51 and stored in the RAM 42 as a candidate facility name that is a destination candidate.

  As a result, even if a plurality of search terms having a small number of characters (for example, one character or two characters) are input, the CPU 41 stores “hiragana” in which the hiragana whose search order matches the first search term is stored. Of the “units”, it is possible to extract from the first character information data table 86 only “division units” in which the facility names having the first characters of all search words as the first characters of each keyword are stored.

  Therefore, the CPU 41 extracts from the first character information data table 86 only the “division unit” in which the facility name having the first character of all search terms as the first character of each keyword is stored, and the corresponding “ Since “reading” of all facility names in the “division unit” is sequentially read out and full text search is performed for all search terms, it is possible to reduce the number of facility names to be searched, and to search at high speed and respond It is possible to prevent a decrease in property.

  Next, a navigation device 91 according to a fourth embodiment will be described with reference to FIGS. In the following description, the same reference numerals as those of the navigation device 1 according to the first embodiment shown in FIGS. 1 to 7 indicate the same or corresponding parts as those of the navigation device 1 according to the first embodiment.

The schematic configuration of the navigation device 91 according to the fourth embodiment is substantially the same as that of the navigation device 1 according to the first embodiment. Various control processes are also substantially the same as the navigation apparatus 1 according to the first embodiment.
However, the navigation device 91 stores the facility name data table 92 shown in FIG. 10 in the facility name DB 27 instead of the facility name data table 51, and replaces the head character information data table 52 with the head shown in FIG. The difference is that the character information data table 93 is stored in the facility name DB 27.

Here, the facility name data table 92 will be described with reference to FIG.
As shown in FIG. 10, the facility name data table 92 is composed of a “division unit”, “reading” for storing the reading of the facility name, and “facility name” in the same manner as the facility name data table 51. Yes.
However, in this “division unit”, 1 to 3 hiragana characters that match the keywords that make up the facility name reading are stored in correspondence with the 1 to 3 line combinations of the 50 sounds to which they belong. Yes. For example, when the “division unit” is “ta line line”, each hiragana character “taa”, “tai”, “tau”,... Toe "and" Too "belong.

  The “dividing unit” includes, for example, “a line, a line, a line”, “a line, a line, a line”, “a line, a line, a line”, etc. A combination of more than one row 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 line” You may make it memorize | store the combination of 4 or more lines of 50 sound, such as "A line, a performed line", "a line, a line", "a line," etc.

  Further, “reading” stores a reading of a facility name including a keyword that coincides with each hiragana character of 1 to 3 characters belonging to “division unit”. For example, the reading of the facility name is “Aishi / Eiaeru / Okazaki / Kojiyo / Sekkei”. The three letters in front of each keyword are “Aishi”, “Eia”, “Okaza”, “Koji”, “ Each combination of three lines of 50 sounds of “division unit” in the facility name data table 92 corresponding to “Sekke” “A line, A line”, “A line, A line” , “Ka line, line”, and “read” corresponding to “line, line”, respectively.

  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 “Ashi AR Okazaki Factory Design Section” is “A line is a line”, “A line is a line”, “A line is a line” in the “Division unit” of the facility name data table 92. , “Ka-a-a-sa-sa”, “Sa-go-a-wa-a-line”, “Reading” in “Ashi / Eia-Ru / Okazaki / Kojo / Sekika” are stored in the “facility name” respectively. .

Next, the head character information data table 93 will be described with reference to FIG.
As shown in FIG. 11, the head character information data table 93 is composed of “division unit”, “keyword head character information”, and “reading”, as with the head character information data table 52. Further, “keyword first character information” is divided into 50 sound lines from “A line” to “Wa line”.

  However, this “division unit” corresponds to the “division unit” in the facility name data table 92, and the hiragana with 1 to 3 characters that match the keyword that constitutes the reading of the facility name belongs to the 50 Corresponding to a combination of 1 to 3 lines of sound is stored. For example, if the “division unit” is “A line,” the two-letter hiragana characters “Ah”, “Ai”, “Au”,... , "Oo" belongs.

  The “reading” corresponding to each “division unit” stores the reading of the facility name stored in “reading” in each “division unit” of the facility name data table 92. For example, in the “reading” corresponding to the “division unit” in which the combination of two lines of 50 sounds “A line” is stored, the combination of the two lines of 50 sounds in the facility name data table 92 “A line” The readings of the facility names “Oh”, “Ei”,... Stored in “Reading” in “Division unit” in which “is stored” are stored separated by the delimiter “;”.

  In addition, in the “keyword first character information” corresponding to each “division unit”, the first character of each keyword belongs for each reading of each facility name stored in “reading” corresponding to the same “division unit”. The 50-sound line is counted by line, and the maximum count value between readings of each facility name is extracted from each 50-sound line-by-line count value. ”To“ Wa ”are stored separately for each of the 50 sound lines.

  For example, as shown in FIG. 11, in the “keyword first character information” corresponding to the “division unit” in which the combination of three lines of “50 sounds” “A line and A line” is stored, the facility name reading “ "Osaka", "Ooi / Osago" / "Ote / Souvenir" keywords "Osaka", "Ooi", "Osamajo", "Ote", "Ou" “5” is stored as the maximum count value obtained by counting the 50-sound line to which the first character of each keyword belongs.

  Similarly, in the “keyword first character information” corresponding to the “division unit” in which the three-line combination of “50 lines” “A line and line” is stored, the facility name reading “Aishi / Air / The count value “1” of the “ka line” to which the first character of the keyword “Kojo” of “Okazaki / Kojo / Sekkei” belongs is the maximum count that counts the line of 50 sounds to which the first character of each keyword belongs. Stored as a value.

  Similarly, in the “keyword first character information” corresponding to the “division unit” in which the three-line combination of “50 lines” “A line and line” is stored, the facility name reading “ The count value “1” of “Sa line” to which the first character of the keyword “Shita” belongs is stored as the maximum count value by counting the line of 50 sounds to which the first character of each keyword belongs. Has been. In addition, the facility name is included in “Ta line” to “Wa line” of “Keyword first character information” corresponding to “Division unit” in which a combination of three lines of “50 lines” “A line line” is stored. “0” is stored, which indicates that the first character of each of the readings does not belong.

  Therefore, according to the count values stored separately for each of the 50 sound lines of “A line” to “Wa line” of “Key word first character information” corresponding to each “Division unit” of the first character information data table 93, It is possible to determine the presence / absence of a line of 50 sounds to which the first character of each keyword reading of the facility name stored in each “division unit” belongs.

  Then, the CPU 41 of the navigation device 91 according to the fourth embodiment replaces the facility name data table 51 and the head character information data table 52 in S113 to S116 of the “candidate facility name extraction process” shown in FIG. The facility name data table 92 and the head character information data table 93 are used.

  Specifically, in S113, the CPU 41 determines that the hiragana that belongs to the combination of the 50-sound rows stored in the first “division unit” of the first character information data table 93 is the first search word in the search order. A determination process is performed to determine whether or not the front matches. If it is determined that the hiragana characters belonging to the combination of the 50-sound rows stored in the “division unit” do not match the first search word in the search order (S113: NO), the CPU 41 A determination process for determining whether or not the next “division unit” is stored in the first character information data table 93 is executed.

  When it is determined that the next “division unit” is stored in the first character information data table 93, the CPU 41 stores the 50 sounds stored in the next “division unit” in the first character information data table 93. Hiragana characters belonging to the combination of lines are read out, and the loop after S113 is executed again. On the other hand, if it is determined that the next “division unit” is not stored in the first character information data table 93, the CPU 41 ends the loop and proceeds to the processing of S116.

  On the other hand, if it is determined in S113 that the hiragana characters belonging to the combination of the 50-sound rows stored in the “division unit” match the first search word in the search order (S113: YES), the CPU 41 , The process proceeds to S114. In S114, the CPU 41 reads all the search words from the RAM 42, and counts the lines of 50 sounds to which the first characters of all the search words belong by line.

  Then, the CPU 41 determines that each count value stored in the line of the 50-sound row to which each head character of all the search words of the “keyword head character information” of the “division unit” belongs is the head of each search word. A determination process is performed to determine whether or not the count value of each line of the 50-sound line to which the character belongs is equal to or greater. That is, the reading of the name of the facility to which the first character of each keyword belongs in the line of 50 sounds to which the first character of all search words belongs is in the “division unit” of the facility name data table 92 corresponding to the “division unit” A determination process for determining whether or not “read” is stored is executed.

  Then, the count value stored in the line of 50 sound lines to which the first characters of all the search words of the “keyword first character information” of the “division unit” belong is 50 to which the first characters of all the search words belong. When it is determined that there is at least one 50-sound line classification or a 50-sound line classification with a count value of “0” (S114: NO), the CPU 41 determines that there is less than the count value for each sound line. Then, a determination process for determining whether or not the next “division unit” is stored in the first character information data table 93 is executed.

  When it is determined that the next “division unit” is stored in the first character information data table 93, the CPU 41 stores the 50 sounds stored in the next “division unit” in the first character information data table 93. Hiragana characters belonging to the combination of lines are read out, and the loop after S113 is executed again. On the other hand, if it is determined that the next “division unit” is not stored in the first character information data table 93, the CPU 41 ends the loop and proceeds to the processing of S116.

  On the other hand, in S114, the count value stored in the line of the 50-sound row to which each first character of all the search words of “keyword first character information” of the “division unit” belongs is the value of each first character of all the search words. If it is determined that the count value is greater than or equal to the count value for each line of the 50 sound lines to which it belongs (S114: YES), the CPU 41 proceeds to the process of S115. In S <b> 115, the CPU 41 stores the “division unit” in the RAM 42 as a corresponding “division unit” for searching for a candidate facility name in the facility name data table 92.

  Subsequently, the CPU 41 executes determination processing for determining whether or not the next “division unit” is stored in the first character information data table 93. When it is determined that the next “division unit” is stored in the first character information data table 93, the CPU 41 stores the 50 sounds stored in the next “division unit” in the first character information data table 93. Hiragana characters belonging to the combination of lines are read out, and the loop after S113 is executed again. On the other hand, if it is determined that the next “division unit” is not stored in the first character information data table 93, the CPU 41 ends the loop and proceeds to the processing of S116.

  For example, as shown in FIG. 11, when the search term set in the first search order in S112 is “Ai” and the search term set in the second search order is “ko”, the CPU 41 “A line”, “A line and A line”,... “A line and A line” ... “A done” The processing of S114 is executed for each “division unit” in which “row” is stored.

  Then, the CPU 41 classifies all search words “ai” and “ko” of the “keyword first character information” into the first characters “a” and “ko” of “50” to which “ko” belongs. Search for a candidate facility name in the facility name data table 92 for a “division unit” in which a combination of “50 lines” of “50” rows whose count values are “1” or more is stored. The corresponding “division unit” is stored in the RAM 42.

  In S 116, the CPU 41 sequentially reads out the “division units” for searching for the candidate facility names in the facility name data table 92 stored in S 115 from the RAM 42, and within the “division units” in the facility name data table 92. Read “reading” of all facility names in turn. Then, the CPU 41 executes a determination process for determining whether or not there is a keyword that matches forward with each search word for which the search order is set in S112, among the keywords that constitute the reading of each read facility name. That is, the full text search of each search word is performed for “read” of all the facility names that have been read.

  Then, when there is a keyword that matches each 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 92. Are stored in the RAM 42 in order as candidate facility names which are destination candidates, and the process proceeds to S117.

  As described above in detail, in the navigation device 91 according to the fourth embodiment, the CPU 41 belongs to the hiragana whose search order matches the first search word among the “division units” of the first character information data table 93. A “division unit” in which a combination of 50 sound lines is stored is extracted. Then, the CPU 41 of the extracted “divided units” corresponds to the 50-sound line to which the first character of all search words belongs, and the 50-sound of “keyword first character information” of each “divided unit”. Search for candidate facility names in the facility name data table 92 only when the count value stored in the row classification is equal to or greater than the count value for each row of the 50-sound row to which the first characters of all search words belong It is stored in the RAM 42 as “division unit”.

  Subsequently, the CPU 41 sequentially reads out the corresponding “division units” for searching for candidate facility names in the facility name data table 92, and sequentially reads “reading” of all the facility names in the corresponding “division unit” in the facility name data table 92. Read to each. Then, the CPU 41 performs a full-text search of each search word for “read” of all the facility names that have been read, and if there is a keyword that matches the search word in the keywords that constitute the reading of the facility name that has been read. The “facility name” corresponding to the reading of the facility name is read from the facility name data table 92 and stored in the RAM 42 as a candidate facility name that is a destination candidate.

  As a result, even if a plurality of search terms with a small number of characters (for example, one or two characters) are input, the CPU 41 performs a 50-sound line to which a hiragana whose search order matches the first search term belongs. Of the “division units” in which the combinations of the two are stored, only the “division unit” in which the name of the facility having the first character of each keyword as the first character of each keyword is extracted from the first character information data table 93. It becomes possible.

  Therefore, the CPU 41 extracts from the first character information data table 93 only the “division unit” in which the facility name having the first character of all search terms as the first character of each keyword is stored, and the corresponding “ Since “reading” of all facility names in the “division unit” is sequentially read out and full text search is performed for all search terms, it is possible to reduce the number of facility names to be searched, and to search at high speed and respond It is possible to prevent a decrease in property.

  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 92, within each “division unit”, the facility name stored in the “facility name” is stored. There is no duplication and only one facility name is stored. Accordingly, there is an overlap in the reading of the facility name stored in the “reading” among the “division units” in the facility name data table 92, 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. As a result, only one facility name stored in the “facility name” of each “division unit” is stored, so the number of facility names stored in duplicate is reduced and the data capacity of the name list is reduced. It is possible to suppress an increase in memory capacity for expanding the name list.

  Next, a navigation device 95 according to Embodiment 5 will be described with reference to FIG. In the following description, the same reference numerals as those of the navigation device 1 according to the first embodiment shown in FIGS. 1 to 7 indicate the same or corresponding parts as those of the navigation device 1 according to the first embodiment. The same reference numerals as those of the navigation device 91 according to the fourth embodiment in FIGS. 10 and 11 indicate the same or corresponding parts as those of the navigation device 91 according to the fourth embodiment.

The schematic configuration of the navigation device 95 according to the fifth embodiment is substantially the same as the navigation device 91 according to the fourth embodiment. Various control processes are substantially the same as those of the navigation apparatus 91 according to the fourth embodiment.
However, the navigation device 95 is different in that the first character information data table 96 shown in FIG. 12 is stored in the facility name DB 27 instead of the first character information data table 93. For this reason, as described later, the processing in S114 is also different.

Here, the head character information data table 96 will be described with reference to FIG.
As shown in FIG. 12, the head character information data table 96 according to the fifth embodiment is similar to the head character information data table 93 in that “dividing unit”, “keyword head character information”, “read” It is composed of Further, “keyword first character information” is divided into 50 sound lines from “A line” to “Wa line”.

  However, as shown in FIG. 12, in the “keyword first character information” corresponding to each “division unit”, for each reading of each facility name stored in “reading” corresponding to the same “division unit”, The 50-sound line to which the first character of each keyword belongs is counted for each line, and “1” is assigned to and stored in the line-by-line classification of 50 sounds whose count value is “1” or more, and the count value is “0”. "0" is substituted and stored in the line-by-line classification of "". That is, “1” is stored in the 50-sound line classification to which the first character of each keyword belongs, and “0” is stored in the other 50-sound line classifications.

  For example, as shown in FIG. 12, the “first character information of keyword” corresponding to “division unit” in which a combination of three lines of 50 sounds “A line, A line” is stored is a reading of the facility name “ "Osaka", "Ooi / Osago" / "Ote / Souvenir" keywords "Osaka", "Ooi", "Osamajo", "Ote", "Ou" Is “5” (see FIG. 11), “1” is stored in “A line” of the “keyword first character information”.

  Similarly, in the “keyword first character information” corresponding to the “division unit” in which the three-line combination of “50 lines” “A line and line” is stored, the facility name reading “Aishi / Air / Since the count value of “ka line” to which the first character of the keyword “Kojo” of “Okazaki / Kojo / Sekkei” belongs is “1” (see FIG. 11), “the first character information of the keyword” is “ “1” is stored in “KA”.

  Similarly, in the “keyword first character information” corresponding to the “division unit” in which the three-line combination of “50 lines” “A line and line” is stored, the facility name reading “ Since the count value of “sa line” to which the first character of the keyword “shiat” belongs is “1” (see FIG. 3), “sa line” of the “keyword first character information”. Stores “1”. In addition, the facility name is included in “Ta line” to “Wa line” of “Keyword first character information” corresponding to “Division unit” in which a combination of three lines of “50 lines” “A line line” is stored. “0” is stored, which indicates that the first character of each of the readings does not belong.

  Accordingly, whether or not the value stored in each line of the 50 sounds of “A line” to “Wa line” of “Key word first character information” corresponding to each “Division unit” of the first character information data table 96 is “1”. Thus, it is possible to determine the presence / absence of the 50-sound line to which the first character of each keyword reading of the facility name stored in each “division unit” belongs.

Next, the process of S114 executed by the CPU 41 of the navigation device 95 according to the fifth embodiment will be described.
In S114, the CPU 41 reads all the search words from the RAM 42, and the 50 sounds to which the first characters of all the search words of “keyword first character information” corresponding to the “division unit” (see Example 4) specified in S113 belong. Determination processing for determining whether or not all the values stored in the row classification are “1” is executed. That is, the reading of the name of the facility to which the first character of each keyword belongs to the line of 50 sounds to which the first character of all search words belongs is in the “division unit” of the facility name data table 92 corresponding to the “division unit”. A determination process for determining whether or not “read” is stored is executed.

  Then, it is determined that the values stored in the 50-sound line classification of the “keyword first character information” of the “division unit” are not all “1”, that is, the value “0” exists. In this case (S114: NO), the CPU 41 executes a determination process for determining whether or not the next “division unit” is stored in the first character information data table 96.

  When it is determined that the next “division unit” is stored in the first character information data table 96, the CPU 41 stores the 50 sounds stored in the next “division unit” in the first character information data table 96. Hiragana characters belonging to the combination of lines are read out, and the loop after S113 is executed again. On the other hand, if it is determined that the next “division unit” is not stored in the first character information data table 96, the CPU 41 ends the loop and proceeds to the process of S116.

  On the other hand, in S114, it is determined that all the count values stored in the section of the 50-sound row to which each head character of all the search words of “keyword head character information” of the “division unit” belongs are “1”. If it has been (S114: YES), the CPU 41 proceeds to the process of S115. In S <b> 115, the CPU 41 stores the “division unit” in the RAM 42 as a corresponding “division unit” for searching for a candidate facility name in the facility name data table 92.

  Subsequently, the CPU 41 executes a determination process for determining whether or not the next “division unit” is stored in the first character information data table 96. When it is determined that the next “division unit” is stored in the first character information data table 96, the CPU 41 stores the 50 sounds stored in the next “division unit” in the first character information data table 96. Hiragana characters belonging to the combination of lines are read out, and the loop after S113 is executed again. On the other hand, if it is determined that the next “division unit” is not stored in the first character information data table 96, the CPU 41 ends the loop and proceeds to the process of S116.

  For example, as shown in FIG. 12, when the search word set in the first search order in S112 is “Ai” and the search word set in the second search order is “ko”, the CPU 41 “A line”, “A line and A line”,... “A line and A line” ... “A done” The processing of S114 is executed for each “division unit” in which “row” is stored.

  Then, the CPU 41 classifies all search words “ai” and “ko” of the “keyword first character information” into the first characters “a” and “ko” of “50” to which “ko” belongs. A search is made for a candidate facility name in the facility name data table 92 for a “division unit” in which a combination of “50 lines” with all values stored in “1” is stored. It is stored in the RAM 42 as “division unit”.

  As described above in detail, in the navigation device 95 according to the fifth embodiment, the CPU 41 belongs to the hiragana whose search order is the same as the first search word among the “division units” in the first character information data table 96. A “division unit” in which a combination of 50 sound lines is stored is extracted. Then, the CPU 41 stores each of the extracted “division units” in the division of 50 sound lines to which the first characters of all search words of “keyword first character information” of each “division unit” belong. Only values having a value of “1” are stored in the RAM 42 as corresponding “division units” for searching for candidate facility names in the facility name data table 92.

  Subsequently, the CPU 41 sequentially reads out the corresponding “division units” for searching for candidate facility names in the facility name data table 92, and sequentially reads “reading” of all the facility names in the corresponding “division unit” in the facility name data table 92. Read to each. Then, the CPU 41 performs a full-text search of each search word for “read” of all the facility names that have been read, and if there is a keyword that matches the search word in the keywords that constitute the reading of the facility name that has been read. The “facility name” corresponding to the reading of the facility name is read from the facility name data table 92 and stored in the RAM 42 as a candidate facility name that is a destination candidate.

  As a result, even if a plurality of search terms with a small number of characters (for example, one or two characters) are input, the CPU 41 performs a 50-sound line to which a hiragana whose search order matches the first search term belongs. Of the “divided units” in which the combinations are stored, only the “divided unit” in which the facility name having the first character of each keyword as the first character of each keyword is stored is extracted from the first character information data table 96. It becomes possible.

  Therefore, the CPU 41 extracts from the first character information data table 96 only the “division unit” in which the facility name having the first character of all search words as the first character of each keyword is stored, and the corresponding “ Since “reading” of all facility names in the “division unit” is sequentially read out and full text search is performed for all search terms, it is possible to reduce the number of facility names to be searched, and to search at high speed and respond It is possible to prevent a decrease in property.

  Next, a navigation device 98 according to Embodiment 6 will be described with reference to FIG. In the following description, the same reference numerals as those of the navigation device 1 according to the first embodiment shown in FIGS. 1 to 7 indicate the same or corresponding parts as those of the navigation device 1 according to the first embodiment. The same reference numerals as those of the navigation device 91 according to the fourth embodiment in FIGS. 10 and 11 indicate the same or corresponding parts as those of the navigation device 91 according to the fourth embodiment.

The schematic configuration of the navigation device 98 according to the sixth embodiment is substantially the same as that of the navigation device 91 according to the fourth embodiment. Various control processes are substantially the same as those of the navigation apparatus 91 according to the fourth embodiment.
However, the navigation device 98 is different in that the first character information data table 99 shown in FIG. 13 is stored in the facility name DB 27 instead of the first character information data table 93. For this reason, as described later, the processing in S114 is also different.

Here, the first character information data table 99 will be described with reference to FIG.
As shown in FIG. 13, the head character information data table 99 according to the sixth embodiment is similar to the head character information data table 93 in that “dividing unit”, “keyword head character information”, “reading”, and the like. It is composed of However, the “keyword first character information” is divided so that hiragana characters belong to one character at a time in the order of the Japanese syllabary.

  In addition, in the “keyword first character information” corresponding to each “division unit”, the first character of each keyword is read for each reading of each facility name stored in “reading” corresponding to the same “division unit”. It counts for each sound, extracts the maximum count value between readings of each facility name from the count values for each of the 50 sounds, and “a” to which the first character of each keyword of “keyword first character information” belongs. ~ It is stored in the category of “n”.

  For example, as shown in FIG. 13, the reading of each facility name corresponding to the “division unit” in which the combination of three lines of 50 sounds “A line, A line” is stored is “Aishi / Air A / Oka” "Zaki / Koji / Sekkei", "Osaka / Ooi / Osamajo / Ote / Souvenir", and "Ushishino / Shitaa" are stored. For this reason, the keywords of the facility name reading “Aishi / Eiaeru / Okazaki / Kojo / Sekika” “Aishi”, “Eiaeru”, “Okazaki”, “Kojo”, “Sekikaika” The count values of “A” are “1”, “E” is “1”, “O” is “1”, “KO” is “1”, and “SE” is “1”.

  In addition, counts of the first letters of the keywords "Osaka", "Ooi", "Oosawa", "Ote", "Osame" for the facility name reading "Osaka / Ooi / Osamajo / Ote / Souvenir" The value is “5” for “O”. In addition, the count value of the first character of each of the keywords “Ureshino” and “Shiat” for the reading of the facility name “Ushishino / Shia-ta” is “1” for “U” and “shi”. “1”.

  Accordingly, the hiragana “a”, “u”, “e”, “e” of the “keyword first character information” corresponding to the “division unit” in which the three-line combination “a line a line” is stored. “1” is stored as the maximum count value for each category to which “ko”, “shi”, and “se” belong, and “5” is stored as the maximum count value for the category to which hiragana “o” belongs. Yes. In addition, each hiragana “i”, “ka”-“ke” of “keyword first character information” corresponding to “division unit” in which a combination of three lines of “50 lines” “a line a line” is stored, “0” is stored in the category to which “sa”, “su”, “so” to “n” belong.

  Accordingly, each “division unit” is determined by the count value stored in each category to which “a” to “n” of “keyword first character information” corresponding to each “division unit” of the first character information data table 99. It becomes possible to discriminate the hiragana that constitutes the first character of each keyword for reading the facility name stored therein.

Next, the process of S114 executed by the CPU 41 of the navigation device 98 according to the sixth embodiment will be described.
In S114, the CPU 41 reads all search words from the RAM 42, and counts the first characters of all search words for each of the 50 sounds. Then, the CPU 41 determines that the count values stored in the sections to which the first characters of all the search words of the “keyword first character information” of the “division unit” (see Example 4) identified in S113 belong are all searched. A determination process for determining whether or not the first character of the word is equal to or greater than the count value for each of the 50 sounds is executed. That is, the reading of the name of the facility to which the first character of each keyword belongs in the division of 50 sounds to which the first character of all search words belongs is in the “division unit” of the facility name data table 92 corresponding to the “division unit”. A determination process for determining whether or not “read” is stored is executed.

  Then, in the division to which the first character of all search words of the “keyword first character information” of the “division unit” belongs, a division or count value smaller than the count value for each first sound of all the search words is “0”. When the CPU 41 determines that there is at least one category (S114: NO), the CPU 41 executes a determination process for determining whether or not the next “division unit” is stored in the first character information data table 99. To do.

  When it is determined that the next “division unit” is stored in the first character information data table 99, the CPU 41 stores the 50 sounds stored in the next “division unit” in the first character information data table 99. Hiragana characters belonging to the combination of lines are read out, and the loop after S113 is executed again. On the other hand, if it is determined that the next “division unit” is not stored in the first character information data table 99, the CPU 41 ends the loop and proceeds to the processing of S116.

  On the other hand, in S114, the count value stored in the section to which each first character of all the search words of the “keyword first character information” of the “division unit” belongs is the count value for each first character of all the search words. When it determines with it being above (S114: YES), CPU41 transfers to the process of S115. In S <b> 115, the CPU 41 stores the “division unit” in the RAM 42 as a corresponding “division unit” for searching for a candidate facility name in the facility name data table 92.

  Subsequently, the CPU 41 executes a determination process for determining whether or not the next “division unit” is stored in the first character information data table 99. When it is determined that the next “division unit” is stored in the first character information data table 99, the CPU 41 stores the 50 sounds stored in the next “division unit” in the first character information data table 99. Hiragana characters belonging to the combination of lines are read out, and the loop after S113 is executed again. On the other hand, if it is determined that the next “division unit” is not stored in the first character information data table 99, the CPU 41 ends the loop and proceeds to the processing of S116.

  For example, as shown in FIG. 13, when the search word set in the first search order in S112 is “Ai” and the search word set in the second search order is “ko”, the CPU 41 “A line”, “A line and A line”,... “A line and A line” ... “A done” The processing of S114 is executed for each “division unit” in which “row” is stored.

  Then, the CPU 41 stores all search words “ai” and “ko” in the “keyword first character information” in the first character “a” and “ko” to which “50” sounds belong. Search for candidate facility names in the facility name data table 92 for the “division unit” in which the combination of “50 lines” with all the values being “1” or more is stored. It is stored in the RAM 42 as a “division unit”.

  As described above in detail, in the navigation device 98 according to the sixth embodiment, the CPU 41 belongs to the hiragana whose search order is the same as the first search word among the “division units” of the first character information data table 99. A “division unit” in which a combination of 50 sound lines is stored is extracted. Then, the CPU 41 sets the count values stored in the sections to which the first characters of all the search words of the “keyword first character information” of each “division unit” belong to the extracted “division units”. Only those that are equal to or greater than the count value for each of the first 50 characters of the search word are stored in the RAM 42 as a corresponding “division unit” for searching for a candidate facility name in the facility name data table 92.

  Subsequently, the CPU 41 sequentially reads out the corresponding “division units” for searching for candidate facility names in the facility name data table 92, and sequentially reads “reading” of all the facility names in the corresponding “division unit” in the facility name data table 92. Read to each. Then, the CPU 41 performs a full-text search of each search word for “read” of all the facility names that have been read, and if there is a keyword that matches the search word in the keywords that constitute the reading of the facility name that has been read. The “facility name” corresponding to the reading of the facility name is read from the facility name data table 51 and stored in the RAM 42 as a candidate facility name that is a destination candidate.

  As a result, even if a plurality of search terms with a small number of characters (for example, one or two characters) are input, the CPU 41 performs a 50-sound line to which a hiragana whose search order matches the first search term belongs. Of the “division units” in which the combinations are stored, only the “division unit” in which the name of the facility having the first character of each keyword as the first character of each keyword is extracted from the first character information data table 99. It becomes possible.

  Therefore, the CPU 41 extracts from the first character information data table 99 only the “division unit” in which the facility name having the first character of all search words as the first character of each keyword is stored, and the corresponding “ Since “reading” of all facility names in the “division unit” is sequentially read out and full text search is performed for all search terms, it is possible to reduce the number of facility names to be searched, and to search at high speed and respond It is possible to prevent a decrease in property.

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

  (A) For example, in the first character information data table 86 according to the third embodiment or the first character information data table 99 according to the sixth embodiment, the “first character information of the keyword” corresponding to each “division unit” has the same “ For each reading of each facility name stored in “reading” corresponding to “divided unit”, the first character of each keyword is counted for each of the 50 sounds, and the division of 50 sounds whose count value is “1” or more is “ “1” may be substituted and stored, and “0” may be substituted and stored in the division of the 50 sounds whose count value is “0”.

  In S114, the CPU 41 reads all the search words from the RAM 42 and classifies them into the 50 sound categories to which the first characters of all the search words of the “keyword first character information” corresponding to the “division unit” specified in S113 belong. You may make it perform the determination process which determines whether all the values memorize | stored are "1".

  (B) Further, for example, the data in the “reading” column of each head character information data table 52, 82, 86, 93, 96, 99 may not be stored. Thereby, the data capacity of each of the head character information data tables 52, 82, 86, 93, 96, 99 can be reduced.

  (C) Further, for example, the “division unit” of each facility name data table 51, 92 and each head character information data table 52, 82, 86, 93, 96, 99 includes not only hiragana but also katakana and alphabets. , Numbers, and predetermined symbols (for example, arithmetic symbols and arrows) may be stored.

  For example, alphabetical characters are stored in alphabetical order one to five characters in each division name of each facility name data table 51, 92 and each head character information data table 52, 82, 86, 93, 96, 99. May be. The facility names of the facility name data tables 51 and 92 may be stored with alphabetical facility names, and “reading” may be stored with the facility names divided into keywords.

  Further, the “first character information of keyword” of each of the first character information data tables 52, 82, 86, 93, 96, 99 may be divided so that the alphabet belongs to one or more characters in alphabetical order. Further, the “reading” corresponding to each “division unit” of each head character information data table 52, 82, 86, 93, 96, 99 is included in each “division unit” of each facility name data table 51, 92. You may make it memorize | store the facility name divided into the keyword memorize | stored in "reading."

1, 81, 85, 91, 95, 98 Navigation device 14 Operation unit 15 Liquid crystal display 18 Touch panel 25 Map information DB
27 Facility name DB
41 CPU
42 RAM
43 ROM
51, 92 Facility name data table 52, 82, 86, 93, 96, 99 First character information data table 61 Search word input screen 62 50 sound key 71 Search result display screen 72 Search result display field

Claims (5)

A facility name storage means for dividing a plurality of facility names to be searched into a plurality of keywords, respectively, and storing each facility name in association with a predetermined number of character strings that are forward-matched with each keyword;
For each facility name associated with the predetermined number of divided character strings, a division character belonging to each division is divided into a plurality of divisions to which a predetermined number of division characters each composed of a different character and given a predetermined order belong. Keyword initial character information storage means for storing count information for each category in which the first character of each keyword that matches is stored in association with the divided character string of the predetermined number of characters;
An input means for entering a search term;
In the keyword first character information storage means, a division for obtaining the divided character string corresponding to each search word based on the count information corresponding to the section to which the first character of each search word belongs inputted through the input means A string acquisition means;
In the facility name storage means, each search word input by the input means from the facility name stored in association with the divided character string acquired via the divided character string acquisition means and the number of characters of each search word Search means for acquiring, as a candidate facility name, a facility name having a keyword that matches forward in the search order set in the input order when the number of characters is the same or the number of characters ,
The facility search device characterized by comprising. For each facility name associated with the predetermined number of divided character strings, the count information for each category is a maximum count obtained by counting the first character of each keyword that matches the category character belonging to each category for each of the plurality of categories. Value,
The divided character string acquisition means is configured such that all of the maximum count values of the sections to which the first character of each search word that is input via the input means belongs are the first character for each section to which the first character of each search word belongs. The facility search device according to claim 1, wherein the divided character string associated with the count information that is equal to or greater than the count value is acquired. The count information for each category is a count value obtained by counting the first character of each keyword that matches the category character belonging to each category for each of the plurality of categories for each facility name associated with the predetermined number of divided character strings. Is presence / absence information indicating whether or not
The divided character string acquisition means includes the divided character string associated with count information indicating that all the presence / absence information for each section to which the first character of each search word input through the input means belongs has a count value. The facility search device according to claim 1, wherein:   The facility search apparatus according to any one of claims 1 to 3, wherein the segmented character is a 50-sound kana, and the segment is segmented by a line of 50-sound. A facility name storage means for dividing a plurality of facility names to be searched into a plurality of keywords, respectively, and storing each facility name in association with a predetermined number of character strings that are forward-matched with each keyword;
For each facility name associated with the predetermined number of divided character strings, the division characters belonging to each division are divided into a plurality of divisions to which a predetermined number of division characters each composed of a different character and given a predetermined order belong. Keyword initial character information storage means for storing count information for each category in which the first character of each keyword that matches is stored in association with the divided character string of the predetermined number of characters;
On a computer with
An input process for entering a search term;
In the keyword first character information storage means, a divided character string that acquires the divided character string corresponding to each search word based on count information corresponding to a section to which the first character of each search word input in the input step belongs Acquisition process;
In the facility name storage means, each search word input in the input step from the facility name stored in association with the divided character string acquired in the divided character string acquisition step, and the number of characters of each search word in descending order. Or, if the number of characters is the same, a search step of acquiring a facility name having a keyword that matches forward in the search order set in the input order as a candidate facility name;
A program for running

Images