<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Inviting Epiphany &#187; Projects</title>
	<atom:link href="http://richardminerich.com/category/projects/feed/" rel="self" type="application/rss+xml" />
	<link>http://richardminerich.com</link>
	<description>A programmer&#039;s chronicle of insights and discoveries</description>
	<lastBuildDate>Sun, 15 Apr 2012 22:15:53 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
		<item>
		<title>Advice for Getting Started with F#</title>
		<link>http://richardminerich.com/2011/10/advice-for-getting-started-with-f/</link>
		<comments>http://richardminerich.com/2011/10/advice-for-getting-started-with-f/#comments</comments>
		<pubDate>Mon, 03 Oct 2011 19:12:39 +0000</pubDate>
		<dc:creator>Richard Minerich</dc:creator>
				<category><![CDATA[Conferences]]></category>
		<category><![CDATA[Events]]></category>
		<category><![CDATA[Professional F# 2.0]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[fsharp]]></category>
		<category><![CDATA[Learning F#]]></category>

		<guid isPermaLink="false">http://richardminerich.com/?p=875</guid>
		<description><![CDATA[I had a great time at NYC Code Camp this last weekend. About half the people in my talk already knew F# and were there to talk about Type Providers, the other half just came to see what this F# thing was all about. This post is to help those in the second half begin [...]]]></description>
		<wfw:commentRss>http://richardminerich.com/2011/10/advice-for-getting-started-with-f/feed/</wfw:commentRss>
		<slash:comments>5</slash:comments>
		</item>
		<item>
		<title>Record Linkage Algorithms in F# – Extensions to Jaro-Winkler Distance (Part 3)</title>
		<link>http://richardminerich.com/2011/09/record-linkage-algorithms-in-f-extensions-to-jaro-winkler-distance-part-3/</link>
		<comments>http://richardminerich.com/2011/09/record-linkage-algorithms-in-f-extensions-to-jaro-winkler-distance-part-3/#comments</comments>
		<pubDate>Tue, 27 Sep 2011 13:15:20 +0000</pubDate>
		<dc:creator>Richard Minerich</dc:creator>
				<category><![CDATA[Record Linkage]]></category>
		<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[fsharp]]></category>
		<category><![CDATA[Jaro]]></category>
		<category><![CDATA[Jaro-Winkler]]></category>
		<category><![CDATA[Machine Learning]]></category>

		<guid isPermaLink="false">http://richardminerich.com/?p=721</guid>
		<description><![CDATA[While writing the previous article on tokenized matching I realized I left out some important background information on Jaro-Winkler distance. First, there&#8217;s something important to know about the Jaro-Winkler distance: it&#8217;s not a metric distance and so does not obey the triangle inequality. That is, if you found the JW distance between strings A and [...]]]></description>
		<wfw:commentRss>http://richardminerich.com/2011/09/record-linkage-algorithms-in-f-extensions-to-jaro-winkler-distance-part-3/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Imperative Pseudocode to Pure Functional Algorithm with Gale-Shapely and F#</title>
		<link>http://richardminerich.com/2011/09/imperative-pseudocode-to-pure-functional-algorithm/</link>
		<comments>http://richardminerich.com/2011/09/imperative-pseudocode-to-pure-functional-algorithm/#comments</comments>
		<pubDate>Mon, 19 Sep 2011 20:51:23 +0000</pubDate>
		<dc:creator>Richard Minerich</dc:creator>
				<category><![CDATA[Record Linkage]]></category>
		<category><![CDATA[Thoughts]]></category>
		<category><![CDATA[Abstraction]]></category>
		<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[fsharp]]></category>
		<category><![CDATA[Functional Programming]]></category>
		<category><![CDATA[Gale-Shapely]]></category>
		<category><![CDATA[Immutable Data Structures]]></category>
		<category><![CDATA[Looping]]></category>
		<category><![CDATA[Recursion]]></category>

		<guid isPermaLink="false">http://richardminerich.com/?p=781</guid>
		<description><![CDATA[Continuing from last time, let&#8217;s look at how one goes from imperative pseudocode to pure functional using Gale-Shapely as an example. Overall, to convert an algorithm from imperative to functional is a fairly simple process once you understand how to convert from a while loop to recursion with accumulators. This post is just a more [...]]]></description>
		<wfw:commentRss>http://richardminerich.com/2011/09/imperative-pseudocode-to-pure-functional-algorithm/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Record Linkage in F# &#8211; Token Matching, Stable Marriages and the Gale-Shapley algorithm</title>
		<link>http://richardminerich.com/2011/09/record-linkage-in-f-token-matching-stable-marriages-and-the-gale-shapley-algorithm/</link>
		<comments>http://richardminerich.com/2011/09/record-linkage-in-f-token-matching-stable-marriages-and-the-gale-shapley-algorithm/#comments</comments>
		<pubDate>Tue, 13 Sep 2011 13:00:53 +0000</pubDate>
		<dc:creator>Richard Minerich</dc:creator>
				<category><![CDATA[Record Linkage]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[Gale-Shapely]]></category>
		<category><![CDATA[Token Alignment]]></category>

		<guid isPermaLink="false">http://richardminerich.com/?p=710</guid>
		<description><![CDATA[Initially, one of the biggest problems I found when trying to marry records was the god awful quality of much of data I often have to work with. It&#8217;s mostly old mainframe and database data with truncated fields, limited character sets and fields with nonsensical contents. Even worse, much of the data is the result [...]]]></description>
		<wfw:commentRss>http://richardminerich.com/2011/09/record-linkage-in-f-token-matching-stable-marriages-and-the-gale-shapley-algorithm/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Record Linkage Algorithms in F# – Jaro-Winkler Distance (Part 2)</title>
		<link>http://richardminerich.com/2011/09/record-linkage-algorithms-in-f-%e2%80%93-jaro-winkler-distance-part-2/</link>
		<comments>http://richardminerich.com/2011/09/record-linkage-algorithms-in-f-%e2%80%93-jaro-winkler-distance-part-2/#comments</comments>
		<pubDate>Tue, 06 Sep 2011 13:09:16 +0000</pubDate>
		<dc:creator>Richard Minerich</dc:creator>
				<category><![CDATA[Record Linkage]]></category>
		<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[fsharp]]></category>
		<category><![CDATA[Jaro]]></category>
		<category><![CDATA[Jaro-Winkler]]></category>
		<category><![CDATA[Machine Learning]]></category>

		<guid isPermaLink="false">http://richardminerich.com/?p=671</guid>
		<description><![CDATA[Last time we dove into the Jaro distance algorithm and picked apart how each of its components are calculated. However, from a modern perspective Jaro alone is a rather weak method of string matching. It was Winkler&#8217;s extension that brought this algorithm into widespread modern use. Matthew Jaro&#8217;s insight when inventing the Jaro distance algorithm [...]]]></description>
		<wfw:commentRss>http://richardminerich.com/2011/09/record-linkage-algorithms-in-f-%e2%80%93-jaro-winkler-distance-part-2/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Record Linkage Algorithms in F# &#8211; Jaro-Winkler Distance (Part 1)</title>
		<link>http://richardminerich.com/2011/09/record-linkage-algorithms-in-f-jaro-winkler-distance-part-1/</link>
		<comments>http://richardminerich.com/2011/09/record-linkage-algorithms-in-f-jaro-winkler-distance-part-1/#comments</comments>
		<pubDate>Fri, 02 Sep 2011 18:44:30 +0000</pubDate>
		<dc:creator>Richard Minerich</dc:creator>
				<category><![CDATA[Record Linkage]]></category>
		<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[fsharp]]></category>
		<category><![CDATA[Jaro]]></category>
		<category><![CDATA[Jaro-Winkler]]></category>
		<category><![CDATA[Machine Learning]]></category>
		<category><![CDATA[Tutorial]]></category>

		<guid isPermaLink="false">http://richardminerich.com/?p=640</guid>
		<description><![CDATA[When first approaching the task of record linkage I was initially overwhelmed by the huge number of different algorithms available for comparing strings. Now I know that the secret to finding your way in this sea of algorithms is two fold. First, know that many are outdated and have newer and better implementations, so they [...]]]></description>
		<wfw:commentRss>http://richardminerich.com/2011/09/record-linkage-algorithms-in-f-jaro-winkler-distance-part-1/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>An F# Ant Colony Simulation in Silverlight 4.0 with Dynamic AI Loading</title>
		<link>http://richardminerich.com/2010/12/an-f-ant-colony-simulation-in-silverlight-4-0-with-dynamic-ai-loading/</link>
		<comments>http://richardminerich.com/2010/12/an-f-ant-colony-simulation-in-silverlight-4-0-with-dynamic-ai-loading/#comments</comments>
		<pubDate>Sat, 11 Dec 2010 07:44:14 +0000</pubDate>
		<dc:creator>Richard Minerich</dc:creator>
				<category><![CDATA[Conferences]]></category>
		<category><![CDATA[Events]]></category>
		<category><![CDATA[Games]]></category>
		<category><![CDATA[Projects]]></category>
		<category><![CDATA[Ants]]></category>
		<category><![CDATA[Assembly Loading]]></category>
		<category><![CDATA[CUFP]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[Silverlight 4.0]]></category>

		<guid isPermaLink="false">http://richardminerich.com/?p=476</guid>
		<description><![CDATA[I&#8217;ve been enviously watching Phillip Trelford publish excellent F# games all week and tonight I just couldn&#8217;t stand it anymore.  I stayed in, rolled up my sleeves and ported the very same ant colony simulation I used in my CUFP workshop to Silverlight 4.0. Wow, just look at those little guys go at it.  Silverlight [...]]]></description>
		<wfw:commentRss>http://richardminerich.com/2010/12/an-f-ant-colony-simulation-in-silverlight-4-0-with-dynamic-ai-loading/feed/</wfw:commentRss>
		<slash:comments>6</slash:comments>
		</item>
		<item>
		<title>An F# Whirlwind</title>
		<link>http://richardminerich.com/2010/11/an-f-whirlwind/</link>
		<comments>http://richardminerich.com/2010/11/an-f-whirlwind/#comments</comments>
		<pubDate>Wed, 03 Nov 2010 22:43:43 +0000</pubDate>
		<dc:creator>Richard Minerich</dc:creator>
				<category><![CDATA[Conferences]]></category>
		<category><![CDATA[Professional F# 2.0]]></category>
		<category><![CDATA[User Groups]]></category>
		<category><![CDATA[Books]]></category>
		<category><![CDATA[Education]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[IKEA]]></category>
		<category><![CDATA[NYCFSUG]]></category>

		<guid isPermaLink="false">http://richardminerich.com/?p=309</guid>
		<description><![CDATA[Just under two weeks ago I was packing up my things at Atalasoft and enjoying my last Friday Beer:30 with coworkers and friends. A lot has changed in these past two weeks. I&#8217;ve moved into my Hoboken apartment and (partially) assembled a whole set of IKEA furniture, I&#8217;ve gotten started as the first employee at [...]]]></description>
		<wfw:commentRss>http://richardminerich.com/2010/11/an-f-whirlwind/feed/</wfw:commentRss>
		<slash:comments>4</slash:comments>
		</item>
		<item>
		<title>The Ted Neward F# Folding Challenge</title>
		<link>http://richardminerich.com/2010/04/the-ted-neward-f-folding-challenge/</link>
		<comments>http://richardminerich.com/2010/04/the-ted-neward-f-folding-challenge/#comments</comments>
		<pubDate>Thu, 29 Apr 2010 22:53:20 +0000</pubDate>
		<dc:creator>Richard Minerich</dc:creator>
				<category><![CDATA[Professional F# 2.0]]></category>
		<category><![CDATA[Code Kata]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[fold]]></category>
		<category><![CDATA[foldBack]]></category>
		<category><![CDATA[fsharp]]></category>

		<guid isPermaLink="false">http://richardminerich.com/?p=76</guid>
		<description><![CDATA[My friend, and fellow Professional F# 2.0 author, Ted Neward recently challenged me to a bit of a Code Kata.   Take a list of numbers and compress it in a particular simple way but without any mutable state.  What makes this problem interesting is that a tech interviewer mentioned that that he hadn&#8217;t seen a functional [...]]]></description>
		<wfw:commentRss>http://richardminerich.com/2010/04/the-ted-neward-f-folding-challenge/feed/</wfw:commentRss>
		<slash:comments>23</slash:comments>
		</item>
		<item>
		<title>Professional F# 2.0 in Progress</title>
		<link>http://richardminerich.com/2010/02/professional-f-2-0-in-progress/</link>
		<comments>http://richardminerich.com/2010/02/professional-f-2-0-in-progress/#comments</comments>
		<pubDate>Fri, 12 Feb 2010 01:19:24 +0000</pubDate>
		<dc:creator>Richard Minerich</dc:creator>
				<category><![CDATA[Professional F# 2.0]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Writing]]></category>

		<guid isPermaLink="false">http://richardminerich.com/?p=3</guid>
		<description><![CDATA[Over the past few months I&#8217;ve been hard at work on Professional F# 2.0 for Wrox. Describing functional programming to an object oriented audience is a major challenge but I believe I have risen to it well thus far.  The main issue stems from the fact that functional programming is so different and most of [...]]]></description>
		<wfw:commentRss>http://richardminerich.com/2010/02/professional-f-2-0-in-progress/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

