JP5359789B2 - Point search device and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a point search device which can inhibit increase of memory capacity to extend a name list, and also can prevent deterioration of responsiveness by performing search at high speed. <P>SOLUTION: A facility name data table which includes "split unit", "facility name" and "reading" which stores reading of the facility name is stored in a facility name DB 27. In the "split unit", a split character string consisting of one character of hiragana syllabary or a specific split character in which one character of the hiragana syllabary is added to a very long word is stored. In the "reading", the reading of a facility name containing the keyword which performs forward matching with the split character string or the specific split character string of the "split unit" is stored. In the "facility name", the facility name used as a search object is stored corresponding to the reading of the facility name. Then CPU 41 performs full text search by reading in order the "reading" of all facility names in the "split unit" wherein the split character string or the specific split character string which performs forward matching with a search word are stored. <P>COPYRIGHT: (C)2011,JPO&amp;INPIT

Description

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

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

JP-A-9-97266

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

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

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

In order to achieve the object, the point search apparatus according to claim 1 reads a plurality of facility names representing a destination to be searched and a reading of the facility name for each keyword constituting a reading of each facility name. Is stored in association with a predetermined number of character strings that match the keyword in advance, and if the keyword matches the predetermined word, the facility name is stored for the predetermined word. The facility name storage means for storing in association with a specific divided character string added with a predetermined number of character strings that match the other characters in front of other keywords, input means for inputting a search word, and input by the input means a predetermined word determining means for determining whether or not the search terms readings contains predetermined words, input by said input means through said predetermined word determination means When it is determined that the predetermined word is included in the reading of the search word, a keyword determination unit that determines whether or not another keyword is included in the reading of the search word; and the predetermined word determination unit when it is determined that the predetermined word is not included in the reading of the search terms entered by the input means through a determines from the front of the reading of the search term the predetermined number as the divided character string The candidate facility name is searched from all the facility names stored in association with the determined divided character string , while the other words are read in the search word input by the input unit via the keyword determination unit. If it is determined that a keyword is included, a predetermined divided character string is determined by adding a predetermined number of character strings that are forward-matched to the other keyword to the predetermined word. Characterized by comprising a search unit for the entire facility name boss was in connection with a particular division string stored search for candidate facility name, a.

Further, the point search device according to claim 2 is the point search device according to claim 1 , wherein the search unit reads the search word input by the input unit via the keyword determination unit. When it is determined that no keyword is included, all facility names stored in association with all the specific divided character strings including the predetermined word are acquired as candidate facility names.

The point search device according to claim 3 is the point search device according to claim 1 or 2 , wherein the predetermined number of divided character strings includes a plurality of combinations corresponding to a predetermined number of lines of 50 sound lines. The predetermined divided character string is formed by adding a plurality of predetermined character strings corresponding to combinations of a predetermined number of lines of 50 sound to the predetermined word. The facility name storage means reads the plurality of facility names and the facility names, and if the keyword does not match a predetermined word, the facility name storage means includes 50 sounds to which a divided character string of a predetermined number of characters that matches the keyword in front belongs. In association with a combination of a predetermined number of lines and when the keyword matches a predetermined word, it is forwarded with another keyword reading the facility name with respect to the predetermined word. Wherein the combination of a predetermined number of lines of rows match a predetermined number of divided character string belongs syllabary is stored in association with the appended specified division string.

Furthermore, the program according to claim 4 reads a plurality of facility names representing destinations to be searched and the facility names for each keyword constituting each facility name reading, and the keywords do not match a predetermined word. In this case, the keyword is stored in association with a predetermined number of divided character strings that are forward-matched with the keyword, and when the keyword matches a predetermined word, another keyword for reading the facility name with respect to the predetermined word. An input step of inputting a search word to a computer having facility name storage means for storing in association with a specific divided character string to which a predetermined number of divided character strings prefixed with the character string are added, and the search word input in the input step read the the predetermined word predetermined word determines whether include determining step, said predetermined word determining search terms entered by the input process in the step of Only when it is determined that the predetermined word is included, the keyword determination step for determining whether or not another keyword is included in the reading of the search word, and the input in the predetermined word determination step when the predetermined word is found not included in the search terms read input in step determines a predetermined number of characters as the divided character string from the front of the reading of the search term, and this decision A candidate facility name is searched from all the facility names stored in association with the divided character string , and when the other keyword is included in the reading of the search term input in the input step in the keyword determination step If it is determined, the said predetermined said to other keywords and beginning with a constant word by adding a divided character string having a predetermined number of particular divided character string determined, specific division string this decision A search step of searching a candidate facility name from all hosts name stored in association with a program for execution.

  In the point search device according to claim 1 having the above-described configuration, since only one facility name indicating the destination associated with each divided character string or each specific divided character string and only one reading of the facility name is stored. It is possible to reduce the capacity of the name list by reducing the number of facility names that are stored in duplicate and the reading of the name of the facility, thereby reducing the data capacity of the name list, and suppressing the increase in the memory capacity for expanding the name list.

  A facility name including a predetermined word is stored in association with a specific divided character string obtained by adding a predetermined number of divided character strings that are forward-matched to other keywords of the facility name to the predetermined word. As a result, since the facility name including the predetermined word is further subdivided and stored in correspondence with the specific divided character string, it is possible to further increase the memory capacity for expanding the name list while reducing the data capacity of the name list. Deterrence.

When it is determined not to contain a predetermined word read in the search word is determined from the front of the reading of the search term a predetermined number as a divided character string associated with the determined division string Candidate facility names are searched from all the facility names stored. As a result, it is possible to quickly determine the divided character string, reduce the name of the facility to be searched, perform the search at high speed, and prevent a decrease in responsiveness.

Also, if it contains a predetermined word with other keyword reading of search words, determine the particular division string by adding the divided character string having a predetermined number of characters to other keywords and forward matches the predetermined word Then, candidate facility names are searched from all the facility names stored in association with the determined specific divided character string. As a result, the specific divided character string can be quickly determined, the number of facility names to be searched can be reduced, the search can be performed at high speed, and the decrease in responsiveness can be prevented.

Further, in the point search device according to claim 2, when only a predetermined word is included in the reading of the search word, all facility names stored in association with all the specific divided character strings including the predetermined word Is acquired as a candidate facility name, it is possible to search at a higher speed and prevent a decrease in responsiveness.

