-
Notifications
You must be signed in to change notification settings - Fork 191
/
Copy pathsimilar_find.go
74 lines (62 loc) · 1.42 KB
/
similar_find.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
package strutil
// SimilarComparator definition
// links:
// https://github.com/mkideal/cli/blob/master/fuzzy.go
type SimilarComparator struct {
src, dst string
}
// NewComparator create
func NewComparator(src, dst string) *SimilarComparator {
return &SimilarComparator{src, dst}
}
// Similar by minDifferRate
// Usage:
// c := NewComparator("hello", "he")
// rate, ok :c.Similar(0.3)
func (c *SimilarComparator) Similar(minDifferRate float32) (float32, bool) {
dist := c.editDistance([]byte(c.src), []byte(c.dst))
differRate := dist / float32(max(len(c.src), len(c.dst))+4)
return differRate, differRate >= minDifferRate
}
func (c *SimilarComparator) editDistance(s, t []byte) float32 {
var (
m = len(s)
n = len(t)
d = make([][]float32, m+1)
)
for i := 0; i < m+1; i++ {
d[i] = make([]float32, n+1)
d[i][0] = float32(i)
}
for j := 0; j < n+1; j++ {
d[0][j] = float32(j)
}
for j := 1; j < n+1; j++ {
for i := 1; i < m+1; i++ {
if s[i-1] == t[j-1] {
d[i][j] = d[i-1][j-1]
} else {
d[i][j] = min(d[i-1][j]+1, min(d[i][j-1]+1, d[i-1][j-1]+1))
}
}
}
return d[m][n]
}
func min(x, y float32) float32 {
if x < y {
return x
}
return y
}
func max(x, y int) int {
if x > y {
return x
}
return y
}
// Similarity calc for two string.
// Usage:
// rate, ok := Similarity("hello", "he")
func Similarity(s, t string, rate float32) (float32, bool) {
return NewComparator(s, t).Similar(rate)
}