COMPUTING RELATIVE REDUNDANCY TO MEASURE GRAMMATICAL CONSTRAINT IN SPEECH RECOGNITION TASKS.

M. M. Sondhi, S. E. Levinson

Research output: Contribution to journalArticle

Abstract

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 languageEnglish (US)
Pages (from-to)409-412
Number of pages4
Journal[No source information available]
StatePublished - Jan 1 2017

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'COMPUTING RELATIVE REDUNDANCY TO MEASURE GRAMMATICAL CONSTRAINT IN SPEECH RECOGNITION TASKS.'. Together they form a unique fingerprint.

  • Cite this