In the point search device according to claim 3 , for each keyword constituting the facility name reading, when the keyword does not match a predetermined word, the facility name and the facility name reading are forward-matched with the keyword. And stored in association with a line of 50 sounds to which a predetermined number of divided character strings belong. In addition, when the keyword matches a predetermined word, a combination of a predetermined number of lines of 50 sound lines to which a predetermined character number of divided character strings that match the other words of the facility name in front of the predetermined word belongs. Is stored in association with the specific divided character string to which is added. As a result, the facility name stored in association with each other and the number of reading data of the facility name can be reduced, and the memory capacity for expanding the name list is further suppressed while reducing the data capacity of the name list. It becomes possible to do.

Furthermore, in the program according to claim 4 , when the computer reads the program and it is determined that the predetermined word is not included in the reading of the search word, the predetermined number of characters is read from the front of the reading of the search word. divided character determined as a column, to find a candidate facility name from all hosts name stored in association with the determined division string. Accordingly, the computer can quickly determine the divided character string, reduce the number of facility names to be searched, perform a search at high speed, and prevent a decrease in responsiveness. . In addition, when a predetermined word and another keyword are included in the reading of the search word, the computer adds a predetermined character string of a predetermined number of characters that matches the other keyword to the predetermined word and adds the specific divided character string. The candidate facility names are searched from all the facility names stored in association with the determined specific character string. As a result, the computer can quickly determine the specific divided character string, reduce the number of facility names to be searched, perform the search at high speed, and prevent a decrease in responsiveness. Become.

It is the block diagram which showed the navigation apparatus which concerns on a present Example. It is a figure which shows an example of the facility name data table stored in facility name DB. It is a flowchart which shows "point information display processing" which searches for point information based on the input search term, and displays it as a list. It is a figure which shows an example of the search word input screen which inputs a search word. It is a figure which shows an example of the search result display screen which displayed the search result of FIG. 4 as a list. It is a figure which shows an example of the search word input screen which inputs a search word. It is a figure which shows an example of the search result display screen which displayed the search result of FIG. 6 as a list. It is a figure which shows an example of the search word input screen which inputs a search word. It is a figure which shows an example of the search result display screen which displayed the search result of FIG. 8 as a list. It is a figure which shows an example of the search word input screen which inputs a search word. It is a figure which shows an example of the search result display screen which displayed the search result of FIG. 8 as a list. It is a figure which shows an example of the facility name data table stored in facility name DB which concerns on another Example. It is a flowchart which shows "point information display processing 2" which searches for point information based on the input search term based on another Example, and displays it as a list.

  Hereinafter, a point search device, a point search method, and a program according to the present invention will be described in detail with reference to the drawings based on an embodiment in which a navigation device is embodied.

  Hereinafter, a point search device and a program according to the present invention will be described in detail with reference to the drawings based on an embodiment in which a navigation device is embodied.

[Schematic configuration of navigation device]
First, a schematic configuration of the navigation device according to the present embodiment will be described with reference to FIG. FIG. 1 is a block diagram showing a navigation device 1 according to the present embodiment.
As shown in FIG. 1, the navigation apparatus 1 according to the present embodiment records a current position detection processing unit 11 that detects a current position of the own vehicle (hereinafter referred to as “own vehicle position”) and the like, and various data. The data recording unit 12, the navigation control unit 13 for performing various arithmetic processes based on the input information, the operation unit 14 for receiving operations from the operator, and displaying information such as a map to the operator A liquid crystal display 15, a speaker 16 for outputting voice guidance regarding route guidance, etc., and a communication device 17 for communicating with a road traffic information center, a map information distribution center, etc. (not shown) via a mobile phone network, etc. The touch panel 18 is mounted on the surface of the liquid crystal display 15. The navigation control unit 13 is connected to a vehicle speed sensor 21 that detects the traveling speed of the vehicle.

  Hereinafter, each component constituting the navigation device 1 will be described. The current position detection processing unit 11 includes a GPS 31, a direction sensor 32, a distance sensor 33, and the like. It is possible to detect a travel distance and the like.

  The data recording unit 12 includes an external storage device and a hard disk (not shown) as a recording medium, a map information database (map information DB) 25, a facility name database (facility name DB) 27 stored in the hard disk, and a predetermined number. And a recording head (not shown) which is a driver for reading predetermined programs and writing predetermined data to the hard disk.

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

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

  The facility name DB 27 stores a facility name data table 51 (see FIG. 2) described later. As will be described later, the facility name data table 51 stores the facility name and the reading of the facility name in association with a divided character string of a predetermined number of characters (one character in this embodiment) for each division unit. ing. In addition, as will be described later, the facility name data table 51 reads the facility name and the facility name as a character string such as a long word (for example, “Shiyakusho”, “Jimusho”, “Senta”). And a predetermined number of characters (one character in the present embodiment) is added to the specific divided character string and stored for each division unit. Here, the “long-sized ward” is, for example, each of the keywords “city hall”, “office”, “center”, etc. included in the facility names of 1000 or more and 10,000 or more “Shiyakusho”, “jimu” It is a character string such as "Sho" or "Senta".

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

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

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

  Further, the liquid crystal display 15 includes map information currently traveling, a search word input screen 61 (see FIG. 4 and the like), which will be described later, a search result display screen 71 (see FIG. 5 and the like) that displays a list of the names of the searched facilities, Operation guidance, operation menu, key guidance, recommended route from the current location to the destination, guidance information along the recommended route, traffic information, news, weather forecast, time, mail, TV program, etc. are displayed.

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

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

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

