Phrasing prediction deterministic approaches

Prominence prediction algorithms follow the same basic approaches as phrase break prediction where we have simple deterministic algorithms, sophisticated deterministic algorithms and data... 

Prominence prediction by deterministic means is actually one of the most successful uses of non-statistical methods in speech synthesis. This can be attributed to a number of factors, for example the fact that the rules often don t interact or the fact that many of the rules are base on semantic features (such that even if we did use a data driven technique we would still have to come up with the semantic taxonomy by hand). Sproat notes [410] that statistical approaches have had only limited success as the issue (especially in compound noun phrases) is really one of breadth and not modelling regardless of how the prominence algorithm actually works, what it requires is a broad and exhaustive list of examples of compound nouns. Few complex generalisations are present (what machine learning algorithms are good at) and once presented with an example, the rules are not difficult to write by hand. 

---

See also in sourсe #XX -- [ ]

---