JP2018173784A - Retrieval processing method, retrieval processing program, and retrieval processing device - Google Patents

Abstract

An object of the present invention is to efficiently search for a desired object. A search processing apparatus (101) receives an answer in order for each of a plurality of questions via a terminal (102). The search processing apparatus 101 executes a search according to a combination of a plurality of received answers. In response to the presentation of the search result, the search processing device 101 receives at least the last received answer from the plurality of received answers when an input indicating that the search result does not include the desired search target is made. A search result obtained by excluding the search result corresponding to the last answer from the search results executed according to the combination of one or a plurality of answers excluding. [Selection] Figure 1

Description

  The present invention relates to a search processing method, a search processing program, and a search processing device.

  2. Description of the Related Art Conventionally, various search devices that search for a desired object by inputting a keyword are known.

  As related prior art, bibliographic data having a title or author name, bibliographic data obtained by reading a book, and image data having image information of a book are stored in association with each other and input keyword information is stored. Based on this, there is a technique for extracting and displaying each data. In addition, there is a method of designating a map position when a user inputs ambiguous information about a desired map position and answers a question by dialogue with the map information providing apparatus. In addition, when a keyword is received and a search is performed corresponding to the same content at the set frequency using the search frequency count value for the keyword not associated with the content data, the keyword is newly added to the content. There is a technology to correspond to.

JP 2002-132786 A JP-A-11-265141 JP 2014-199642 A

  However, in the conventional technology, for example, when the user cannot remember the keyword, the desired object may not be searched, and the object may not be searched efficiently.

  In one aspect, an object of the present invention is to efficiently search for an object.

  In one embodiment, a search processing method, a search processing program, and a search processing device accept answers in order for each of a plurality of questions, execute a search according to a combination of the accepted answers, and present search results In response to an input indicating that the desired search target is not included in the search result, a combination of one or a plurality of answers excluding at least the last accepted answer among the plurality of accepted answers The search result obtained by excluding the search result corresponding to the last answer from the search result executed according to the above is presented.

  According to one aspect of the present invention, an object can be searched efficiently.

FIG. 1 is an explanatory diagram of an example of the search processing method according to the embodiment. FIG. 2 is an explanatory diagram of a system configuration example of the search system 200 according to the embodiment. FIG. 3 is a block diagram illustrating a hardware configuration example of the server Sv. FIG. 4 is an explanatory diagram showing an example of the contents stored in the question information DB 211. FIG. 5 is an explanatory diagram showing an example of the contents stored in the information DB 212. FIG. 6 is an explanatory diagram showing an example of the stored contents of the storage difference information DB 213. FIG. 7 is a block diagram illustrating a functional configuration example of the server Sv. FIG. 8 is an explanatory diagram illustrating an example of a basic information input screen displayed on the terminal Ti. FIG. 9 is an explanatory diagram illustrating an example of a question screen displayed on the terminal Ti. FIG. 10 is an explanatory diagram (part 1) illustrating an example of a search result screen displayed on the terminal Ti. FIG. 11 is an explanatory diagram (part 2) illustrating an example of a search result screen displayed on the terminal Ti. FIG. 12 is an explanatory diagram (part 1) illustrating an example of a storage screen displayed on the terminal Ti. FIG. 13 is an explanatory diagram (part 2) illustrating an example of a storage screen displayed on the terminal Ti. FIG. 14 is a flowchart (part 1) illustrating an example of the search processing procedure of the server Sv. FIG. 15 is a flowchart (part 2) illustrating an example of the search processing procedure of the server Sv. FIG. 16 is a flowchart (part 3) illustrating an example of the search processing procedure of the server Sv.

  Exemplary embodiments of a search processing method, a search processing program, and a search processing device according to the present invention will be described below in detail with reference to the drawings.

