Computing Semantic Clusters by Semantic Mirroring and Spectral Graph Partitioning

نویسندگان

  • Lars Eldén
  • Magnus Merkel
  • Lars Ahrenberg
  • Martin Fagerlund
چکیده

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.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing Word Senses by Semantic Mirroring and Spectral Graph Partitioning

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 different meanings of words that occur in the translations. Spectral graph theory is used to partition the graph, which leads to a grouping of the words according to different senses...

متن کامل

Centralized Clustering Method To Increase Accuracy In Ontology Matching Systems

Ontology is the main infrastructure of the Semantic Web which provides facilities for integration, searching and sharing of information on the web. Development of ontologies as the basis of semantic web and their heterogeneities have led to the existence of ontology matching. By emerging large-scale ontologies in real domain, the ontology matching systems faced with some problem like memory con...

متن کامل

Unsupervised Semantic Role Induction with Graph Partitioning

In this paper we present a method for unsupervised semantic role induction which we formalize as a graph partitioning problem. Argument instances of a verb are represented as vertices in a graph whose edge weights quantify their role-semantic similarity. Graph partitioning is realized with an algorithm that iteratively assigns vertices to clusters based on the cluster assignments of neighboring...

متن کامل

Small-world Structure in Children’s Featured Semantic Networks

Background: Knowing the development pattern of children’s language is applicable in developmental psychology. Network models of language are helpful for the identification of these patterns.  Objectives: We examined the small-world properties of featured semantic networks of developing children. Materials & Methods: In this longitudinal study, the featured semantic networks of children aged 1...

متن کامل

Generating an Indoor space routing graph using semantic-geometric method

The development of indoor Location-Based Services faces various challenges that one of which is the method of generating indoor routing graph. Due to the weaknesses of purely geometric methods for generating indoor routing graphs, a semantic-geometric method is proposed to cover the existing gaps in combining the semantic and geometric methods in this study. The proposed method uses the CityGML...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Mathematics in Computer Science

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2013