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

M. M. Sondhi; S. E. Levinson

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

M. M. Sondhi, S. E. Levinson

Research output: Contribution to conference › Paper › peer-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 language	English (US)
Pages	409-412
Number of pages	4
State	Published - 1978
Externally published	Yes
Event	Rec IEEE Int Conf Acoust Speech Signal Process 3rd - Tulsa, OK, USA Duration: Apr 10 1978 → Apr 12 1978

Conference

Conference	Rec IEEE Int Conf Acoust Speech Signal Process 3rd
City	Tulsa, OK, USA
Period	4/10/78 → 4/12/78

ASJC Scopus subject areas

Engineering(all)

Library availability

Discover UIUC Full Text

Cite this

@conference{74a7bbe06c534550ba2d736e91f45922,

title = "COMPUTING RELATIVE REDUNDANCY TO MEASURE GRAMMATICAL CONSTRAINT IN SPEECH RECOGNITION TASKS.",

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.",

author = "Sondhi, {M. M.} and Levinson, {S. E.}",

year = "1978",

language = "English (US)",

pages = "409--412",

}

TY - CONF

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

AU - Sondhi, M. M.

AU - Levinson, S. E.

PY - 1978

Y1 - 1978

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0017791247&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0017791247&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0017791247

SP - 409

EP - 412

T2 - Rec IEEE Int Conf Acoust Speech Signal Process 3rd

Y2 - 10 April 1978 through 12 April 1978

ER -

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

Abstract

Conference

ASJC Scopus subject areas

Library availability

Related links

Fingerprint

Cite this