Here, the facility name data table 51 stored in the facility name DB 27 will be described with reference to FIG.
As illustrated in FIG. 2, the facility name data table 51 includes “division units”, “reading” that stores the reading of the facility name, and “facility name”.

  In this “divided unit”, a divided character string composed of one hiragana character that matches the keyword that constitutes the reading of the facility name is stored one by one in the order of 50 sounds. In addition, the “division unit” is a specific division that is configured by adding a one-character hiragana character that matches the other words that are not the long word among the keywords constituting the facility name reading to the long word. Character strings are stored in the order of 50 tones. Here, the keyword is a character string of reading composed of units that make sense.

  The “divided unit” includes divided character strings such as “Ah”, “Ai”, “Ah”, etc., “Ah”, “Ah”, “Ah”, etc. You may make it memorize | store two characters or more at a time in 50 sound order. In addition, only a part of the “division unit” is divided into character strings, for example, “O”, “ka”, “ka”,… “kan”, “ki”, “ku” .., etc. You may make it memorize | store two characters or more at a time in 50 sound order.

  In addition, in the “dividing unit”, as a specific dividing character string, for example, “Shiakusho Ah”, “Shikusho Aoi”, “Shikusho Aoi”, ..., “Shiakusho Aoh”, “Shiakusho Aoi” ”,“ Shiakushooh ”, etc., etc., a hiragana with two or more characters may be added to a long word and stored in the order of 50 tones. In addition, only a part of the “division unit” is specified as a specific division character string, for example, “Shiakushou”, “Shiyakusuka”, “Shiyakusuka”,… “Shiyakusokukan” ”,“ Yakushokuki ”,“ Shiyakushoku ”,..., Etc., two or more hiragana characters may be added to the long word and stored in the order of the Japanese syllabary.

  Further, “reading” stores a reading of a facility name including a keyword that matches the hiragana stored in each “division unit”. That is, in the “reading”, when a divided character string composed of one character hiragana is stored in the “division unit”, the reading of the facility name including the keyword that matches the divided character string is stored. Yes. In addition, in the “reading”, when a specific divided character string in which one character hiragana is added to a long word is stored in “division unit”, the keyword of the long word, the added hiragana and the front Readings of facility names including other keywords that match are stored.

  In addition, the reading of the facility name is stored by being separated by a delimiter (for example, “/”) for each keyword. For example, when the facility name is “Tokyo / Nezumi / Shi”, “Tokyo”, “Nezumi”, and “Shi” are stored in “Yomi” as keywords for the facility name. Accordingly, the reading of the facility name “Tokyo / Nezumi / Shi” is “read” corresponding to each of the divided character strings “shi”, “to”, “ne” of the “division unit” of the facility name data table 51. Is stored in each.

  Note that the reading of the facility name including the keyword of the long word is not stored in the “reading” corresponding to the “division unit” in which the divided character string consisting of one hiragana character that matches the long word in front is stored. For example, reading of the character string “Nagoya / Shiyakusho / Kankyo” corresponds to “ka”, “na”, “shiyakushoka”, “shiyakushona” of “division unit” in the facility name data table 51. It is memorized in “reading”. Therefore, the reading of the character string “Nagoya / Shikuku / Kankyo” is not stored in the “reading” corresponding to “shi” of “division unit” in the facility name data table 51.

  Further, in “facility name”, a facility name representing a destination to be searched is stored corresponding to the reading of the facility name stored in “reading”. For example, the facility name “Tokyo Nesme See” is stored corresponding to the reading of the facility name “Tokyo / Nezumi / Shi”. Therefore, the facility name “Tokyo Nesmy Sea” is changed to “Tokyo / Nezumi / Shi” of “Hi” and “To” in “Division unit” of the facility name data table 51 and “Reading” in “Ne”. The corresponding “facility name” is stored respectively.

  Further, for example, the facility name “Nagoya City Hall Environment Section” is stored in correspondence with the reading of the facility name “Nagoya / Shiyakusho / Kankyoka”. Therefore, the facility name “Nagoya City Hall Environment Section” is the “facility name” corresponding to “ka”, “na”, “shiyakusuka”, “shiyakushona” of “division unit” in the facility name data table 51. Each is remembered.

  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.

  Also, the “reading” corresponding to the “division unit” in which the divided character string consisting of one hiragana character that matches the long word first is not stored as the facility name including the long word keyword. As a result, it is possible to reduce the number of facility names and the number of readings of the facility name stored corresponding to the “division unit” in which a divided character string consisting of a single hiragana character that matches the long word in front is stored. It becomes. That is, the total data capacity of “reading” and “facility name” for each “division unit” can be set to a predetermined data capacity or less (for example, 1 megabyte to 10 megabyte or less).

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

  FIG. 3 is a flowchart showing a “spot information display process” which is a process executed by the CPU 41 and searches the spot information based on the input search word and displays the list. The program shown in the flowchart in FIG. 3 is executed by the CPU 41 when a destination setting button (not shown) of the operation unit 14 is pressed.

As shown in FIG. 3, first, in step (hereinafter abbreviated as S) 11, the CPU 41 searches the screen of the liquid crystal display 15 for a destination address, a name related to a facility, etc. as point information. A search word input screen 61 for inputting is displayed.
Here, an example of the search word input screen 61 will be described with reference to FIG. As shown in FIG. 4, the search word input screen 61 displays a 50 sound key 62, an input character display unit 63, a correction button 65, a return button 66, and a completion button 68.

  In the input character display portion 63, the input character input by the 50 sound key 62 is displayed. Further, every time the correction button 65 is pressed, the last input characters of the character string displayed on the input character display unit 63 can be deleted one by one. Further, by pressing the return button 66, it is possible to return to the state before the last operation. Further, by pressing the completion button 68, it is possible to instruct to search for a name related to the facility as the point information and display the list using the character string displayed on the input character display unit 63 as a search word. .

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

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

  On the other hand, when the completion button 68 is pressed (S13: YES), the CPU 41 stores the character string displayed on the input character display unit 63 as a search word in the RAM 42, and then proceeds to S14. In S14, the CPU 41 reads the search word from the RAM 42, and determines whether or not the number of characters of the search word, that is, the number of input characters is greater than the number of characters in the divided character string stored in the “division unit”, that is, whether or not A determination process for determining whether there are two or more characters is executed.

  If it is determined that the number of characters of the search word is equal to or less than the number of characters of the divided character string stored in the “division unit”, that is, one character (S14: NO), the CPU 41 proceeds to the processing of S15. . In S15, the CPU 41 reads from the facility name data table 51 all the facility names of “facility names” in the “division unit” in which the divided character string that matches the search word in the forward direction is stored, and names of candidate facilities that are destination candidates. After storing in the RAM 42, the process proceeds to S19.

  On the other hand, when it is determined that the number of characters of the search word is larger than the number of characters of the divided character string stored in the “division unit”, that is, two or more characters (S14: YES), the CPU 41 performs the process of S16. Migrate to In S <b> 16, the CPU 41 determines whether or not the search word includes a long word (for example, a character string such as “shiyakusho”, “jimushi”, “senta”). Execute.

  If it is determined that the search word does not include a long word (S16: NO), the CPU 41 proceeds to the process of S17. In S <b> 17, the CPU 41 stores the “reading” of all the facility names in the “division unit” in which the divided character string that matches the search word in advance, that is, the one character hiragana that matches the search word in advance, is stored in the facility name data table. Read sequentially from 51. Then, the CPU 41 executes a determination process for determining whether or not there is a keyword that matches the search word in the keywords that constitute the reading of each read facility name, that is, all the facility names that have been read. Perform a full-text search for "reading".

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

  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 in order as a candidate facility name which is a destination candidate, and the process proceeds to S19.

  On the other hand, if it is determined that the search word includes a long word (S16: YES), the CPU 41 proceeds to the process of S18. In S18, the CPU 41 reads the search word from the RAM 42, and the number of characters of the search word, that is, the number of input characters is specified by adding one character hiragana to the long word included in the search word stored in the “division unit”. A determination process for determining whether or not there are more characters than the number of divided character strings is executed.

  For example, when the search word includes the long word “Shiyakusho”, the CPU 41 adds the number of characters “1 character” to the character number “5 characters” of the long word “Shiyakusho”. A determination process for determining whether or not the number of characters is greater than “6 characters” is executed.

  When it is determined that the number of characters of the search word is larger than the number of characters of the specific divided character string obtained by adding one character hiragana to the long word included in the search word stored in the “division unit” (S18: YES), the CPU 41 proceeds to the process of S17. In S <b> 17, the CPU 41 sequentially reads “reading” of all the facility names in the “division unit” in which the specific divided character string that matches the search word in front is stored in order from the facility name data table 51. Then, the CPU 41 determines whether there is a keyword that matches the remaining character string excluding the long word from the search word among the keywords different from the long word character string that constitutes the reading of each read facility name. A determination process is performed to determine whether or not, that is, a full-text search is performed on the remaining character strings excluding the “read” long words of all the facility names that have been read.

  When the keyword that differs from the character string of the long word constituting the reading of the read facility name is a keyword that matches the remaining character string excluding the long word from the search word, the CPU 41 forwards the keyword. Then, 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 in order as a candidate facility name that is a destination candidate, and the process proceeds to S19.

  On the other hand, when it is determined that the number of characters of the search word, that is, the number of input characters is equal to or less than the number of characters of the specific divided character string obtained by adding one character hiragana to the long word included in the search word stored in the “division unit” (S18: NO), the CPU 41 proceeds to the process of S15. In S15, when the number of characters of the search word is the number of characters obtained by adding one character to the number of long words included in the search word, the CPU 41 stores the “division unit” in which a specific divided character string that matches the search word is stored. All the facility names of “facility names” are read from the facility name data table 51 and stored in the RAM 42 as candidate facility names that are destination candidates, and the process proceeds to S19.

  In S15, when the number of characters of the search word is the number of long words included in the search word, the CPU 41 stores each of the 50 “divided units” in which the specific divided character string that matches the search word is stored. All the facility names of “facility names” are read from the facility name data table 51 and stored in the RAM 42 as candidate facility names that are destination candidates, and the process proceeds to S19.

  Subsequently, in S19, the CPU 41 reads out candidate facility names from the RAM 42 and displays them as a list, displays the number of candidate facility names, and ends the processing. The liquid crystal display 15 displays a predetermined number of items, such as five at a time, in the order of the list (see FIG. 5). When the display priority is assigned to each facility name, the CPU 41 displays the list of candidate facility names as a list sorted in descending order of display priority.

