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

Fingerprint

Speech recognition
Redundancy

ASJC Scopus subject areas

  • Engineering(all)

Cite this

COMPUTING RELATIVE REDUNDANCY TO MEASURE GRAMMATICAL CONSTRAINT IN SPEECH RECOGNITION TASKS. / Sondhi, M. M.; Levinson, S. E.

In: [No source information available], 01.01.2017, p. 409-412.

Research output: Contribution to journalArticle

@article{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 = "2017",
month = "1",
day = "1",
language = "English (US)",
pages = "409--412",
journal = "[No source information available]",

}

TY - JOUR

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

AU - Sondhi, M. M.

AU - Levinson, S. E.

PY - 2017/1/1

Y1 - 2017/1/1

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 - Article

AN - SCOPUS:0017791247

SP - 409

EP - 412

JO - [No source information available]

JF - [No source information available]

ER -