<?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 for NashCoding</title>
	<atom:link href="http://www.nashcoding.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.nashcoding.com</link>
	<description>Yet Another Artificial Intelligence Blog</description>
	<lastBuildDate>Sat, 11 Feb 2012 21:19:06 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>Comment on Implementation of Sukhotin&#8217;s Algorithm by Robert</title>
		<link>http://www.nashcoding.com/2010/07/07/implementation-of-sukhotins-algorithm/comment-page-1/#comment-543</link>
		<dc:creator>Robert</dc:creator>
		<pubDate>Sat, 11 Feb 2012 21:19:06 +0000</pubDate>
		<guid isPermaLink="false">http://www.nashcoding.com/?p=51#comment-543</guid>
		<description>Thank you for your answer ! If i may,i would also like to point out one aspect that surprised me ! This algorithm is a statistical one,and i remarked that some of the facts stated in the article in which the article is presented (http://www.4shared.com/office/dKlzPwpB/guy1991vowelIdentification.html?) tend to make this algorithm quite inexact. For example,it is mentioned in the article that,in the English language,Sukhotin&#039;s algorithm can return &quot;t&quot; as a vocal due to the fact that this letter tends to occur very often near a consonant.
    Also,i can tell you that this also applies to Romanian. From what i remarked,i can tell that the number of times a letter occurs near a vowel or near a consonant determines whether if it is a vowel or a consonant.Thus,the more times a letter occurs near a vowel,the lower the possibility of that letter being a vowel.The same thing applies to consonants. 
     Also,could you do a tutorial on image manipulation in C# (i know that there are some projects on the web,but they are very vague and a beginner,such as i am,can&#039;t understand them). 
    Thanks again for your response !</description>
		<content:encoded><![CDATA[<p>Thank you for your answer ! If i may,i would also like to point out one aspect that surprised me ! This algorithm is a statistical one,and i remarked that some of the facts stated in the article in which the article is presented (<a href="http://www.4shared.com/office/dKlzPwpB/guy1991vowelIdentification.html?" rel="nofollow">http://www.4shared.com/office/dKlzPwpB/guy1991vowelIdentification.html?</a>) tend to make this algorithm quite inexact. For example,it is mentioned in the article that,in the English language,Sukhotin&#8217;s algorithm can return &#8220;t&#8221; as a vocal due to the fact that this letter tends to occur very often near a consonant.<br />
    Also,i can tell you that this also applies to Romanian. From what i remarked,i can tell that the number of times a letter occurs near a vowel or near a consonant determines whether if it is a vowel or a consonant.Thus,the more times a letter occurs near a vowel,the lower the possibility of that letter being a vowel.The same thing applies to consonants.<br />
     Also,could you do a tutorial on image manipulation in C# (i know that there are some projects on the web,but they are very vague and a beginner,such as i am,can&#8217;t understand them).<br />
    Thanks again for your response !</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Building a Startup &#8211; 12 Priceless Tools for Launching Your MVP by Affordable Health Insurance Companies Comparison Charleston, West Virginia</title>
		<link>http://www.nashcoding.com/2011/05/31/building-a-startup-12-priceless-tools-for-launching-your-mvp/comment-page-1/#comment-541</link>
		<dc:creator>Affordable Health Insurance Companies Comparison Charleston, West Virginia</dc:creator>
		<pubDate>Wed, 11 Jan 2012 05:32:37 +0000</pubDate>
		<guid isPermaLink="false">http://www.nashcoding.com/?p=356#comment-541</guid>
		<description>If possible, as you gain information, please add to this blog with new information. I have found it extremely useful.</description>
		<content:encoded><![CDATA[<p>If possible, as you gain information, please add to this blog with new information. I have found it extremely useful.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Implementation of Sukhotin&#8217;s Algorithm by Wesley</title>
		<link>http://www.nashcoding.com/2010/07/07/implementation-of-sukhotins-algorithm/comment-page-1/#comment-538</link>
		<dc:creator>Wesley</dc:creator>
		<pubDate>Sat, 17 Dec 2011 20:23:47 +0000</pubDate>
		<guid isPermaLink="false">http://www.nashcoding.com/?p=51#comment-538</guid>
		<description>Looks like you&#039;ve got escape characters in your string. If you&#039;re going to use the \ character in a string, you need to escape the characters or make it a string literal. Just put @ before the first quotation mark. :)</description>
		<content:encoded><![CDATA[<p>Looks like you&#8217;ve got escape characters in your string. If you&#8217;re going to use the \ character in a string, you need to escape the characters or make it a string literal. Just put @ before the first quotation mark. <img src='http://www.nashcoding.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Implementation of Sukhotin&#8217;s Algorithm by Robert</title>
		<link>http://www.nashcoding.com/2010/07/07/implementation-of-sukhotins-algorithm/comment-page-1/#comment-537</link>
		<dc:creator>Robert</dc:creator>
		<pubDate>Sat, 17 Dec 2011 20:06:27 +0000</pubDate>
		<guid isPermaLink="false">http://www.nashcoding.com/?p=51#comment-537</guid>
		<description>Very interesting algorithm,but at row 33 i have an error! I am using visual studio 2010 express and i downloaded the list in in the parentheses and typed inside the parentheses the path to the list .Here&#039;s a screenshot of the problem: http://www.4shared.com/photo/u_jKrUhv/error.html? 
Can you help me,please???</description>
		<content:encoded><![CDATA[<p>Very interesting algorithm,but at row 33 i have an error! I am using visual studio 2010 express and i downloaded the list in in the parentheses and typed inside the parentheses the path to the list .Here&#8217;s a screenshot of the problem: <a href="http://www.4shared.com/photo/u_jKrUhv/error.html?" rel="nofollow">http://www.4shared.com/photo/u_jKrUhv/error.html?</a><br />
Can you help me,please???</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Building a Startup &#8211; Part 2 &#8211; Defending .NET by Simon</title>
		<link>http://www.nashcoding.com/2011/04/10/building-a-startup-part-2-defending-net/comment-page-1/#comment-535</link>
		<dc:creator>Simon</dc:creator>
		<pubDate>Sat, 19 Nov 2011 18:43:44 +0000</pubDate>
		<guid isPermaLink="false">http://www.nashcoding.com/?p=282#comment-535</guid>
		<description>Visual Studio is there to host ReShaeper and notning else. On it&#039;s own it sucks. Oh and Django is superior to ASP.NET MVC in every single way I can imagine.</description>
		<content:encoded><![CDATA[<p>Visual Studio is there to host ReShaeper and notning else. On it&#8217;s own it sucks. Oh and Django is superior to ASP.NET MVC in every single way I can imagine.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Building a Startup &#8211; 12 Priceless Tools for Launching Your MVP by Eric</title>
		<link>http://www.nashcoding.com/2011/05/31/building-a-startup-12-priceless-tools-for-launching-your-mvp/comment-page-1/#comment-516</link>
		<dc:creator>Eric</dc:creator>
		<pubDate>Tue, 01 Nov 2011 10:39:02 +0000</pubDate>
		<guid isPermaLink="false">http://www.nashcoding.com/?p=356#comment-516</guid>
		<description>I love the article name and yes these tools are priceless! I love but important Top &quot; &quot; list.  These articles are very valuable for startups and beginner entrepreneurs.</description>
		<content:encoded><![CDATA[<p>I love the article name and yes these tools are priceless! I love but important Top &#8221; &#8221; list.  These articles are very valuable for startups and beginner entrepreneurs.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Hacker News Needs Honeypots by Rob Ruffler</title>
		<link>http://www.nashcoding.com/2011/10/28/hackernews-needs-honeypots/comment-page-1/#comment-508</link>
		<dc:creator>Rob Ruffler</dc:creator>
		<pubDate>Fri, 28 Oct 2011 20:05:06 +0000</pubDate>
		<guid isPermaLink="false">http://www.nashcoding.com/?p=428#comment-508</guid>
		<description>While I&#039;ll agree that there is a fair amount of colorful commentary in Giles post, I wouldn&#039;t say it&#039;s irrelevant.

I particularly agree with this statement:

&quot;When you build a system where you get points for the number of people who agree with you, you are building a popularity contest for ideas. However, your popularity contest for ideas will not be dominated by the people with the best ideas, but the people with the most time to spend on your web site. Votes appear to be free, like contribution is with Wikipedia, but in reality you have to register to vote, and you have to be there frequently for your votes to make much difference. So the votes aren&#039;t really free - they cost time. If you do the math, it&#039;s actually quite obvious that if your popularity contest for ideas inherently, by its structure, favors people who waste their own time, then your contest will produce winners which are actually losers. The most popular ideas will not be the best ideas, since the people who have the best ideas, and the ability to recognize them, also have better things to do and better places to be.&quot;

Lack of article quality over time certainly does seem like a systemic problem.</description>
		<content:encoded><![CDATA[<p>While I&#8217;ll agree that there is a fair amount of colorful commentary in Giles post, I wouldn&#8217;t say it&#8217;s irrelevant.</p>
<p>I particularly agree with this statement:</p>
<p>&#8220;When you build a system where you get points for the number of people who agree with you, you are building a popularity contest for ideas. However, your popularity contest for ideas will not be dominated by the people with the best ideas, but the people with the most time to spend on your web site. Votes appear to be free, like contribution is with Wikipedia, but in reality you have to register to vote, and you have to be there frequently for your votes to make much difference. So the votes aren&#8217;t really free &#8211; they cost time. If you do the math, it&#8217;s actually quite obvious that if your popularity contest for ideas inherently, by its structure, favors people who waste their own time, then your contest will produce winners which are actually losers. The most popular ideas will not be the best ideas, since the people who have the best ideas, and the ability to recognize them, also have better things to do and better places to be.&#8221;</p>
<p>Lack of article quality over time certainly does seem like a systemic problem.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Hacker News Needs Honeypots by Wesley</title>
		<link>http://www.nashcoding.com/2011/10/28/hackernews-needs-honeypots/comment-page-1/#comment-507</link>
		<dc:creator>Wesley</dc:creator>
		<pubDate>Fri, 28 Oct 2011 19:26:55 +0000</pubDate>
		<guid isPermaLink="false">http://www.nashcoding.com/?p=428#comment-507</guid>
		<description>@Rob: Thanks for pointing that out. The article he&#039;s linking there is pretty much just ad hominem attacks with no actual evidence, so I&#039;ll just dismiss it.</description>
		<content:encoded><![CDATA[<p>@Rob: Thanks for pointing that out. The article he&#8217;s linking there is pretty much just ad hominem attacks with no actual evidence, so I&#8217;ll just dismiss it.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Hacker News Needs Honeypots by Rob Ruffler</title>
		<link>http://www.nashcoding.com/2011/10/28/hackernews-needs-honeypots/comment-page-1/#comment-506</link>
		<dc:creator>Rob Ruffler</dc:creator>
		<pubDate>Fri, 28 Oct 2011 19:06:53 +0000</pubDate>
		<guid isPermaLink="false">http://www.nashcoding.com/?p=428#comment-506</guid>
		<description>@Wesley, I believe Giles is suggesting you click on his name in this comment thread. 

It links here: http://gilesbowkett.blogspot.com/2008/05/summon-monsters-open-door-heal-or-die.html</description>
		<content:encoded><![CDATA[<p>@Wesley, I believe Giles is suggesting you click on his name in this comment thread. </p>
<p>It links here: <a href="http://gilesbowkett.blogspot.com/2008/05/summon-monsters-open-door-heal-or-die.html" rel="nofollow">http://gilesbowkett.blogspot.com/2008/05/summon-monsters-open-door-heal-or-die.html</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Hacker News Needs Honeypots by Wesley</title>
		<link>http://www.nashcoding.com/2011/10/28/hackernews-needs-honeypots/comment-page-1/#comment-505</link>
		<dc:creator>Wesley</dc:creator>
		<pubDate>Fri, 28 Oct 2011 17:06:15 +0000</pubDate>
		<guid isPermaLink="false">http://www.nashcoding.com/?p=428#comment-505</guid>
		<description>@giles: What? Just provide a link please...</description>
		<content:encoded><![CDATA[<p>@giles: What? Just provide a link please&#8230;</p>
]]></content:encoded>
	</item>
</channel>
</rss>