Here, as shown in FIG. 4, an example of a result list display when “Tokyo Nezumi” is entered as a search word on the search word input screen 61 and the completion button 68 is pressed is based on FIG. 5. explain.
First, as shown in FIG. 4, the CPU 41 stores “Tokyo Nezumi” as a search term in the RAM 42 in S13.

  Thereafter, the CPU 41 determines in S14 that the number of characters of the search word “Tokyo Nezumi” is larger than the number of characters “1 character” in the divided character string (S14: YES). Then, the CPU 41 determines in S16 that the search word “Tokyo Nezumi” does not include a long word such as “Shiakusho” or “Jimushi”, and the process proceeds to S17.

  The CPU 41 sequentially reads, from the facility name data table 51, “reading” of all the facility names in the “division unit” in which the divided character string “to” that matches the search word “Tokyo Nezumi” in S17 is stored. Then, a full-text search is performed to determine whether a keyword that matches the search word “Tokyo Nezumi” is included.

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

  Subsequently, as shown in FIG. 5, the CPU 41 displays a search result display screen 71 on the liquid crystal display 15, and names of two candidate facilities “Tokyo Nesme See” and “Tokyo Nesme Land” in the two search result display columns 72. (Point information) is displayed. Here, when the user presses and selects the spot information in the search result display field 72, the CPU 41 sets the facility as a destination, performs a route search, and displays a recommended route on the map. In addition, facility information about the facility (for example, business hours, fees, etc.) is displayed.

  In addition, a number display section 73 is provided in the upper part of the search result display screen 71, and the number of searched search targets “2” is displayed. Further, on the left side of each search result display column 72, the names of the facilities in the search result display column 72 are scrolled down one by one, the previous button 74 and the next button 75 for scrolling up, and the facility in the search result display column 72 Each page button 76, 77 for scrolling down and scrolling up the name of each is displayed.

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

  Thereafter, the CPU 41 determines in S14 that the number of characters of the search word “to” is equal to or less than the number of characters “1 character” in the divided character string, and proceeds to the processing of S15. The CPU 41 reads from the facility name data table 51 the names of all facilities in the “division unit” in which the divided character string “to” that matches the search term “to” in S15 is stored, and the candidate facilities that are destination candidates The name is stored in the RAM 42.

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

Next, as shown in FIG. 8, an example of a result list display in the case where “Search” is input as a search word on the search word input screen 61 and the completion button 68 is pressed is based on FIG. 9. I will explain.
First, as shown in FIG. 8, the CPU 41 stores in the RAM 42 “Syakushakukan?” As a search term in S13.

  Thereafter, the CPU 41 determines in S14 that the number of characters of the search term “Shikakukan Kyoka” is greater than the number of characters “1 character” in the divided character string (S14: YES). Then, the CPU 41 determines in S16 that the search word “Yoshikakukan Kyoka” contains the long word “Shiyakushoku”, and the process proceeds to S18.

In S18, the CPU 41 determines that the number of characters of the search word “Shiyakushokankyo” is greater than the number of characters “6 characters” obtained by adding “1 character” to the number of characters “5 characters” of the long word “Shiyakusho”. Then, the process proceeds to S17. In the facility name data table 51, the CPU 41 reads “reading” of all facility names in the “division unit” in which the specific divided character string “shiyakushoka” that matches the search word “shiyakushokankyo” in S17 is stored. Read in order.
Then, the CPU 41 adds the long word “Shiakusho” from the search word “Shiyakushokan” to the keyword different from the character string of the long word “Shiyakusho” that constitutes the reading of each read facility name. A full-text search is performed to determine whether a keyword that matches the remaining character string “Kankyo” is included.

  Subsequently, as shown in FIG. 9, the CPU 41 displays a search result display screen 71 on the liquid crystal display 15, and “Okazaki City Hall Environment Section”, “Nagoya City Hall Environment Section”, “Naha” are displayed in the five search result display fields 72. “City Hall Environment Section”, “Numazu City Hall Environment Section”, “Fukuoka City Hall Environment Section” and the top five candidate facility names (point information) are displayed. The number display section 73 displays the number of candidate facility names “48”.

