[Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing 1991
DOI: 10.1109/icassp.1991.150308
|View full text |Cite
|
Sign up to set email alerts
|

Decision trees for phonological rules in continuous speech

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
46
0
1

Year Published

1995
1995
2011
2011

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 95 publications
(47 citation statements)
references
References 13 publications
0
46
0
1
Order By: Relevance
“…In automatic speech recognition (ASR), rare triphones are tied on the model [1] or the state [2] level, and such context modeling based on either data-driven or decision tree clustering significantly improves the recognition performance. It was already shown that the state tying system consistently out-performs the model clustered system.…”
Section: Introductionmentioning
confidence: 99%
“…In automatic speech recognition (ASR), rare triphones are tied on the model [1] or the state [2] level, and such context modeling based on either data-driven or decision tree clustering significantly improves the recognition performance. It was already shown that the state tying system consistently out-performs the model clustered system.…”
Section: Introductionmentioning
confidence: 99%
“…Starting from the classical scheme [1], some attempts have been made in order to improve the accuracy and the discriminative power of the models. An alternative methodology, the fast and efficient Growing and Pruning algorithm [4], has also been applied to build the decision trees.…”
Section: Introductionmentioning
confidence: 99%
“…Decision Trees (DT) are one of the most common approaches to the problem of selecting a suitable set of context dependent sublexical units (DT-CD-SLUs) for speech recognition [1][2] [3].…”
Section: Introductionmentioning
confidence: 99%
“…The probability of cluster membership P(Kjtr u ) can be ex- (5) This last approximation rests upon the assumption that left and right contextual inuences are independent of each other which is of course not exactly right. However, this simplication is needed to achieve generalization capabilities and is somewhat analog to the use of questions concerning the left (right) only contexts for constructing decision trees [4]. The probabilities in (5) ; (6) where #Tr o is the total number of observed triphone states and #K the number of triphone states in cluster K.…”
Section: Decoding With Unseen Triphonesmentioning
confidence: 99%
“…So far, this generalization problem has been mainly solved using decision-trees [4] [1] [5] that proceed \top-down" by going from less-to more specic contexts through successive (binary) splitting steps. In contrast, bottom-up techniques start from the most detailed level and aim at building robust entities by means of a merging process typically based on agglomerative clustering.…”
Section: Introductionmentioning
confidence: 99%