pigfoot’s weblog
We should forget about small efficiencies — Donald Knuth
An improvement on capturing similarity between strings
Author: pigfoot5 Aug
An improvement on capturing similarity between strings, from CodeProject.
主要是 implement Levenshtein algorithm 和 Kuhn-Munkres algorithm (a.k.a Hungarian method).
Popularity: 16% [?]
PhotoStream
Categories
Recent Comments
- buy fioricet: Fioricet online Cheapest price... Hey guys,
- matt: Appreciate the builds so far..
- firefox 3.0.3: 等待pigfoot 3.0.3 版 ........
- Buy tramadol: shop for Tramadol... Where can I
- [Fx] Lucky☆Fox 1.0.0 #080817 釋出 | the KiDs ?!: [...] LuckyFox 1.0.0 #080818
- pank: 在使用傳統倉頡、注音時, 請問有沒有辦法讓字根不要出現在游標處?
- pigfoot: Toomore: 哈哈 不過我買的這款魔術方塊好像不太好轉的感覺 :p
- pigfoot: .Ai 不是耶 是 Logitech 的.
- pigfoot: Cheyi & Toomore: Yes. All libraries
- pigfoot: city_fantar: You're right. However, the mmx
Links
Archives
- July 2008
- June 2008
- April 2008
- February 2008
- December 2007
- November 2007
- October 2007
- September 2007
- August 2007
- July 2007
- June 2007
- March 2007
- February 2007
- January 2007
- December 2006
- November 2006
- October 2006
- September 2006
- August 2006
- July 2006
- June 2006
- May 2006
- April 2006
- March 2006
- February 2006
- January 2006
- December 2005
- November 2005
- October 2005
- September 2005
- August 2005
- July 2005
- June 2005
One Response for "An improvement on capturing similarity between strings"
Very interesting article
Leave a reply