Next, as shown in FIG. 10, an example of a result list display in a case where “search” is input as a search word on the search word input screen 61 and the completion button 68 is pressed will be described based on FIG. 11. To do.
First, as shown in FIG. 10, the CPU 41 stores “Yakusoku” as a search term in the RAM 42 in S <b> 13.

  Thereafter, the CPU 41 determines in S14 that the number of characters of the search term “Shiyakusho” is larger than the number of characters “1 character” in the divided character string (S14: YES). Then, the CPU 41 determines in S16 that the search word “shiyakusho” includes the long word “shiyakusho”, and proceeds to the processing of S18. In S18, the CPU 41 determines that the number of characters of the search word “Shiyakusho” is equal to or less than “6 characters” obtained by adding “1 character” to the number of characters “5 characters” of the long word “Shiyakusho”. The process proceeds to S15.

  The CPU 41 stores the specific divided character strings “Shiakusho”, “Shiakusho”, “Shiakusho”,... The names of all facilities in the “division unit” are read from the facility name data table 51 and stored in the RAM 42 as candidate facility names that are destination candidates.

  Subsequently, as shown in FIG. 11, the CPU 41 displays a search result display screen 71 on the liquid crystal display 15, and “Okazaki City Hall Environment Section”, “Nagoya City Hall Environment Section”, “Naha” are displayed in the five search result display fields 72. “City Hall Environment Section”, “Numazu City Hall Environment Section”, “Fukuoka City Hall Environment Section” and the top five candidate facility names (point information) are displayed. The number display section 73 displays the number of candidate facility names “10,000 or more”.

  As described in detail above, in the navigation device 1 according to the present embodiment, there is a duplication of the facility name stored in the “facility name” between the “division units” of the facility name data table 51, but each “division unit”. Inside, there is no duplication of the facility name stored in “facility name”, and only one facility name is stored. Accordingly, there is an overlap in the reading of the facility name stored in the “reading” among the “division units” in the facility name data table 51, but in each “division unit”, the facility name stored in the “reading” is stored. There is no duplication of readings, and only readings of one facility name are stored.

  Thus, in each “division unit” of the facility name data table 51, only one facility name reading indicating the destination is stored, and only one facility name corresponding to the facility name reading is stored. Therefore, it is possible to reduce the capacity of the facility name data table 51 by reducing the number of facility names that are stored in duplicate and the reading of the facility names. Further, the total data capacity of “reading” and “facility name” for each “division unit” in the facility name data table 51 is set to a predetermined data capacity or less (for example, 1 to 50 megabytes or less). Thus, it is possible to suppress an increase in the memory capacity of the RAM 42 that develops the facility name in the facility name data table 51 corresponding to the search term and the reading of the facility name.

  In addition, the facility name data table 51 includes a facility name including a long word and a reading of the facility name with a one-character split character string that matches the other words of the facility name in front of the long word. It stores the “facility name” corresponding to the “division unit” in which the specific divided character string is stored and “reading” of the facility name. In the facility name data table 51, the “reading” corresponding to the “division unit” in which a divided character string consisting of a single hiragana character that coincides with the long word is stored in the facility name including the long word keyword. Don't remember readings.

  Thus, the facility name including the long word and the reading of the facility name are further subdivided and stored in correspondence with the specific divided character string, so that the facility name in the “division unit” in which the specific divided character string is stored and the The number of readings of facility names can be reduced, and the total data capacity of “reading” and “facility name” for each “division unit” is less than a predetermined data capacity (for example, 1 megabyte to 10 megabytes or less). .) Can be set. Accordingly, while reducing the data capacity of the facility name data table 51, it is possible to more effectively increase the memory capacity of the RAM 42 that develops the facility name of the facility name data table 51 corresponding to the search term and the reading of the facility name. It becomes possible to deter.

  Further, the CPU 41 does not include the long word in the reading of the search word, and when the number of characters of the search word is larger than the number of characters “1 character” of the divided character string that matches the search word, "Reading" of all the facility names in the "division unit" in which the divided character string that matches the search word in front is stored in order from the facility name data table 51, and the keyword that matches the search word in front is read. Search the facility name in full text. This makes it possible to reduce the number of facility names to be searched only to all facility names in the “division unit” in which the divided character string that matches the search word in front is stored. It is possible to prevent a decrease in responsiveness.

  In addition, when the search word does not include a long word and the number of characters of the search word is “1 character” in the divided character string that matches the search word, the CPU 41 reads the search word. Are read from the facility name data table 51 as candidate facility names, and are stored in the RAM 42 as candidate facility names. Then, the CPU 41 displays a list of a predetermined number of candidate facility names, such as five at a time, in the order of the list, and displays the number of candidate facility names. This makes it possible to search for candidate facility names at a higher speed and prevent a decrease in responsiveness, and whether the user further increases the number of search term characters or selects candidate facility names displayed in a list. Can be determined.

  In addition, the CPU 41 adds a one-character hiragana to the long word included in the search word that contains the long word in the reading of the search word and the number of characters of the search word stored in the “division unit”. When there are more characters than the number of characters in the specific divided character string, “reading” of all the facility names in the “division unit” in which the specific divided character string that matches the search word is read from the facility name data table 51 in order. . Then, the CPU 41 performs a full-text search for the reading of each facility name thus read, using the remaining character string obtained by removing a long word from the search word as a search word.

  This allows the number of facility names to be searched to be limited to all facility names within the “division unit” in which a specific divided character string that matches the search word in advance is stored. It is possible to perform at a high speed and prevent a decrease in responsiveness.

  In addition, the CPU 41 adds a one-character hiragana to the long word included in the search word that contains the long word in the reading of the search word and the number of characters of the search word stored in the “division unit”. If the number of characters of the specific divided character string is less than or equal to the number of characters, the facility name data table 51 uses all facility names of “facility names” in the “division unit” in which the specific divided character string that matches the search word in advance is stored as candidate facility names Are stored in the RAM 42 as candidate facility names. Then, the CPU 41 displays a list of a predetermined number of candidate facility names, such as five at a time, in the order of the list, and displays the number of candidate facility names.

  This makes it possible to search for candidate facility names having long words at a higher speed and prevent a decrease in responsiveness, and the user can further increase the number of characters in the search term or list the candidate facility names displayed in a list. It is possible to determine whether to select.

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

  For example, the navigation device 101 according to another embodiment has almost the same configuration as the navigation device 1, but stores the facility name data table 81 shown in FIG. 12 in the facility name DB 27 instead of the facility name data table 51. You may do it. Here, the facility name data table 81 will be described with reference to FIG.

