Chinese whispers - An efficient graph clustering algorithm and its application to natural language processing problems

Proceedings of TextGraphs: The 1st Workshop on Graph-Based Methods for Natural Language Processing

Volumn , Issue , 2020, Pages 73-80

  Biemann, Chris ^a  

^a UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH ALGORITHMS; GRAPHIC METHODS; NATURAL LANGUAGE PROCESSING SYSTEMS;

GRAPH CLUSTERING ALGORITHMS; ITS APPLICATIONS; NATURAL LANGUAGE PROCESSING; SMALL WORLDS; WORD SENSE DISAMBIGUATION;

CLUSTERING ALGORITHMS;

EID: 85081787936     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. F. Amblard. 2002. Which ties to choose? A survey of social networks models for agent-based social simulations. In Proc. of the 2002 SCS International Conference On Artificial Intelligence, Simulation and Planning in High Autonomy Systems, pp.253-258, Lisbon, Portugal.
2. C. Biemann, S. Bordag, G. Heyer, U. Quasthoff, C. Wolff. 2004. Language-independent Methods for Compiling Monolingual Lexical Data, Proceedings of CicLING 2004, Seoul, Korea and Springer LNCS 2945, pp. 215-228, Springer, Berlin Heidelberg
3. B. Bollobás. 1998. Modern graph theory, Graduate Texts in Mathematics, vol. 184, Springer, New York
4. S. Bordag. 2006. Word Sense Induction: Triplet-Based Clustering and Automatic Evaluation. Proceedings of EACL-06. Trento
5. C. Biemann and S. Teresniak. 2005. Disentangling from Babylonian Confusion - Unsupervised Language Identification. Proceedings of CICLing-2005, Mexico City, Mexico and Springer LNCS 3406, pp. 762-773
6. S. van Dongen. 2000. A cluster algorithm for graphs. Technical Report INS-R0010, National Research Institute for Mathematics and Computer Science in the Netherlands, Amsterdam.
7. T. Dunning. 1993. Accurate Methods for the Statistics of Surprise and Coincidence, Computational Linguistics 19(1), pp. 61-74
8. M. Ester, H.-P. Kriegel, J. Sander and X. Xu. 1996. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In Proceedings of the 2nd Int. Conf. on Knowledge Discovery and Datamining (KDD'96) Portland, USA, pp. 291-316.
9. B. Dorow and D. Widdows. 2003. Discovering Corpus-Specific Word Senses. In EACL-2003 Conference Companion (research notes and demos), pp. 79-82, Budapest, Hungary
10. R. Ferrer-i-Cancho and R.V. Sole. 2001. The small world of human language. Proceedings of The Royal Society of London. Series B, Biological Sciences, 268(1482):2261-2265
11. H. Schütze. 1995. Distributional part-of-speech tagging. In EACL 7, pages 141-148
12. J. Šíma and S.E. Schaeffer. 2005. On the npcompleteness of some graph cluster measures. Technical Report cs.CC/0506100, arXiv.org e-Print archive, http://arxiv.org/.
13. B. Stein and O. Niggemann. 1999. On the Nature of Structure and Its Identification. Proceedings of WG'99, Springer LNCS 1665, pp. 122-134, Springer Verlag Heidelberg
14. M. Steyvers, J. B. Tenenbaum. 2005. The large-scale structure of semantic networks: statistical analyses and a model of semantic growth. Cognitive Science, 29(1).
15. Ushioda, A. (1996). Hierarchical clustering of words and applications to NLP tasks. In Proceedings of the Fourth Workshop on Very Large Corpora, pp. 28-41. Somerset, NJ, USA
16. D. J. Watts. 1999. Small Worlds: The Dynamics of Networks Between Order and Randomness, Princeton Univ. Press, Princeton, USA
17. Z. Wu and R. Leahy (1993): An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence