<?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>pigfoot's weblog &#187; C#</title>
	<atom:link href="http://weblog.pigfoot.org/pigfoot/category/dev/csharp/feed/" rel="self" type="application/rss+xml" />
	<link>http://weblog.pigfoot.org/pigfoot</link>
	<description>We should forget about small efficiencies -- Donald Knuth</description>
	<lastBuildDate>Fri, 30 Jul 2010 02:51:24 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
		<item>
		<title>An improvement on capturing similarity between strings</title>
		<link>http://weblog.pigfoot.org/pigfoot/2005/08/05/an-improvement-on-capturing-similarity-between-strings/</link>
		<comments>http://weblog.pigfoot.org/pigfoot/2005/08/05/an-improvement-on-capturing-similarity-between-strings/#comments</comments>
		<pubDate>Fri, 05 Aug 2005 15:41:00 +0000</pubDate>
		<dc:creator>pigfoot</dc:creator>
				<category><![CDATA[C#]]></category>
		<category><![CDATA[Develop]]></category>

		<guid isPermaLink="false">http://weblog.pigfoot.org/pigfoot/2005/08/05/an-improvement-on-capturing-similarity-between-strings/</guid>
		<description><![CDATA[An improvement on capturing similarity between strings, from CodeProject. 主要是 implement Levenshtein algorithm 和 Kuhn-Munkres algorithm (a.k.a Hungarian method).]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.codeproject.com/csharp/ImproveStringSimilarity.asp">An improvement on capturing similarity between strings</a>, from <a href="http://www.codeproject.com/">CodeProject</a>.</p>
<p>主要是 implement <a href="http://www.let.rug.nl/~kleiweg/lev/levenshtein.html">Levenshtein algorithm</a> 和 <a href="http://www.math.uwo.ca/~mdawes/courses/344/kuhn-munkres.html">Kuhn-Munkres algorithm</a> (a.k.a Hungarian method).</p>
<img src="http://weblog.pigfoot.org/pigfoot/?ak_action=api_record_view&id=98&type=feed" alt="" />]]></content:encoded>
			<wfw:commentRss>http://weblog.pigfoot.org/pigfoot/2005/08/05/an-improvement-on-capturing-similarity-between-strings/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
	</channel>
</rss>
