在Python中，为了提高效率，作者尝试并行化一个嵌套循环来查找最大相似值。代码中，使用了`ThreadPoolExecutor`进行并行计算，并结合`concurrent.futures`库来处理结果。通过`itertools.permutations`生成所有可能的单词对，然后计算它们之间的相似度。最终找到每个单词的最大相似词及其相似度。
I'm struggling for some time to improve the execution time of this piece of code. Since the calculations are really time-consuming I think that the best solution would be to parallelize the code.
The output could be also stored in memory, and written to a file afterwards.
I am new to both Python and parallelism, so I find it difficult to apply the concepts explained here and here. I also found this question, but I couldn't manage to figure out how to implement the same for my situation.
I am working on a Windows platform, using Python 3.4.
for i in range(0, len(unique_words)):
max_similarity = 0
max_similarity_word = ""
for j in range(0, len(unique_words)):
if not i == j:
similarity = calculate_similarity(global_map[unique_words[i]], global_map[unique_words[j]])
if similarity > m
最低0.47元/天 解锁文章
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
