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

M. M. Sondhi, S. E. Levinson

Research output: Contribution to conferencePaperpeer-review

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)
Pages409-412
Number of pages4
StatePublished - 1978
Externally publishedYes
EventRec IEEE Int Conf Acoust Speech Signal Process 3rd - Tulsa, OK, USA
Duration: Apr 10 1978Apr 12 1978

Conference

ConferenceRec IEEE Int Conf Acoust Speech Signal Process 3rd
CityTulsa, OK, USA
Period4/10/784/12/78

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