FilesExpand file tree

code-submit

/

diff2.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

75 lines (66 loc) · 2.16 KB

code-submit

/

diff2.py

Copy path

Top

File metadata and controls

• Code
• Blame

75 lines (66 loc) · 2.16 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

75

import numpy as np

import difflib

import heapq

s = "导游（见习）"

w = "见习导游"

def string_similar(s1, s2):

s2_low = s2.lower()

score1 = difflib.SequenceMatcher(None, s1, s2).quick_ratio()

score2 = difflib.SequenceMatcher(None, s1, s2_low).quick_ratio()

val_max = max(score1,score2)

return val_max

#target_str, list(candidates.keys()),

def search_abbr(w, s, ngram =10):

sl = []

wl = []

for idx in range(len(s)):

if w.startswith(s[idx]):

i = 0

while i<ngram:

if idx+i>len(s):

break

word = s[idx:idx+i]

i+=1

sc = string_similar(word,w)

wl.append(word)

sl.append(sc)

return wl[np.argmax(sl)]

def extact_sort(target,candlist,limit =10):

wl = []

for item in candlist:

score = string_similar(target, item) * 100

wl.append((item, score))

return heapq.nlargest(limit, wl, key=lambda i: i[1]) if limit is not None else sorted(wl, key=lambda i: i[1], reverse=True)

def digit_distance_search(target, candidates,limit =10):

target = abs(float(target))

if target ==0:

target = target+0.01

candlist = list(candidates.keys())

wl = []

wls=[]

score = 0

for item in candlist:

try:

float(item)

wl.append(item)

except ValueError:

pass

if len(wl) >1:

for i in range(len(wl) -2):

for j in range(i+1,len(wl)-1):

try:

if candidates[wl[i]][0] == candidates[wl[j]][0]:

wls.append(wl[i])

except:

print('keyerror',candidates[wl[i]][0],candidates[wl[j]][0])

pass

wl = [x for x in wl if x not in wls]

wls.clear()

wlt=[]

for item in wl :

if float(item) !=0:

score = min(target,abs(float(item)))/max(target,abs(float(item)))

else:

score = (float(item) +0.01)/target

wlt.append((score*100,item))

return heapq.nlargest(limit, wlt, key=lambda i: i[1]) if limit is not None else sorted(wlt, key=lambda i: i[1], reverse=True)