<?xml version='1.0' encoding='UTF-8'?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:ccmbenchmark="https://www.ccmbenchmark.com/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:media="http://search.yahoo.com/mrss/"><channel><title>Laurent Piranian : Dernier contenus</title><link>/account/laurent-piranian-1342</link><atom:link href="/account/laurent-piranian-1342" rel="self" type="application/rss+xml" /><language>fr</language><pubDate>Sun, 16 Aug 2026 21:36:43 +0200</pubDate><lastBuildDate>Sun, 16 Aug 2026 21:36:43 +0200</lastBuildDate><item><title>Référencement naturel et duplication de contenu</title><link>https://www.journaldunet.com/seo/1102232-referencement-naturel-et-duplication-de-contenu/</link><description><![CDATA[<a href="https://www.journaldunet.com/seo/1102232-referencement-naturel-et-duplication-de-contenu/"><img src="https://img-0.journaldunet.com/TInbKcZRC4DdobSxuvItVtJES8k=/100x/smart/1d0d12e3cc1f4ae8af5be868d2acb589/user-jdn/11078.jpg" align="left" hspace="5" vspace="0"></a>A l’heure de Panda, détails sur un projet communautaire français, accessible au public et gratuit qui permet de faire du content spinning en ligne. Le but du projet est de passer les filtres du duplicate content tout en faisant des économies]]></description><pubDate>Wed, 18 May 2011 10:17:01 +0200</pubDate><guid>https://www.journaldunet.com/seo/1102232-referencement-naturel-et-duplication-de-contenu/</guid><dc:creator><![CDATA[Laurent Piranian]]></dc:creator><ccmbenchmark:content_author><![CDATA[Laurent Piranian]]></ccmbenchmark:content_author><ccmbenchmark:content_author_company><![CDATA[Maliboo r&eacute;f&eacute;rencement]]></ccmbenchmark:content_author_company><ccmbenchmark:content_author_illustration>1</ccmbenchmark:content_author_illustration></item></channel></rss>