(Embodiment)
FIG. 1 is an explanatory diagram of an example of the search processing method according to the embodiment. In FIG. 1, a search processing apparatus 101 and a terminal 102 are connected so as to communicate with each other. The search processing device 101 is a computer device such as a server. The terminal 102 is a computer device used by the user, and is, for example, a smartphone, a mobile phone, a tablet PC (Personal Computer), a desktop PC, a notebook PC, or the like.

  The search processing apparatus 101 is provided in a library or the like, for example, refers to a storage unit that stores book information, and searches and presents a book desired by a user. Specifically, the search processing apparatus 101 can search for a book using input information received from a user via the terminal 102. The input information is, for example, keywords such as title, author name, publisher name, classification, and subject.

  Here, for example, a housewife group with children is one of the user groups who often use public libraries. A housewife's mother, for example, wants a child to read a book for education. In order for a child to read a book, the mother may search for the book and recommend it to the child, for example, not only a famous book but also a book that he read as a child may be recommended to the child. Also, although there are books that impressed among the books that my mother read as a child, I can not remember the title, I do not remember the details of the book, or I do not remember even if I remember Have been doing.

  In this way, when a user wants to search for a book that he / she read when he was a child, he / she may not remember the keyword itself or may have a memory difference in the keyword because it is an old memory. Thereby, a desired target object may not be searched efficiently.

  Therefore, in the embodiment, a search processing method capable of efficiently searching for a desired object will be described. Hereinafter, processing examples of the search processing apparatus 101 and the terminal 102 will be described.

  First, as illustrated in (1) of FIG. 1, the search processing apparatus 101 receives answers in order for each of a plurality of questions. Specifically, the search processing apparatus 101 displays a question screen 111 on the terminal 102 and receives an answer from each of the questions in order from the user via the terminal 102. In the question screen 111, for example, a question 1 is displayed as to whether the book being searched is a picture book or a book other than a picture book. For example, the terminal 102 has a touch panel display screen, and when the user accepts an answer by operating the touch panel on the question screen 111, the terminal 102 transmits the answer result to the search processing device 101.

  When the search processing apparatus 101 receives the answer result from the terminal 102, the search processing apparatus 101 displays the next question on the terminal 102 and accepts the answer from the user. In this way, the search processing apparatus 101 displays a plurality of questions on the terminal 102 and receives an answer from the user.

  For example, the tenth question 10 is displayed on the question screen 112 of the terminal 102. When an answer to the question 10 is received from the user on the question screen 112, the search processing apparatus 101 executes a search according to the combination of the received multiple answers.

  The search by the search processing device 101 is performed every time an answer to a question is received, for example. For example, the search processing apparatus 101 narrows down to 1000 books by searching when the first answer to the question 1 is received, and narrows down to 500 books by searching when the second answer to the question 2 is received. Perform a search and refine every time you accept. Then, for example, it is assumed that the search is performed when the ninth answer to the question 9 is received and narrowed down to 50 books, and the search when the 10th answer to the question 10 is received is narrowed down to 15 volumes.

  When the number of books is reduced to a predetermined number (for example, 20) or less by the search, the search processing apparatus 101 displays a search result screen 113 on the terminal 102 and presents the search result to the user. For example, the search result screen 113 displays the title of the book that is the search result. On the search result screen 113, an input indicating whether or not the book is desired by the user is received by a “Yes” button 121 and a “No” button 122.

  On the search result screen 113, two books are displayed. In the search result screen 113, for example, when the user swipes or pinches in the touch panel of the terminal 102, other 13 books out of the 15 books that have been narrowed down can be browsed. A list of all the books may be displayed.

  Here, it is assumed that an input indicating that a desired search target is included in the search result is made in accordance with the presentation of the search result. Specifically, it is assumed that a book with the displayed title is selected on the search result screen 113 and the “Yes” button 121 is selected. In this case, the search processing apparatus 101 displays details of the selected book, for example.

  On the other hand, it is assumed that an input indicating that a desired search target is not included in the search result is made in accordance with the presentation of the search result. Specifically, it is assumed that the displayed book is not selected on the search result screen 113 and the “No” button 122 is selected. In this case, as shown in (2), the search processing apparatus 101 uses the search result executed according to the combination of one or a plurality of answers excluding at least the last accepted answer among the plurality of accepted answers. The search result excluding the search result according to the answer is presented.

  The search result according to the last answer is, for example, the search result according to the answer to the last question. For example, the search result excluding the search result corresponding to the last answer is the search result excluding the search result corresponding to the tenth answer to the question 10, and specifically, up to the ninth answer to the question 9 It is a search result according to the answer. For this reason, the search processing apparatus 101 presents search results according to up to nine answers. Specifically, the search processing apparatus 101 displays a search result screen 114 on the terminal 102. The search result screen 114 displays the title of the book that is the search result. On the search result screen 114, an input indicating whether or not the book is desired by the user is received by a “Yes” button 121 and a “No” button 122.

  For example, if it is narrowed down to 50 books by the search when accepting the ninth answer, 35 books excluding the 15 books narrowed down by the search when accepting the 10th answer are presented. On the search result screen 114, two books are displayed. On the search result screen 114, for example, when the user swipes or pinches in the touch panel of the terminal 102, the other 33 of the narrowed down 35 books can be browsed. In addition, when the search processing apparatus 101 presents the search results when receiving the ninth answer (35 volumes), the search processing apparatus 101 can also display the search results when receiving the 10th answer (15 volumes). It is good.

  It is assumed that a book with the displayed title is selected on the search result screen 114 and the “Yes” button 121 is selected. In this case, for example, the search processing apparatus 101 displays details about the book of the selected title and ends the search processing.

  The search result corresponding to the last answer may include not only the search result corresponding to the answer to the last question but also other search results presented. Specifically, a search result corresponding to an answer to a question made before the last question may be included. More specifically, when an input indicating that a desired search target is not included in the search result is made, for example, the search processing apparatus 101 excludes the search result corresponding to the ninth answer. Search results corresponding to up to the eighth answer to question 8 are presented. Similarly, when an input indicating that a desired search target is not included in the search result is made, the search processing apparatus 101 responds to the mth answer to the question m (8 ≧ m ≧ 2). The search result according to the answer to the “m−1” th answer to the question m−1 excluding the search result is presented.

  As described above, the search processing apparatus 101 according to the embodiment sequentially receives answers for each of a plurality of questions. Thereby, the search processing apparatus 101 can obtain an answer in order for each of the plurality of questions.

  In addition, the search processing device 101 executes a search according to a combination of a plurality of received answers. Thereby, the search processing apparatus 101 can obtain a search result according to a combination of a plurality of answers.

  Here, in the presentation of the search result corresponding to the answer to the last question, the input indicating that the desired search target is not included in the search result is performed by the search corresponding to the answer to the last question. Couldn't search for books. For this reason, it is recognized that an effective search is not performed in the search according to the answer to the last question, that is, it is recognized that the answer to the last question is a memory difference of the user.

  For this reason, the search processing apparatus 101 excludes the search result corresponding to the last answer when an input indicating that the desired search target is not included in the search result is made according to the presentation of the search result. Present search results. Specifically, the search processing apparatus 101 searches for a search result corresponding to the last answer from a search result executed according to a combination of one or a plurality of answers excluding at least the last accepted answer among the plurality of accepted answers. Present search results excluding.

  Thereby, it is possible to present a search result excluding the last answer that is recognized as a user's memory difference, for example, it is possible to present a search result according to an answer up to one previous time. Therefore, since a search result in consideration of the user's memory difference can be presented, an object desired by the user can be efficiently searched.

(System configuration example of search system 200)
Next, a system configuration example of the search system 200 according to the embodiment will be described.

  FIG. 2 is an explanatory diagram of a system configuration example of the search system 200 according to the embodiment. In FIG. 2, the search system 200 is configured to include a server Sv and terminals T1 to Tn (n: a natural number of 1 or more). In the search system 200, the server Sv and the terminals T1 to Tn are connected via a wired or wireless network 210. The network 210 is, for example, the Internet, a mobile communication network, a LAN (Local Area Network), a WAN (Wide Area Network), or the like.

  In the following description, an arbitrary viewer terminal among the terminals T1 to Tn may be expressed as “terminal Ti” (i = 1, 2,..., N). The server Sv includes a question information DB 211 (Database), a main information DB 211, and a storage difference information DB 213. The contents stored in the various DBs 211 to 213 will be described later with reference to FIGS. The search processing apparatus 101 illustrated in FIG. 1 corresponds to the server Sv, for example.

  The terminal Ti is a computer used by a comic viewer. The terminal Ti is, for example, a smartphone, a mobile phone, a tablet PC, or the like. The terminal 102 shown in FIG. 1 corresponds to the terminal Ti, for example.

