A Bimachine Compiler for Ranked Tagging Rules
Computation and Language
2007-05-23 v1
Abstract
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.
Keywords
Cite
@article{arxiv.cs/0407046,
title = {A Bimachine Compiler for Ranked Tagging Rules},
author = {Wojciech Skut and Stefan Ulrich and Kathrine Hammervold},
journal= {arXiv preprint arXiv:cs/0407046},
year = {2007}
}
Comments
7 pages, 3 figures Proceedings of COLING 2004 (to appear)