﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>C++博客-阿牛CPP-随笔分类-算法</title><link>http://www.cppblog.com/whncpp/category/8328.html</link><description /><language>zh-cn</language><lastBuildDate>Sat, 20 Sep 2008 19:26:55 GMT</lastBuildDate><pubDate>Sat, 20 Sep 2008 19:26:55 GMT</pubDate><ttl>60</ttl><item><title>字符串相似度算法（ Levenshtein Distance算法）</title><link>http://www.cppblog.com/whncpp/archive/2008/09/21/62378.html</link><dc:creator>whn</dc:creator><author>whn</author><pubDate>Sat, 20 Sep 2008 19:03:00 GMT</pubDate><guid>http://www.cppblog.com/whncpp/archive/2008/09/21/62378.html</guid><wfw:comment>http://www.cppblog.com/whncpp/comments/62378.html</wfw:comment><comments>http://www.cppblog.com/whncpp/archive/2008/09/21/62378.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/whncpp/comments/commentRss/62378.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/whncpp/services/trackbacks/62378.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 一个字符串可以通过增加一个字符，删除一个字符，替换一个字符得到另外一个字符串，假设，我们把从字符串A转换成字符串B，前面3种操作所执行的最少次数称为AB相似度<br>&nbsp;&nbsp;<a href='http://www.cppblog.com/whncpp/archive/2008/09/21/62378.html'>阅读全文</a><img src ="http://www.cppblog.com/whncpp/aggbug/62378.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/whncpp/" target="_blank">whn</a> 2008-09-21 03:03 <a href="http://www.cppblog.com/whncpp/archive/2008/09/21/62378.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>