Graph clustering with Leiden recovers Zipfian distributions in unsupervised speech term discovery more effectively than K-means, GMM or BIRCH across three languages.
Revisiting Lexicon Evaluation in Unsupervised Word Discovery
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Building a lexicon from discovered word-like units is a central goal in zero-resource speech processing. But do our evaluations provide a trustworthy indication of lexicon quality? A common metric, normalized edit distance, averages the phoneme edit distances between discovered units in each cluster. We show that this metric has an inherent bias toward the quality of large clusters, inhibiting fair evaluation. Moreover, it ignores how well true classes are distributed across clusters. Based on established theory in clustering literature, we propose two metrics that address these shortcomings: a modified metric that weighs cluster size when assessing within-cluster consistency, and an inverse metric that assesses how true words are spread across clusters. Through experiments on synthetic and real-world lexicons, we demonstrate that combined, these metrics are: (1) more closely correlated with how similar a lexicon is to the ground-truth distribution, and (2) more robust to biases that skew lexicon evaluations.
fields
eess.AS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Recovering the Zipfian Distribution in Unsupervised Term Discovery
Graph clustering with Leiden recovers Zipfian distributions in unsupervised speech term discovery more effectively than K-means, GMM or BIRCH across three languages.