<?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"
	>
<channel>
	<title>Comments on: Symbols as Hash Codes for Super-fast Linear Classifiers</title>
	<atom:link href="http://lingpipe-blog.com/2008/03/25/symbols-as-hash-codes-for-super-fast-linear-classifiers/feed/" rel="self" type="application/rss+xml" />
	<link>http://lingpipe-blog.com/2008/03/25/symbols-as-hash-codes-for-super-fast-linear-classifiers/</link>
	<description>Alias-i’s Natural Language Processing and Text Analytics API</description>
	<pubDate>Wed, 20 Aug 2008 23:59:15 +0000</pubDate>
	<generator>http://wordpress.org/?v=MU</generator>
		<item>
		<title>By: An Online Logistic Regression API with Regularization &#171; LingPipe Blog</title>
		<link>http://lingpipe-blog.com/2008/03/25/symbols-as-hash-codes-for-super-fast-linear-classifiers/#comment-2457</link>
		<dc:creator>An Online Logistic Regression API with Regularization &#171; LingPipe Blog</dc:creator>
		<pubDate>Tue, 03 Jun 2008 23:13:20 +0000</pubDate>
		<guid isPermaLink="false">http://lingpipe.wordpress.com/?p=83#comment-2457</guid>
		<description>[...] so a constant stream of new features won&#8217;t blow out memory (see my previous blog entry on using hash codes as features). Unfortunately, VW runs from the command-line and requires the training examples to be in a data [...]</description>
		<content:encoded><![CDATA[<p>[...] so a constant stream of new features won&#8217;t blow out memory (see my previous blog entry on using hash codes as features). Unfortunately, VW runs from the command-line and requires the training examples to be in a data [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Feature Hash Code Collisions in Linear Classifiers &#171; LingPipe Blog</title>
		<link>http://lingpipe-blog.com/2008/03/25/symbols-as-hash-codes-for-super-fast-linear-classifiers/#comment-2164</link>
		<dc:creator>Feature Hash Code Collisions in Linear Classifiers &#171; LingPipe Blog</dc:creator>
		<pubDate>Fri, 02 May 2008 18:38:56 +0000</pubDate>
		<guid isPermaLink="false">http://lingpipe.wordpress.com/?p=83#comment-2164</guid>
		<description>[...] a comment to John Langford&#8217;s response to my blog entry recapitulating his comments after his talk, Kuzman Ganchev points out that he and Mark Dredze did [...]</description>
		<content:encoded><![CDATA[<p>[...] a comment to John Langford&#8217;s response to my blog entry recapitulating his comments after his talk, Kuzman Ganchev points out that he and Mark Dredze did [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Machine Learning (Theory) &#187; Eliminating the Birthday Paradox for Universal Features</title>
		<link>http://lingpipe-blog.com/2008/03/25/symbols-as-hash-codes-for-super-fast-linear-classifiers/#comment-2138</link>
		<dc:creator>Machine Learning (Theory) &#187; Eliminating the Birthday Paradox for Universal Features</dc:creator>
		<pubDate>Sat, 26 Apr 2008 18:40:49 +0000</pubDate>
		<guid isPermaLink="false">http://lingpipe.wordpress.com/?p=83#comment-2138</guid>
		<description>[...] want to expand on this post which describes one of the core tricks for making Vowpal Wabbit fast and easy to use when learning [...]</description>
		<content:encoded><![CDATA[<p>[...] want to expand on this post which describes one of the core tricks for making Vowpal Wabbit fast and easy to use when learning [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: craig</title>
		<link>http://lingpipe-blog.com/2008/03/25/symbols-as-hash-codes-for-super-fast-linear-classifiers/#comment-2076</link>
		<dc:creator>craig</dc:creator>
		<pubDate>Fri, 04 Apr 2008 19:38:42 +0000</pubDate>
		<guid isPermaLink="false">http://lingpipe.wordpress.com/?p=83#comment-2076</guid>
		<description>http://weblogs.java.net/blog/kohsuke/archive/2008/03/deep_dive_into.html

This article gives a method for getting the assembly code of native code produced by the JIT. Take a peek.</description>
		<content:encoded><![CDATA[<p><a href="http://weblogs.java.net/blog/kohsuke/archive/2008/03/deep_dive_into.html" rel="nofollow">http://weblogs.java.net/blog/kohsuke/archive/2008/03/deep_dive_into.html</a></p>
<p>This article gives a method for getting the assembly code of native code produced by the JIT. Take a peek.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
