A Bimachine Compiler for Ranked Tagging Rules

Simple item page
dc.creatorSkut, Wojciech
dc.creatorUlrich, Stefan
dc.creatorHammervold, Kathrine
dc.date2004-07-19
dc.date.accessioned2026-07-07T03:21:35Z
dc.date.available2026-07-07T03:21:35Z
dc.descriptionThis 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.
dc.description7 pages, 3 figures Proceedings of COLING 2004 (to appear)
dc.identifierhttps://arxiv.org/abs/cs/0407046
dc.identifierhttp://arxiv.org/abs/cs/0407046
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32255
dc.subjectComputation and Language
dc.subjectI.2.7;F.4.2;F.4.3
dc.titleA Bimachine Compiler for Ranked Tagging Rules
dc.typetext

Files

Collections

arXiv