摘要:
维基百科对字符串相似度(Damerau–Levenshtein distance)的定义是:In information theory and computer science, the Damerau–Levenshtein distance (named after Frederick J. Damerau and Vladimir I. Levenshtein) is a "distance" (string metric) between two strings, i.e., finite sequence of symbols, given by counting 阅读全文
posted @ 2011-07-21 14:11
ET民工[源自火星]
阅读(1630)
评论(0)
推荐(0)
浙公网安备 33010602011771号