<?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: Digg Tries Again To Bury Dupes</title>
	<atom:link href="http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/</link>
	<description>Startup and Technology News</description>
	<lastBuildDate>Fri, 27 Nov 2009 02:28:21 -0800</lastBuildDate>
	
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: منتديات</title>
		<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/comment-page-1/#comment-2965401</link>
		<dc:creator>منتديات</dc:creator>
		<pubDate>Fri, 04 Sep 2009 00:38:03 +0000</pubDate>
		<guid isPermaLink="false">http://www.techcrunch.com/?p=78261#comment-2965401</guid>
		<description>Good luck trying to accomplish this. Sounds like a daunting task</description>
		<content:encoded><![CDATA[<p>Good luck trying to accomplish this. Sounds like a daunting task</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: مركز تحميل</title>
		<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/comment-page-1/#comment-2965393</link>
		<dc:creator>مركز تحميل</dc:creator>
		<pubDate>Fri, 04 Sep 2009 00:35:03 +0000</pubDate>
		<guid isPermaLink="false">http://www.techcrunch.com/?p=78261#comment-2965393</guid>
		<description>if i give you a tiny url, you need to “trust” that the issue is valid, and by then, you’ve already linked on the link. unless you have a well formed sandbox browser.. who knows what the heck can happen.</description>
		<content:encoded><![CDATA[<p>if i give you a tiny url, you need to “trust” that the issue is valid, and by then, you’ve already linked on the link. unless you have a well formed sandbox browser.. who knows what the heck can happen.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: viky</title>
		<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/comment-page-1/#comment-2833560</link>
		<dc:creator>viky</dc:creator>
		<pubDate>Thu, 02 Jul 2009 12:40:40 +0000</pubDate>
		<guid isPermaLink="false">http://www.techcrunch.com/?p=78261#comment-2833560</guid>
		<description>thats absolutely right.</description>
		<content:encoded><![CDATA[<p>thats absolutely right.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jim</title>
		<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/comment-page-1/#comment-2832589</link>
		<dc:creator>Jim</dc:creator>
		<pubDate>Wed, 01 Jul 2009 23:04:29 +0000</pubDate>
		<guid isPermaLink="false">http://www.techcrunch.com/?p=78261#comment-2832589</guid>
		<description>Digg is a useless site full with junk links on top. I am sure investors (VCs) are trying to get rid of it very hard. May be AOL would buy them for free to put them out of their misery.</description>
		<content:encoded><![CDATA[<p>Digg is a useless site full with junk links on top. I am sure investors (VCs) are trying to get rid of it very hard. May be AOL would buy them for free to put them out of their misery.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Name*</title>
		<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/comment-page-1/#comment-2831633</link>
		<dc:creator>Name*</dc:creator>
		<pubDate>Wed, 01 Jul 2009 13:50:40 +0000</pubDate>
		<guid isPermaLink="false">http://www.techcrunch.com/?p=78261#comment-2831633</guid>
		<description>Specify your canonical!</description>
		<content:encoded><![CDATA[<p>Specify your canonical!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Raj</title>
		<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/comment-page-1/#comment-2831592</link>
		<dc:creator>Raj</dc:creator>
		<pubDate>Wed, 01 Jul 2009 13:25:10 +0000</pubDate>
		<guid isPermaLink="false">http://www.techcrunch.com/?p=78261#comment-2831592</guid>
		<description>Good luck trying to accomplish this. Sounds like a daunting task</description>
		<content:encoded><![CDATA[<p>Good luck trying to accomplish this. Sounds like a daunting task</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: <fb:name linked="false" useyou="false" uid="506991550">Ivan Lazarte</fb:name></title>
		<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/comment-page-1/#comment-2831034</link>
		<dc:creator><fb:name linked="false" useyou="false" uid="506991550">Ivan Lazarte</fb:name></dc:creator>
		<pubDate>Wed, 01 Jul 2009 02:41:17 +0000</pubDate>
		<guid isPermaLink="false">http://www.techcrunch.com/?p=78261#comment-2831034</guid>
		<description>rofl so true.  repeating and/of having no or half a story is great business.  

also hilarious:
http://tinypic.com/view.php?pic=htv3nr&amp;s=5</description>
		<content:encoded><![CDATA[<p>rofl so true.  repeating and/of having no or half a story is great business.  </p>
<p>also hilarious:<br />
<a href="http://tinypic.com/view.php?pic=htv3nr&amp;s=5" rel="nofollow"></a><a href='http://tinypic.com/view.php?pic=htv3nr&amp;s=5'>http://tinypic....=htv3nr&amp;s=5</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: OOTheLibrarian</title>
		<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/comment-page-1/#comment-2830940</link>
		<dc:creator>OOTheLibrarian</dc:creator>
		<pubDate>Wed, 01 Jul 2009 01:21:33 +0000</pubDate>
		<guid isPermaLink="false">http://www.techcrunch.com/?p=78261#comment-2830940</guid>
		<description>Hold up a minute. TC author discusses &quot;users often submit[ting] the same content over and over again&quot; ?</description>
		<content:encoded><![CDATA[<p>Hold up a minute. TC author discusses &#8220;users often submit[ting] the same content over and over again&#8221; ?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Spencer Schoeben</title>
		<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/comment-page-1/#comment-2830848</link>
		<dc:creator>Spencer Schoeben</dc:creator>
		<pubDate>Wed, 01 Jul 2009 00:20:13 +0000</pubDate>
		<guid isPermaLink="false">http://www.techcrunch.com/?p=78261#comment-2830848</guid>
		<description>I think this is a very good thing.  However, I think they if it detects duplicate content from a different URL, it should add that to the main entry.

That way, when you are viewing the Digg entry, you can see all the places that the content is published.  It would be sort of like how Google News shows you a story but allows you to read it from different publishers.</description>
		<content:encoded><![CDATA[<p>I think this is a very good thing.  However, I think they if it detects duplicate content from a different URL, it should add that to the main entry.</p>
<p>That way, when you are viewing the Digg entry, you can see all the places that the content is published.  It would be sort of like how Google News shows you a story but allows you to read it from different publishers.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: New Gadgets &#124; Digg Tries Again To Bury Dupes</title>
		<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/comment-page-1/#comment-2830777</link>
		<dc:creator>New Gadgets &#124; Digg Tries Again To Bury Dupes</dc:creator>
		<pubDate>Tue, 30 Jun 2009 23:42:44 +0000</pubDate>
		<guid isPermaLink="false">http://www.techcrunch.com/?p=78261#comment-2830777</guid>
		<description>[...] Original post by Hostpundit - Hosting and Gadgets [...]</description>
		<content:encoded><![CDATA[<p>[...] Original post by Hostpundit &#8211; Hosting and Gadgets [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Kelly</title>
		<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/comment-page-1/#comment-2830729</link>
		<dc:creator>Kelly</dc:creator>
		<pubDate>Tue, 30 Jun 2009 23:14:36 +0000</pubDate>
		<guid isPermaLink="false">http://www.techcrunch.com/?p=78261#comment-2830729</guid>
		<description>&quot;...and whose to say which is more Digg-worthy...&quot;

Who&#039;s. Not whose. Who is.</description>
		<content:encoded><![CDATA[<p>&#8220;&#8230;and whose to say which is more Digg-worthy&#8230;&#8221;</p>
<p>Who&#8217;s. Not whose. Who is.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: timy11</title>
		<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/comment-page-1/#comment-2830654</link>
		<dc:creator>timy11</dc:creator>
		<pubDate>Tue, 30 Jun 2009 22:32:39 +0000</pubDate>
		<guid isPermaLink="false">http://www.techcrunch.com/?p=78261#comment-2830654</guid>
		<description>hey jeff...

don&#039;t worry... i&#039;m convinced that 95-99% of the people on here think css is code!

but what you state is what i&#039;ve said is a major, athough as yet, unexploited issue involving tiny urls. 

tiny urls, obscure the underlying url, and is contrary to the entire issue of the DNS system.

if i give you a tiny url, you need to &quot;trust&quot; that the issue is valid, and by then, you&#039;ve already linked on the link. unless you have a well formed sandbox browser.. who knows what the heck can happen.

and given the fact that an evil doer could in theory, spawn 100s of tiny urls with a number of levels between the tiny url you get, and the final parent url that&#039;s the actual malformed page... this could wreak havoc....

have fun!</description>
		<content:encoded><![CDATA[<p>hey jeff&#8230;</p>
<p>don&#8217;t worry&#8230; i&#8217;m convinced that 95-99% of the people on here think css is code!</p>
<p>but what you state is what i&#8217;ve said is a major, athough as yet, unexploited issue involving tiny urls. </p>
<p>tiny urls, obscure the underlying url, and is contrary to the entire issue of the DNS system.</p>
<p>if i give you a tiny url, you need to &#8220;trust&#8221; that the issue is valid, and by then, you&#8217;ve already linked on the link. unless you have a well formed sandbox browser.. who knows what the heck can happen.</p>
<p>and given the fact that an evil doer could in theory, spawn 100s of tiny urls with a number of levels between the tiny url you get, and the final parent url that&#8217;s the actual malformed page&#8230; this could wreak havoc&#8230;.</p>
<p>have fun!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Vindexus</title>
		<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/comment-page-1/#comment-2830641</link>
		<dc:creator>Vindexus</dc:creator>
		<pubDate>Tue, 30 Jun 2009 22:20:17 +0000</pubDate>
		<guid isPermaLink="false">http://www.techcrunch.com/?p=78261#comment-2830641</guid>
		<description>That is the big problem with digg, it takes a lot more steps to tag stories.. sneezing is a 1000 times easier.</description>
		<content:encoded><![CDATA[<p>That is the big problem with digg, it takes a lot more steps to tag stories.. sneezing is a 1000 times easier.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: BombayNinja</title>
		<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/comment-page-1/#comment-2830636</link>
		<dc:creator>BombayNinja</dc:creator>
		<pubDate>Tue, 30 Jun 2009 22:08:34 +0000</pubDate>
		<guid isPermaLink="false">http://www.techcrunch.com/?p=78261#comment-2830636</guid>
		<description>True...

&quot;Our boys wrote some code yesterday to see if multiple URLs point to the same page&quot;

VS

“Our R&amp;D team came up with a solution that identifies these types of duplicates by using a document similarity algorithm”

I miss those days as an engineer where we used to mess with clueless business dudes. Glad to head the old trick is still in use.</description>
		<content:encoded><![CDATA[<p>True&#8230;</p>
<p>&#8220;Our boys wrote some code yesterday to see if multiple URLs point to the same page&#8221;</p>
<p>VS</p>
<p>“Our R&amp;D team came up with a solution that identifies these types of duplicates by using a document similarity algorithm”</p>
<p>I miss those days as an engineer where we used to mess with clueless business dudes. Glad to head the old trick is still in use.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: sean percival</title>
		<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/comment-page-1/#comment-2830625</link>
		<dc:creator>sean percival</dc:creator>
		<pubDate>Tue, 30 Jun 2009 22:01:19 +0000</pubDate>
		<guid isPermaLink="false">http://www.techcrunch.com/?p=78261#comment-2830625</guid>
		<description>This post, totally photoshopped.</description>
		<content:encoded><![CDATA[<p>This post, totally photoshopped.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jacob Rothstein</title>
		<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/comment-page-1/#comment-2830610</link>
		<dc:creator>Jacob Rothstein</dc:creator>
		<pubDate>Tue, 30 Jun 2009 21:53:20 +0000</pubDate>
		<guid isPermaLink="false">http://www.techcrunch.com/?p=78261#comment-2830610</guid>
		<description>Discriminating between those two (BS and legitimate things one doesn&#039;t understand) seems like a big part of the challenge of the modern world.  Too far to one side and you&#039;re a sucker; too far to the other and you can&#039;t learn.</description>
		<content:encoded><![CDATA[<p>Discriminating between those two (BS and legitimate things one doesn&#8217;t understand) seems like a big part of the challenge of the modern world.  Too far to one side and you&#8217;re a sucker; too far to the other and you can&#8217;t learn.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Chris</title>
		<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/comment-page-1/#comment-2830604</link>
		<dc:creator>Chris</dc:creator>
		<pubDate>Tue, 30 Jun 2009 21:49:17 +0000</pubDate>
		<guid isPermaLink="false">http://www.techcrunch.com/?p=78261#comment-2830604</guid>
		<description>What Digg should do is transfer all the diggs from the duplicate article to the original article, that way all the duplication can be eliminated and there will be no bias.</description>
		<content:encoded><![CDATA[<p>What Digg should do is transfer all the diggs from the duplicate article to the original article, that way all the duplication can be eliminated and there will be no bias.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Adam Gutterman</title>
		<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/comment-page-1/#comment-2830603</link>
		<dc:creator>Adam Gutterman</dc:creator>
		<pubDate>Tue, 30 Jun 2009 21:48:16 +0000</pubDate>
		<guid isPermaLink="false">http://www.techcrunch.com/?p=78261#comment-2830603</guid>
		<description>Seriously, does anyone but 1000 or so crazy hardcore Digg users care about this?</description>
		<content:encoded><![CDATA[<p>Seriously, does anyone but 1000 or so crazy hardcore Digg users care about this?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Posts about Digg as of June 30, 2009 &#187; The Daily Parr</title>
		<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/comment-page-1/#comment-2830593</link>
		<dc:creator>Posts about Digg as of June 30, 2009 &#187; The Daily Parr</dc:creator>
		<pubDate>Tue, 30 Jun 2009 21:40:55 +0000</pubDate>
		<guid isPermaLink="false">http://www.techcrunch.com/?p=78261#comment-2830593</guid>
		<description>[...] to capture the moment … or to use a reference from KJA’s creative director – snap a happy   Digg Tries Again To Bury Dupes - techcrunch.com 06/30/2009 Since its inception, one of the biggest problems with Digg has been [...]</description>
		<content:encoded><![CDATA[<p>[...] to capture the moment … or to use a reference from KJA’s creative director – snap a happy   Digg Tries Again To Bury Dupes &#8211; techcrunch.com 06/30/2009 Since its inception, one of the biggest problems with Digg has been [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: sir jorge</title>
		<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/comment-page-1/#comment-2830587</link>
		<dc:creator>sir jorge</dc:creator>
		<pubDate>Tue, 30 Jun 2009 21:38:31 +0000</pubDate>
		<guid isPermaLink="false">http://www.techcrunch.com/?p=78261#comment-2830587</guid>
		<description>ever since the stopped allowing shouts, even my coolest content doesn&#039;t get diggs..despite 400+ friends.</description>
		<content:encoded><![CDATA[<p>ever since the stopped allowing shouts, even my coolest content doesn&#8217;t get diggs..despite 400+ friends.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Kevin Urrutia</title>
		<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/comment-page-1/#comment-2830579</link>
		<dc:creator>Kevin Urrutia</dc:creator>
		<pubDate>Tue, 30 Jun 2009 21:34:13 +0000</pubDate>
		<guid isPermaLink="false">http://www.techcrunch.com/?p=78261#comment-2830579</guid>
		<description>seems like it might work</description>
		<content:encoded><![CDATA[<p>seems like it might work</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: geekevaluation</title>
		<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/comment-page-1/#comment-2830568</link>
		<dc:creator>geekevaluation</dc:creator>
		<pubDate>Tue, 30 Jun 2009 21:22:25 +0000</pubDate>
		<guid isPermaLink="false">http://www.techcrunch.com/?p=78261#comment-2830568</guid>
		<description>techies have a new crush , twitter</description>
		<content:encoded><![CDATA[<p>techies have a new crush , twitter</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Patrick</title>
		<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/comment-page-1/#comment-2830559</link>
		<dc:creator>Patrick</dc:creator>
		<pubDate>Tue, 30 Jun 2009 21:18:54 +0000</pubDate>
		<guid isPermaLink="false">http://www.techcrunch.com/?p=78261#comment-2830559</guid>
		<description>Except that the sentence they used is completely legitimate... just because you don&#039;t understand it doesn&#039;t mean it&#039;s BS.</description>
		<content:encoded><![CDATA[<p>Except that the sentence they used is completely legitimate&#8230; just because you don&#8217;t understand it doesn&#8217;t mean it&#8217;s BS.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Patrick</title>
		<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/comment-page-1/#comment-2830555</link>
		<dc:creator>Patrick</dc:creator>
		<pubDate>Tue, 30 Jun 2009 21:18:03 +0000</pubDate>
		<guid isPermaLink="false">http://www.techcrunch.com/?p=78261#comment-2830555</guid>
		<description>The bigger dupe problem is stories being submitted from the same site with slightly different urls that point to the same page.  This should be easily solved since the resulting page are identical.

For stories on different sites, if the text content is 95% the same then there is a dupe.  The problem is if someone submits a rip-off of the original article before the original is submitted.  This could be solved by linking the different pages together under the same submission.  You could then have some sort of flag people can set to say which is the original.</description>
		<content:encoded><![CDATA[<p>The bigger dupe problem is stories being submitted from the same site with slightly different urls that point to the same page.  This should be easily solved since the resulting page are identical.</p>
<p>For stories on different sites, if the text content is 95% the same then there is a dupe.  The problem is if someone submits a rip-off of the original article before the original is submitted.  This could be solved by linking the different pages together under the same submission.  You could then have some sort of flag people can set to say which is the original.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: BombayNinja</title>
		<link>http://www.techcrunch.com/2009/06/30/digg-tries-to-bury-dupes-again/comment-page-1/#comment-2830551</link>
		<dc:creator>BombayNinja</dc:creator>
		<pubDate>Tue, 30 Jun 2009 21:17:44 +0000</pubDate>
		<guid isPermaLink="false">http://www.techcrunch.com/?p=78261#comment-2830551</guid>
		<description>&quot;Our R&amp;D team came up with a solution that identifies these types of duplicates by using a document similarity algorithm&quot;

Now you can create such sentences too: http://dack.com/web/bullshit.html</description>
		<content:encoded><![CDATA[<p>&#8220;Our R&amp;D team came up with a solution that identifies these types of duplicates by using a document similarity algorithm&#8221;</p>
<p>Now you can create such sentences too: <a href="http://dack.com/web/bullshit.html" rel="nofollow"></a><a href='http://dack.com/web/bullshit.html'>http://dack.com...b/bullshit.html</a></p>
]]></content:encoded>
	</item>
</channel>
</rss>
