Compiling Language Models from a Linguistically Motivated Unification Grammar

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Systems now exist which are able to compile unification grammars into language models that can be included in a speech recognizer, but it is so far unclear whether non-trivial linguistically principled grammars can be used for this purpose. We describe a series of experiments which investigate the question empirically, by incrementally constructing a grammar and discovering what problems emerge when successively larger versions are compiled into finite state graph representations and used as language models for a medium-vocabulary recognition task.
To be published in COLING 2000

Keywords

Computation and Language, I.2.7

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/30294

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0006021
 http://arxiv.org/abs/cs/0006021

Collections

arXiv