(Hardware configuration example of server Sv)
FIG. 3 is a block diagram illustrating a hardware configuration example of the server Sv. In FIG. 3, the server Sv includes a CPU (Central Processing Unit) 301, a memory 302, an I / F (Interface) 303, a disk drive 304, and a disk 305. Each component is connected by a bus 300.

  Here, the CPU 301 governs overall control of the server Sv. The memory 302 includes, for example, a ROM (Read Only Memory), a RAM (Random Access Memory), and a flash ROM. Specifically, for example, a flash ROM or ROM stores various programs, and a RAM is used as a work area for the CPU 301. The program stored in the memory 302 is loaded into the CPU 301 to cause the CPU 301 to execute the coded process.

  The I / F 303 is connected to the network 210 through a communication line, and is connected to another device (for example, the terminal Ti shown in FIG. 2) via the network 210. The I / F 303 serves as an interface between the network 210 and the own apparatus, and controls input / output of data from other apparatuses. For example, a modem or a LAN adapter may be employed as the I / F 303.

  The disk drive 304 controls reading / writing of data with respect to the disk 305 according to the control of the CPU 301. The disk 305 stores data written under the control of the disk drive 304. Examples of the disk 305 include a magnetic disk and an optical disk.

  The server Sv may include, for example, an SSD (Solid State Drive), a keyboard, a mouse, and a display in addition to the above-described components.

(Storage contents of various DBs 211 to 213)
Next, contents stored in the various DBs 211 to 213 included in the server Sv illustrated in FIG. 2 will be described with reference to FIGS. The various DBs 211 to 213 are realized by a storage device such as the memory 302 and the disk 305 shown in FIG.

  FIG. 4 is an explanatory diagram showing an example of the contents stored in the question information DB 211. In FIG. 4, the question information DB 211 has fields for question ID (Identification), question content, options, priority presentation age, and first weight. By setting information in each field, question information (for example, question information 400-1 to 400-4) is stored as a record.

  Here, question ID shows the identification information attached | subjected for every question. The question content indicates the question content to be presented to the user. The option indicates an answer that is presented to the user and accepted to be selected. The priority presentation age indicates an age range for giving priority to the corresponding question. Specifically, when a user's age when reading a book to be searched is an appropriate age, the corresponding question is presented with priority. The first weight is an evaluation value indicating whether or not effective narrowing is easily performed by the question. For example, a higher value indicates a question that is more effectively narrowed down. The question for which the effective narrowing is performed is, for example, a question that makes it difficult for the user to answer an error in memory. Further, the higher the first weight is, the more effective the narrowing down is, so that the question is easy to select.

  For example, in the question information 400-1, the question ID is “001”, the question content is “Which is the main character?”, The choice is “human, animal, other”, and the priority presentation age is “12 years or older”. The first weight indicates “1.5”. In addition to the examples shown in the figure, the question content includes, for example, "Is the book a series?", "Is the book a translated book?", "Where is the country in the story?" ”,“ Is the hero a man ”,“ How old is the hero? ”, Etc.

  FIG. 5 is an explanatory diagram showing an example of the contents stored in the information DB 212. In FIG. 5, the main information DB 212 includes fields for a main ID, title, author, first edition, and answer to each question. By setting information in each field, this information (for example, this information 500-1 to 500-3) is stored as a record.

  Here, this ID shows the identification information attached | subjected for every book. The title indicates the title of the book. The author indicates the author of the book. The first edition shows the year the book was first published. The answer to each question indicates the answer to each question. When an answer is received for each question, a book that matches the accepted answer is extracted, while a book that does not match the accepted answer is excluded, and narrowing down is performed.

  This information 500-1 indicates that the book ID is “1000000000”, the title is “Neko no Hotel”, the author is “XX Editorial Board”, and the first edition is “1985”. The information 500-1 indicates that the answer to the question 001 is “animal”, the answer to the question 002 is “yes”, the answer to the question 003 is “other”, and the answer to the question 004 is “other than picture book”. In the book “Cat Hotel” shown in the information 500-1, the answer to question 001 is “animal”, the answer to question 002 is “yes”, the answer to question 003 is “other”, and the answer to question 004 is “ This is a book that is selected when “other than a picture book” or the like is accepted.

  FIG. 6 is an explanatory diagram showing an example of the stored contents of the storage difference information DB 213. In FIG. 6, the storage difference information DB 213 has fields for a real ID, a question ID, and a second weight. By setting information in each field, storage difference information (for example, storage difference information 600-1 to 600-9) is stored as a record.

  Here, this ID shows the identification information attached | subjected for every book. Question ID shows the discernment information given for every question. The second weight is, for example, an evaluation value of a book (search target) indicating whether or not an answer of a different memory is easily given by the question. Specifically, the lower the value, the answer of the wrong memory to the question. Indicates that this is an easy-to-use book.

  More specifically, for example, it is assumed that there is a book that easily causes a memory difference when a cat is a hero even though a dog is a hero. When searching for this book, if the question “Is the cat the main character?” Is asked, an answer of “Yes” can be easily accepted, that is, an answer with a different memory is easily given. If such a wrong answer is made, it will not be included in the search results. In other words, if the desired book is likely to cause a memory difference, the desired book is not included in the search results. For this reason, the search processing apparatus 101 includes a book (search target) that easily causes a memory difference in the search result. For example, the search processing apparatus 101 includes it in the search result or presents the search range for the next answer. To search.

  For example, if the second weight is equal to or smaller than a predetermined value (for example, “2.0”), the search processing apparatus 101 includes the search result in the search result. As described above, the second weight is an evaluation value of a book indicating whether or not the book is likely to be answered with a different memory for each question, and even if it is not included in the search result, it is exceptionally included in the search result. It is a value used for judgment to

  The storage difference information 600-1 indicates that the real ID is “1000000000”, the question ID is “001”, and the second weight is “0.8”. Even if an answer to the question with the question ID “001” is accepted, the second weight of the book with the book ID “1000000000” shown in the memory difference information 600-1 is a predetermined value (eg, “2.0” or less). Therefore, even if it is not included in the search result, it is included in the search result.

