New and computationally efficient algorithms are presented 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.
|Original language||English (US)|
|Number of pages||4|
|Journal||[No source information available]|
|State||Published - Jan 1 2017|
ASJC Scopus subject areas