Chinese Whispers - An Efficient Graph Clustering Algorithm And Its Application To Natural Language Processing Problems

@inproceedings{Biemann2006ChineseW,
  title={Chinese Whispers - An Efficient Graph Clustering Algorithm And Its Application To Natural Language Processing Problems},
  author={Christian Biemann},
  year={2006}
}
We introduce Chinese Whispers, a randomized graph-clustering algorithm, which is time-linear in the number of edges. After a detailed definition of the algorithm and a discussion of its strengths and weaknesses, the performance of Chinese Whispers is measured on Natural Language Processing (NLP) problems as diverse as language separation, acquisition of syntactic word classes and word sense disambiguation. At this, the fact is employed that the small-world property holds for many graphs in NLP. 

Citations

Publications citing this paper.
SHOWING 1-10 OF 199 CITATIONS, ESTIMATED 27% COVERAGE

199 Citations

0102030'07'10'13'16'19
Citations per Year
Semantic Scholar estimates that this publication has 199 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…