original_docstring: 
          get the mu for each guassian kernel. Mu is the middle of each bin
          :param n_kernels: number of kernels (including exact match). first one is exact match
          :return: l_mu, a list of mu.
          
docstring: get the mu for each guassian kernel. Mu is the middle of each bin
docstring_tokens: get the mu for each guassian kernel . Mu is the middle of each bin
code: def kernal_mus(n_kernels, use_exact):
          """
          get the mu for each guassian kernel. Mu is the middle of each bin
          :param n_kernels: number of kernels (including exact match). first one is exact match
          :return: l_mu, a list of mu.
          """
          if use_exact:
              l_mu = [1]
          else:
              l_mu = [2]
          if n_kernels == 1:
              return l_mu
  
          bin_size = 2.0 / (n_kernels - 1)  # score range from [-1, 1]
          l_mu.append(1 - bin_size / 2)  # mu: middle of the bin
          for i in range(1, n_kernels - 1):
              l_mu.append(l_mu[i] - bin_size)
          return l_mu
code_tokens: def kernal_mus ( n_kernels , use_exact ) : if use_exact : l_mu = [ 1 ] else : l_mu = [ 2 ] if n_kernels == 1 : return l_mu bin_size = 2.0 / ( n_kernels - 1 ) l_mu . append ( 1 - bin_size / 2 ) for i in range ( 1 , n_kernels - 1 ) : l_mu . append ( l_mu [ i ] - bin_size ) return l_mu
short_docstring: get the mu for each guassian kernel.
short_docstring_tokens: get the mu for each guassian kernel .
comment: """
          get the mu for each guassian kernel. Mu is the middle of each bin
          :param n_kernels: number of kernels (including exact match). first one is exact match
          :return: l_mu, a list of mu.
          """$SEP$# score range from [-1, 1]
  $SEP$# mu: middle of the bin
  