Welcome to this Sunday evening in Norway.

No article writing software, article generators or article spinning on this site.

Kjell Gunnar Bleivik First version 02.13.2012

Last updated 02.14.2012 Status: Will be updated with additional information.

This method results in articles that can create over 100,000,000,000,000,000,000,000 different versions. So you can safely publish these articles with no fear of duplicate content penalties from the search engines.


You can publish Hubpages or Squidoo Lenses with Adsense to make money. The sky's the limit!

Source: []

What is a spinnable article? It is shorter and random article created from a set of bigger articles. There are companies that specialize in producing such article sets. You don't need to be a mathematicians to understand that you shall not have a big set of large articles to create many unique smaller articles. So if you have 10 articles, each 50 000 words long written by good writers, you don't need to be a C programmer, JavaScript or PHP script expert to understand that you can create thousands of 500 word long unique articles. If this is a large tendency on the interent, it is not difficult to understand that it is difficult to earn money on affiliate networks.

We have seen that some article writing bots and software have disappeared, but new more sofisticated inventions like article spinning pops up. There is smart article generating software whose articles is difficult to identify. An obvious solution is to only accepte invited writers and writers that will not be related with article spinning. Like zero dope in sports is difficult (impossible) to stop, it is difficult (impossible) to avoid article and bot writing software.

Worse, If you know the method of fine elements and cURL, you can even crawl an internet site, behave like a human and indentify the bot as a known browser (user agent). Then you can use the scraped information to automatically create large articles and from that set create small unique articles. A popular definition of randomness is that if you have enough monkeys that write on a typewriter, one of them would by chance produce the collected writings of Shakespeare. Intelligent screen scrapers can be written i PHP, so there is no limit with the vast amount of online articles. As such, this short article can be embedded as a section in a large article that is used in article spinning. The method of finite elements are well known by engineers where a large complex structure is broken down in its smaller elements, analysed and merged together to the larger more complex structure. You don't need to have very special imagination to understand how this technique can be used to produce a base of large articles that can be used in article spinning. Is there red flags that can signal that a article is produced by article software. Yes there is. A missing name, a pseudonym bad or missing citations etc. are obvious signals. And like software and bots can be used to automize article writing as described above, software can of course also be used to identify the writer, the article base or that article spinning has been used to create an article. When for pratical purposes, there are billions of billions of combinations as indicated in the cite that starts this article, the task may be insolvable. When there are infinite unique combinations it is impossible.

Is it possible to protect your content, is it still possible to identify copy cats?

Kjell Gunnar Bleivik First version 02.15.2012

Last updated 02.15.2012 Status: Will be updated with additional information.

This article is a follow up of the above article and we start this article with a quote (is it unique on the internet?) from one of my favourite books Professor Bjørn Kirkerud (1989): "Object Oriented Programming With Simula". Addison Wesley Publishing Company ISBN 0 201 17574 6 chapter 10.10 with the heading, Can computers "learn" real games?

Whether or not the program in this chapter can be said to learn from experience does not seem to be a very interesting question, since its answer depends almost solely on how you choose to use words like "learn" and "experience". More interesting is the question of whether or not the ideas behind the program are generally applicable. Can the same ideas be utilized to "teach" a computer to play chess or to "learn" to perform other tasks?

Fortunately (some would say "alas") the idea are not applicable to any but the simplest tasks. The main reason for this is that the number of possible situations that could arise is overwhelmingly large for most interesting games. For example, the number of possible situations in the game of chess is larger than the number of elementary particles in the known universe. That means that it is impossible - and will always remain impossible, no matter what size of computers may be constructed in the future - to declare arrays that are large enough to hold bead values for every possible situation in a game of chess. It also means that the number of training games necessary to produce acceptable values in a bead array is far too large to be played in the lifetime of any human being. Even the period between two "Big Bangs" of the universe would be too short to produce a chess-player that plays measurably better than completely randomly by the method described in this chapter. There do exist programs that enable computers to play acceptable chess, but they are based on very different ideas, and cannot be said to have learned to play chess.

Even if search engines don't like duplicate content, landing pages and gate way pages, are they able to find them? Are search engines able to identify duplicate content made by article spinning (read the article above)? How many instances do you need before the combination can be infinite? Two (0,1) is definitely enough. If you have a long enough bitstream, it can always be made "infinite" for practical purposes. The precision of a 64 bit computer is 2 raised to the negative power of 64. Even if you had all the computing power in the universe, you would not be able to compute pi since pi is a trancendental number.

Don't let services like Copyscape fool you. Of course, identical copies of your articles can be identified with this tool. Search engines can identify some sort of dublicate content, but they can not identify advanced automatic article generation and spinning. How many compinations are there of the letters in the English alphabet? I have read that Shakespeare had a vocabulary of about 100 000 words. Some years ago, the Language monitor had a story that the number of words in the English language passed one million. These words can of course be combined in endless combinatiions and new words are created daily, not least words related to the digital age and the internet.

Infinite divided by 2 is infinite, so the result divided by 4 is of course infinite, too. A string of 0 and 1, starting with 1, where the characters are of the size used in this article around our galaxy, the Milky Way is absolutely finite. The number of sand grains in Sahara can be counted or more precisely approximated. They are absolutely finite, but for practical purposes they can be "regarded as infinite". So what if a content spinner has a network of screen scraping [] bots scraping information from the internet 24 hours a day, seven days a week and merging the content more or less sematically together, is it possible to identify the copy? If you are a serious content writer that sells ad space on your sites, can you be competing with what you have written yourself?

Related links

Privacy Policy | Company | Contact Us | Site of MultiFinansIT: Organization number 987 091 398 | © 2004 - 2024 MultiFinansIT | All rights Reserved |