# US 2004/0024599 A1 · Audio search conducted through statistical pattern matching

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2004/0024599 A1
- Document ID: US20040024599A1
- Status: Published application
- Kind: A1
- Application number: 10/210,754
- Filed: 2002-07-31
- Published: 2004-02-05
- Earliest claimed: 2002-07-31
- Assignees: Intel Corporation
- Inventors: Michael E. Deisher
- Web page: https://patentgrep.com/patent/US20040024599A1

## CPC

- G10L 15/142: {Hidden Markov Models [HMMs]}
- G10L 2015/025: {Phonemes, fenemes or fenones being the recognition units}
- G10L: SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING

## Abstract

A technique for audio searches by statistical pattern matching is disclosed. The audio to be located is processed for feature extraction and decoded using a maximum likelihood (“ML”) search. A left-right Hidden Markov Model (“HMM”) is constructed from the ML state sequence. Transition probabilities are defined as normalized state occupancies from the most likely state sequence of the decoding operation. Utterance duration is measured from the search sample. Other model parameters are gleaned from an acoustic model. A ML search of an audio corpus is conducted with respect to the HMM and a garbage model. New start states are added at each frame. Low scoring and long state sequences (with respect to the search sample duration) are discarded at each frame. Locations where scores of the new model are higher than those of the garbage model are marked as potential matches. The highest scoring matches are presented as results.

## Claims

### Claim 1

A system for audio searches, comprising:
a general acoustic model, representing speech sounds; and
a garbage model, representing speech and non-speech sounds, wherein the system is capable of:
performing feature extraction on an audio corpus and on an audio search term;
decoding the audio search term using a maximum likelihood search;
using a resulting state sequence from the maximum likelihood search and parameters from the general acoustic model to construct a new model with a plurality of states;
assigning state transition probabilities to the new model given maximum likelihood state occupancy durations from the maximum likelihood search;
conducting an audio corpus maximum likelihood search with respect to the new model and the garbage model;
discarding low scoring and long state sequences at each of a plurality of frames, with respect to duration of the audio search term; and
recording locations and scores of matches and presenting results of the search.

### Claim 2 (depends on 1)

The system of claim 1, wherein the feature extraction converts a speech waveform into a parametric representation that is used for analysis and processing.

### Claim 3 (depends on 1)

The system of claim 1, wherein the maximum likelihood search is used to find a most probable sequence of hidden states given a sequence of observed data, and a maximum likelihood score is calculated with respect to the general acoustic model.

### Claim 4 (depends on 1)

The system of claim 1, wherein the new model is a left-right hidden Markov model.

### Claim 5 (depends on 1)

The system of claim 1, wherein the garbage model is trained on speech and background noise.

### Claim 6 (depends on 1)

The system of claim 1, wherein locations of matches are determined at places in which scores of the new model are substantially higher than scores of the garbage model.

### Claim 7

A method of conducting audio searches, comprising:
performing feature extraction on an audio corpus;
processing an audio search term to perform feature extraction;
decoding the audio search term using a maximum likelihood technique;
generating a model, that has at least one state, from parameters of an acoustic model and from a result of the maximum likelihood technique, including state durations;
allocating state transition probabilities to the model given maximum likelihood state occupancy durations from the maximum likelihood technique;
performing an audio corpus maximum likelihood search with respect to the model and a garbage model;
pruning low scoring and long state sequences at each of a plurality of frames, with respect to the search duration;
recording locations and scores of matches; and
introducing the locations of matches as results of the search.

### Claim 8 (depends on 7)

The method of claim 7, wherein the maximum likelihood technique is carried out with respect to the acoustic model that produces a maximum likelihood score.

### Claim 9 (depends on 8)

The method of claim 8, wherein the maximum likelihood technique is used to find a most probable sequence of hidden states, given a sequence of observed data, and a maximum likelihood score is calculated with respect to the acoustic model.

### Claim 10 (depends on 7)

The method of claim 7, wherein the model is a left-right hidden Markov model.

### Claim 11 (depends on 7)

The method of claim 7, wherein the garbage model is trained on speech and background noise.

### Claim 12 (depends on 11)

The method of claim 11, wherein the garbage model generates a score that serves as a best path point of reference.

### Claim 13 (depends on 7)

The method of claim 7, wherein feature extraction converts a speech waveform into a parametric representation for analysis and processing.

### Claim 14 (depends on 7)

The method of claim 7, wherein locations of matches are determined at places in which scores of the model are higher than scores of the garbage model.

### Claim 15

An article comprising:
a storage medium having stored thereon instructions that when executed by a machine result in the following:
processing an audio search term for feature extraction;
performing maximum likelihood decoding on the audio search term;
generating a model, having one or more search model states, from a resulting state sequence from the maximum likelihood decoding and from an acoustic model;
assigning state transition probabilities to the model, given maximum likelihood state occupancy durations from the maximum likelihood decoding;
performing feature extraction on an audio corpus;
performing maximum likelihood decoding on the audio corpus with respect to the model and a garbage model;
removing low scoring and long state sequences with respect to search sample duration;
logging locations and scores of matches; and
presenting results of the matches.

### Claim 16 (depends on 15)

The article of claim 15, wherein feature extraction converts a speech waveform into a parametric representation that is used for analysis and processing.

### Claim 17 (depends on 15)

The article of claim 15, wherein the maximum likelihood decoding finds a most probable sequence of hidden states from a sequence of observed data, and a maximum likelihood score is calculated with respect to the acoustic model.

### Claim 18 (depends on 15)

The article of claim 15, wherein the one or more search model states proceed from left to right in the model.

### Claim 19 (depends on 15)

The article of claim 15, wherein locations of matches are determined at places in which scores of the model are higher than scores of the garbage model.

### Claim 20 (depends on 15)

The article of claim 15, wherein the garbage model is trained on speech and background noise.
