Patent Grant
9613166
The present disclosure relates generally to computer query processing, and more specifically to electronic search suggestions of related entities based on co-occurrence and/or fuzzy score matching.
Users frequently use search engines for locating information of interest either from the Internet or any database system. Search engines commonly operate by receiving a search query from a user and returning search results to the user. Search results are usually ordered based on the relevance of each returned search result to the search query. Therefore, the quality of the search query may be significantly important for the quality of search results. However, search queries from users, in most cases, may be written incomplete or partial (e.g., the search query may not include enough words to generate a focused set of relevant results and instead generates a large number of irrelevant results), and sometimes misspelled (e.g., Bill Smith may be incorrectly spelled as “Bill Smith”).
One common approach to improve the quality of the search results is to enhance the search query. One way to enhance the search query may be by generating possible suggestions based on the user's input. For this, some approaches propose methods for identifying candidate query refinements for a given query from past queries submitted by one or more users. However, these approaches are based on query logs that sometimes may lead the user to results that may not be of interest. There are other approaches using different techniques that may not be accurate enough. Thus, there still exists a need for methods that improve or enhance search queries from users to get more accurate results and also present users with useful related entities of interest as they type the search query.
A method for generating search suggestions of related entities based on co-occurrence and/or fuzzy score matching is disclosed. In one aspect of the present disclosure, the method may be employed in a computer search system that may include a client/server type architecture. In one embodiment, the search system may include a user interface to a search engine in communication with one or more server devices over a network connection. The server device may include one or more processors executing instructions for a plurality of special purpose computer modules, including an entity extraction module and a fuzzy-score matching module, as well as an entity co-occurrence knowledge base database. The knowledge base may be built as an in-memory database and may also include other components, such as one or more search controllers, multiple search nodes, collections of compressed data, and a disambiguation module. One search controller may be selectively associated with one or more search nodes. Each search node may be capable of independently performing a fuzzy key search through a collection of compressed data and returning a set of scored results to its associated search controller.
In another aspect of the present disclosure, the method may include performing partial entity extractions, by an entity extraction module, from provided search queries to identify whether the search query refers to an entity, and if so, to determine the entity type. Furthermore, the method may include generating algorithms, by a fuzzy-score matching module, corresponding to the type of entity extracted and performing a search against an entity co-occurrence knowledge base. Additionally, the query text parts that are not detected as entities are treated as conceptual features, such as topics, facts, and key phrases that can be employed for searching the entity co-occurrence knowledge base. The entity co-occurrence knowledge base, which may already have a repository where entities may be indexed as entities to entities, entities to topics, or entities to facts, among others, may return fast and accurate suggestions to the user to complete the search query.
In a further aspect of the present disclosure, the completed search query may be used as a new search query. The search system may process the new search query, run an entity extraction, find related entities with the highest scores from the entity co-occurrence knowledge base, and present said related entities in a drop down list that may be useful for the user.
In one embodiment, a method is disclosed. The method comprises receiving, by an entity extraction computer, user input of partial search query parameters from a user interface, the partial search query parameters having at least one incomplete search query parameter, extracting, by the entity extraction computer, one or more first entities from the partial search query parameters by comparing the partial search query parameters with an entity co-occurrence database having instances of co-occurrence of the one or more first entities in an electronic data corpus and identifying at least one entity type corresponding to the one or more first entities in the partial search query parameters, and selecting, by a fuzzy-score matching computer, a fuzzy matching algorithm for searching the entity co-occurrence database to identify one or more records associated with the partial search query parameters, wherein the fuzzy matching algorithm corresponds to the at least one identified entity type. The method further includes searching, by the fuzzy-score matching computer, the entity co-occurrence database using the selected fuzzy matching algorithm and forming one or more first suggested search query parameters from the one or more records based on the search, presenting, by the fuzzy-score matching computer, the one or more first suggested search query parameters via the user interface, receiving by the entity extraction computer, user selection of the one or more first suggested search query parameters so as to form completed search query parameters, and extracting, by the entity extraction computer, one or more second entities from the completed search query parameters. The method further includes searching, by the entity extraction computer, the entity co-occurrence database to identify one or more entities related to the one or more second entities so as to form one or more second suggested search query parameters, and presenting, by the entity extraction computer, the one or more second suggested search query parameters via the user interface.
In another embodiment, a system is disclosed. The system comprises one or more server computers having one or more processors executing computer readable instructions for a plurality of computer modules including an entity extraction module configured to receive user input of partial search query parameters from a user interface, the partial search query parameters having at least one incomplete search query parameter, the entity extraction module being further configured to extract one or more first entities from the partial search query parameters by comparing the partial search query parameters with an entity co-occurrence database having instances of co-occurrence of the one or more first entities in an electronic data corpus and identifying at least one entity type corresponding to the one or more first entities in the partial search query parameters. The system further includes a fuzzy-score matching module configured to select a fuzzy matching algorithm for searching the entity co-occurrence database to identify one or more records associated with the partial search query parameters, wherein the fuzzy matching algorithm corresponds to the at least one identified entity type. The fuzzy-score matching module is further configured to search the entity co-occurrence database using the selected fuzzy matching algorithm and form one or more first suggested search query parameters from the one or more records based on the search, and present the one or more first suggested search query parameters via the user interface. Additionally, the entity extraction module is further configured to receive user selection of the one or more first suggested search query parameters so as to form completed search query parameters, extract one or more second entities from the completed search query parameters, search the entity co-occurrence database to identify one or more entities related to the one or more second entities so as to form one or more second suggested search query parameters, and present the one or more second suggested search query parameters via the user interface.
As used here, the following terms may have the following definitions:
“Entity extraction” refers to computer information processing methods for extracting information such as names, places, and organizations.
“Corpus” refers to a collection of one or more electronic documents.
“Features” is any information which is at least partially derived from a document.
“Module” refers to one or more computer hardware and/or software components suitable for carrying out at least one or more tasks.
“Fact” refers to objective relationships between features.
“Entity knowledge base” refers to an electronic database containing features/entities.
“Query” refers to an electronic request to retrieve information from one or more suitable databases.
“Topic” refers to a set of thematic information which is at least partially derived from a corpus.
The present disclosure can be better understood by referring to the following figures. The components in the figures are not necessarily to scale, emphasis instead being placed upon illustrating the principles of the disclosure. In the figures, reference numerals designate corresponding parts throughout the different views.
The present disclosure is herein described in detail with reference to embodiments illustrated in the drawings, which form a part hereof. Other embodiments may be used and/or other changes may be made without departing from the spirit or scope of the present disclosure. The illustrative embodiments described in the detailed description are not meant to be limiting of the subject matter presented herein.
Reference will now be made to the exemplary embodiments illustrated in the drawings, and specific language will be used herein to describe the same. It will nevertheless be understood that no limitation of the scope of the invention is thereby intended. Alterations and further modifications of the inventive features illustrated herein, and additional applications of the principles of the inventions as illustrated herein, which would occur to one skilled in the relevant art and having possession of this disclosure, are to be considered within the scope of the present disclosure.
Embodiments of the present disclosure introduce a novel electronic search suggestion generation mechanism which is different from the existing mechanisms that are based on mining and ranking the activity of the search system's global users' past search queries. The presented search suggestion mechanism, is based on employing an entity co-occurrence knowledge base in its core, along with fuzzy matching modules and entity extraction modules. The entity co-occurrence knowledge base, is an electronic repository where entities may be indexed as entities to entities, entities to topics, or entities to facts among others, and stored in a way to allow faster and weighted responses. In brief, the user partial/complete queries are processed on-the-fly to detect entities (entity extraction), misspelled variations (fuzzy matching) of the entities and other conceptual features. These features are employed to search (fuzzy score matching) entity co-occurrence knowledge base to suggest search queries and possible expansions/suggestions of the accurate entities intended by the user, which will lead to a more accurate search experience. Further, once the suggested entity is chosen, the proposed system would suggest related entities that are present in the entity co-occurrence knowledge base, which will lead to an improved consecutive search experience, as discussed in further detail in
A search engine 104 may include, but is not limited to, an interface via a web-based tool that enables users to locate information on the World Wide Web. Search engine 104 may also include tools that enable users to locate information within internal database systems. Server device 106, which may be implemented in a single server device 106 or in a distributed architecture across a plurality of server computers, may include an entity extraction module 110, a fuzzy-score matching module 112, and an entity co-occurrence knowledge base database 114.
Entity extraction module 110 may be a hardware and/or software computer module able to extract and disambiguate on-the-fly independent entities from a given set of queries such as a query string, partial query, structured data and the like. Example of entities may include people, organizations, geographic locations, dates and/or time. During the extraction, one or more feature recognition and extraction algorithms may be employed. Also, a score may be assigned to each extracted feature, indicating the level of certainty of the feature being correctly extracted with the correct attributes. Taking into account the feature attributes, the relative weight or relevance of each of the features may be determined. Additionally, the relevance of the association between features may be determined using a weighted scoring model.
Fuzzy-score matching module 112 may include a plurality of algorithms that may be adjusted or selected according to the type of entity extracted from a given search query. The function of the algorithms may be to determine whether the given search query (input) and suggested searched strings are similar to each other, or approximately match a given pattern string. Fuzzy matching may also be known as fuzzy string matching, inexact matching, and approximate matching. Entity extraction module 110 and fuzzy-score matching module 112 may work in conjunction with Entity co-occurrence knowledge base 114 to generate search suggestions for the user.
According to various embodiments, entity co-occurrence knowledge base 114 may be built, but is not limited to, as an in-memory database and may include components such as one or more search controllers, multiple search nodes, collections of compressed data, and a disambiguation module. One search controller may be selectively associated with one or more search nodes. Each search node may be capable of independently performing a fuzzy key search through a collection of compressed data and returning a set of scored results to its associated search controller.
Entity co-occurrence knowledge base 114 may include related entities based on features and ranked by a confidence score. Various methods for linking the features may be employed, which may essentially use a weighted model for determining which entity types are most important, which have more weight, and, based on confidence scores, determine how confident the extraction of the correct features has been performed.
In one embodiment, method 200 may initiate when a user starts typing a search query, step 202, in the search engine 104, as described above in
In fuzzy-score matching step 208, extracted entity or entities, as well as any non-entities, may be searched and compared against entity co-occurrence knowledge base 114. Extracted entity or entities may include incomplete names of persons, for example first name and the first character of the last name, abbreviations of organizations, for example “UN” that may stand for “United Nations”, short forms, and nicknames among others. Entity co-occurrence knowledge base 114 may already have registered a plurality of records indexed in an structured data, such as entity to entity, entity to topics, and entity to facts index among others. This may allow fuzzy-score matching in step 208 to happen expeditiously. Fuzzy-score matching may use, but is not limited to, a common string metric such as Levenshtein distance, strcmp95, ITF scoring, and the like. Levenshtein distance between two words may refer to the minimum number of single-character edits required to change one word into the other.
Once fuzzy-score matching in step 208 step finishes comparing and searching the search query against all records in the entity co-occurrence knowledge base 114, the record that dominates the most or is the closest to match the given pattern string of the search query input may be selected as first candidate for a search suggestion, step 210. Other records with less proximity to match the given pattern string of the search query input may be placed under the first candidate in a descending order. Search suggestion in step 210 may then be presented to the user in a drop down list of possible matches that the user may select to complete the query.
In another embodiment, after the user selects a match of his/her interest, search system 100 may take that selection as a new search query, step 212. Subsequently, an entity extraction step 214 from said new search query may be performed. During the extraction, one or more feature recognition and extraction algorithms may be employed. Also, a score may be assigned to each extracted feature, indicating the level of certainty of the feature being correctly extracted with the correct attributes. Taking into account the feature attributes, the relative weight or relevance of each of the features may be determined. Additionally, the relevance of the association between features may be determined using a weighted scoring model. Entity extraction module 110 may then run a search against entity co-occurrence knowledge base 114 to find related entities, step 216, based on the co-occurrences with the highest scores. Finally, a drop down list of search suggestions, in step 218, including related entities, may be presented to the user before performing the actual search of the data in the electronic document corpus.
Following the method 200, as the user types “Michael J”, the entity extraction module 110 performs a quick search on-the-fly of the first word (Michael) against entity co-occurrence knowledge base 114 to identify the type of entity, in this example, the entity may refer to the name of a person. Subsequently, fuzzy-score matching module 112 may select a string match algorithm tailored for names of persons. Name of persons may be found in databases written in different forms such as using only initials (short forms), or first name and first character of the last name, or first name, initial of the middle name and last name, or any combination thereof. Fuzzy-score matching module 112 may use a common string metric such as Levenshtein distance to determine and assign a score to the entity, topic, or fact within entity co-occurrence knowledge base 114 that may match the entity “Michael”. In this example, Michael matches with a great amount of records having that name. However, as the user types the following character “J”, fuzzy-score matching module 112 may perform another comparison based on Levenshtein distance against all co-occurrences with Michael with the entity co-occurrence knowledge base 114. Entity co-occurrence knowledge base 114 may then select all possible matches with the highest scores for “Michael J”. For example, fuzzy-score matching module 112 may return search suggestions 310 to complete “Michael J” such as “Michael Jackson”, “Michael Jordan”, “Michael J. Fox”, or even “Michael Dell” in some cases to the user. The user may then be able to either select from the drop down list one of the persons suggested, or ignore the suggestion and keep typing. Expanding on the aforementioned example, a query like “Michael the basketball player”, would lead to the suggestion of “Michael Jordan”, based on the results returned by searching Entity co-occurrence knowledge base for “Michael” in person entity name variations and “the basketball player” in the co-occurrence features like key phrases, facts, topics, and the like. Another example can be “Alexander the actor”, would lead to the suggestion of “Alexander Polinsky”. As those skilled in the art will realize, the existing search platforms cannot provide suggestions generated in the aforementioned manner.
In this embodiment, the user may select “Michael Jordan” from the drop down list to complete the partial query 304, as indicated in
While various aspects and embodiments have been disclosed, other aspects and embodiments are contemplated. The various aspects and embodiments disclosed are for purposes of illustration and are not intended to be limiting, with the true scope and spirit being indicated by the following claims.
The foregoing method descriptions and the process flow diagrams are provided merely as illustrative examples and are not intended to require or imply that the steps of the various embodiments must be performed in the order presented. As will be appreciated by one of skill in the art the steps in the foregoing embodiments may be performed in any order. Words such as “then,” “next,” etc. are not intended to limit the order of the steps; these words are simply used to guide the reader through the description of the methods. Although process flow diagrams may describe the operations as a sequential process, many of the operations can be performed in parallel or concurrently. In addition, the order of the operations may be re-arranged. A process may correspond to a method, a function, a procedure, a subroutine, a subprogram, etc. When a process corresponds to a function, its termination may correspond to a return of the function to the calling function or the main function.
The various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the embodiments disclosed here may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
Embodiments implemented in computer software may be implemented in software, firmware, middleware, microcode, hardware description languages, or any combination thereof. A code segment or machine-executable instructions may represent a procedure, a function, a subprogram, a program, a routine, a subroutine, a module, a software package, a class, or any combination of instructions, data structures, or program statements. A code segment may be coupled to another code segment or a hardware circuit by passing and/or receiving information, data, arguments, parameters, or memory contents. Information, arguments, parameters, data, etc. may be passed, forwarded, or transmitted via any suitable means including memory sharing, message passing, token passing, network transmission, etc.
The actual software code or specialized control hardware used to implement these systems and methods is not limiting of the invention. Thus, the operation and behavior of the systems and methods were described without reference to the specific software code being understood that software and control hardware can be designed to implement the systems and methods based on the description here.
When implemented in software, the functions may be stored as one or more instructions or code on a non-transitory computer-readable or processor-readable storage medium. The steps of a method or algorithm disclosed here may be embodied in a processor-executable software module which may reside on a computer-readable or processor-readable storage medium. A non-transitory computer-readable or processor-readable media includes both computer storage media and tangible storage media that facilitate transfer of a computer program from one place to another. A non-transitory processor-readable storage media may be any available media that may be accessed by a computer. By way of example, and not limitation, such non-transitory processor-readable media may comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other tangible storage medium that may be used to store desired program code in the form of instructions or data structures and that may be accessed by a computer or processor. Disk and disc, as used here, include compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk, and Blu-ray disc where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media. Additionally, the operations of a method or algorithm may reside as one or any combination or set of codes and/or instructions on a non-transitory processor-readable medium and/or computer-readable medium, which may be incorporated into a computer program product.
The preceding description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined here may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown here but is to be accorded the widest scope consistent with the following claims and the principles and novel features disclosed here.
This application claims priority to and is a continuation of co-pending U.S. patent application Ser. No. 14/558,159 entitled “Search Suggestions of Related Entities Based on Co-Occurrence and/or Fuzzy-Score Matching,” filed Dec. 2, 2014, which claims priority to U.S. Provisional Application No. 61/910,905, filed Dec. 2, 2013, entitled “Search Suggestions of Related Entities Based on Co-Occurrence and/or Fuzzy-Score Matching,” which is hereby incorporated by reference in its entirety. This application is related to U.S. patent application Ser. No. 14/557,794, entitled “Method for Disambiguating Features in Unstructured Text,” filed Dec. 2, 2014; U.S. patent application Ser. No. 14/558,300, entitled “Event Detection Through Text Analysis Using Trained Event Template Models,” filed Dec. 2, 2014; U.S. patent application Ser. No. 14/558,101, entitled “Non-Exclusionary Search Within In-Memory Databases,” filed Dec. 2, 2014; and U.S. patent application Ser. No. 14/558,036, entitled “Search Suggestions Fuzzy-Score Matching and Entity Co-Occurrence,” filed Dec. 2, 2014; each of which are incorporated herein by reference in their entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 6128660 | Grimm et al. | Oct 2000 | A |
| 6178529 | Short et al. | Jan 2001 | B1 |
| 6226635 | Katariya | May 2001 | B1 |
| 6266781 | Chung et al. | Jul 2001 | B1 |
| 6353926 | Parthesarathy et al. | Mar 2002 | B1 |
| 6738759 | Wheeler et al. | May 2004 | B1 |
| 6832373 | O'Neill | Dec 2004 | B2 |
| 6832737 | Karlsson et al. | Dec 2004 | B2 |
| 7058846 | Kelkar et al. | Jun 2006 | B1 |
| 7099898 | Nakamura et al. | Aug 2006 | B1 |
| 7370323 | Marinelli et al. | May 2008 | B2 |
| 7421478 | Muchow | Sep 2008 | B1 |
| 7447940 | Peddada | Nov 2008 | B2 |
| 7543174 | Van Rietschote et al. | Jun 2009 | B1 |
| 7681075 | Havemose et al. | Mar 2010 | B2 |
| 7818615 | Krajewski et al. | Oct 2010 | B2 |
| 7899871 | Kumar et al. | Mar 2011 | B1 |
| 7984043 | Waas | Jul 2011 | B1 |
| 8055933 | Jaehde et al. | Nov 2011 | B2 |
| 8122026 | Laroco et al. | Feb 2012 | B1 |
| 8341622 | Eatough | Dec 2012 | B1 |
| 8345998 | Malik et al. | Jan 2013 | B2 |
| 8356036 | Bechtel et al. | Jan 2013 | B2 |
| 8375073 | Jain | Feb 2013 | B1 |
| 8423522 | Lang et al. | Apr 2013 | B2 |
| 8429256 | Vidal et al. | Apr 2013 | B2 |
| 8589429 | Thirumalai | Nov 2013 | B1 |
| 8726267 | Li et al. | May 2014 | B2 |
| 8782018 | Shim et al. | Jul 2014 | B2 |
| 8995717 | Cheng et al. | Mar 2015 | B2 |
| 9009153 | Khan et al. | Apr 2015 | B2 |
| 9025892 | Lightner et al. | May 2015 | B1 |
| 9032387 | Hill et al. | May 2015 | B1 |
| 20010037398 | Chao et al. | Nov 2001 | A1 |
| 20020031260 | Thawonmas et al. | Mar 2002 | A1 |
| 20020165847 | McCartney et al. | Nov 2002 | A1 |
| 20020174138 | Nakamura | Nov 2002 | A1 |
| 20030028869 | Drake et al. | Feb 2003 | A1 |
| 20030033288 | Shanahan et al. | Feb 2003 | A1 |
| 20030112792 | Cranor et al. | Jun 2003 | A1 |
| 20030158839 | Faybishenko et al. | Aug 2003 | A1 |
| 20030182282 | Ripley | Sep 2003 | A1 |
| 20040010502 | Bomfim et al. | Jan 2004 | A1 |
| 20040027349 | Landau et al. | Feb 2004 | A1 |
| 20040049478 | Jasper et al. | Mar 2004 | A1 |
| 20040143571 | Bjornson et al. | Jul 2004 | A1 |
| 20040153869 | Marinelli et al. | Aug 2004 | A1 |
| 20040205064 | Zhou et al. | Oct 2004 | A1 |
| 20040215755 | O'Neill | Oct 2004 | A1 |
| 20040243645 | Broder et al. | Dec 2004 | A1 |
| 20050091211 | Vernau et al. | Apr 2005 | A1 |
| 20050192994 | Caldwell et al. | Sep 2005 | A1 |
| 20050203888 | Woosley et al. | Sep 2005 | A1 |
| 20060101081 | Lin et al. | May 2006 | A1 |
| 20060129843 | Srinivasa et al. | Jun 2006 | A1 |
| 20060294071 | Weare et al. | Dec 2006 | A1 |
| 20070005639 | Gaussier et al. | Jan 2007 | A1 |
| 20070027845 | Dettinger et al. | Feb 2007 | A1 |
| 20070100806 | Ramer et al. | May 2007 | A1 |
| 20070156748 | Emam et al. | Jul 2007 | A1 |
| 20070174289 | Utiger | Jul 2007 | A1 |
| 20070203693 | Estes | Aug 2007 | A1 |
| 20070203924 | Guha et al. | Aug 2007 | A1 |
| 20070240152 | Li et al. | Oct 2007 | A1 |
| 20070250519 | Fineberg et al. | Oct 2007 | A1 |
| 20070282959 | Stern | Dec 2007 | A1 |
| 20080010683 | Baddour et al. | Jan 2008 | A1 |
| 20080027915 | Karasudani et al. | Jan 2008 | A1 |
| 20080027920 | Schipunov et al. | Jan 2008 | A1 |
| 20080077570 | Tang et al. | Mar 2008 | A1 |
| 20080155607 | Klappert | Jun 2008 | A1 |
| 20080270389 | Jones et al. | Oct 2008 | A1 |
| 20080306908 | Agrawal et al. | Dec 2008 | A1 |
| 20090019013 | Tareen et al. | Jan 2009 | A1 |
| 20090043792 | Barsness et al. | Feb 2009 | A1 |
| 20090049038 | Gross | Feb 2009 | A1 |
| 20090089626 | Gotch et al. | Apr 2009 | A1 |
| 20090094484 | Son et al. | Apr 2009 | A1 |
| 20090222395 | Light et al. | Sep 2009 | A1 |
| 20090240682 | Balmin et al. | Sep 2009 | A1 |
| 20090292660 | Behal et al. | Nov 2009 | A1 |
| 20090299999 | Loui et al. | Dec 2009 | A1 |
| 20090322756 | Robertson et al. | Dec 2009 | A1 |
| 20100010989 | Li et al. | Jan 2010 | A1 |
| 20100077001 | Vogel et al. | Mar 2010 | A1 |
| 20100138931 | Thorley et al. | Jun 2010 | A1 |
| 20100223264 | Brucker et al. | Sep 2010 | A1 |
| 20100235311 | Cao et al. | Sep 2010 | A1 |
| 20100251305 | Kimble et al. | Sep 2010 | A1 |
| 20100274785 | Procopiuc et al. | Oct 2010 | A1 |
| 20110029636 | Smyth et al. | Feb 2011 | A1 |
| 20110071975 | Friedlander et al. | Mar 2011 | A1 |
| 20110093471 | Brockway et al. | Apr 2011 | A1 |
| 20110099163 | Harris et al. | Apr 2011 | A1 |
| 20110119243 | Diamond et al. | May 2011 | A1 |
| 20110125764 | Carmel et al. | May 2011 | A1 |
| 20110161333 | Langseth et al. | Jun 2011 | A1 |
| 20110264679 | Dettinger et al. | Oct 2011 | A1 |
| 20110282888 | Koperski et al. | Nov 2011 | A1 |
| 20110296390 | Vidal et al. | Dec 2011 | A1 |
| 20110296397 | Vidal et al. | Dec 2011 | A1 |
| 20120030220 | Edwards et al. | Feb 2012 | A1 |
| 20120047025 | Strohman | Feb 2012 | A1 |
| 20120059839 | Andrade et al. | Mar 2012 | A1 |
| 20120102121 | Wu et al. | Apr 2012 | A1 |
| 20120117069 | Kawanishi et al. | May 2012 | A1 |
| 20120131139 | Siripurapu et al. | May 2012 | A1 |
| 20120143875 | Sarma et al. | Jun 2012 | A1 |
| 20120246154 | Duan et al. | Sep 2012 | A1 |
| 20120254224 | Thompson | Oct 2012 | A1 |
| 20120310934 | Peh et al. | Dec 2012 | A1 |
| 20120323839 | Kiciman et al. | Dec 2012 | A1 |
| 20130132405 | Bestgen et al. | May 2013 | A1 |
| 20130144605 | Brager et al. | Jun 2013 | A1 |
| 20130166480 | Popescu et al. | Jun 2013 | A1 |
| 20130166547 | Pasumarthi et al. | Jun 2013 | A1 |
| 20130290232 | Tsytsarau et al. | Oct 2013 | A1 |
| 20130303198 | Sadasivam et al. | Nov 2013 | A1 |
| 20130311485 | Khan | Nov 2013 | A1 |
| 20140013233 | Ahlberg et al. | Jan 2014 | A1 |
| 20140022100 | Fallon et al. | Jan 2014 | A1 |
| 20140074784 | Mao et al. | Mar 2014 | A1 |
| 20140149446 | Kuchmann-Beauger et al. | May 2014 | A1 |
| 20140156634 | Buchmann et al. | Jun 2014 | A1 |
| 20140244550 | Jin et al. | Aug 2014 | A1 |
| 20140280183 | Brown et al. | Sep 2014 | A1 |
| 20140351233 | Crupi et al. | Nov 2014 | A1 |
| 20150074037 | Sarferaz | Mar 2015 | A1 |
| 20150149481 | Lee et al. | May 2015 | A1 |
| 20150154079 | Lightner et al. | Jun 2015 | A1 |
| 20150154264 | Lightner et al. | Jun 2015 | A1 |
| 20150154297 | Lightner et al. | Jun 2015 | A1 |
| Number | Date | Country |
|---|---|---|
| 2013003770 | Jan 2013 | WO |
| Entry |
|---|
| International Search Report and Written Opinion dated Mar. 3, 2015, corresponding to International Patent Application No. PCT/US2014/067921, 10 pages. |
| International Search Report and Written Opinion dated Mar. 6, 2015 corresponding to International Patent Application No. PCT/US2014/067993, 9 pages. |
| International Search Report and Written Opinion dated Mar. 10, 2015 corresponding to International Patent Application No. PCT/US2014/067999, 10 pages. |
| International Search Report and Written Opinion of the International Searching Authority dated Apr. 15, 2015 corresponding to International Patent Application No. PCT/US2014/068002, 10 pages. |
| International Search Report and Written Opinion dated Feb. 24, 2015 corresponding to International Patent Application No. PCT/US2014/0067918, 10 pages. |
| Tunkelang, D. “Faceted Search,” Morgan & Claypool Publ., 2009, pp. i-79. |
| Schuth, A., et al., “University of Amsterdam Data Centric Ad Hoc Faceted Search Runs,” ISLA, 2012, pp. 155-160. |
| Tools, Search Query Suggestions using ElasticSearch via Shingle Filter and Facets, Nov. 2012, pp. 1-12. |
| International Search Report and Written Opinion of the International Searching Authority dated Apr. 15, 2015, corresponding to International Patent Application No. PCT/2014/067994, 9 pages. |
| International Search Report dated Apr. 15, 2015 corresponding to International Patent Application No. PCT/US2014/067997, 4 pages. |
| Written Opinion of the International Searching Authority dated Apr. 15, 2015 corresponding to International Patent Application No. PCT/US2014/067997, 9 pages. |
| Number | Date | Country | |
|---|---|---|---|
| 20160042001 A1 | Feb 2016 | US |
| Number | Date | Country | |
|---|---|---|---|
| 61910905 | Dec 2013 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 14558159 | Dec 2014 | US |
| Child | 14920580 | US |
