This paper presents a novel prosody model in the context of computer text-to-speech synthesis applications for tone languages. We have demonstrated its applicability using the Standard Yorùbá (SY) language. Our approach is motivated by the theory that abstract and realised forms of various prosody dimensions should be modelled within a modular and unified framework (Coleman 1994). We have imple...

We generalize a learning algorithm by Drewes and Högberg [1] for regular tree languages based on a learning model proposed by Angluin [2] to recognizable tree languages of arbitrarily many dimensions, so-called multi-dimensional trees. Multi-dimensional trees over multidimensional tree domains have been defined by Rogers [3, 4]. However, since the algorithm by Drewes and Högberg relies on class...

In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued)  regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...

the traditional event tree analysis uses a single probability to represent each top event. however, it is unrealistic to evaluate the occurrence of each event by using a crisp value without considering the inherent uncertainty and imprecision a state has. the fuzzy set theory is universally applied to deal with this kind of phenomena. the main purpose of this study is to construct an easy metho...

Multidimensional association rule mining searches for interesting relationship among the values from different dimensions/attributes in a relational database. In this method the correlation is among set of dimensions i.e., the items forming a rule come from different dimensions. Therefore each dimension should be partitioned at the fuzzy set level. This paper proposes a new algorithm for genera...