JP2009266171A - Information retrieving device and navigation device - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide an information retrieving device can shorten a retrieval time for retrieving the reading Japanese syllabary having two character strings, and a navigation device. <P>SOLUTION: The information retrieving device prepares data 30 for extraction having registered character strings 31 sorted in the order of the Japanese syllabary and bit information 32 that represents respective characters included in the registered character strings 31 by binary codes, determines whether "&" is included in an input character sting, and retrieves at least either a character string existing before the "&" or a character string existing after the "&" by using the bit information 32 of the data 30 for extraction when it is determined that the "&" is included. <P>COPYRIGHT: (C)2010,JPO&INPIT

Description

  The present invention relates to an information search device and a navigation device for searching for information data desired by a user from information data.

An information search apparatus that inputs and searches for a single character string formed by continuously arranging 50 syllabary kana characters is known as a prior art (for example, Patent Document 1). In addition, a 50-sound search using a search tree and a corresponding table in which data is arranged in a 50-sound order is known as a conventional technique (for example, Non-Patent Document 1).
JP 2000-339339 A KIWI Review Committee: KIWI Format Ver. 1. 10, P331 (1998)

  In a conventional information retrieval technique as disclosed in Patent Document 1 or Non-Patent Document 1, when two 50-character strings are input and so-called AND search is performed so that each of the 50-character strings is included at the same time. This is done as follows. First, a 50-sound search is performed for each character string. Next, the respective search results are compared, and common ones are extracted as AND search search results. As described above, when an AND search of 50 sounds using two character strings is performed, there is a problem that the search takes time.

  According to the aspect of the present invention, the information search apparatus includes extracted character strings that include registered character strings that are sorted in alphabetical order or in alphabetical order, and bit information that represents each character included in the registered character string with a binary code. The registered character string obtained by searching the registered character string sorted according to the order of the characters included in the first input character string by using the extraction data creating means for creating the character string and a predetermined search tree. Search means for searching for a second input character string from bit information corresponding to the column.

  According to the present invention, it is possible to shorten the search time for searching for a reading kana having two character strings.

  FIG. 1 shows a navigation device 1 according to an embodiment of the present invention. The navigation device 1 can search for a desired facility by a 50 sound search. The navigation device 1 includes a control circuit 11, a ROM 12, a RAM 13, a current location detection device 14, an image memory 15, a display monitor 16, a speaker 17, an input device 18, a touch panel 19, a touch panel control unit 110, and a disk drive 111. The disk drive 111 is loaded with a DVD-ROM 112 in which map data and facility search data are stored.

  The control circuit 11 includes a microprocessor and its peripheral circuits, and performs various controls by executing a control program stored in the ROM 12 using the RAM 13 as a work area. The control circuit 11 performs a predetermined route search process based on the map data stored in the DVD-ROM 112. Then, the processing result is displayed on the display monitor 16 as a recommended route.

  The current location detection device 14 is a device that detects the current location of the vehicle. The current location detection device 14 includes a vibration gyro 14a, a vehicle speed sensor 14b, a GPS (Global Positioning System) sensor 14c, and the like. The vibration gyro 14a detects the traveling direction of the vehicle, the vehicle speed sensor 14b detects the vehicle speed, and the GPS sensor 14c detects a GPS signal from a GPS satellite. The navigation device 1 determines a map display range, a route search start point, and the like based on the current location of the vehicle detected by the current location detection device 14. Further, the current location of the vehicle detected by the current location detection device 14 is displayed on the map as the vehicle position mark.

  The image memory 15 stores image data to be displayed on the display monitor 16. This image data includes road map drawing data and various graphic data, which are appropriately generated based on the map data stored in the DVD-ROM 112. The navigation device 1 can perform map display and the like by using the image data generated in this way.

  The disk drive 111 reads map data from the DVD-ROM 112. The map data includes map display data, route search data, facility search data, facility data, and the like. The map display data and the route search data include road link information and node information stored in the map data. The map display data has map data of a plurality of scales from wide areas to details, and the scale of the display map can be changed according to a user request. The map data may be read from a recording medium other than the DVD-ROM 112, such as a CD-ROM or a hard disk.

  The facility search data 2 included in the map data will be described with reference to FIG. Using this facility search data 2, the user can search for a desired facility. As shown in FIG. 2, the facility search data 2 includes search tree data 20 and extraction data 30. The facility data in the extracted data 30 is linked to the corresponding data in the facility data 40 so that the detailed information of the facility searched for in the facility search data 2 can be acquired.

  As shown in FIG. 3 (a), the search tree 200 represented by the search tree data 20 includes a node (a, i, u,...) Corresponding to a 50-sound kana and a link (arrow) connecting the nodes. It consists of. Each node includes information 21a and 21b of the position and range (offset to the corresponding data) of the data corresponding to the node in the extraction data 30. When the first character kana is input, a search point is set to the node corresponding to the input kana among the first character nodes, and corresponding data corresponding to the node is searched. When the second character kana is input, the search point moves from the parent node to the child node according to the link connected to the node to the node corresponding to the input second character kana. Then, corresponding data corresponding to the node to which the search point has moved is searched from the extraction data 30. Each time a kana is entered, the movement of the search point from the parent node to the child node is repeated. As shown in FIG. 3B, the search tree data 20 has an INFO field and a link field corresponding to each link. In the INFO field, node name and attribute information, corresponding data corresponding to the above-mentioned node, and the like are stored, and in the link field, a link (pointer) for designating a child node is stored.

  As shown in FIG. 4, the extraction data 30 includes 50 sound reading data 31 and 50 sound bit information 32. The 50-sound reading data 31 is data of a reading pseudonym of the facility name, that is, character string data representing the name of the facility. The 50-sound reading data 31 is sorted in the order of 50-syllabary readings of facility names. The 50 sound bit information 32 is information representing the reading name of the facility name with a binary code of 50 sounds. For the 50-spoken reading data 31 of each facility, a bit is provided in the 50-spoken kana, and the bit of the kana included in the reading of the facility name is set to “1” and is not included in the reading of the facility name. “0” is set to the bit of the kana. For example, when “a” is included in the reading name of the facility name, the bit corresponding to “a” is “1”, and when “a” is not included, the bit corresponding to “a” is “0”. become. The extraction data 30 includes, in addition, display character data for displaying a list of facility names related to the retrieved reading pseudonym, and facility data for linking the retrieved reading pseudonym and information of the facility related to the reading pseudonym The data position information at 40 is included.

  As shown in FIG. 4, the facility data 40 is detailed information about each facility. The facility data 40 includes a facility ID 41 for identifying the facility, a longitude / latitude coordinate 42 of the facility, an address 43, a name 44, a franchise. A group name 45 such as a chain name, business hours 46, text data 47 describing other detailed information of the facility, information update date and time 48, and the like are stored.

  With reference to FIG. 5 to FIG. 8, a 50-sound search using two character strings in the embodiment of the present invention will be described. In the following description, it is assumed that an AND search is performed on the character string “A” and the character string “Kakiku”. Here, the AND search means searching for a reading pseudonym that includes two character strings at the same time.

  As shown in FIG. 5, when the user inputs the pseudonym “A” as the first character, the data in the range of the reference numeral 51 of the extraction data 30 is searched based on the information of the node of the search tree 200. When the pseudonym “I” is input as the second character, the data in the range of the reference numeral 52 of the extraction data 30 is searched based on the node information of the search tree 200. When the pseudonym “u” is input as the third character, data in the range of reference numeral 53 of the extraction data 30 is searched based on the information of the nodes of the search tree 200. When the input of the first character string “Ayu” is completed and the operation proceeds to input of the second character string, “&” is input as the fourth character.

  After the character “&” is input, the corresponding data in the extraction data 30 is searched based on the 50 sound bit information 32. As shown in FIG. 6, when the user inputs the kana “ka” as the fifth character, the data 61 in which the bit corresponding to “ka” is “1” in the extraction data 30 in the range of reference numeral 53. , 62 are retrieved. As shown in FIG. 7, when the kana “ki” is input as the sixth character, “ki” is extracted from the extraction data 61 and 62 searched when the kana “ka” is input as the fifth character. Data 61 and 62 whose bits corresponding to are “1” are retrieved. As shown in FIG. 8, when the kana “ku” is input as the seventh character, “ku” is extracted from the extraction data 61 and 62 searched when the kana “ki” is input as the sixth character. Data 61 in which the bit corresponding to is “1” is retrieved. As described above, the AND search of the character string “Ah” and the character string “Kakiku” is performed.

  Returning to FIG. 1 again, the navigation device 1 will be described. The display monitor 16 in FIG. 1 provides various information such as a road map near the vehicle position to the user as a screen display based on various information such as map data. The speaker 17 outputs sound for instructing the user to perform various input operations and for guiding the route. The input device 18 has operation keys that are operated by a user for setting various commands, and is realized by a button switch on the operation panel, a hard switch around the panel, or the like. The user sets the destination by operating the input device 18 in accordance with an instruction on the display screen of the display monitor 16 or a voice instruction from the speaker 17.

  When the destination is set by the user, a route search end point is set at the destination. Then, route calculation from the route search start point to the route search end point is performed based on a predetermined algorithm using the route search data. The route thus obtained (hereinafter referred to as a recommended route) is displayed on the screen in a manner different from other roads by changing the display form, for example, the display color. Thereby, the user can recognize the recommended route on the road map on the screen. Further, the navigation device 1 instructs the user in the direction of travel using a screen or voice so that the vehicle can travel according to the recommended route, thereby guiding the route of the vehicle.

  The touch panel 19 is a transparent touch switch laminated on the surface of the display monitor 16, and an image displayed on the display monitor 16 is displayed through the touch panel 19. Therefore, when the user presses the display screen of the display monitor 16, the touch panel 19 is pressed. The touch panel 19 sends a signal corresponding to the operation position on the touch panel 19 to the touch panel control unit 110, and the touch panel control unit 110 calculates the pressed position of the touch panel 19. When an attempt is made to press various buttons and display menus displayed on the display monitor 16 with a finger or the like, the touch panel 19 is pressed, and processing defined in the various buttons and display menus is executed.

  Next, with reference to FIG. 9 and FIG. 10, an operation of searching for 50 sounds in the embodiment of the present invention will be described. In the following description, it is assumed that an AND search is performed on the character string “A” and the character string “Kakiku”.

  FIG. 9 is a diagram for explaining the 50 sound search screen 70. The 50-sound search screen 70 is a screen for inputting a kana as a search condition for a 50-sound search. The user can display the 50 sound search screen 70 on the display monitor 16 from a predetermined menu screen (not shown). On the 50 sound search screen 70, a character input button group 71, an input character display field 72, a confirmation button 73 and a return button 74 are displayed.

  The character input button group 71 includes a plurality of character input buttons. When the character input button is pressed, a kana or a symbol corresponding to the pressed character input button is input to the navigation device 1. When performing an AND search of the character string “A” and the character string “Kakiku”, the user inputs “A” that is the first character string, then inputs “&”, and the second character string. Enter “stirring”. The input character display field 72 is a display field for characters input by the character input button group 71. As a result of the input operation described above, the characters “That & Kakiku” are displayed in the input character display field 72. The confirm button 73 is a button for confirming a search condition based on characters input by the character input button group 71. The return button 74 is a button for returning to the predetermined menu screen described above.

  FIG. 10 is a diagram for explaining the search result display screen 80. When the user inputs a character on the 50-sound search screen 70 and then presses the confirmation button 73, a search result display screen 80 is displayed on the display monitor 16. The search result display screen 80 displays the number 81 of search results, a list 82 displaying the names of the searched facilities, an end button 83 and a return button 84. When the user presses the facility name displayed in the list 82, detailed information on the facility corresponding to the pressed facility name is displayed on the display monitor 16. When the user presses the end button 83, the 50-sound search is ended, and the predetermined menu screen described above is displayed on the display monitor 16. When the user presses the return button 84, the 50 sound search screen 70 is displayed on the display monitor 16.

  Next, the 50 sound search process according to the embodiment of the present invention will be described with reference to the flowcharts of FIGS. The processing of FIG. 11 and FIG. 12 is executed in the control circuit 11 by a program that starts when the 50 sound search screen 70 (see FIG. 9) is displayed on the display monitor 16.

  In step S1101, it is determined whether or not a kana is input by the character input button group 71. If a kana is input, an affirmative determination is made in step S1101 and the process proceeds to step S1102. If no kana is input, step S1101 is repeated. In step S1102, the search tree 200 is searched for data corresponding to the input pseudonym from the extraction data 30. In step S1103, the number of corresponding data is detected.

  In step S1104, it is determined whether or not a kana has been input by the character input button group 71. If a kana is input, an affirmative determination is made in step S1104, and the process returns to step S1102. If no kana is input, a negative determination is made in step S1104, and the process proceeds to step S1105. In step S1105, it is determined whether or not “&” is input by the character input button “&”. If “&” is input, an affirmative determination is made in step S1105, and the process proceeds to step S1201 in FIG. If “&” is not input, a negative determination is made in step S1105, and the process proceeds to step S1106.

  In step S1106, it is determined whether or not the confirm button 73 has been pressed. If the confirm button 73 is pressed, an affirmative determination is made in step S1106, and the process proceeds to step S1107. If the confirmation button 73 is not pressed, a negative determination is made in step S1106, and the process returns to step S1104.

  In step S1107, a list of facility names corresponding to the retrieved data is displayed. In step S1108, detailed information on the facility selected from the list is displayed.

  In step S <b> 1201 of FIG. 12, it is determined whether or not a kana is input by the character input button group 71. If a kana is input, an affirmative determination is made in step S1201 and the process proceeds to step S1202. If no kana is input, a negative determination is made in step S1201 and the process proceeds to step S1204. In step S1202, the retrieved data is searched for data in which the 50 sound bits corresponding to the input kana are set to “1”. In step S1203, the number of retrieved data is detected. Then, the process returns to step S1201.

  In step S1204, it is determined whether or not the confirm button 73 has been pressed. If the confirm button 73 is pressed, an affirmative decision is made in step S1204 and the process proceeds to step S1107 in FIG. If the confirm button 73 is not pressed, a negative determination is made in step S1204, and the process returns to step S1201.

