<?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/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: Word stemming in Ruby</title>
	<atom:link href="http://blog.saush.com/2009/02/08/word-stemming-in-ruby/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.saush.com/2009/02/08/word-stemming-in-ruby/</link>
	<description>technology, people and life in general</description>
	<lastBuildDate>Sun, 05 Sep 2010 23:48:54 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>By: Building a search engine in 200ish lines of Ruby &#171; A little story</title>
		<link>http://blog.saush.com/2009/02/08/word-stemming-in-ruby/#comment-696</link>
		<dc:creator>Building a search engine in 200ish lines of Ruby &#171; A little story</dc:creator>
		<pubDate>Wed, 01 Apr 2009 13:25:12 +0000</pubDate>
		<guid isPermaLink="false">http://blog.saush.com/?p=234#comment-696</guid>
		<description>[...] I do cheat a bit and use various libraries extensively including Hpricot, DataMapper and the Porter Stemmer. SaushEngine is a web search engine which means it goes out to  Internet and harvests data on [...]</description>
		<content:encoded><![CDATA[<p>[...] I do cheat a bit and use various libraries extensively including Hpricot, DataMapper and the Porter Stemmer. SaushEngine is a web search engine which means it goes out to  Internet and harvests data on [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: saush.com &#187; Blog Archive &#187; Write an Internet search engine with 200 lines of Ruby code</title>
		<link>http://blog.saush.com/2009/02/08/word-stemming-in-ruby/#comment-695</link>
		<dc:creator>saush.com &#187; Blog Archive &#187; Write an Internet search engine with 200 lines of Ruby code</dc:creator>
		<pubDate>Tue, 17 Mar 2009 14:17:46 +0000</pubDate>
		<guid isPermaLink="false">http://blog.saush.com/?p=234#comment-695</guid>
		<description>[...] I do cheat a bit and use various libraries extensively including Hpricot, DataMapper and the Porter Stemmer. SaushEngine is a web search engine which means it goes out to  Internet and harvests data on [...]</description>
		<content:encoded><![CDATA[<p>[...] I do cheat a bit and use various libraries extensively including Hpricot, DataMapper and the Porter Stemmer. SaushEngine is a web search engine which means it goes out to  Internet and harvests data on [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: saush.com &#187; Blog Archive &#187; Naive Bayesian Classifiers and Ruby</title>
		<link>http://blog.saush.com/2009/02/08/word-stemming-in-ruby/#comment-694</link>
		<dc:creator>saush.com &#187; Blog Archive &#187; Naive Bayesian Classifiers and Ruby</dc:creator>
		<pubDate>Tue, 10 Feb 2009 16:38:44 +0000</pubDate>
		<guid isPermaLink="false">http://blog.saush.com/?p=234#comment-694</guid>
		<description>[...] to a root word &#8216;fish&#8217;. In our method here we used a popular stemming algorithm called Porter stemming algorithm. To use this stemming algorithm, install the following [...]</description>
		<content:encoded><![CDATA[<p>[...] to a root word &#8216;fish&#8217;. In our method here we used a popular stemming algorithm called Porter stemming algorithm. To use this stemming algorithm, install the following [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Roman</title>
		<link>http://blog.saush.com/2009/02/08/word-stemming-in-ruby/#comment-693</link>
		<dc:creator>Roman</dc:creator>
		<pubDate>Mon, 09 Feb 2009 18:10:23 +0000</pubDate>
		<guid isPermaLink="false">http://blog.saush.com/?p=234#comment-693</guid>
		<description>You might be interested in my version of stemmer. It&#039;s based on the C version and thus in an order of magnitude faster (and uses MUCH less memory).
http://github.com/romanbsd/fast-stemmer</description>
		<content:encoded><![CDATA[<p>You might be interested in my version of stemmer. It&#8217;s based on the C version and thus in an order of magnitude faster (and uses MUCH less memory).<br />
<a href="http://github.com/romanbsd/fast-stemmer" rel="nofollow">http://github.com/romanbsd/fast-stemmer</a></p>
]]></content:encoded>
	</item>
</channel>
</rss>
