Tree Structured Dirichlet Processes for Hierarchical Morphological Segmentation
نویسندگان
چکیده
منابع مشابه
Tree Structured Dirichlet Processes for Hierarchical Morphological Segmentation
This article presents a probabilistic hierarchical clustering model for morphological segmentation. In contrast to existing approaches to morphology learning, our method allows learning hierarchical organization of word morphology as a collection of tree structured paradigms. The model is fully unsupervised and based on the hierarchical Dirichlet process (HDP). Tree hierarchies are learned alon...
متن کاملTractography Segmentation Using a Hierarchical Dirichlet Processes Mixture Model
In this paper, we propose a new nonparametric Bayesian framework to cluster white matter fiber tracts into bundles using a hierarchical Dirichlet processes mixture (HDPM) model. The number of clusters is automatically learnt from data with a Dirichlet process (DP) prior instead of being manually specified. After the models of bundles have been learnt from training data without supervision, they...
متن کاملSpeech acoustic unit segmentation using hierarchical dirichlet processes
Speech recognition systems have historically used contextdependent phones as acoustic units because these units allow linguistic information, such as a pronunciation lexicon, to be leveraged. However, when dealing with a new language for which minimal linguistic resources exist, it is desirable to automatically discover acoustic units. The process of discovering acoustic units usually consists ...
متن کاملHierarchical Dirichlet Processes
Figure 1: Bayesian Mixture Model For a Bayesian Mixture Model as shown in figure 1, as k →∞, we shall have G = ∑∞ c=1 πcδφc , where all the φc are i.i.d. samples from G0, while the random sequence {πc}c=1 sum up to one, shall be constructed by the “Stick Breaking” process [3]. Suppose there is a stick with length 1. Let βc ∼ Beta(1, α) for c = 1, 2, 3, . . . , and regard them as fractions we ta...
متن کاملHierarchical Dirichlet Processes
We consider problems involving groups of data, where each observation within a group is a draw from a mixture model, and where it is desirable to share mixture components between groups. We assume that the number of mixture components is unknown a priori and is to be inferred from the data. In this setting it is natural to consider sets of Dirichlet processes, one for each group, where the well...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Linguistics
سال: 2018
ISSN: 0891-2017,1530-9312
DOI: 10.1162/coli_a_00318