As shown in FIG. 12, the facility name data table 81 is composed of a “division unit”, “reading” for storing the reading of the facility name, and “facility name”, like the facility name data table 51. Yes.
However, in this “divided unit”, a divided character string composed of a combination of two lines of 50 sounds to which a two-character hiragana character that matches the keyword constituting the facility name reading belongs is stored. For example, in the divided character string “Ta Line Line” of “Division Unit”, each hiragana character “Ta”, “Tai”, “Tau” of the two characters that match the keyword of the facility name reading,・ ・ 25 character strings “Toe” and “Too” belong.

  In addition, to the “divided unit”, a 50-sound line to which a one-character hiragana character that matches the other keywords that are not the longest word among the keywords constituting the facility name reading is added to the long word. The specific divided character string is stored. For example, the specific division character string “Shiyakushoku Line” of “Division Unit” includes “Shiyakushoku”, “Shiyakushoku”, “Shiyakushoku”, “Shiyakushoku”, “Shiyakushoko” Five character strings belong.

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

  Also, for the division unit, read the facility name for a long word, such as "Shiakusho Line", "Shiakusho Line", "Shiakusho Line", etc. Two or more lines of 50 syllables to which two or more hiragana characters that coincide with the other keywords that are not the longest word among the constituent keywords belong may be added and stored as a specific divided character string.

  In addition, in the “reading”, when a divided character string is stored in the “division unit”, a keyword that matches the front of each hiragana character of two characters belonging to a combination of two lines of 50 sounds of the divided character string is included. The reading of the facility name is stored. For example, the facility name reading “Tokyo / Nezumi / Shi” is “division unit” in the facility name data table 81 corresponding to the two characters “To”, “Nez”, and “Shi” in front of each keyword. ”Is stored in“ reading ”corresponding to the divided character strings of the two combinations of“ ta line and line ”,“ na line and line ”, and“ sa line and line ”. The long sound “-” is read as the vowel of the previous character.

  In addition, in the “reading”, when a specific divided character string is stored in the “division unit”, the long word of the specific divided character string is included in the keyword, and the 50-sound line added to the long word is included. A facility name reading is stored that includes other keywords that are not the long words that coincide with the one-character hiragana character that belongs to it.

  For example, if the name of the facility is “Nagoya / Yakusyo / Kankyoka”, the long word “Shiakusyo” will be followed by “na”, “na”, “ “K” line is stored in “reading” corresponding to “division unit” of each of the specific divided character strings “Shiakushoku line” and “Shiakushoku line”. In addition, the reading of the facility name is “Nagoya / Yakusyo / Kankyoka”, the other two characters that are not long words, “Nagoya”, “Kankyoka”, the two characters in front of “Nagoya”, and “Kan”, each divided character It is also stored in “reading” corresponding to the “division unit” of the columns “na row or row” and “ka row”.

  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 name of the facility “Nagoya City Hall Environment Division” is the “divided unit” of each specific divided character string “Shiakushoku Line”, “Shiyakushoka Line”, and each divided character string “Nana Line or Line”, “Kara Line”. Are stored in correspondence with the reading of the facility name “Nagoya / Shiyakusho / Kankyoka”.

  Then, the CPU 41 of the navigation device 101 according to another embodiment may execute a “point information display process 2” shown in FIG. 13 instead of the “point information display process” shown in FIG. Here, the “point information display process 2” will be described with reference to FIG.

