python用循环找最大值_并行化python中的嵌套for循环以查找最大值

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