A Bimachine Compiler for Ranked Tagging Rules

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

This paper describes a novel method of compiling ranked tagging rules into a deterministic finite-state device called a bimachine. The rules are formulated in the framework of regular rewrite operations and allow unrestricted regular expressions in both left and right rule contexts. The compiler is illustrated by an application within a speech synthesis system.
7 pages, 3 figures Proceedings of COLING 2004 (to appear)

Keywords

Computation and Language, I.2.7;F.4.2;F.4.3

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

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

Collections

arXiv