The navigation apparatus 1 in the above embodiment has the following effects.
(1) Extraction data 30 having registered character strings (50-sound reading data 31) sorted in the order of 50 notes and 50-sound bit information 32 representing each character included in the registered character string by a binary code. It is prepared and it is determined whether or not a logical operator (AND search expression: “&”) is included in the input character string (step S1105 in FIG. 11). If it is determined, at least one of the character string preceding the logical operator (first character string) and the character string following the logical operator (second character string) is extracted from the extraction data 30. The search is made using the 50-tone information 32. Thereby, the time required for the AND search using two character strings can be shortened.

(2) One character string is searched for 50 sounds using the search tree 200, and the other character string is further searched using the 50-bit information 32 within the range of the search result. Thereby, using the search tree 200 and the extraction data 30, it is possible to appropriately perform a search for a reading pseudonym of a facility name having two character strings.

The navigation device 1 of the above embodiment can be modified as follows.
(1) The reading kana (registered character string) is not limited to the reading kana of the facility name as long as it reads a reading kana having two character strings, that is, a registered character string. Further, the 50-sound reading data of the extraction data 30 is not limited to the reading kana of the facility name as long as it is reading kana (registered character string) data.

(2) In the above-described embodiment, the 50 sound bit information 32 is information obtained by converting a reading name of a facility name, that is, a character string representing the name of the facility into bits corresponding to 50 sounds. However, it is good also as the information which converted the reading name of the name of the category of the facility which concerns on a facility name, ie, the character string showing the name of a facility, into 50 sound bits. This makes it possible to perform an AND search of “partial character string of the facility name reading” and “partial character string of the facility category name”, improving the convenience of the navigation device. To do. For example, in FIG. 13, the 50-sound reading data 31 is “Enoshima Ikuzokan”, whereas the 50-sound bit information is “Suizokan”, which is a facility category.

  Further, the 50-sound bit information 32 may be information obtained by converting a 50-sound kana included in the reading name of the area name where the facility exists, that is, a character string representing the facility category into 50-sound bits. This makes it possible to perform an AND search between “a partial character string of the reading name of the facility name” and “a partial character string of the reading name of the facility area”, which is convenient. For example, “Tokyo Disneyland” can be searched using two character strings “Touki” and “Urayasu”.

  Note that the AND search described above is performed in the input order of “partial character string of the reading of the facility name”, “&”, and “partial character string of the name of the facility category or facility region”. You may be able to do this in the input order of “partial character string of the reading of the facility category or name of the facility”, “&”, “partial character of the reading of the facility name” You may be able to do it.

  Furthermore, the 50-sound bit information 32 is converted into a 50-sound bit by converting the 50-sound kana included in the reading kana of the name obtained by translating the facility name into a popular name or abbreviation, that is, a character string representing the common name or abbreviation for the facility name. It is good. This makes it possible to perform an AND search of “partial character string of the reading name of the facility name” and “partial character string of the reading name of the facility replacement name”, improving the convenience of the navigation device To do. For example, it is possible to search for “Enoshima Aquarium” using two character strings “Enoshima” and “Enosui”.

  In this case as well, the above AND search can be performed in the input order of “partial character string of the reading name of the facility name”, “&”, and “partial character string of the reading name of the facility replacement name”. Alternatively, it may be possible to perform in the input order of “partial character string of the reading name of the facility replacement name”, “&”, and “partial character string of the reading name of the facility name”. Good.

