Computing relative redundancy to measure grammatical constraint in speech recognition tasks
暂无分享,去创建一个
In this paper we present new and computationally efficient algorithms for computing some statistical properties of finite languages. In particular, the relative redundancy which measures grammatical constraint, is computed for several speech recognition task languages which have appeared in the literature.
[1] Stephen E. Levinson,et al. The Vocal Speech Understanding System , 1975, IJCAI.
[2] Stephen E. Levinson. Improving word recognition accuracy by means of syntax , 1977 .