Experimental Comparison of Semantic Word Clouds
We study the problem of computing semantics-preserving word clouds in which semantically related words are close to each other. We implement three earlier algorithms for creating word clouds and three new ones. We define several metrics for quantitative evaluation of the resulting layouts. Then the algorithms are compared according to these metrics, using two data sets of documents from Wikipedia and research papers. We show that two of our new algorithms outperform all the others by placing many more pairs of related words so that their bounding boxes are adjacent. Moreover, this improvement is not achieved at the expense of significantly worsened measurements for the other metrics.
KeywordsEdge Weight Semantic Relation Ranking Function Term Frequency Related Word
Unable to display preview. Download preview PDF.
- 4.Erkan, G., Radev, D.R.: LexRank: Graph-based lexical centrality as salience in text summarization. J. Artificial Intelligence Res. 22(1), 457–479 (2004)Google Scholar
- 7.Li, H., Abe, N.: Word clustering and disambiguation based on co-occurrence data. In: Int. Conf. Comput. Linguistics, vol. 2, pp. 749–755. Association for Computational Linguistics, Stroudsburg (1998)Google Scholar
- 11.Schrammel, J., Leitner, M., Tscheligi, M.: Semantically structured tag clouds: An empirical evaluation of clustered presentation approaches. In: SIGCHI Conference on Human Factors in Computing Systems, pp. 2037–2040. ACM, New York (2009)Google Scholar