首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Computing Semantic Clusters by Semantic Mirroring and Spectral Graph Partitioning
Authors:Lars Eldén  Magnus Merkel  Lars Ahrenberg  Martin Fagerlund
Institution:1. Department of Mathematics, Link?ping University, Link?ping, Sweden
2. Department of Computer Science, Link?ping University, Link?ping, Sweden
Abstract:Using the technique of semantic mirroring a graph is obtained that represents words and their translations from a parallel corpus or a bilingual lexicon. The connectedness of the graph holds information about the semantic relations of words that occur in the translations. Spectral graph theory is used to partition the graph, which leads to a grouping of the words in different clusters. We illustrate the method using a small sample of seed words from a lexicon of Swedish and English adjectives and discuss its application to computational lexical semantics and lexicography.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号