“At least” operator for combining audio search hits
First Claim
1. A method to search audio data, comprising:
- receiving, by a server, audio data representing speech;
receiving, by the server, a search query related to the audio data, the search query comprising a plurality of search terms;
compiling, by the server, the search query into a hierarchy of scored speech recognition sub-searches;
searching, by an audio search engine executing on the server, the audio data for speech identified by one or more of the sub-searches to produce hits, each hit being associated with a respective search term in the search query;
determining, by the server, whether to record each hit in a hit store, wherein a particular hit is recorded only when no previous hits associated with the respective search term are found or when a relevancy score of the particular hit is higher than a relevancy score of all previous hits associated with the respective search term;
determining, by the server, whether the hits recorded in the hit store exceed a predetermined number; and
when the hits exceed the predetermined number, combining, by the server, the hits by use of at least one combination function to provide a composite search score of the audio data, wherein at least one of the combination functions comprises an at-least-M-of-N function, the predetermined number of hits comprising hits for at least M members of a set comprising N members, wherein N is greater than or equal to M, and wherein the composite search score is determined based on the M members having a highest relevancy score.
8 Assignments
0 Petitions
Accused Products
Abstract
System and method to search audio data, including: receiving audio data representing speech; receiving a search query related to the audio data; compiling, by use of a processor, the search query into a hierarchy of scored speech recognition sub-searches; searching, by use of a processor, the audio data for speech identified by one or more of the sub-searches to produce hits; and combining, by use of a processor, the hits by use of at least one combination function to provide a composite search score of the audio data. The combination function may include an at-least-M-of-N function that produces a high score when at least M of N function inputs exceed a predetermined threshold value. The composite search score employ a soft time window such as a spline function.
27 Citations
20 Claims
-
1. A method to search audio data, comprising:
-
receiving, by a server, audio data representing speech; receiving, by the server, a search query related to the audio data, the search query comprising a plurality of search terms; compiling, by the server, the search query into a hierarchy of scored speech recognition sub-searches; searching, by an audio search engine executing on the server, the audio data for speech identified by one or more of the sub-searches to produce hits, each hit being associated with a respective search term in the search query; determining, by the server, whether to record each hit in a hit store, wherein a particular hit is recorded only when no previous hits associated with the respective search term are found or when a relevancy score of the particular hit is higher than a relevancy score of all previous hits associated with the respective search term; determining, by the server, whether the hits recorded in the hit store exceed a predetermined number; and when the hits exceed the predetermined number, combining, by the server, the hits by use of at least one combination function to provide a composite search score of the audio data, wherein at least one of the combination functions comprises an at-least-M-of-N function, the predetermined number of hits comprising hits for at least M members of a set comprising N members, wherein N is greater than or equal to M, and wherein the composite search score is determined based on the M members having a highest relevancy score. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. A system to search audio data, comprising:
-
a computer-readable storage medium, storing executable instructions; a processor in communication with the computer-readable storage medium, the processor when executing the executable instructions; receives audio data representing speech; receives a search query related to the audio data, the search query comprising a plurality of search terms; compiles the search query into a hierarchy of scored speech recognition sub-searches; searches, by an audio search engine executing on the processor, the audio data for speech identified by one or more of the sub-searches to produce hits, each hit being associated with a respective search term in the search query; and determines whether to record each hit in a hit store, wherein a particular hit is recorded only when no previous hits associated with the respective search term are found or when a relevancy score of the particular hit is higher than a relevancy score of all previous hits associated with the respective search term; determines whether the hits recorded in the hit store exceed a predetermined number; and when the hits exceed the predetermined number, combines the hits by use of at least one combination function to provide a composite search score of the audio data, wherein at least one of the combination functions comprises an at-least-M-of-N function, the predetermined number of hits comprising hits for at least M members of a set comprising N members, wherein N is greater than or equal to M, and wherein the composite search score is determined based on the M members having a highest relevancy score. - View Dependent Claims (15, 16, 17, 18, 19, 20)
-
Specification