dfa_decode.c File Reference

Prediction of next words based on DFA grammar for stack decoding (2nd pass). More...

#include <julius.h>

Include dependency graph for dfa_decode.c:

Go to the source code of this file.

---

Detailed Description

Prediction of next words based on DFA grammar for stack decoding (2nd pass).

Author:

Akinobu LEE

Date:

Mon Mar 7 15:31:00 2005

Given a part-of-sentence hypothesis, these function determine a set of next words allowed to be connected by the grammar. Actually, only words in the word trellis, which exist around the estimated word-end frame will be expanded.

In Julian, the location where a (short) pause can be inserted should be explicitly specified by grammar, just like other words. Since user does not always place pause at the specified place, the decoder have to consider the skipping of such short pause word for the next word prediction.

If a short pause word is contained in the set of next word candidates, word set next to the short pause word is further included in the word candidates. Whether short pause was actually inserted or not in the user input will be determined by score in search_bestfirst_main.c.

In Julian mode, dfa_firstwords(), dfa_nextwords(), dfa_acceptable() and dfa_eosscore() are called from main search function wchmm_fbs(). When Julius mode, on the other hand, the corresponding functions in ngram_decode.c will be used instead.

Revision

1.1.1.1

Definition in file dfa_decode.c.

---