Posting questions from search queries
First Claim
1. A method, comprising:
- identifying search queries that each include a question word of a plurality of predetermined question words;
mapping each of the search queries to a corresponding canonical form, including applying mappings defined in an evaluation file to the search queries, the defined mappings includingfiltering that removes from the search queries any predetermined non-question words occurring in the search queries, the predetermined non-question words being obtained from the evaluation file,conjugating any verbs in the search queries to a particular verb tense,updating declensions of nouns in the search queries to a particular noun declension, andordering the words remaining in each of the search queries after the filtering, conjugating, and updating in a predefined way, including placing the question word in a predetermined position in the ordering;
identifying a plurality of different search queries that each map to a particular canonical form;
ranking the different search queries based on a frequency of occurrence of each of the different search queries; and
selecting a highest-ranked different query as a representative query for each of the different search queries.
2 Assignments
0 Petitions
Accused Products
Abstract
The present disclosure is directed to a system and method for posting questions from search queries. In some implementations, a method includes identifying a plurality of different questions previously searched. The previously-searched questions each include a word indicating a question. The previously-searched questions are filtered to remove one or more specified words included with the question word. At least a subset of the plurality of previously-searched questions that can be used to generate a canonical form after removing the one or more specified words are determined. The subset of previously-searched questions are ranked based, at least in part, on a frequency of submission of each previously-submitted search query in the subset. A particular one of the previously-submitted search queries in the subset is identified as representative of the subset of previously-submitted search queries based on the ranking.
-
Citations
21 Claims
-
1. A method, comprising:
-
identifying search queries that each include a question word of a plurality of predetermined question words; mapping each of the search queries to a corresponding canonical form, including applying mappings defined in an evaluation file to the search queries, the defined mappings including filtering that removes from the search queries any predetermined non-question words occurring in the search queries, the predetermined non-question words being obtained from the evaluation file, conjugating any verbs in the search queries to a particular verb tense, updating declensions of nouns in the search queries to a particular noun declension, and ordering the words remaining in each of the search queries after the filtering, conjugating, and updating in a predefined way, including placing the question word in a predetermined position in the ordering; identifying a plurality of different search queries that each map to a particular canonical form; ranking the different search queries based on a frequency of occurrence of each of the different search queries; and selecting a highest-ranked different query as a representative query for each of the different search queries. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A system comprising:
-
one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising; identifying search queries that each include a question word of a plurality of predetermined question words; mapping each of the search queries to a corresponding canonical form, including applying mappings defined in an evaluation file to the search queries, the defined mappings including filtering that removes from the search queries any predetermined non-question words occurring in the search queries, the predetermined non-question words being obtained from the evaluation file, conjugating any verbs in the search queries to a particular verb tense, updating declensions of nouns in the search queries to a particular noun declension, and ordering the words remaining in each of the search queries after the filtering, conjugating, and updating in a predefined way, including placing the question word in a predetermined position in the ordering; identifying a plurality of different search queries that each map to a particular canonical form; ranking the different search queries based on a frequency of occurrence of each of the different search queries; and selecting a highest-ranked different query as a representative query for each of the different search queries. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20)
-
-
21. A computer program product, encoded on one or more non-transitory computer storage media, comprising instructions that when executed by one or more computers cause the one or more computers to perform operations comprising:
-
identifying search queries that each include a question word of a plurality of predetermined question words; mapping each of the search queries to a corresponding canonical form, including applying mappings defined in an evaluation file to the search queries, the defined mappings including filtering that removes from the search queries any predetermined non-question words occurring in the search queries, the predetermined non-question words being obtained from the evaluation file, conjugating any verbs in the search queries to a particular verb tense, updating declensions of nouns in the search queries to a particular noun declension, and ordering the words remaining in each of the search queries after the filtering, conjugating, and updating in a predefined way, including placing the question word in a predetermined position in the ordering; identifying a plurality of different search queries that each map to a particular canonical form; ranking the different search queries based on a frequency of occurrence of each of the different search queries; and selecting a highest-ranked different query as a representative query for each of the different search queries.
-
Specification