(3) As shown in FIG. 14, the extraction data 30 includes identification information (category ID 33, area ID 34) for identifying the category of the facility and the region where the facility exists, with respect to the reading pseudonym data of each facility name. ). As a result, the search result of the 50-sound search using two character strings can be narrowed down by the category or region of the facility, and the number of search results can be reduced, which is convenient. In this case, the search results can be narrowed down by extracting data having a predetermined identification code from the search results of the 50-sound search using two character strings.

(4) The present invention is not limited to the Japanese syllabary kana as long as it is a registered character string registered according to a predetermined rule. For example, the present invention can also be applied to alphabets in addition to 50-sound kana. In this case, a search is performed using a search tree for searching for an alphabet registered character string in the extraction data 30 'and the extraction data 30' as shown in FIG. The extraction data 30 ′ has alphabet data 31 ′ as registered character string data and alphabet bit information 32 ′ representing each character included in the registered character string with a binary code. The alphabet data 31 'is alphabet data representing the name of the facility. In the alphabet data 31 ', the names of the facilities are sorted in alphabetical order. The alphabet bit information 32 ′ is information representing the alphabet of the facility name with an alphabetic binary code.

(5) A 50-sound search is performed for the second character string using the search tree 200, and the first character string is further searched using the 50-bit information 32 within the range of the search result. Also good.

