Difference between revisions of "SimilarityEM"

From CSWiki
Jump to: navigation, search
m
 
Line 5: Line 5:
  
 
     A part of [[Wordnet_plus]]
 
     A part of [[Wordnet_plus]]
<center>
 
<u style="display: none">
 
<a href="http://allformyspace-0.1myspacesite.org"> free layouts for myspace</a>
 
<a href="http://freeformyspace-0.1myspacesite.org"> Myspace</a>
 
<a href="http://myspasethebest-0.myspacemenet.org/"> layouts for myspace</a>
 
<a href="http://coolbest-0.myspaseze3.org"> myspace</a>
 
<a href="http://freebest-0.myspaseze3.org"> myspace</a>
 
<a href="http://whatsthis-0.myspasezess.org"> myspace</a>
 
<a href="http://inmyspace-0.myspasezess.org"> myspace</a>
 
<a href="http://insitemyspace-0.myspasezewww.org"> myspace</a>
 
<a href="http://myspacesite-0.myspasezewww.org"> myspace</a>
 
<a href="http://myspace2-0.myspaseze3ww.org">myspace</a>
 
<a href="http://myspace1-0.myspaseze3ww.org">myspace</a>
 
<a href="http://myspace3-0.myspaseze3ww.org">myspace</a>
 
 
<a href="http://myspace4-0.myspaseze3w.org">myspace</a>
 
<a href="http://myspace5-0.myspaseze3w.org">myspace</a>
 
<a href="http://myspace6-0.myspaseze3w.org">myspace</a>
 
</u>
 
</center>
 

Latest revision as of 21:03, 24 November 2006

The idea of this page is to create an iterative algorithm that assigns synsets to words in some corpus (probably by looking at limited windows) to maximize the the sum of all pairwise values for some function <math>S_{i,j}</math> over synsets <math>i</math> and <math>j</math>. Then, we recompute <math>S_{i,j}</math> for the synsets we have so as to maximize the value for the current synset assignments. We continue until the similarities become stable.

We would have to be careful to just not arbitrarily assign all words to a single highly evocative synset, but to make sure that all senses are somehow appropriately represented. This would require a careful starting point, perhaps the emperical evocation we already have and conserving evocation.


    A part of Wordnet_plus