<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Distribution of Mutual Information</title>
	<atom:link href="http://blog.opencog.org/2009/03/11/distribution-of-mutual-information/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.opencog.org/2009/03/11/distribution-of-mutual-information/</link>
	<description>The latest developments in building an open-source mind</description>
	<lastBuildDate>Fri, 23 Mar 2012 21:15:00 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
	<item>
		<title>By: linasv</title>
		<link>http://blog.opencog.org/2009/03/11/distribution-of-mutual-information/#comment-9</link>
		<dc:creator>linasv</dc:creator>
		<pubDate>Tue, 08 Sep 2009 18:38:26 +0000</pubDate>
		<guid isPermaLink="false">http://brainwave.opencog.org/?p=89#comment-9</guid>
		<description>These graphs were discussed on the corpora mailing list in March 2009. See http://mailman.uib.no/public/corpora/2009-March/008193.html and followups in that thread.

It was concluded that the gross features of the graph (i.e. the exponential fall-off) can be explained by drawing random pairs of words from a Zipfian distribution for single words (which seemed plausible to me, although I did not do the math to double-check/verify this).</description>
		<content:encoded><![CDATA[<p>These graphs were discussed on the corpora mailing list in March 2009. See <a href="http://mailman.uib.no/public/corpora/2009-March/008193.html" rel="nofollow">http://mailman.uib.no/public/corpora/2009-March/008193.html</a> and followups in that thread.</p>
<p>It was concluded that the gross features of the graph (i.e. the exponential fall-off) can be explained by drawing random pairs of words from a Zipfian distribution for single words (which seemed plausible to me, although I did not do the math to double-check/verify this).</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: linasv</title>
		<link>http://blog.opencog.org/2009/03/11/distribution-of-mutual-information/#comment-44</link>
		<dc:creator>linasv</dc:creator>
		<pubDate>Tue, 08 Sep 2009 18:38:00 +0000</pubDate>
		<guid isPermaLink="false">http://brainwave.opencog.org/?p=89#comment-44</guid>
		<description>These graphs were discussed on the corpora mailing list in March 2009. See http://mailman.uib.no/public/corpora/2009-March/008193.html and followups in that thread.

It was concluded that the gross features of the graph (i.e. the exponential fall-off) can be explained by drawing random pairs of words from a Zipfian distribution for single words (which seemed plausible to me, although I did not do the math to double-check/verify this).</description>
		<content:encoded><![CDATA[<p>These graphs were discussed on the corpora mailing list in March 2009. See <a href="http://mailman.uib.no/public/corpora/2009-March/008193.html" rel="nofollow">http://mailman.uib.no/public/corpora/2009-March/008193.html</a> and followups in that thread.</p>
<p>It was concluded that the gross features of the graph (i.e. the exponential fall-off) can be explained by drawing random pairs of words from a Zipfian distribution for single words (which seemed plausible to me, although I did not do the math to double-check/verify this).</p>
]]></content:encoded>
	</item>
</channel>
</rss>

