文本相似度计算方法汇总:文本相似度计算方法详解
1 基本思路
定义:
- 假设字符串 S A S_A SA,共 m m m 位,即 S A [ 1 ] S_A[1] SA[1] 至 S B [ m ] S_B[m] SB[m]
- 字符串 S B S_B SB,共 n n n位,即 S B [ 1 ] S_B[1] SB[1]至 S B [ n ] S_B[n] SB[n]
- D [ i ] [ j ] D[i][j] D[i][j]表示 S A [ 1... i ] S_A[1...i] SA[1...i] 转换为 S B [ 1... j ] S_B[1...j] SB[1...j] 的编辑距离
思路:
使用递归和动态规划的思想,
如果 S A [ i ] = = S B [ j ] S_A[i] == S_B[j] SA[i]==SB[j], 那么 D [ i ] [ j ] = D [ i − 1 ] [ j − 1 ] D[i][j]=D[i-1][j-1] D[i][j]=D[i−1][j−1]
如果 S A [ i ] S_A[i] SA