As illustrated in FIG. 13, in S111 to S113, the CPU 41 executes the processes of S11 to S13.
Subsequently, in S114, the CPU 41 reads the search word from the RAM 42, and the number of characters of the search word, that is, the number of input characters is “2 lines” of the 50-sound line of the divided character string stored in the “division unit”. The determination process for determining whether or not the number of characters is greater than “2 characters” is executed.

  If it is determined that the number of characters of the search word is less than or equal to the number of 50-sound lines “2 lines” of the divided character string stored in the “division unit”, that is, the number of characters is “2 characters” or less (S114: NO), the CPU 41 proceeds to the process of S115. In S115, the CPU 41 reads out all the facility names of “facility names” in the “division unit” in which the two-line divided character string of 50 sounds to which the search word belongs are read from the facility name data table 81, and is the destination candidate. A certain candidate facility name is stored in the RAM 42. Thereafter, the CPU 41 proceeds to the process of S119, executes the process of S19, and ends the process.

  For example, when the search word is “kan”, the CPU 41 determines that the number of characters of the search word is equal to or less than the number of lines of 50 sounds “2 lines” of the divided character string stored in the “division unit” ( S114: NO), all the facility names of “facility names” in the “division unit” in which the divided character string “ka do line” is stored are stored as candidate facility names in the RAM 42 (S115). Then, the CPU 41 displays a search result display screen 71 on the liquid crystal display 15, and in the five search result display fields 72, “Okazaki City Hall Environment Section”, “Nagoya City Hall Environment Section”, “Fukuoka City Hall Environment Section”,... And the top five candidate facility names (point information) are displayed. Further, the CPU 41 displays the number of candidate facility names as, for example, “317” or the like on the number display section 73 (S119).

  On the other hand, if it is determined that the number of characters of the search word is greater than the number of lines of 50 sounds “2 lines” of the divided character string stored in the “division unit”, that is, the number of characters “2 characters” (S114: YES) ), The CPU 41 proceeds to the process of S116 and executes the process of S16. If it is determined that the search word does not include a long word (S116: NO), the CPU 41 proceeds to the process of S117.

  In S <b> 117, the CPU 41 sequentially reads “reading” of all the facility names in the “division unit” in which two lines of 50 sounds to which the first two characters of the search word belong are stored from the facility name data table 81. Then, the CPU 41 executes a determination process for determining whether or not there is a keyword that matches the search word in the keywords that constitute the reading of each read facility name, that is, all the facility names that have been read. Perform a full-text search for "reading".

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

  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 81 and stored in the RAM 42 in order as a candidate facility name which is a destination candidate, and the process proceeds to S119.

  For example, when the search word is “Tokyo”, the CPU 41 determines that the number of characters of the search word is greater than the number of lines of 50 sounds “2 lines” of the divided character string stored in “division unit” (S114). :)), “reading” of all facility names in the “division unit” of “ta line line” to which the first two characters “to” of the search word belong are sequentially read from the facility name data table 81, and the search word “Tokyo” The full text search is performed to determine whether or not a keyword matching the prefix “” is included.

  And each facility name corresponding to the reading of each facility name “Tokyo / Nezumi / Shi”, “Tokyo / Nezumi / Land”, “Tokyo / Renbo / Land”, etc. “Tokyo Nesmy Sea”, “Tokyo Nesme Land”, “Tokyo Rainbow Land”,... Are read from the facility name data table 81 and stored in the RAM 42 as candidate facility names that are destination candidates (S117). Then, the CPU 41 displays the search result display screen 71 on the liquid crystal display 15, and the five search result display fields 72 include “Tokyo Nesme See”, “Tokyo Nesme Land”, “Tokyo Rainbow Land”,... The candidate facility name (point information) is displayed. Further, the CPU 41 displays the number of candidate facility names as, for example, “125” or the like on the number display unit 73 (S119).

  On the other hand, when it is determined that a long word is included in the search word (S116: YES), the CPU 41 proceeds to the process of S118. In S <b> 118, the CPU 41 reads the search word from the RAM 42, and the number of characters of the search word is equal to the number of lines of the specific divided character string including the long word included in the number of characters of the long word included in the search word, that is, the number of characters “ A determination process for determining whether the number of characters is greater than the number of characters added by “one character” is executed.

  If it is determined that the number of characters of the search word is greater than the number of characters obtained by adding one hiragana to the long word included in the search word stored in the “division unit” (S118: YES), the CPU 41 Then, the process proceeds to S117. In S117, the CPU 41 obtains a specific divided character string in which a line of 50 sounds to which the first character of the remaining character string excluding the long word from the search word belongs is added to the character string of the long word included in the search word. The “reading” of all the facility names in the stored “division unit” is sequentially read from the facility name data table 81. Then, the CPU 41 determines whether there is a keyword that matches the remaining character string excluding the long word from the search word among the keywords different from the long word character string that constitutes the reading of each read facility name. A determination process for determining whether or not is executed. That is, the CPU 41 performs a full text search for the read of each facility name that has been read, using the remaining character string obtained by removing a long word from the search word as a search word.

  When the keyword that differs from the character string of the long word constituting the reading of the read facility name is a keyword that matches the remaining character string excluding the long word from the search word, the CPU 41 forwards the keyword. The “facility name” corresponding to the reading of the facility name is read from the facility name data table 81 and stored in the RAM 42 in order as a candidate facility name that is a destination candidate. Thereafter, the CPU 41 proceeds to the process of S119, executes the process of S19, and ends the process.

  For example, as shown in FIG. 8, when the completion button 68 is pressed in S113 and the CPU 41 stores "search text" as a search term in the RAM 42, the CPU 41 stores the specific divided character string "squishy text line". "Reading" of all the facility names in the "division unit" in which "is stored" is sequentially read from the facility name data table 81. Then, the CPU 41 performs a full text search for whether or not a keyword that directly matches the character string “Kankyoka” obtained by removing the long word “Shiyakushoku” from the search word “Shiyakushokukyo” is included.

  Subsequently, as shown in FIG. 9, the CPU 41 displays a search result display screen 71 on the liquid crystal display 15, and “Okazaki City Hall Environment Section”, “Nagoya City Hall Environment Section”, “Naha” are displayed in the five search result display fields 72. “City Hall Environment Section”, “Numazu City Hall Environment Section”, “Fukuoka City Hall Environment Section” and the top five candidate facility names (point information) are displayed. The number display section 73 displays the number of candidate facility names “48”.

  On the other hand, when it is determined that the number of characters of the search word is equal to or less than the number of characters obtained by adding one hiragana to the long word included in the search word stored in the “division unit” (S118: NO), the CPU 41 Then, the process proceeds to S115. In S115, when the number of characters of the search word is the number of characters obtained by adding one character to the number of characters of the long word included in the search word, the CPU 41 adds the long word from the search word to the character string of the long word included in the search word. The facility name data table 81 includes all facility names of “facility names” in the “division unit” stored with a specific divided character string to which a line of 50 sounds to which the first character of the remaining character string excluding the word belongs is added. And stored in the RAM 42 as a candidate facility name that is a destination candidate, and the process proceeds to S119.

  In S115, if the number of characters of the search word is the number of long words included in the search word, the CPU 41 stores 10 specific divided character strings including the long word included in the search word. All facility names of “facility names” in each “division unit” are read from the facility name data table 81 and stored in the RAM 42 as candidate facility names that are destination candidates, and the process proceeds to S119.

  For example, as shown in FIG. 10, when the CPU 41 has pressed the completion button 68 in S113 and has stored “shiyakusho” in the RAM 42 as a search word, each specific division including the long word “shiyakusho” is stored. Read all facility names in the “division unit” in which the character strings “Shiakushoua Line”, “Shiyakusuka Line”, “Shiyakusoku Line”,... The candidate facility name that is a candidate is stored in the RAM 42.

  Subsequently, as shown in FIG. 11, the CPU 41 displays a search result display screen 71 on the liquid crystal display 15, and “Okazaki City Hall Environment Section”, “Nagoya City Hall Environment Section”, “Naha” are displayed in the five search result display fields 72. “City Hall Environment Section”, “Numazu City Hall Environment Section”, “Fukuoka City Hall Environment Section” and the top five candidate facility names (point information) are displayed. The number display section 73 displays the number of candidate facility names “10,000 or more”.

  As described above in detail, in the navigation apparatus 101 according to another embodiment, there is a duplication of the facility name stored in the “facility name” between the “division units” in the facility name data table 81, but each “division unit”. In “”, there is no duplication of the facility name stored in “facility name”, and only one facility name is stored. Accordingly, there is an overlap in the reading of the facility name stored in the “reading” among the “division units” in the facility name data table 81, but in each “division unit”, the facility name stored in the “reading” is stored. There is no duplication of readings, and only readings of one facility name are stored.

  Thereby, in each “division unit” of the facility name data table 81, only one facility name reading indicating the destination is stored, and only one facility name corresponding to the facility name reading is stored. Therefore, it is possible to reduce the capacity of the facility name data table 81 by reducing the number of facility names that are stored in duplicate and the reading of the facility names. In addition, the total data capacity of “reading” and “facility name” for each “division unit” in the facility name data table 81 is set to a predetermined data capacity or less (for example, 1 to 50 megabytes or less). Thus, it is possible to suppress an increase in the memory capacity of the RAM 42 that develops the facility name in the facility name data table 81 corresponding to the search term and the reading of the facility name.

  In addition, the facility name data table 81 includes, for each keyword constituting the facility name reading, if the keyword is not a long word, the facility name and the facility name reading are two-letter hiragana characters that match the keyword in front. Is stored in correspondence with the “division unit” in which a divided character string composed of a combination of two lines of 50 sounds to which the sound belongs is stored. In addition, the facility name data table 81 indicates that, when the keyword is a long word, one character that is forward-matched to another keyword that is not the long word among the keywords constituting the facility name reading for the long word. A specific divided character string to which a line of 50 sounds to which the hiragana belongs is added is stored in association with the “division unit” stored.

  Thus, the facility name including the long word and the reading of the facility name are further subdivided and stored in correspondence with the specific divided character string, so that the facility name in the “division unit” in which the specific divided character string is stored and the The number of readings of facility names can be reduced, and the total data capacity of “reading” and “facility name” for each “division unit” is less than a predetermined data capacity (for example, 1 megabyte to 10 megabytes or less). .) Can be set. Accordingly, while reducing the data capacity of the facility name data table 81, it is possible to further effectively increase the memory capacity of the RAM 42 that develops the facility name of the facility name data table 81 corresponding to the search term and the reading of the facility name. It becomes possible to deter.

  In addition, the CPU 41 does not include a long word in the reading of the search word, and if the number of characters of the search word is larger than the number of lines of 50 sounds of the divided character string “2 lines”, "Reading" of all the facility names in the "division unit" in which the two lines of 50 sounds to which the two front letters belong is stored is read in order from the facility name data table 81, and the keyword that matches the search word in front is read. Search the full text of the facility name you have. As a result, the number of facility names to be searched can be limited to all the facility names in the “division unit” in which two lines of 50 sounds to which the first two letters of the search word belong are stored. It is possible to perform full-text search at high speed and prevent a decrease in responsiveness.

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

  In addition, the CPU 41 adds a one-character hiragana to the long word included in the search word that contains the long word in the reading of the search word and the number of characters of the search word stored in the “division unit”. When there are more characters than the number of characters, a specific divided character obtained by adding a 50-sound line to which the first character of the remaining character string excluding the long word from the search word is added to the character string of the long word included in the search word “Reading” of all the facility names in the “division unit” in which the column is stored is sequentially read from the facility name data table 81. Then, the CPU 41 performs a full-text search for the reading of each facility name thus read, using the remaining character string obtained by removing a long word from the search word as a search word.

  As a result, the name of the facility to be searched is added to the character string of the long word included in the search word and the line of 50 sounds to which the first character of the remaining character string excluding the long word from the search word belongs. It is possible to reduce the number of all facility names in the “division unit” in which the specific divided character string is stored, and it is possible to perform full-text search for candidate facility names at high speed and to prevent a decrease in responsiveness. .

  In addition, the CPU 41 adds a one-character hiragana to the long word included in the search word that contains the long word in the reading of the search word and the number of characters of the search word stored in the “division unit”. If the number of characters is less than or equal to the number of characters, a specific divided character string in which a line of 50 sounds to which the first character of the remaining character string excluding the long word from the search word belongs is added to the character string of the long word included in the search word Are read out from the facility name data table 81 as candidate facility names and stored in the RAM 42 as candidate facility names. Then, the CPU 41 displays a list of a predetermined number of candidate facility names, such as five at a time, in the order of the list, and displays the number of candidate facility names.

  This makes it possible to search for candidate facility names having long words at a higher speed and prevent a decrease in responsiveness, and the user can further increase the number of characters in the search term or list the candidate facility names displayed in a list. It is possible to determine whether to select.

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

