Key points are not available for this paper at this time.
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.
Sondhi et al. (2005) studied this question.