Chinese Restaurant Process for cognate clustering: A threshold free approach

2016/10/19 by Taraka Rama, Rama, Taraka
Computer Science · #Computation and Language (cs.CL) #Data Mining Algorithms and Applications #FOS: Computer and information sciences #Natural Language Processing Techniques #Rough Sets and Fuzzy Logic

paper · pdf · doi:10.48550/arxiv.1610.06053

openalex publication_date 2016/10/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we introduce a threshold free approach, motivated from Chinese Restaurant Process, for the purpose of cognate clustering. We show that our approach yields similar results to a linguistically motivated cognate clustering system known as LexStat. Our Chinese Restaurant Process system is fast and does not require any threshold and can be applied to any language family of the world.

Related

• Fast and unsupervised methods for multilingual cognate clustering
• Reducing over-clustering via the powered Chinese restaurant process
• Distance Dependent Chinese Restaurant Processes
• Siamese convolutional networks based on phonetic features for cognate identification
• Scalable Inference for Nested Chinese Restaurant Process Topic Models