Los puntos clave no están disponibles para este artículo en este momento.
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. (Thu,) studied this question.