(Example of functional configuration of server Sv)
FIG. 7 is a block diagram illustrating a functional configuration example of the server Sv. In FIG. 7, the server Sv includes a determination unit 701, a presentation control unit 702, an acceptance control unit 703, a search unit 704, a change unit 705, and a storage unit 710. Specifically, for example, the determination unit 701 to the change unit 705 may cause the CPU 301 to execute a program stored in a storage device such as the memory 302 and the disk 305 illustrated in FIG. Realize its function. The processing result of each functional unit is stored in a storage device such as the memory 302 and the disk 305, for example.

  The storage unit 710 is realized by a storage device such as the memory 302 and the disk 305, for example. Specifically, for example, the storage unit 710 stores various DBs 211 to 213 illustrated in FIGS.

  The storage unit 710 stores various information such as a book to be searched and a question for narrowing down the search target. The book is a book such as a picture book, a novel, a picture book, a comic, a magazine, but may include a newspaper, a catalog, and the like. The search target is not limited to a book, but may be a CD (Compact Disc), a DVD (Digital Versatile Disc), content, an automobile, or the like. The determination unit 701 determines a plurality of questions from the questions stored in the storage unit 710. The presentation control unit 702 is an output unit, for example, and causes the terminal Ti to present a plurality of questions determined by the determination unit 701. The presentation control unit 702 presents a plurality of questions one by one, but the plurality of questions may be displayed in a list.

  The reception control unit 703 is, for example, a reception unit, and receives responses in order for each of a plurality of questions. Specifically, the reception control unit 703 receives an answer to the question from the user via the terminal Ti. For example, the reception control unit 703 accepts answers one question at a time for each question presented one question at a time. However, the reception control unit 703 may receive answers collectively for a plurality of questions displayed in a list.

  In addition, the reception control unit 703 receives, for example, the user's date of birth and the age when a desired book is read before presenting a plurality of questions. The search unit 704 narrows down the books that become the search range in advance based on the date of birth of the user and the age when the desired book is read. Specifically, for example, the search unit 704 sets a search range in which the first version of the year is earlier than the year when the book was read. Thereby, the search range can be narrowed down in advance using the date of birth of the user or the age when the desired book is read.

  In addition, the search unit 704 executes a search according to a combination of a plurality of answers received by the reception control unit 703. Specifically, the search unit 704 performs a search according to a combination of a plurality of answers by performing a search every time an answer is received by the reception control unit 703. When the search result by the search unit 704 does not fall below the predetermined number, the determination unit 701 determines the next question. Then, the presentation control unit 702 presents the next question determined by the determination unit 701.

  On the other hand, when the search results by the search unit 704 are equal to or less than a predetermined number, the presentation control unit 702 presents the search results. The predetermined number is, for example, the number of book titles and authors that can fit on the list display screen, and specifically, 20 books. Note that when there is no search result corresponding to the search result by a plurality of searches by the search unit 704, the presentation control unit 702 may present the search result before the current search. When the search result is presented by the presentation control unit 702, the reception control unit 703 selects either one of an input indicating that the desired search target is included in the search result and an input indicating that the search result is not included. Accept input.

  In response to the presentation of the search result, when an input indicating that the desired search target is not included in the search result is made, the presentation control unit 702 displays the search result excluding the search result according to the last answer. Present. Specifically, the presentation control unit 702 retrieves a search result corresponding to the last answer from a search result executed according to a combination of one or a plurality of answers excluding at least the last accepted answer among the plurality of accepted answers. Present search results excluding.

  The search result according to the last answer is, for example, the search result according to the answer to the last question. Specifically, for example, when the reception control unit 703 has received W answers in total and an input indicating that the desired search target is not included in the search result is performed, the presentation control unit 702 The search result excluding the search result corresponding to the Wth answer is presented. Specifically, the presentation control unit 702 presents search results corresponding to one or a plurality of answers up to the W-1th item before the Wth item. However, the presentation control unit 702 only needs to be able to present the search result excluding the search result corresponding to the Wth answer. For example, the presentation control unit 702 randomly selects a combination from one or a plurality of answers up to the W-1th answer. You may show the search result obtained by. In addition, when presenting search results according to the answers up to the (W-1) th, the presentation control unit 702 may also present search results according to the Wth answer.

  In addition, the search result according to the last answer may include not only the search result according to the answer to the last question but also other search results presented, specifically, before the last question. A search result corresponding to an answer to the question made in the above may be included. More specifically, the presentation control unit 702 presents search results corresponding to the answers up to the (W-1) th answer, and an input indicating that the desired search target is not included in the search results is performed. The search result excluding the search result corresponding to the (W-1) th answer is presented. Specifically, the presentation control unit 702 presents search results corresponding to one or more answers up to the (W-2) th. Thereafter, in the same manner, when an input indicating that the desired search target is not included in the search result is made, the presentation control unit 702 excludes the presented search result, and up to the previous one. Present the search result according to the answer.

  Further, the changing unit 705 changes the evaluation value of the question presented at the end of the plurality of questions depending on whether or not an input indicating that the desired search target is not included in the search result is performed. The input indicating that the desired search target is not included in the search result means that the desired search result has not been obtained. For example, it is effective when the user makes an answer of a different memory. This means that no narrowing was performed. For this reason, if an input indicating that the desired search target is not included in the search result is performed, the last presented question is, for example, a question that is easy for a user to answer a wrong memory, and is effective. It is recognized that the question cannot be narrowed down.

  The evaluation value of the question is an evaluation value indicating whether or not effective narrowing down is easily performed by the question, and is, for example, the first weight (see FIG. 4). The higher the value, the more effective narrowing down is performed. Indicates that the question is The determination unit 701 determines a plurality of questions according to the evaluation value of the question. Specifically, the determination unit 701 preferentially determines a question having a higher evaluation value than a question having a lower evaluation value. Moreover, the determination part 701 changes the order which shows a some question according to the evaluation value of a question. Specifically, the determination unit 701 precedes the order in which questions with higher question evaluation values are presented. Thereby, the server Sv can perform effective narrowing down at an early stage in a plurality of searches.

  For example, the change unit 705 lowers the evaluation value of a question presented at the end of a plurality of questions when an input indicating that a desired search target is not included in the search result is performed. As a process for lowering the evaluation value of a question, the changing unit 705, for example, when an input indicating that a desired search target is included in a search result is performed, the evaluation value of a question presented at the end of a plurality of questions Subtract a specific value from The specific value is stored in advance in a storage device such as the memory 302 and the disk 305 by the developer of the search system 200, for example. This makes it difficult for the determination unit 701 to determine the question in subsequent search processing.

  Further, the changing unit 705 changes the evaluation value of the question presented at the end of the plurality of questions depending on whether or not an input indicating that a desired search target is included in the search result is performed. Specifically, the change unit 705 increases the evaluation value of the question presented at the end of the plurality of questions when an input indicating that a desired search target is included in the search result is performed. As a process for increasing the evaluation value of a question, the changing unit 705, for example, when an input indicating that a desired search target is included in a search result is performed, the evaluation value of a question presented at the end of a plurality of questions A specific value is added to.

  Specifically, when an input indicating that a desired search target is included in a search result is performed, a book that a user searches for a search result according to answers to a plurality of questions including the last question. This is the case. That is, it is a case where it is recognized that there is no answer of the user's memory difference for a plurality of questions. Therefore, it is recognized that the plurality of questions including the last question are questions that can be effectively narrowed down. For this reason, the changing unit 705 increases the evaluation values of a plurality of questions including the last question. For example, the changing unit 705 adds the specific value described above to the evaluation values of the plurality of questions including the last question. Thereby, in the subsequent search processing, a plurality of questions used until an input indicating that a desired search target is included can be easily determined by the determination unit 701.

  In addition, the determination unit 701 excludes the question from the plurality of questions when the evaluation value of the question becomes a predetermined value or less. For example, the determination unit 701 may refer to the evaluation value of the question when determining the question, and may exclude the question when the evaluation value of the referred question is equal to or less than a predetermined value. In addition, when the evaluation value of the question is equal to or less than a predetermined value, a flag indicating that is set, and the determination unit 701 refers to the flag when determining the question, and the evaluation value is predetermined. Questions below the value of may be excluded. The predetermined value is stored in advance in a storage device such as the memory 302 and the disk 305 by a developer of the search system 200, for example.

  Further, the changing unit 705 changes the evaluation value of the search target corresponding to the question depending on whether or not an input indicating that the desired search target is not included in the search result is performed. The evaluation value of the search target is an evaluation value of a book that indicates whether or not an answer of a different memory is easily given by the question. The evaluation value of the search target is a value used for determination to be included in the search result even if it is not included in the search result. Specifically, the evaluation value of the search target is, for example, the second weight (see FIG. 6), and the lower the value, the more likely it is that the answer to the corresponding question is easier to answer.

  The presentation control unit 702 presents a search result and a search target that is extracted from search targets that are not included in the search result based on the evaluation value of the search target. The search target is more easily extracted as the evaluation value of the search target is lower. For example, when the evaluation value of the search target is low, the presentation control unit 702 presents the search target and the search result even when the search target is not included in the search result. In addition, when the evaluation value of the search target is low, the search unit 704 includes the search target in the search range in the search according to the next answer even when the search target is not included in the search result. I do.

  For example, the change unit 705 decreases the evaluation value of the search target when an input indicating that the desired search target is not included in the search result is performed. More specifically, the case where an input indicating that the desired search target is not included in the search result is performed is a case where the book to be searched by the user is not included in the search result according to the answer to the question. Yes, that is, when it is recognized that there was an answer to the question with a different memory. For this reason, since it is recognized that it is a search target in which a wrong answer is easily answered to a question, the evaluation value of the search target corresponding to the question is lowered. As a result, in the subsequent search processing, a search target corresponding to a question that is likely to be answered in a different memory can be presented in the search result even if it is not included in the search result. For example, the changing unit 705 subtracts the specific value from the search target evaluation value corresponding to the question as the process of lowering the evaluation value. The specific value is stored in advance in a storage device such as the memory 302 and the disk 305 by the developer of the search system 200, for example.

  Further, the changing unit 705 changes the evaluation value of the search target corresponding to the question depending on whether or not an input indicating that the desired search target is included in the search result is performed. Specifically, the change unit 705 increases the evaluation value of the search target corresponding to each question when an input indicating that the desired search target is included in the search result is performed. More specifically, the case where an input indicating that a desired search target is included in the search result is a case where a book to be searched for by the user is included in the search result according to answers to a plurality of questions. That is, it is a case where it is recognized that there is no answer of wrong memory for a plurality of questions. For this reason, it is recognized that this search target is a search target in which it is difficult for a plurality of questions to be answered with different memories. Therefore, the evaluation value of the search target corresponding to each question is increased. Thereby, in the subsequent search processing, if a search target corresponding to a question for which it is difficult to answer a difference in memory is not included in the search result, it can be excluded from the search result as it is. For example, the changing unit 705 adds the specific value to the evaluation value of the search target corresponding to the question.

  The server Sv may have a function of performing a search using a normal keyword. In this case, the user may be able to select a function for performing a search using a keyword and a function for performing a search by receiving an answer to a question. As a result, when the user remembers the keyword, the user can input the keyword and perform a search, and the search can be performed efficiently. In addition, when the user does not remember the keyword, an answer to the question can be received and searched, so that the function of performing a search using a normal keyword can be supplemented and the search can be performed efficiently.