(6) Of the character string before the logical operator and the character string after the logical operator, one character string is searched by a method other than the 50-sound search using the search tree 200, and the search result Within the range, the other character string may be further searched using the 50-bit information 32.

(7) When determining whether or not a logical operator is included in the input character string, it is determined whether or not the character “&” is input. If it can be judged, it will not be limited to embodiment. For example, the determination may be made by inputting a space key.

  The present invention is not limited to the navigation device 1 as long as it is an information search device. For example, a mobile phone terminal having a function of searching for facilities may be used.

  It is also possible to combine one or a plurality of embodiments and modifications. It is possible to combine the modified examples in any way.

  The above description is merely an example, and the present invention is not limited to the above embodiment.

It is a block diagram which shows the structure of the navigation apparatus of embodiment of this invention. It is a figure for demonstrating the data for a facility search. It is a figure for demonstrating a search tree. It is a figure for demonstrating the data for extraction, and facility data. It is a figure for demonstrating the 50 sound search using the search tree in embodiment of this invention. It is a figure for demonstrating the 50 sound search using 50 sound bit information in embodiment of this invention. It is a figure for demonstrating the 50 sound search using 50 sound bit information in embodiment of this invention. It is a figure for demonstrating the 50 sound search using 50 sound bit information in embodiment of this invention. It is a figure for demonstrating a 50 sound search screen. It is a figure for demonstrating a search result display screen. It is a flowchart for demonstrating the 50 sound search process in embodiment of this invention. It is a flowchart for demonstrating the 50 sound search process in embodiment of this invention. It is a figure for demonstrating the modification of the data for extraction. It is a figure for demonstrating the modification of the data for extraction. It is a figure for demonstrating the modification of the data for extraction.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Navigation apparatus 11 Control circuit 16 Display monitor 20 Search tree data 30 Extraction data 31 50 sound reading data 32 50 sound bit information 40 Facility data 200 Search tree