Claims (4)

A plurality of facility names representing destinations to be searched and a reading of the facility name are forward-matched with the keyword when the keyword does not match a predetermined word for each keyword constituting the reading of each facility name. When the keyword matches a predetermined word and is stored in association with a predetermined number of divided character strings, the divided character string has a predetermined number of characters that matches the other words of the facility name in front of the predetermined word. Facility name storage means for storing in association with the specific divided character string to which
An input means for entering a search term;
Predetermined word determination means for determining whether or not the predetermined word is included in the reading of the search term input by the input means;
If it is determined that the predetermined word is included in the reading of the search word input by the input unit via the predetermined word determination unit, is another keyword included in the reading of the search word? Keyword determination means for determining whether or not,
When it is determined that the predetermined word is not included in the reading of the search word input by the input unit via the predetermined word determination unit, the predetermined number of characters is divided from the front of the reading of the search word. determined as a character string, search the candidate facility name from all hosts name stored in association with the determined division string, while search word input by the input means via the keyword determining unit When it is determined that the other keyword is included in the reading, a predetermined divided character string is determined by adding a predetermined number of character strings that match the other keyword to the predetermined word. Search means for searching for candidate facility names from all facility names stored in association with the determined specific divided character string;
The point search device characterized by comprising. When the search means determines that the other keyword is not included in the reading of the search word input by the input means via the keyword determination means, all the specific divisions including the predetermined word are included. The point search device according to claim 1 , wherein all facility names stored in association with a character string are acquired as candidate facility names. The divided character string of the predetermined number of characters is composed of a plurality of divided character strings of a predetermined number of characters corresponding to a combination of the predetermined number of lines of 50 sound lines, and the specific divided character string is a sound of 50 sounds in the predetermined word. A plurality of predetermined character divided character strings corresponding to combinations of a predetermined number of lines are added,
The facility name storage means reads the plurality of facility names and the facility name, and if the keyword does not match a predetermined word, the line of 50 sounds to which a predetermined number of divided character strings that match the keyword in front belongs. And when the keyword matches a predetermined word, a divided character string having a predetermined number of characters that matches the predetermined word in front of other keywords of the facility name. location search device according to claim 1 or claim 2, characterized in that stored in association with a particular division string combinations of predetermined number of rows is added row of belongs syllabary. A plurality of facility names representing destinations to be searched and a reading of the facility name are forward-matched with the keyword when the keyword does not match a predetermined word for each keyword constituting the reading of each facility name. When the keyword matches a predetermined word and is stored in association with a predetermined number of divided character strings, the divided character string has a predetermined number of characters that matches the other words of the facility name in front of the predetermined word. In a computer provided with facility name storage means for storing in association with the specific divided character string to which
An input process for entering a search term;
A predetermined word determination step for determining whether or not the predetermined word is included in the reading of the search term input in the input step ;
If it is determined in the predetermined word determination step that the predetermined word is included in the reading of the search word input in the input step, whether or not another keyword is included in the reading of the search word A keyword determination step for determining
When it is determined in the predetermined word determination step that the predetermined word is not included in the reading of the search word input in the input step, the predetermined number of characters is calculated from the front of the search word reading. The candidate facility name is searched from all the facility names stored in association with the determined divided character string , while the other words are read in the search term input in the input step in the keyword determination step. Is determined to include a predetermined character string by adding a predetermined number of character strings that are forward-matched with the other keywords to the predetermined word, and the determined specific division is determined. A search process for searching for candidate facility names from all facility names stored in association with character strings,
A program for running

Images