(Example of screen displayed on terminal Ti)
FIG. 8 is an explanatory diagram illustrating an example of a basic information input screen displayed on the terminal Ti. In FIG. 8, a basic information input screen 800 is a screen that is displayed on the touch panel of the terminal Ti and receives input of basic information of the user. The basic information is the year of birth and the age at which you read the book you are searching for. When the user inputs the year of birth and the age at which the book was read, the button 801 becomes operable. Then, when the button 801 is operated by the user, for example, the question shown in FIG. 9 is presented.

  FIG. 9 is an explanatory diagram illustrating an example of a question screen displayed on the terminal Ti. In FIG. 9, a question screen 900 is a screen on which a question is displayed on the touch panel of the terminal Ti and an answer from a user can be accepted for the question. The question screen 900 displays a question “What is the genre of the story?” The answer button 901 displays “Gakuen”, “History”, “SF (Science Fiction)”, and “Other” buttons so that the user can operate any one of them. Is selected. When answers to a plurality of questions are received and the search results become a predetermined number or less, the search results shown in FIG. 10 are presented.

  FIG. 10 is an explanatory diagram (part 1) illustrating an example of a search result screen displayed on the terminal Ti. In FIG. 10, a search result screen 1000 is a screen on which a book search result is displayed on the touch panel of the terminal Ti and a response from the user as to whether or not the book that is being searched for has been found can be received. In the search result screen 1000, two books are displayed.

  In the search result screen 1000, two books are displayed for convenience of explanation, but a list of up to a predetermined number of books (for example, 20 books) can be displayed. Also, in the search result screen 1000, the user can browse other narrowed books by swiping or pinching in the touch panel of the terminal Ti.

  On the search result screen 1000, either “Yes” button 1001 or “No” button 1002 is displayed to be selectable in response to the question “Have you found the book you are looking for?” ing. If any one of the displayed title books is selected and the “Yes” button 1001 is selected, a detailed screen for the selected title book is displayed, and the search process is terminated, for example. On the other hand, if the “No” button 1002 is selected on the search result screen 1000, the search result shown in FIG. 11 is displayed.

  FIG. 11 is an explanatory diagram (part 2) illustrating an example of a search result screen displayed on the terminal Ti. In FIG. 11, a search result screen 1100 is a screen on which a book search result is displayed on the touch panel of the terminal Ti, and an answer from the user as to whether or not the book being searched for has been found can be received. The search result screen 1100 is a search result excluding the search result corresponding to the tenth answer, specifically, the search result corresponding to the ninth answer. On the search result screen 1100, two books are displayed.

  On the search result screen 1100, two books are displayed for convenience of explanation. However, when the user swipes or pinches in the touch panel of the terminal Ti, the search results corresponding to the ninth answer are displayed. Other books that are can be viewed.

  On the search result screen 1100, either “Yes” button 1001 or “No” button 1002 is displayed to be selectable in response to the question “Have you found the book you are looking for?” ing.

  If the “No” button 1002 is selected on the search result screen 1100, the search result shown in FIG. 11 is displayed. This is a search result excluding the search result corresponding to the ninth answer, and specifically, the search result corresponding to the eighth answer. When an input indicating that the desired search target is not included in the search result, that is, when the “No” button 1002 is selected, the search result corresponding to the previous answer is displayed. repeat. If input indicating that the desired search target is not included in the search result continues to be performed, for example, if the search result corresponding to the first answer is displayed, the “No” button 1002 becomes unselectable, and the search process is performed. Ends.

  On the other hand, if any one of the displayed title books is selected and the “Yes” button 1001 is selected, a detailed screen 1110 about the selected title book is displayed, and for example, search processing is performed. finish. When the book with the selected title is a book desired by the user, when the user selects the “Register to children's bookshelf” button 1111, a storage screen 1200 provided for each individual user (see FIG. 12). Migrate to

  FIG. 12 is an explanatory diagram (part 1) illustrating an example of a storage screen displayed on the terminal Ti. In FIG. 12, a storage screen 1200 is a screen provided for each individual user and indicating that information on books that are desired to be borrowed or books that are desired to be purchased is stored. The storage screen 1200 is a screen that can be browsed by inputting a user ID and password. The storage screen 1200 includes, for example, files of “books recommended for children” and “books to read from now on”. In a “book to be read from now on” file, information about a book that the user wants to read in the future is stored by user registration. In the “book to be recommended for children” file, for example, information on books that the user's children want to read is stored by user registration. The “book to recommend to children” file is linked to a file accessible to the child of the user.

  When the user selects “books recommended for children” on the storage screen 1200, a provision screen 1210 is displayed. A book selected by the user is input to the provision screen 1210. Thereby, the book which a user recommends to his child is registered.

  FIG. 13 is an explanatory diagram (part 2) illustrating an example of a storage screen displayed on the terminal Ti. In FIG. 13, a storage screen 1300 is provided for each child of the user and is a screen indicating that information on an interesting book or a book recommended by a parent is stored. The storage screen 1300 is a screen that can be browsed by inputting the child's child ID and password. The storage screen 1300 includes, for example, files of “interesting book” and “mom book”. In the “interesting book” file, a book that the child of the user himself / herself has read is stored by his / her registration operation. In addition, the “Mother's book” file is linked to, for example, the user's (parent's) “book recommended for children” file (see FIG. 12), and can be accessed by the user's children. is there.

  When the child of the user selects “Mom's book” on the storage screen 1300, a receipt screen 1310 is displayed. The receipt screen 1310 displays book information recommended by the parent. Thereby, the user's child can check the book recommended by the user's parent.

