__jconf_search__ Struct Reference

Search parameters. More...

#include <jconf.h>

Collaboration diagram for __jconf_search__:

[legend]


Data Fields
short	id
	Unique ID.
char	name [JCONF_MODULENAME_MAXLEN]
	Unique name.
JCONF_AM *	amconf
	Which AM configuration to refer.
JCONF_LM *	lmconf
	Which LM configuration to refer.
boolean	compute_only_1pass
	Compute only 1pass (-1pass).
boolean	ccd_handling
	context handling
boolean	force_ccd_handling
	force context-dependent handling
struct {
LOGPROB lm_weight
	N-gram Language model weight (-lmp).
LOGPROB lm_penalty
	N-gram Word insertion penalty (-lmp).
LOGPROB lm_weight2
	N-gram Language model weight for 2nd pass (-lmp2).
LOGPROB lm_penalty2
	N-gram Word insertion penalty for 2nd pass (-lmp2).
LOGPROB lm_penalty_trans
	N-gram Additional insertion penalty for transparent words (-transp).
LOGPROB penalty1
	Word insertion penalty for DFA grammar on 1st pass (-penalty1).
LOGPROB penalty2
	Word insertion penalty for DFA grammar on 2nd pass (-penalty2).
boolean lmp2_specified
	INTERNAL: TRUE if -lmp2 specified.
boolean lmp_specified
	INTERNAL: TRUE if -lmp specified.
}	lmp
	LM weights.
struct {
int specified_trellis_beam_width
	Beam width of 1st pass.
boolean old_tree_function_flag
	(DEBUG) use old build_wchmm() instead of build_wchmm2() for lexicon construction (-oldtree)
}	pass1
	First pass parameters.
struct {
int nbest
	Search until N-best sentences are found (-n).
int enveloped_bestfirst_width
	Word beam width of 2nd pass.
LOGPROB scan_beam_thres
	Score beam threshold of 2nd pass (-sb).
int hypo_overflow
	Hypothesis overflow threshold at 2nd pass (-m).
int stack_size
	Hypothesis stack size of 2nd pass (-s).
int lookup_range
	Get next words from word trellis with a range of this frames on 2nd pass (-lookuprange).
boolean looktrellis_flag
	Limit expansion words for trellis words on neighbor frames at 2nd pass of DFA for speedup (-looktrellis).
}	pass2
	Second pass parameters.
struct {
boolean enabled
	GraphOut: if enabled, graph search is enabled.
boolean lattice
	GraphOut: if enabled, output word graph.
boolean confnet
	GraphOut: if enabled, generate confusion network.
int graph_merge_neighbor_range
	GraphOut: allowed margin for post-merging on word graph generation (-graphrange) if set to -1, same word with different phone context will be separated.
}	graph
	Word graph output.
struct {
boolean enabled
	TRUE if short-pause segmentation enabled for this instance.
int sp_frame_duration
	Length threshold to detect short-pause segment in frames.
char * pausemodelname
	name string of pause model
}	successive
	Successive decoding (--enable-sp-segment).
struct {
LOGPROB cm_alpha
	Scaling factor for confidence scoring (-cmalpha).
boolean align_result_word_flag
	Forced alignment: per word (-walign).
boolean align_result_phoneme_flag
	Forced alignment: per phoneme (-palign).
boolean align_result_state_flag
	Forced alignment: per state (-salign).
}	annotate
	Annotation to the output.
struct {
int output_hypo_maxnum
	Result: number of sentence to output (-output) , also see nbest (-n).
boolean progout_flag
	Result: output partial recognition result on the 1st pass (-progout).
int progout_interval
	Result: Progressive output interval on 1st pass in msec (-proginterval).
int progout_interval_frame
	Result: INTERNAL: interval in number of frames.
boolean multigramout_flag
	Get results for all grammars independently on 2nd pass on DFA (-multigramout / -nomultigramout).
}	output
	Output configurations.
struct {
boolean trellis_check_flag
	Enter trellis interactive check routine after boot (-check trellis).
boolean triphone_check_flag
	Enter triphone existence check routine after boot (-check triphone).
boolean wchmm_check_flag
	Enter lexicon structure consulting mode after boot (-check wchmm).
boolean start_inactive
	should be set to TRUE at startup when this process should start with inactive status
boolean fallback_pass1_flag
	In case the 2nd pass search fails, this option specifies Julius to use the result of the previous 1st pass as final result.
}	sw
	Misc.
__jconf_search__ *	next