×

“At least” operator for combining audio search hits

  • US 9,535,987 B2
  • Filed: 01/25/2016
  • Issued: 01/03/2017
  • Est. Priority Date: 03/30/2012
  • Status: Active Grant
First Claim
Patent Images

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 all claims
  • 8 Assignments
Timeline View
Assignment View
    ×
    ×