(Server Sv Search Process Procedure)
Next, the search processing procedure of the server Sv will be described with reference to FIGS.

  FIG. 14 is a flowchart (part 1) illustrating an example of the search processing procedure of the server Sv. FIG. 15 is a flowchart (part 2) illustrating an example of the search processing procedure of the server Sv. FIG. 16 is a flowchart (part 3) illustrating an example of the search processing procedure of the server Sv. In the flowchart of FIG. 14, first, the server Sv determines whether or not a request for starting a search for a book has been received from the user via the terminal Ti (step S1401). Here, the server Sv waits until accepting a search start request (step S1401: No).

  When the server Sv receives a search start request (step S1401: Yes), the server Sv displays an input screen for the year the user was born and the age at which the book was read (step S1402). Next, the server Sv determines whether or not the input of the year the user was born and the age at which the book was read has been completed (step S1403). Here, the server Sv waits until the input of the year the user was born and the age at which the book was read is completed (step S1403: No).

  When the server Sv completes the input of the year the user was born and the age at which the book was read (step S1403: Yes), the first version is “born year + the age at which the book was read + 10” from the input information. The previous book is narrowed down (step S1404). For example, if the year of birth is 1986 and the age of reading a book is nine years old, the book will be narrowed down to books before 1986 + 9 + 10 = 2005. “10” is a set value in consideration of an error when there is a difference between the age of reading the book stored by the user and the age of actually reading the book, and may be another set value. In this way, by narrowing down the books using the age at which the user read the book, for example, books published in the last few years can be excluded from the search range, so the search can be performed efficiently. Can do.

  Then, the server Sv compares the age of reading the book with the priority presentation age, and extracts the corresponding question from the question information DB 211 (step S1405). Then, the server Sv selects a question having a high first weight from the extracted questions (step S1406). In other words, the server Sv gives priority to the question with the higher evaluation value of the question, and first selects the order in which the question with the higher evaluation value of the question is presented. Next, the server Sv determines whether or not the first weight of the selected question is equal to or less than a predetermined value (step S1501). The first weight being equal to or less than the predetermined value means that effective narrowing down cannot be performed due to the question.

  If the first weight is equal to or less than the predetermined value (step S1501: Yes), the server Sv proceeds to step S1508. If the first weight is not less than or equal to the predetermined value (step S1501: No), the server Sv determines whether an answer has been received from the user (step S1502). Here, the server Sv waits until an answer is received from the user (step S1502: No). When the server Sv receives an answer from the user (step S1502: Yes), the server Sv extracts a book applicable to the answer from the information DB 212 (step S1503).

  Next, the server Sv determines whether the book is likely to cause a memory difference due to the question (step S1504). More specifically, the book in which a memory difference is likely to occur due to the question is, specifically, the second weight corresponding to the question ID (question) among the books indicated by the book ID in the memory difference information DB 213 (see FIG. 6) is a predetermined value. (For example, “2.0”) or less (book ID). It should be noted that the second weight indicates that the lower the value, the easier the answer to the question is to answer differently.

  When the server Sv determines that the book is not likely to cause a memory difference due to the question (step S1504: No), the server Sv proceeds to step S1506. When the server Sv determines that the book is likely to cause a memory difference due to the question (step S1504: Yes), the server Sv includes the book in the search result (step S1505).

  Next, the server Sv determines whether or not the number of books has been narrowed down to a certain number (step S1506). If the server Sv has not narrowed down to a certain number of books (step S1506: No), the server Sv determines whether there is a question that is not displayed (step S1507). If there is a question that is not displayed (step S1507: Yes), the server Sv proceeds to step S1405 in FIG. The server Sv displays a list of books when the number of books has been narrowed down (step S1506: Yes) or when there is no question not displayed (step S1507: No) (step S1508).

  Then, the server Sv determines whether or not the book that the user was looking for has been found (step S1601). Specifically, for example, the server Sv determines whether or not the button 1001 is selected on the search result screens 1000 and 1100 (see FIGS. 10 and 11). If the book that the user was looking for is not found (step S1601: No), the server Sv determines whether a search result corresponding to the answer to the first question is displayed (step S1602).

  When the server Sv does not display the search result corresponding to the answer to the first question (step S1602: No), the server Sv displays the first weight of the question displayed last and the second weight of the book corresponding to the question. Lower (step S1603). The value for reducing each weight is a value set in advance for each weight, for example, “0.1”. The last displayed question is, for example, a question that is recognized as having a memory difference in answer because the book desired by the user was not found. Then, the server Sv displays a list of books narrowed down in the case of the question immediately before the last displayed question (step S1604), and proceeds to step S1601.

  On the other hand, when the server Sv displays the search result corresponding to the answer to the first question (step S1602: Yes), the server Sv displays “The book you were looking for was not found” (step S1605), A series of processing by this flowchart is complete | finished.

  In step S1601, when the book that the user was looking for is found (step S1601: Yes), the server Sv increases the first weight of the corresponding question and the second weight of the book corresponding to each question ( Step S1606). The value for increasing each weight is a value set in advance for each weight, for example, “0.1”. The relevant question is, for example, a question that is presented until the user finds a desired book and is recognized as having no memory difference in answer.

  Next, the server Sv determines whether or not “Register in children's bookshelf” (see “Register in children's bookshelf” button 1111 in FIG. 11) has been selected (step S1607). When “Register in children's bookshelf” is not selected (step S1607: No), the server Sv determines whether or not the processing is finished (step S1608). The term “end” means to end without selecting “Register in children's bookshelf” or to register in “Books to be read” (see FIG. 12).

  When it is determined that the server Sv has not ended (step S1608: No), the server Sv proceeds to step S1607. When the server Sv determines that the processing has ended (step S1608: Yes), the series of processing according to this flowchart ends. When “Register to children's bookshelf” is selected (step S1607: Yes), the server Sv registers the book to be recommended for children (step S1609), and ends the series of processes in this flowchart.

  As described above, in the embodiment, the server Sv receives an answer in order for each of a plurality of questions. Thereby, server Sv can obtain an answer in order about each of a plurality of questions. Further, the server Sv can allow the user to keep track of each question, and can assist the user to remember the desired book.

  Further, the server Sv executes a search according to the combination of the received plurality of answers. Thereby, the server Sv can obtain a search result corresponding to a combination of a plurality of answers.

  The server Sv also retrieves the search result excluding the search result corresponding to the last answer when an input indicating that the desired search target is not included in the search result is made according to the presentation of the search result. Present. Specifically, the server Sv excludes a search result corresponding to the last answer from a search result executed according to a combination of one or a plurality of answers excluding at least the last accepted answer among a plurality of accepted answers. Presents the search results.

  As a result, the server Sv can present a search result excluding the last answer that is recognized as a difference in the memory of the user, for example, a search result corresponding to the previous answer. Therefore, the server Sv can present a search result considering the user's memory difference, and can efficiently search for an object desired by the user. Therefore, the server Sv can find the book desired by the user while helping to correct the memory difference in the process of finding the book read in the past.

  Further, the server Sv changes the evaluation value (first weight) of the question presented at the end of the plurality of questions depending on whether or not an input indicating that the desired search target is not included in the search result is performed. . Specifically, the server Sv changes the evaluation value (first weight) of a question presented at the end of a plurality of questions when an input indicating that the desired search target is not included in the search result is performed. To do. Thereby, the evaluation value of the question that cannot be effectively narrowed down can be lowered. Therefore, in subsequent search processing, the server Sv can make it difficult to select a question that cannot be effectively narrowed down. For this reason, the server Sv can search for an object efficiently.

  Further, the server Sv changes the evaluation value of the question according to whether or not an input indicating that a desired search target is included in the search result is performed. Specifically, the server Sv changes the evaluation value (first weight) of a question presented at the end of a plurality of questions when an input indicating that a desired search target is included in the search result is performed. . As a result, the server Sv can increase the evaluation value of the question that has been effectively narrowed down. Therefore, in the subsequent search processing, the server Sv can easily select a question that can be effectively narrowed down. For this reason, the server Sv can search for an object efficiently.

  The server Sv determines a plurality of questions according to the evaluation value of the question. Thereby, server Sv can present the question with the said high evaluation value which can perform effective narrowing down. Therefore, the server Sv can search for an object efficiently.

  Further, the server Sv changes the order in which a plurality of questions are presented according to the evaluation value of the question. Thereby, the server Sv can preferentially present a question with a high evaluation value that can be effectively narrowed down. Therefore, the server Sv can search for an object efficiently.

  Further, the server Sv excludes the question from the plurality of questions when the evaluation value of the question becomes a predetermined value or less. As a result, the server Sv can be prevented from presenting a question with a low evaluation value that cannot be effectively narrowed down. Therefore, the server Sv can search for an object efficiently.

  Further, the server Sv changes the evaluation value of the search target corresponding to the question depending on whether or not an input indicating that the desired search target is not included in the search result is performed. Specifically, the server Sv changes the evaluation value (second weight) of the search target when an input indicating that the desired search target is not included in the search result is performed. Thereby, it is possible to lower the evaluation value of a search target that is recognized as a search target that is easily answered with a different memory for a question. Therefore, in the subsequent search processing, search targets corresponding to questions that are likely to be answered with different memories are included in the search results even if they are not included in the search results, or search according to the next answer Can also be included in the search range. For this reason, the server Sv can search for an object efficiently.

  Further, the server Sv changes the evaluation value of the search target according to whether or not an input indicating that the desired search target is included in the search result is performed. Specifically, the server Sv changes the evaluation value (second weight) of the search target when an input indicating that the search result includes the desired search target is performed. Thereby, it is possible to increase the evaluation value of a search target that is recognized as a search target that is difficult to be answered with a wrong memory for a question. Therefore, in the subsequent search processing, the server Sv may not include the search target corresponding to the question that is difficult to answer with a wrong memory if it is not included in the search result. it can. For this reason, the server Sv can search for an object efficiently.

  Further, the server Sv preliminarily narrows down the search range by using the date of birth of the user and the age when the desired book is read before presenting a plurality of questions. Thus, the server Sv can narrow down the search range in advance using the date of birth of the user or the age at which the desired book is read, so that the object can be searched efficiently.

  The following additional notes are disclosed with respect to the embodiment described above.

