A Bimachine Compiler for Ranked Tagging Rules
Reviewed by Pithpith:QTFONIMHopen to challenge →
classification
cs.CL
keywords
rulesbimachinecompilerrankedregulartaggingallowapplication
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.