def least_common_values(counter, to_find=None):
if to_find is None:
return sorted(counter.items(), key=itemgetter(1), reverse=False)
return heapq.nsmallest(to_find, counter.items(), key=itemgetter(1))
# build word vector, type: word embedding
评论列表
文章目录