Voice interface for a search engine
First Claim
Patent Images
1. A method for providing search results, comprising:
- receiving a voice search query from a user;
deriving one or more recognition hypotheses from the voice search query, each recognition hypothesis being associated with a weight and including one or more terms;
constructing a weighted boolean query using the recognition hypotheses, the constructing including;
determining a length of a shortest recognition hypothesis,pruning a length of each recognition hypothesis up to the length of the shortest recognition hypothesis,determining a length of a longest pruned recognition hypothesis,selecting a number of recognition hypotheses based on one or more query parameters,determining term weights, andforming a weighted boolean query;
providing the weighted boolean query to a search system; and
providing results of the search system.
2 Assignments
0 Petitions
Accused Products
Abstract
A system provides search results from a voice search query. The system receives a voice search query from a user, derives one or more recognition hypotheses, each being associated with a weight, from the voice search query, and constructs a weighted boolean query using the recognition hypotheses. The system then provides the weighted boolean query to a search system and provides the results of the search system to a user.
-
Citations
20 Claims
-
1. A method for providing search results, comprising:
-
receiving a voice search query from a user; deriving one or more recognition hypotheses from the voice search query, each recognition hypothesis being associated with a weight and including one or more terms; constructing a weighted boolean query using the recognition hypotheses, the constructing including; determining a length of a shortest recognition hypothesis, pruning a length of each recognition hypothesis up to the length of the shortest recognition hypothesis, determining a length of a longest pruned recognition hypothesis, selecting a number of recognition hypotheses based on one or more query parameters, determining term weights, and forming a weighted boolean query; providing the weighted boolean query to a search system; and providing results of the search system. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15)
-
-
16. A method for generating a search query, comprising:
-
receiving one or more recognition hypotheses, each recognition hypothesis being constructed from a voice search query; determining a length of a shortest recognition hypothesis; pruning a length of each recognition hypothesis up to the length of the shortest recognition hypothesis; determining a length of a longest pruned recognition hypothesis; selecting a number of recognition hypotheses based on the length of the longest pruned recognition hypothesis; determining query term weights; and forming a weighted boolean query out of each term position in the selected recognition hypotheses. - View Dependent Claims (17, 18)
-
-
19. A server comprising:
-
a memory configured to store instructions; and a processor configured to execute the instructions to receive one or more recognition hypothesis, each recognition hypothesis being constructed from a voice search query, determine a length of a shortest recognition hypothesis, prune a length of each recognition hypothesis up to the length of the shortest recognition hypothesis, determine a length of a longest pruned recognition hypothesis, select a number of recognition hypotheses, the number being based on a value representing the length of the longest pruned recognition hypothesis, determine query term weights, and form a weighted boolean query out of each term position in the selected recognition hypotheses.
-
-
20. A computer-readable medium containing instructions for controlling at least one processor to perform a method for generating a search query, comprising:
-
receiving at least one recognition hypothesis, the recognition hypothesis being constructed from a voice search query and having one or more terms; determining a length of a shortest recognition hypothesis; pruning a length of each recognition hypothesis up to the length of the shortest recognition hypothesis; determining a length of a longest pruned recognition hypothesis; selecting a number of recognition hypotheses, the number being based on the length of the longest pruned recognition hypothesis; determining term weights; and forming a weighted boolean query out of the selected recognition hypotheses.
-
Specification