<?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: Comparing weblog text to the PhD dissertation via tagclouds</title>
	<atom:link href="http://blog.mathemagenic.com/2008/07/07/comparing-weblog-text-to-phd-dissertation/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.mathemagenic.com/2008/07/07/comparing-weblog-text-to-phd-dissertation/</link>
	<description>Lilia Efimova on personal productivity in knowledge-intensive environments, weblog research, knowledge management, PhD, serendipity and lack of work-life balance...</description>
	<lastBuildDate>Fri, 13 Jan 2012 16:17:46 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.5</generator>
	<item>
		<title>By: Tag clouds on the move &#171; Making CommunitySense</title>
		<link>http://blog.mathemagenic.com/2008/07/07/comparing-weblog-text-to-phd-dissertation/comment-page-1/#comment-1241</link>
		<dc:creator>Tag clouds on the move &#171; Making CommunitySense</dc:creator>
		<pubDate>Sun, 03 Aug 2008 19:07:18 +0000</pubDate>
		<guid isPermaLink="false">http://blog.mathemagenic.com/?p=1516#comment-1241</guid>
		<description>[...] cloud for various purposes, but to compare tag clouds.  Lilia Efimova gives a nice example of how she compared the tag clouds of her blog posts and a dissertation chapter on the same topic. Another comparison is to see how different tag cloud tools process the same text. Here&#8217;s the [...]</description>
		<content:encoded><![CDATA[<p>[...] cloud for various purposes, but to compare tag clouds.  Lilia Efimova gives a nice example of how she compared the tag clouds of her blog posts and a dissertation chapter on the same topic. Another comparison is to see how different tag cloud tools process the same text. Here&#8217;s the [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Lilia Efimova</title>
		<link>http://blog.mathemagenic.com/2008/07/07/comparing-weblog-text-to-phd-dissertation/comment-page-1/#comment-309</link>
		<dc:creator>Lilia Efimova</dc:creator>
		<pubDate>Thu, 10 Jul 2008 13:27:25 +0000</pubDate>
		<guid isPermaLink="false">http://blog.mathemagenic.com/?p=1516#comment-309</guid>
		<description>It&#039;s interesting how a tag cloud represents something about the text in the spaces between words, isn&#039;t it? :)</description>
		<content:encoded><![CDATA[<p>It&#8217;s interesting how a tag cloud represents something about the text in the spaces between words, isn&#8217;t it? :)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jason Priem</title>
		<link>http://blog.mathemagenic.com/2008/07/07/comparing-weblog-text-to-phd-dissertation/comment-page-1/#comment-300</link>
		<dc:creator>Jason Priem</dc:creator>
		<pubDate>Thu, 10 Jul 2008 00:51:30 +0000</pubDate>
		<guid isPermaLink="false">http://blog.mathemagenic.com/?p=1516#comment-300</guid>
		<description>Entirely awesome idea!  There plenty of algorithms out there that attempt to determine the similarity between two documents (Plagiarism detection is one application among many; &lt;a href=&quot;http://turnitin.com/&quot; rel=&quot;nofollow&quot;&gt;turnitin&lt;/a&gt; is an example of this).  The tricky thing is that &quot;similarity&quot; is a pretty slippery concept.  Getting raters to read both documents would be the gold standard, but it&#039;s really slow.  Machine comparison is fast, but it&#039;s hard to get the algorithm perfect.

It would be interesting to do a three-way test: readers who read both documents, readers who read just tag clouds, and one or more programs.  I think that your tag cloud method may be a good happy medium between quick-but-dumb machine comparisons and smart-but-slow human-reading.  You still get access to those oh-so-human-gestalts of the documents, but visualization saves you a load of time.</description>
		<content:encoded><![CDATA[<p>Entirely awesome idea!  There plenty of algorithms out there that attempt to determine the similarity between two documents (Plagiarism detection is one application among many; <a href="http://turnitin.com/">turnitin</a> is an example of this).  The tricky thing is that &#8220;similarity&#8221; is a pretty slippery concept.  Getting raters to read both documents would be the gold standard, but it&#8217;s really slow.  Machine comparison is fast, but it&#8217;s hard to get the algorithm perfect.</p>
<p>It would be interesting to do a three-way test: readers who read both documents, readers who read just tag clouds, and one or more programs.  I think that your tag cloud method may be a good happy medium between quick-but-dumb machine comparisons and smart-but-slow human-reading.  You still get access to those oh-so-human-gestalts of the documents, but visualization saves you a load of time.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

