MMR rearrangement (similarity is calculated by editing distance and repeatability)

	def leven_shtein_score(self,query1,query2):# Relative edit distance ( The smaller the relative editing distance , The higher the similarity )
        bias=0.0001
        res=(Levenshtein.distance(query1,query2))/(max(len(query1),len(query2))+bias)
        return res
    def repeat_score(self,query1,query2):#query Repeatability between 
        bias=0.0001
        res = len(list(filter(set(query2).__contains__, query1)))/(len(query2)+bias)
        return res
    
    def similar_score(self,querys):#query Calculation of similarity between 
        similarityMatrix=[[0 for i in range(len(querys))] for j in range(len(querys))]
        for i in range(len(querys)):
            for j in range(len(querys)):
                if i==j:
                    similarityMatrix[i][j]=1
                else:
                    similarityMatrix[i][j]=max((self.repeat_score(querys[i],querys[j])-self.leven_shtein_score(querys[i],querys[j])),0)
        return similarityMatrix
    
    def MMR(self,recScoreDict, similarityMatrix,lambdaConstant=0.5, topN=20):#MMR rearrangement （ Correlation scores of recommenders and similarity matrix between recommenders ）
        s, r = [], [i for i in range(len(recScoreDict))]
        while len(r) > 0:
            score = 0
            selectOne = None
            for i in r:
                firstPart = recScoreDict[i]
                secondPart = 0
                for j in s:
                    sim2 = float(similarityMatrix[i][j])
                    if sim2 > secondPart:
                        secondPart = sim2
                equationScore = lambdaConstant * firstPart - (1 - lambdaConstant) * secondPart
                if equationScore > score:
                    score = equationScore
                    selectOne = i
            if selectOne == None:
                selectOne = i
            r.remove(selectOne)
            s.append(selectOne)
        return (s, s[:topN])[topN > len(s)]