Skip to main content
Article thumbnail
Location of Repository

Practical Issues in Compiling Typed Unification Grammars for Speech Recognition

By John Dowding, Beth Ann Hockey, Beth Ann, Hockey Jean and Jean Mark Gawron

Abstract

Current alternatives for language modeling are statistical techniques based on large amounts of training data, and hand-crafted context-free or finite-state grammars that are difficult to build and maintain. One way to address the problems of the grammar-based approach is to compile recognition grammars from grammars written in a more expressive formalism. While theoretically straight-forward, the compilation process can exceed memory and time bounds, and might not always result in accurate and efficient speech recognition

Year: 2001
OAI identifier: oai:CiteSeerX.psu:10.1.1.19.8050
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://acl.ldc.upenn.edu/P/P01... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.