(Appendix 1) Accepting answers in turn for each of the multiple questions,
Perform a search according to the combination of accepted responses,
In response to the presentation of the search result, when an input indicating that the desired search target is not included in the search result is made, one or more excluding at least the last accepted answer from among the plurality of accepted answers Presenting a search result obtained by excluding the search result according to the last answer from the search result executed according to the combination of the answers of
A search processing method, wherein a computer executes the processing.

(Additional remark 2) The said computer performs the process which changes the evaluation value of the question shown at the end of the said several questions according to whether the input which shows that a desired search object is not included in a search result was performed The search processing method according to supplementary note 1, wherein:

(Supplementary note 3) The supplementary note 2 is characterized in that the computer executes a process of changing the evaluation value of the question depending on whether or not an input indicating that a desired search target is included in the search result is performed. The search processing method described.

(Supplementary note 4) The search processing method according to supplementary note 2 or 3, wherein the computer executes a process of determining the plurality of questions according to an evaluation value of the question.

(Supplementary note 5) The search process according to any one of supplementary notes 2 to 4, wherein the computer executes a process of changing an order of presenting the plurality of questions in accordance with an evaluation value of the question. Method.

(Additional remark 6) When the evaluation value of the said question becomes below a predetermined value, the said computer performs the process which excludes this question from said several questions, Any one of Additional remark 2-5 The search processing method described in 1.

