COMPOST is the result of our first reflections on the computing requirements for synthetic speech generation. It combines the basic facilities of a rule-oriented software with object-oriented design. COMPOST is a tree compiler: it manipulates and transforms not only lists of atoms but also trees and subtrees. Basic atoms involved into the tree inherit of properties of user defined classes . Features and numerical cues are associated with each atom. COMPOST has then numerical capabilities to do synthesis-by- rule. COMPOST has been developped to build a formant-based rule system but may generate any king of parametric trajectories and then could be used in rule-based articulatory synthesis.
Cite as: Bailly, G., Tran, A. (1989) Compost: a rule-compiler for speech synthesis. Proc. First European Conference on Speech Communication and Technology (Eurospeech 1989), 1136-1139, doi: 10.21437/Eurospeech.1989-46
@inproceedings{bailly89_eurospeech,
author={Gérard Bailly and A. Tran},
title={{Compost: a rule-compiler for speech synthesis}},
year=1989,
booktitle={Proc. First European Conference on Speech Communication and Technology (Eurospeech 1989)},
pages={1136--1139},
doi={10.21437/Eurospeech.1989-46}
}