Chinese Restaurant Process for cognate clustering: A threshold free approach

10/19/2016
by   Taraka Rama, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/25/2018

Subadditive threshold in proof of stake system

Two subadditive threshold are proposed for proof stake systems: one is r...
research
09/10/2022

An Analysis of the Differences Among Regional Varieties of Chinese in Malay Archipelago

Chinese features prominently in the Chinese communities located in the n...
research
12/10/2018

Does the Web of Science Accurately Represent Chinese Scientific Performance?

The purpose of this study is to compare Web of Science (WoS) with a Chin...
research
02/15/2018

Reducing over-clustering via the powered Chinese restaurant process

Dirichlet process mixture (DPM) models tend to produce many small cluste...
research
05/30/2023

Shuo Wen Jie Zi: Rethinking Dictionaries and Glyphs for Chinese Language Pre-training

We introduce CDBERT, a new learning paradigm that enhances the semantics...
research
10/15/2018

A simple proof of Pitman-Yor's Chinese restaurant process from its stick-breaking representation

For a long time, the Dirichlet process has been the gold standard discre...
research
02/26/2019

On the Idiosyncrasies of the Mandarin Chinese Classifier System

While idiosyncrasies of the Chinese classifier system have been a richly...

Please sign up or login with your details

Forgot password? Click here to reset