(Additional remark 7) The said computer performs the process which changes the evaluation value of the search object corresponding to a question according to whether the input which shows that a desired search object is not included in a search result was performed The search processing method according to any one of appendices 1 to 6.

(Additional remark 8) The said computer performs the process which changes the evaluation value of the said search object according to whether the input which shows that a desired search target is contained in a search result was performed, The said computer executes The search processing method described in.

(Additional remark 9) The said computer performs the process which presents a search result and the search object extracted based on the evaluation value of the said search object from the search objects not contained in this search result, It is characterized by the above-mentioned. The search processing method according to appendix 7 or 8,

(Appendix 10) Accepting answers in turn for each of a plurality of questions
Perform a search according to the combination of accepted responses,
In response to the presentation of the search result, when an input indicating that the desired search target is not included in the search result is made, one or more excluding at least the last accepted answer from among the plurality of accepted answers Presenting a search result obtained by excluding the search result according to the last answer from the search result executed according to the combination of the answers of
A search processing program for causing a computer to execute processing.

(Supplementary Note 11) A receiving unit that receives an answer in turn for each of a plurality of questions;
A search unit that executes a search according to a combination of a plurality of received responses;
In response to the presentation of the search result, when an input indicating that the desired search target is not included in the search result is made, one or more excluding at least the last accepted answer from among the plurality of accepted answers An output unit for presenting a search result excluding the search result according to the last answer from the search result executed according to the combination of answers;
A search processing apparatus comprising:

101 Search processing device 102, Ti terminal 211 Question information DB
212 Information DB
213 Memory difference information DB
301 CPU
302 Memory 303 I / F
304 disk drive 305 disk 701 determination unit 702 presentation control unit 703 reception control unit 704 search unit 705 change unit 710 storage unit Sv server

Claims (11)

We accept answers in turn for each of multiple questions,
Perform a search according to the combination of accepted responses,
In response to the presentation of the search result, when an input indicating that the desired search target is not included in the search result is made, one or more excluding at least the last accepted answer from among the plurality of accepted answers Presenting a search result obtained by excluding the search result according to the last answer from the search result executed according to the combination of the answers of
A search processing method, wherein a computer executes the processing.   The computer executes a process of changing an evaluation value of a question presented at the end of the plurality of questions in accordance with whether or not an input indicating that a desired search target is not included in a search result is performed. The search processing method according to claim 1.   The search according to claim 2, wherein the computer executes a process of changing the evaluation value of the question according to whether or not an input indicating that a desired search target is included in the search result is performed. Processing method.   The search processing method according to claim 2 or 3, wherein the computer executes a process of determining the plurality of questions according to an evaluation value of the question.   The search processing method according to any one of claims 2 to 4, wherein the computer executes a process of changing an order of presenting the plurality of questions in accordance with an evaluation value of the question.   The computer executes a process of excluding the question from the plurality of questions when the evaluation value of the question becomes a predetermined value or less. Search processing method.   The computer executes a process of changing an evaluation value of a search target corresponding to a question according to whether or not an input indicating that a desired search target is not included in a search result is performed. The search processing method as described in any one of 1-6.   8. The computer according to claim 7, wherein the computer executes a process of changing an evaluation value of the search target according to whether or not an input indicating that the search result includes a desired search target is performed. Search processing method.   The computer executes a process of presenting a search result and a search target extracted based on an evaluation value of the search target from search targets not included in the search result. Or the search processing method according to 8. We accept answers in turn for each of multiple questions,
Perform a search according to the combination of accepted responses,
In response to the presentation of the search result, when an input indicating that the desired search target is not included in the search result is made, one or more excluding at least the last accepted answer from among the plurality of accepted answers Presenting a search result obtained by excluding the search result according to the last answer from the search result executed according to the combination of the answers of
A search processing program for causing a computer to execute processing. A receiving unit that receives an answer in turn for each of a plurality of questions;
A search unit that executes a search according to a combination of a plurality of received responses;
In response to the presentation of the search result, when an input indicating that the desired search target is not included in the search result is made, one or more excluding at least the last accepted answer from among the plurality of accepted answers An output unit for presenting a search result excluding the search result according to the last answer from the search result executed according to the combination of answers;
A search processing apparatus comprising:

Images