<?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>Computer Cranium &#187; distance</title>
	<atom:link href="http://computercranium.com/tag/distance/feed" rel="self" type="application/rss+xml" />
	<link>http://computercranium.com</link>
	<description>Your Computer Science Resource</description>
	<lastBuildDate>Fri, 23 Jul 2010 01:15:39 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>HOW-TO: Use the Levenshtein Distance Algorithm</title>
		<link>http://computercranium.com/programming/java/howto-use-the-levenshtein-distance-algorithm</link>
		<comments>http://computercranium.com/programming/java/howto-use-the-levenshtein-distance-algorithm#comments</comments>
		<pubDate>Thu, 07 May 2009 22:30:21 +0000</pubDate>
		<dc:creator>Kurt</dc:creator>
				<category><![CDATA[Data Structures & Algorithms]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Tutorials]]></category>
		<category><![CDATA[algorithm]]></category>
		<category><![CDATA[distance]]></category>
		<category><![CDATA[levenshtein]]></category>

		<guid isPermaLink="false">http://computercranium.com/?p=320</guid>
		<description><![CDATA[For an anti-plagiarism application I developed about a year ago, I needed a way to calculate the similarity between two strings.  I wasn&#8217;t sure how to go about doing this at first, but then I came across the Levenshtein Distance Algorithm which gets the job done well.  In this example, I&#8217;ll show you [...]]]></description>
		<wfw:commentRss>http://computercranium.com/programming/java/howto-use-the-levenshtein-distance-algorithm/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
