name: StackSearch

synopsis:

g++ [flags ...] file ... -l /isip/tools/lib/$ISIP_BINARY/lib_search.a

#include <StackSearch.h>

StackSearch();
StackSearch(const StackSearch& copy_search);
boolean setNumLevels(long num_levels);
SearchLevel& getSearchLevel(long level)
boolean decode(FrontEnd& fe, long num_frames = ALL_FRAMES);
boolean getHypotheses(String& output_hyp, long level_a, float& total_score,
                      long& num_frames, DoubleLinkedList& trace_path);
quick start:

// configure FrontEnd
//
FrontEnd fe;

Sof front_end_sof;
front_end_sof.open(L"front_end.sof");
fe.read(front_end_sof, front_end_sof.first(fe.name()));
front_end_sof.close();

// configure StackSearch
//
StackSearch search_engine;
long num_levels = 3;
search_engine.setNumLevels(num_levels);

// read models
//
Sof model_sof;
model_sof.open(L"models.sof");

for (long curr_level = 0; curr_level < num_levels; curr_level++) {
  SearchLevel& level = search_engine.getSearchLevel(curr_level);
  level.load(model_sof);
}
model_sof.close();

// process the sentence
//
Filename speech_file(L"speech_file.raw");
fe.open(speech_file);
search_engine.decode(fe);
fe.close();

// get the best hypothesis
//
String best_hypothesis;
float score = 0;
long num_frames = 0;
search_engine.getHypotheses(best_hypothesis, score, num_frames);

description:

StackSearch class implements a hierarchical, asynchronous, stack search engine.

The basic premise behind this is as follows:
dependencies:

public constants:

error codes:

protected data:

required public methods:

class-specific public methods:

private methods:

examples:

notes: