<rdf:RDF
 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
 xmlns="http://purl.org/rss/1.0/"
 xmlns:dc="http://purl.org/dc/elements/1.1/"
 xmlns:cc="http://web.resource.org/cc/"
 >
<!--
	This ontology document is licensed under the Creative Commons
	Attribution License. To view a copy of this license, visit
	http://creativecommons.org/licenses/by/2.0/ or send a letter to
	Creative Commons, 559 Nathan Abbott Way, Stanford, California
	94305, USA.
-->
 <channel rdf:about="http://ebiquity.umbc.edu//tags/html/?t=pointwise+mutual+information">
  <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
  <title><![CDATA[UMBC ebiquity RSS Tag Search]]></title>
  <link><![CDATA[http://ebiquity.umbc.edu//tags/html/?t=pointwise+mutual+information]]></link>
  <description><![CDATA[UMBC ebiquity RSS Tag Search for pointwise mutual information]]></description>
  <items>
    <rdf:Seq>
      <rdf:li resource="http://ebiquity.umbc.edu/event/html/id/344/A-New-Approach-for-Automatic-Thesaurus-Generation"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/577/Improving-Word-Similarity-by-Augmenting-PMI-with-Estimates-of-Word-Polysemy"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/558/Improving-Word-Similarity-by-Augmenting-PMI-with-Estimates-of-Word-Polysemy"/>
      <rdf:li resource="http://ebiquity.umbc.edu/resource/html/id/339/Making-the-Semantic-Web-Easier-to-Use"/>
    </rdf:Seq>
  </items>
 </channel>
 <item rdf:about="http://ebiquity.umbc.edu/event/html/id/344/A-New-Approach-for-Automatic-Thesaurus-Generation">
  <title><![CDATA[A New Approach for Automatic Thesaurus Generation]]></title>
  <link>http://ebiquity.umbc.edu/event/html/id/344/A-New-Approach-for-Automatic-Thesaurus-Generation</link>
  <description><![CDATA[Distributional similarity has long been used to determine  how similar two words are and has been used in automatic thesaurus generation. Such distribution similarity measures, however, do not always work well for finding synonyms in a text corpus because synonyms may not necessarily have the most similar contexts. We have developed a novel alternative approach in automatic thesaurus generation using pointwise mutual information (PMI) and by exploiting co-occurrence patterns of synonyms, whic...]]></description>
  <dc:date>2010-05-04</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/577/Improving-Word-Similarity-by-Augmenting-PMI-with-Estimates-of-Word-Polysemy">
  <title><![CDATA[Improving Word Similarity by Augmenting PMI with Estimates of Word Polysemy]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/577/Improving-Word-Similarity-by-Augmenting-PMI-with-Estimates-of-Word-Polysemy</link>
  <description><![CDATA[Pointwise mutual information (PMI) is a widely used word similarity measure, but it lacks a clear explanation of how it works. We explore how PMI differs from distributional similarity, and we introduce a novel metric, PMImax, that augments PMI with information about a word's number of senses. The coefficients of PMImax are determined empirically by maximizing a utility function based on the performance of automatic thesaurus generation. We show that it outperforms traditional PMI in the appl...]]></description>
  <dc:date>2013-06-01</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/558/Improving-Word-Similarity-by-Augmenting-PMI-with-Estimates-of-Word-Polysemy">
  <title><![CDATA[Improving Word Similarity by Augmenting PMI with Estimates of Word Polysemy]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/558/Improving-Word-Similarity-by-Augmenting-PMI-with-Estimates-of-Word-Polysemy</link>
  <description><![CDATA[Although pointwise mutual information (PMI) has become a commonly used word similarity measure, a clear understanding of how it works has been lacking.  In this paper we explore how PMI differs from distributional similarity, and we introduce a novel metric, PMImax, that augments PMI with information about a word's number of senses.  The coefficients of PMImax are determined empirically by maximizing a utility function based on the performance of automatic thesaurus generation.  We show that ...]]></description>
  <dc:date>2011-06-01</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/resource/html/id/339/Making-the-Semantic-Web-Easier-to-Use">
  <title><![CDATA[Making the Semantic Web Easier to Use]]></title>
  <link>http://ebiquity.umbc.edu/resource/html/id/339/Making-the-Semantic-Web-Easier-to-Use</link>
  <description><![CDATA[Semantic Web technologies have the potential to support many activities by providing a Web-based data representation that ties data to semantics models, facilitates data sharing and linking, supports provenance annotations, and can exploit a large and growing collection of background knowledge on the Web. While the concepts and technologies are mature and supported by sound standards, their use within most application communities remains relatively low. This talk will discuss current research...]]></description>
  <dc:date>2012-04-01</dc:date>
 </item>
</rdf:RDF>