Claims (6)

A registered character string registered in accordance with predetermined rules;
Extraction data recording means for recording bit information representing each character included in the registered character string in a binary code in association with the registered character string;
An input receiving means for receiving input of a character string;
Of the character string input by the input receiving means, a logical operator determination means for determining whether a logical operator is included,
When the logical operator determination means determines that a logical operator is included, at least one of a character string preceding the logical operator and a character string following the logical operator is An information search apparatus comprising: search means for searching using bit information recorded in the extraction data recording means. The information search device according to claim 1,
The information search apparatus according to claim 1, wherein the character string before the logical operator and the character string after the logical operator are character strings representing names of facilities. The information search device according to claim 1,
One of the character string before the logical operator and the character string after the logical operator is a character string representing the name of the facility, and the other character string is a character representing the category of the facility. An information search device, wherein the information search device is a string or a character string representing an area where the facility exists. The information search device according to claim 1,
One of the character string before the logical operator and the character string after the logical operator is a character string representing the name of the facility, and the other character string is a common name for the name of the facility or An information search apparatus, which is a character string representing an abbreviation. In the information search device according to any one of claims 2 to 4,
The extraction data recording means further includes identification information of a category of the facility or identification information of an area where the facility exists,
The search means uses the identification information from a search result using a character string before the logical operator and a character string after the logical operator to a facility of a desired category or a desired area. An information search apparatus characterized by searching for an existing facility.   A navigation device comprising the information search device according to claim 1.

Images