A Flexible Rule Compiler for Speech Synthesis
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:AY23PALTrecord.jsonopen to challenge →
classification
cs.CL
cs.AI
keywords
compilerdeterministicflexiblerulesystemtransducerappliedbimachine
read the original abstract
We present a flexible rule compiler developed for a text-to-speech (TTS) system. The compiler converts a set of rules into a finite-state transducer (FST). The input and output of the FST are subject to parameterization, so that the system can be applied to strings and sequences of feature-structures. The resulting transducer is guaranteed to realize a function (as opposed to a relation), and therefore can be implemented as a deterministic device (either a deterministic FST or a bimachine).
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.