Patent Application
20060010117
The disclosed methods and apparatus systems relate generally to searching for information from a database.
Search engines assist a user in identifying information that may be stored on a computer server or other information storage media. Generally, the information may be is in the form of a database (e.g., any structured database, any database of objects with tags or descriptors). The information may include, for example, various web page content, photographs, goods or services for sale, or any other item that can be represented and stored in electronic format. Some examples of commonly used search engines include, but are not limited to Yahoo®, MSN®, Google™, amazon.com®, a9.com, AOL®, Lycos®, LookSmart®, Altavista™, Ask Jeeves®, Orbitz™, Travelocity®, expedia.com®, and flickr.com™.
Search engines typically require the user to enter one or a plurality of keywords, and in some cases, to specify one or a plurality of Boolean operators to determine the logical relationship between the pluralities of keywords. This provision of one or more keywords and/or optional Boolean operators is referred to as the “search query.” A search engine executes one or more algorithms which act on the search query to identify one or a plurality of items of information that satisfy the search query (this information is commonly referred to as “search results”). The search engine generally returns the results of the search algorithm by presenting them to the user through some form of a user interface (e.g. display). In some instances, when a plurality of search results is available, the search engine may further determine which specific results to present to the user according to some criteria (e.g. ranking, optimization). The user is then able to select one or a plurality of search results. If none of the results is satisfactory, or if additional results are sought, the user can select to view additional results, or the user can refine or modify the search query, for example, by adding or removing one or more keywords and/or optional Boolean operators.
In addition to conventional search engines, which may execute various proprietary algorithms to process search queries and provide results according to some type of ranking of optimization process, a search query may be executed by a web directory service. Unlike a search engine, a web directory service that is capable of processing a search query returns to the user lists and categories of web sites, as search results, without necessarily ranking, promoting or optimizing the list of web sites. One example of a web directory service includes the Open Directory Project, hosted and administered by Netscape Communication Corporation (see http://dmoz.org).
Search engines and web directory services (also referred to herein as “search components”) generally are designed to identify as closely as possible a specific piece (or specific pieces) of information that the user is seeking. To provide satisfactory results, the search component typically relies on the ability of the user to provide a “good” search query. Applicants have recognized and appreciated, however, that there may be a situation in which the user is not able to create a good search query. Examples of such a situation include, but are not limited to, (a) when the user does not know exactly what he or she is searching for; and (2) when there is a very large number of results that satisfy the user's initial search query to the search component. In these and perhaps other instances, the user can become frustrated with the inability of the search component to provide a meaningful set of results; in effect, a traditional search query including one or more keywords and/or Boolean operators does not render satisfactory results.
Applicants have also recognized and appreciated that for at least some search applications (including the examples provided above in which the user does not know exactly what he or she is looking for, or when there is a large number of results), affording the user with the ability to subjectively evaluate search results, or otherwise interact with the search component, may facilitate the generation of significantly more satisfactory search results in an iterative fashion.
In view of the foregoing, various embodiments of the present disclosure are directed to methods and apparatus for interactive searching. In one exemplary embodiment, a user is presented with information (e.g., the results of a search provided by a search component executing a search query). The user then subjectively evaluates the information presented pursuant to some metric (e.g., desirable/positive, undesirable/negative, neutral) to provide user feedback. The user feedback is evaluated using one or more evolutionary algorithms to generate a new search query, which may be executed by any one of a number of conventional search components (or a commercial or non-commercial website powered by a search component) to provide new information to the user. The foregoing process may be iterated any number of times, for example, until a user identifies desirable information. In some implementations, additional user interaction is permitted, such as modification of one or more descriptors/characteristics associated with presented information, and/or modification of a search query generated by the evolutionary algorithm(s).
In various embodiments, the disclosed methods and apparatus enable a user to search for information when the search may not be easily expressed through keywords and/or Boolean operators, and/or when the desired result is not known a priori and/or may include a subjective evaluation on behalf of the user.
In one exemplary implementation, the disclosed methods and apparatus employ an interactive search function that begins by presenting the user with a plurality of items of information through some form of user interface (e.g., a computer display). The user is able to assign one or more subjective values to one or more items (e.g., via a computer mouse or keyboard), which are then evaluated to formulate a new search query. Based on the new search query, the interactive search function identifies a new set of items that match more closely the subjective evaluation of the user, and presents the new items to the user through the user interface. The user again is able to assign a subjective value to any of the items, and the process is repeated. As this interactive search process continues, the disclosed methods and apparatus provide the user with results that are increasingly satisfactory to the user.
In one illustrative embodiment, a user is searching for a gift. The user may begin with little idea of a desired gift. A user interface (e.g., including a conventional computer display and selection device such as a mouse or keyboard) may be configured to display to the user a grid of images representing an initial selection of gift items, generated either randomly or pursuant to some previous query executed by a search component. Optionally, the user can specify some basic data about the intended recipient of the gift (i.e., one or more constraints), to formulate a narrower initial selection of gifts. Via the user interface, the user assigns a subjective value to one or more candidate gifts (e.g., by clicking on one or more icons next to each image representing satisfaction or dissatisfaction). The user then clicks a button to initiate a new search, based at least in part on the assigned subjective value(s), to present a new set of gift images. The user continues this process until a satisfactory gift is found. Based on the foregoing general process, it should be readily appreciated that a user may similarly search for items other than gifts, some examples of which include, but are not limited to, a variety of goods or services for purchase, a venue for a vacation, a parcel of real estate, an image from an image library, a filter and its parameter settings to produce an artistic modification of an image, and other items.
The disclosed methods and apparatus thus provide ways of searching for information when the specific item being sought is not known a priori or when there is a vast number of items that could satisfy the user. The disclosed methods and apparatus may be employed with virtually any search component (e.g. search engine or web directory service) or in any other environment in which search techniques are commonly used (e.g., to search databases stored on some medium). The disclosed methods and apparatus allow the user to conduct a search in an interactive (and iterative) fashion, providing subjective evaluation to guide the search.
In sum, one embodiment of the present disclosure is directed to a method, comprising acts of: A) evaluating first information to provide first feedback on the first information; and B) evaluating the first feedback using at least one evolutionary algorithm to generate a search query.
Another embodiment is directed to a computer-readable medium having computer-readable signals stored thereon that define instructions which, as a result of being executed by a computer, instruct the computer to perform a method comprising acts of: A) permitting a user to evaluate first information to provide first feedback on the first information; and B) evaluating the first feedback using at least one evolutionary algorithm to generate a search query.
Another embodiment is directed to a method performed using a computer system having a user interface including a display and a selection device. The method comprises is acts of: A) displaying first information on the display; B) permitting a user to evaluate the first information via the selection device to provide first feedback on the first information; and C) evaluating the first feedback using at least one evolutionary algorithm to generate a search query.
Another embodiment is directed to a system, comprising at least one first component configured to convey first information to a user, at least one second component configured to permit the user to evaluate the first information to provide first feedback on the first information, and at least one processor configured to evaluate the first feedback using at least one evolutionary algorithm to generate a search query.
Another embodiment is directed to a search method, comprising acts of: A) executing a first search query to generate first information, the first information including a plurality of items, each item of the plurality of items being associated with at least one characteristic; B) encoding the at least one characteristic associated with each item as at least one gene of a genetic string associated with each item; C) permitting a user to assign a subjective value to at least one item of the plurality of items to provide first feedback; D) applying at least one evolutionary algorithm to at least the genetic string associated with the at least one item, based on the first feedback, to generate a second search query; and E) executing the second search query to generate second information.
Another embodiment is directed to a computer-readable medium having computer-readable signals stored thereon that define instructions which, as a result of being executed by a computer, instruct the computer to perform a search method comprising acts of: A) executing a first search query to generate first information, the first information including a plurality of items, each item of the plurality of items being associated with at least one characteristic; B) encoding the at least one characteristic associated with each item as at least one gene of a genetic string associated with each item; C) permitting a user to assign a subjective value to at least one item of the plurality of items to provide first feedback; D) applying at least one evolutionary algorithm to at least the genetic string associated with the at least one item, based on the first feedback, to generate a second search query; and E) executing the second search query to generate second information.
Another embodiment is directed to a search method performed using a computer system having a user interface including a display and a selection device. The search method comprises acts of: A) executing a first search query to generate first information, the first information including a plurality of items, each item of the plurality of items being associated with at least one characteristic; B) encoding the at least one characteristic associated with each item as at least one gene of a genetic string associated with each item; C) displaying the first information on the display; D) permitting a user to assign, via at least the selection device, a subjective value to at least one item of the plurality of items to provide first feedback; E) applying at least one evolutionary algorithm to at least the genetic string associated with the at least one item, based on the first feedback, to generate a second search query; and F) executing the second search query to generate second information.
Another embodiment is directed to a system, comprising a search component configured to execute a first search query to generate first information, the first information including a plurality of items, each item of the plurality of items being associated with at least one characteristic, a first component configured to convey the first information to a user, and a second component configured to permit the user to assign a subjective value to at least one item of the plurality of items to provide first feedback. The system further comprises at least one third component configured to encode the at least one characteristic associated with each item as at least one gene of a genetic string associated with each item, and apply at least one evolutionary algorithm to at least the genetic string associated with the at least one item, based on the first feedback, to generate a second search query. The search component is further configured to execute the second search query to generate second information.
The present disclosure also incorporates herein by reference the entirety of U.S. non-provisional application Ser. No. 10/815,321, filed Apr. 1, 2004, entitled “Methods and Systems for Interactive Search.”
It should be appreciated that all combinations of the foregoing concepts and additional concepts discussed in greater detail below are contemplated as being part of the inventive subject matter disclosed herein. In particular, all combinations of claimed subject matter appearing at the end of this disclosure are contemplated as being part of the inventive subject matter disclosed herein.
a, 3b and 3c provide illustrations of some of the concepts discussed in connection with
a, 4b, 5a and 5b provide illustrations of some of the concepts discussed in connection with
a and 6b provide illustrations of some of the concepts discussed in connection with
To provide an overall understanding, certain illustrative embodiments will now be described; however, it will be understood by one of ordinary skill in the art that the apparatus and methods described herein can be adapted and modified to provide apparatus and methods for other suitable applications and that other additions and modifications can be made without departing from the scope of the systems and methods described herein.
Unless otherwise specified, the illustrated embodiments can be understood as providing exemplary features of varying detail of certain embodiments. Therefore, unless otherwise specified, features, components, modules, and/or aspects of the illustrations can is be otherwise combined, separated, interchanged, and/or rearranged without departing from the disclosed systems or methods.
Interactive search is a way of presenting information to a user and letting the user provide feedback to improve the quality of the search until a desirable item is found. Interactive search differs fundamentally from other search methods in that it is geared toward searches in which the user does not exactly know what he is looking for, or when a normal search may return a vast number of items. In both of these circumstances, Applicants have recognized and appreciated that identifying the specific item(s) of interest to the user may be facilitated by an evaluation of the user's subjective preferences.
One exemplary embodiment of the disclosed methods and apparatus is described in overview in
It should be appreciated that although the exemplary process depicted in
In the embodiment illustrated in
In another embodiment not specifically depicted in
In block 210 of
In block 215 of
In other aspects, the user may select a subjective value from at least two or more possible subjective values to indicate the relative desirability of a given item in the search results. For example, by merely selecting (highlighting) a given item, the user may indicate that item's desirability. Non-selected (non-highlighted) items may then be considered as undesirable. In another aspect, the user may assign a positive value to desirable items, a negative value to undesirable items, and one or more items not particularly addressed by the user may be assigned a neutral value. In yet another aspect, the user may assign a subjective value for a given item from within a range of possible values between some minimum value and some maximum value (e.g., a degree of fitness, weight, grade or rank). In yet another aspect, a subjective value for one or more items may be assigned based on a user's response time to comment on a given item. The forgoing examples are provided primarily for purposes of illustration, and are not intended as limiting. Additionally, as discussed above, various options for assigning a subjective value to one or more items in the search results may be facilitated via the use of a computer display is and/or selection device (e.g., keyboard, mouse).
In block 220 of the interactive search process illustrated in
In block 225 of
In block 230 of the process 120 shown in
In one embodiment, to facilitate the execution of one or more evolutionary algorithms in block 230, one or more characteristics associated with each item, or one or more characteristics that have been modified by a user (as discussed above in connection with block 220), are encoded as one or more “genes” in a genetic string associated with each item. Hence, each item in the search results may be associated with a corresponding genetic string that includes one or more genes, wherein each gene represents a characteristic of the item (e.g., a tag, keyword, comment, identifier, descriptor, attribute, etc., as discussed above).
In block 230, once one or more such genetic strings are assembled, the evolutionary algorithm including one or more genetic operators is then applied to the one or more genetic strings associated with one or more items. Genetic strings are considered in the evolutionary algorithm based on their corresponding “fitness,” i.e., the user feedback (subjective value) assigned to the one or more items with which the strings are associated, to generate a new search query in block 235.
In various aspects, the genetic operators applied by an evolutionary algorithm in block 230 may include, but are not limited to, a selection operator, a mutation operator, a recombination operator, a crossover operator, a directed operator, a constraint operator, and a preservation (elitism) operator. For purposes of the present disclosure, and as would be readily understood by one of ordinary skill in the relevant arts, an evolutionary algorithm (also referred to as a genetic algorithm or program) generally is concerned with three possible factors, namely: 1) a population of one or more “parents” that may be randomly initialized (e.g., in the process 120, a “parent” may be considered as a genetic string associated with a given item in the search results); 2) one or more mutation operators capable of altering at least one “parent” to a “neighboring solution” (this process also may be referred to as a “local search operator”); and 3) a recombination operator which can recombine genetic strings of two parents into a “child” that inherits traits from both parents (this process also may be referred to as a “global search operator”).
In connection with evolutionary algorithms as applied herein, an exemplary mutation operation may be generally understood to potentially introduce randomness to the process, as a mutation operator may be configured to delete one or more genes of a given genetic string, or add one or more random genes to a given genetic string. Exemplary recombination operations can include reproduction, mutation, preservation (e.g., elitism) and/or crossover, where crossover can be understood to be the combination of two individuals (the “parents”) to produce one or more offspring (the “children”) (i.e., a crossover operator may be configured to combine genes of at least two given genetic strings to produce one or more offspring). Those of ordinary skill will recognize that a crossover operator may include asexual crossover and/or single-child crossover. Accordingly, crossover can be more generally understood to provide genetic material from a previous generation to a subsequent generation. In one exemplary evolutionary algorithm that may be employed in an implementation of the process 120 shown in
Variations of evolutionary algorithms, and different genetic operators used in various combinations, several of which are suitable for the process 120 shown in
As discussed above, in block 235 of
In block 245 of the process 120 outlined in
Once new search results are generated in block 250, block 255 indicates that the user optionally may define a filter that is applied to the newly generated results. For example, in one exemplary implementation, the user may define one or more constraints (e.g., provide only those results that cost less than $100, provide only green items, provide only 10 items) to selectively filter out possibly undesirable results from the newly generated results.
As indicated in
With reference again to
In one exemplary implementation, the computer 115 includes a computer-readable medium 115-4 (e.g., various types of memory, compact disk, floppy disk, etc.) having computer-readable signals stored thereon that define instructions which, as a result of being executed by the one or more processors of the computer, instruct the computer to perform various steps or acts of the interactive search process 120. In another implementation, the interactive search process 120 is configured to “sit on top of” a conventional search component invoked by the user of the computer, by obtaining one or more characteristics or “genes” associated with a given item of information via the search component's API, and providing new search queries to the search component via its API.
According to various embodiments, the user may interact with the search process 120 via a number of possible techniques involving the display 115-1 and one or more selection devices 115-2. For example, as discussed above, information representing search results may be displayed on the display 115-1 in a variety of textual and/or graphical (e.g., iconic) formats. The user may utilize one or both of the display 115-1 and one or more of the selection devices 115-2 to click on/select/highlight various items of displayed information to provide some type of user feedback (e.g., assignment of subjective value to an item).
In one exemplary embodiment in which respective items of information are represented as images or diagrams surrounded by a border, a user may click on an item to change its evaluation between neutral (e.g., no border), positive (e.g., grey or some other color border) or negative (e.g., crossed out). In another embodiment, the user may obtain additional information about a particular item (e.g., characteristics or genes associated with the item) by letting a cursor hover over the image or diagram corresponding to the item or right clicking over the image or diagram corresponding to the item, for example. In yet another embodiment, an image or diagram corresponding to one or more items may be associated with a small slider, entry box, or pull-down/drop-down box, etc., displayed near or over the image or diagram. In the example of a slider, the user may adjust the slider with one of the selection devices to assign a subjective value to the item within a range of values from some minimum value to some maximum value represented on the slider. In the example of an entry box or pull-down/drop-down box, the user may manually enter a value from the keyboard, or select a value from amongst multiple possibilities conveyed by a menu. In yet another embodiment, the user may select a degree of randomness in generating new search queries through a slider representing two extremes labeled “Guide Me” and “Surprise Me,” corresponding respectively to low and high degrees of randomness. It should be appreciated that the foregoing examples are provided primarily for purposes of illustration, and that various embodiments of the present disclosure are not necessarily limited in these respects.
a, 3b and 3c provide another illustrative embodiment of some of the concepts discussed above.
Yet another exemplary embodiment implementing various concepts according to the present disclosure includes a web-based system that enables the user to select a venue for a vacation. When looking for a vacation, most Internet-bases search engines such as Orbitz™, travelocity®, and expedia.com® can offer information about specific hotels, resorts, etc., but require the user to have a clear idea of (e.g., to specify) a destination. In many cases, a person looking for a vacation destination may only have an approximate idea of a destination/time, e.g., “I want to spend one week in January someplace warm with my husband and two children.” With existing travel sites, the user has to select a geographical area, and look through a list of possible venues (e.g., selected on the basis of price range) to identify one with the desired characteristics. However, the user may initially have no idea of which particular geographical locations are satisfactory, and even if s/he has an idea of the geographical area (e.g., the Caribbean), s/he may not know which specific locations and which venues at that location satisfy her/his constraints.
Some online vacation sites allow a user to specify a number of criteria in a sequential fashion, for instance by starting with a specific location, then selecting price range, activity types, etc.; however, in this way, the search is narrowed unnecessarily and may cause a user to overlook some potentially suitable alternatives. For example, if a user begins by selecting the Caribbean, s/he may eventually identify a resort in Cancun, but there may have been other venues (e.g., Canary Islands) which have similar and perhaps more desirable characteristics, where such other venues which were not presented to the user after the initial decision.
In view of the foregoing, in one embodiment, the user is presented with a grid of images, each image being a picture representing one venue. Below each image may be a row of icons representing key characteristics of the property, such as cost, style (single, couple, family, . . . ), geographical location, etc. A second row below the image can include simple iconographic buttons that allow the user to obtain additional information in a pop-up window (e.g., view additional photos, read client reviews, determine availability), to provide evaluative feedback about the property (this can be as simple as a thumbs-up/thumbs-down pair, or a slider), to save this property to a folder representing the user's current selection portfolio, and/or to actually make a reservation at this property.
In one aspect of this embodiment, the display below the entire grid of images may include one or more buttons and sliders, including a button to generate a refined set of properties based on the user's feedback, a button to start with a fresh random set of properties, a slider labeled with the extreme values “Surprise me” and “Guide me” which determine the level of randomness of the search as described for the previous embodiment, a button that brings the user to her current portfolio of selections, and navigation buttons to trace backwards and forward through the selections made during a given search session.
In other aspects of this embodiment, an additional set of buttons, pull-down menus, radio buttons, and/or text entry boxes can be included. Through these various devices, the user can specify a filter, i.e., one or more constraints, that apply to all searched properties. For instance, if the user wants only family-oriented resorts by the sea, s/he can specify these criteria to ensure that inappropriate properties are not selected during search.
Based on her personal preferences, the user selects Frame A 410 and Frame F 415 (as depicted by the striped frames). One or more evolutionary algorithms of the interactive search process 120 utilize the “genes” (e.g., tags) associated with the items in Frame A 410 and Frame F 415 and feed a new search query, based mutations and recombinations of the genes, into the Amazon search engine. The search engine generates a new population of search results (
As shown in
a depicts Frame C 420 as being replaced with the musical “Chicago,” which was the search result for the query “Chicago.” The user can continue with the Interactive Search Process by selecting Frame A 410 and Frame C 420. This new search generates an offspring (e.g. mutation and recombination) that combines the genes (e.g., characteristics, tags) of these two new themes. As shown in
According to one aspect, the embodiment illustrated in
The embodiment illustrated in
The disclosed methods and systems can additionally be used to identify a set of parameters or characteristics rather than selecting one item out of an existing set of items. Consider for example the process of modifying a digital image. Programs such as Photo-Shop or Paint Shop Pro provide the user with a large set of filters that alter the content of the image. For example, there are filters that can change contrast, brightness, tint, saturation and color balance. There are also many filters that apply artistic or geometric effects such as emboss, charcoal, paintbrush, leather, kaleidoscope, warp, solarize, mosaic, etc. Each of these filters typically is associated with one or more parameters that modify the extent or nature of the filter. For instance,
Accordingly, the problem of selecting filters and parameters can be understood to be a search problem that requires an understanding of the user's subjective evaluation, and that has a potentially vast set of results, as provided herein.
Another embodiment of the disclosed methods and systems presents the user with a grid of images. Images in the grid are generated by applying a randomly chosen effect filter with a random set of parameters. A separate panel shows the original image for comparison. Each image in the grid is associated with a set of buttons and sliders that enable to user to provide feedback on his/her subjective evaluation of that image, a button that allows the user to manually adjust parameters using the current image as a starting point, and/or a button/interface that allows the user to save the image to a folder.
Below the entire grid of images, the example embodiment includes buttons and sliders, including a button to generate a new set of images based on the user's feedback, a button to start with a fresh random set of images, a slider which determines the level of randomness of the search as described for previous embodiments, and navigation buttons to trace backwards and forward through the selections made during a given search session.
In additional embodiments, the items being searched might include any of the following: homes, automobiles, financial instruments (such as stocks or bonds), service providers, legal documents, scientific articles, art, images, web pages, recruitment candidates, potential employers, etc., with such examples provided for illustration and not limitation. In the context of selecting parameters, as was shown in the embodiment for selecting parameters for image effect filters, additional embodiments can be envisioned for design of mechanical systems, architectural elements, artistic designs, etc. The above are meant as partial lists, as various embodiments can be applied to any search in which the results come from a potentially vast set of choices.
As used herein, a “user interface” is an interface between a human user and a computer that enables communication between the user and the computer. A user interface may include an auditory indicator such as a speaker, and/or a graphical user interface (GUI) including one or more displays. A user interface also may include one or more selection devices including a mouse, a keyboard, a keypad, a track ball, a microphone, a touch screen, a game controller (e.g., a joystick), etc., or any combinations thereof.
As used herein, an “application programming interface” or “API” is a set of one or more computer-readable instructions that provide access to one or more other sets of computer-readable instructions that define functions, so that such functions can be configured to be executed on a computer in conjunction with an application program, in some instances to communicate various data, parameters, and general information between two programs.
The various methods, acts thereof, and various embodiments and variations of these methods and acts, individually or in combination, may be defined by computer-readable signals tangibly embodied on one or more computer-readable media, for example, non-volatile recording media, integrated circuit memory elements, or a combination thereof. Such signals may define instructions, for example, as part of one or more programs, that, as a result of being executed by a computer, instruct the computer to perform one or more of the methods or acts described herein, and/or various embodiments, variations and combination thereof. Such instructions may be written in any of a plurality of programming languages or using any of a plurality of programming techniques.
For example, various methods according to the present disclosure may be programmed using an object-oriented programming language. Alternatively, functional, scripting, and/or logical programming languages may be used. Various aspects of the disclosure may be implemented in a non-programmed environment (e.g., documents created in HTML, XML or other format that, when viewed in a window of a browser program, render aspects of a graphical-user interface (GUI) or perform other functions). Various aspects of the disclosure may be implemented as programmed or non-programmed elements, or combinations thereof.
A given computer-readable medium may be transportable such that the instructions stored thereon can be loaded onto any computer system resource to implement various aspects of the present disclosure. In addition, it should be appreciated that the instructions stored on the computer-readable medium are not limited to instructions embodied as part of an application program running on a host computer. Rather, the instructions may be embodied as any type of computer code (e.g., software or microcode) that can be employed to program a processor to implement various aspects of the present disclosure.
Having thus described several illustrative embodiments, it is to be appreciated that various alterations, modifications, and improvements will readily occur to those skilled in the art. Such alterations, modifications, and improvements are intended to be part of this disclosure, and are intended to be within the spirit and scope of this disclosure. While some examples presented herein involve specific combinations of functions or structural elements, it should be understood that those functions and elements may be combined in other ways according to the present disclosure to accomplish the same or different objectives. In particular, acts, elements, and features discussed in connection with one embodiment are not intended to be excluded from similar or other roles in other embodiments. Accordingly, the foregoing description and attached drawings are by way of example only, and are not intended to be limiting.
The present application claims the benefit under 35 U.S.C. § 119(e) of U.S. Provisional Patent Application Ser. No. 60/585,807, filed on Jul. 6, 2004, entitled “Methods and Systems for Interactive Search,” which is hereby incorporated herein by reference.
| Number | Date | Country | |
|---|---|---|---|
| 60585807 | Jul 2004 | US |
