Abstract:
A system, computer-readable storage medium storing at least one program, and a computer-implemented method for identifying chains of related search queries is presented. Historical search query data is obtained. Chains of related search queries issued by users and search results corresponding to last related search queries in the chains of related search queries that were selected by the users are identified from the historical search query data, where each related search query in a chain of related search queries except for a last related search query in the chain of related search queries violates a search result selection criterion. The chains of related search queries are aggregated into groups, where a respective group has a common first search query and a common search result corresponding to at least one last related search query that was selected by the users. Aggregate data for the groups are stored in a query database.
Abstract:
A computer-implemented method for proving complete query suggestions, performed by a server system, includes receiving a partial search query from a client system. A database of complete search queries is searched to identify a first set of matching complete search queries. If the first set of matching complete search queries fails to satisfy predefined criteria (e.g., with respect to the quantity and/or quality of the matching complete search queries), a rewrite of the received partial search query is performed to produce a first set of rewritten partial search queries. The database of complete search queries is searched to identify a second set of complete search queries matching any of the first set of rewritten partial search queries. At least a subset of the second set of matching complete queries are sent to the client system.
Abstract:
Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for identifying implicit question queries. In one aspect, a method includes receiving a query in unstructured form, comparing terms of the query to query templates, determining, based on the comparison, a match of the query terms to a first query template, wherein the first query template is not determined to be indicative of a question query, determining, based on the first query template, a second query template, and determining that the query is an implicit question query in response to the second query template being indicative of a question queries.
Abstract:
Methods and apparatus related to identifying a query template that includes one or more terms and a member of an entity category and ranking the query template. Query suggestions may be determined based on the query template. The ranking of the query template may be utilized to determine if the query template is a valid query template. The ranking of the template may be based on at least a count of occurrences of one or more of the entities of the entity category in past queries that conform to the query template.
Abstract:
Methods and apparatus for determining whether query templates that have the same entity collection identifier are semantically equivalent query templates based on determining a similarity measure between the query templates. The similarity measure may be based on various factors. For example, in some implementations the similarity measure may be based on a number of the entities of the entity collection that instantiate both of the query templates in a record of past user queries. Also, for example, in some implementations the similarity measure may be based on a number of the entities of the entity collection that instantiate both of the query templates in a record of past user queries and are determined to be entities that satisfy a threshold level of entity similarity between the query templates. In some implementations, terms of two query templates that are determined to be equivalent may be determined to be synonymous.
Abstract:
Methods and apparatus related to identifying a query template that includes one or more terms and a member of an entity category and ranking the query template. Query suggestions may be determined based on the query template. The ranking of the query template may be utilized to determine if the query template is a valid query template. The ranking of the template may be based on at least a count of occurrences of one or more of the entities of the entity category in past queries that conform to the query template.
Abstract:
Methods and apparatus related to identifying a query template that includes one or more terms and a member of an entity category and ranking the query template. Query suggestions may be determined based on the query template. The ranking of the query template may be utilized to determine if the query template is a valid query template. The ranking of the template may be based on at least a count of occurrences of one or more of the entities of the entity category in past queries that conform to the query template.
Abstract:
A computer-implemented method for identifying search results satisfying a search query received from a user includes obtaining a set of ranked search results that satisfies the search query, and identifying, using historical search query data, a search result that was selected by users who issued the search query and that corresponds to at least one related search query in at least one chain of related search queries that are related to the search query. The method further includes determining, using the historical search query data, a frequency that the search query led to a selection of the identified search result; inserting the identified search result into the set of ranked search results based on the frequency that the search query led to the selection of the identified search result; and returning the set of ranked search results to the user.
Abstract:
Systems and techniques are provided for receiving an input column and a search keyword and providing one or more suggested columns with which to merge the input column. A coverage score and a refinity score are calculated for potential columns based on the input column as well as a search score based on the search keyword. The one or more suggested columns may be determined based on the coverage score, refinity score, and/or the search score. The input column and/or a potential column may be modified based on a function and the modification may result in a plurality of modified input and/or potential columns. Coverage, refinity, and search scores may be calculated based on the modified columns.