Chinese Restaurant Process for cognate clustering: A threshold free approach

TL;DR

This paper presents a threshold-free, fast Chinese Restaurant Process-based method for cognate clustering that performs comparably to existing linguistically motivated systems and is applicable across all language families.

Contribution

The paper introduces a novel threshold-free approach for cognate clustering based on the Chinese Restaurant Process, enhancing speed and universality.

Findings

Achieves similar accuracy to LexStat

Does not require threshold tuning

Applicable to any language family

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.